Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

Mathematics

City University of New York (CUNY)

2022

Graph-q-partitioning problem

Articles 1 - 1 of 1

Full-Text Articles in Entire DC Network

Combinatorial Optimization With Photonics-Inspired Clock Models, Mostafa Honari-Latifpour, Matthew S. Mills, Mohammad-Ali Miri Jan 2022

Combinatorial Optimization With Photonics-Inspired Clock Models, Mostafa Honari-Latifpour, Matthew S. Mills, Mohammad-Ali Miri

Publications and Research

NP-hard combinatorial optimization problems are in general hard problems that their computational complexity grows faster than polynomial scaling with the size of the problem. Thus, over the years there has been a great interest in developing unconventional methods and algorithms for solving such problems. Here, inspired by the nonlinear optical process of q-photon down-conversion, in which a photon is converted into q degenerate lower energy photons, we introduce a nonlinear dynamical model that builds on coupled single-variable phase oscillators and allows for efficiently approximating the ground state of the classical q-state planar Potts Hamiltonian. This reduces the exhaustive search in …