arXiv · 1808.00081
Solving NP-hard problems with bistable polaritonic networks
Abstract
A lattice of locally bistable driven-dissipative cavity polaritons is found theoretically to effectively simulate the Ising model, also enabling an effective transverse field. We benchmark the system performance for spin glass problems, and study the scaling of the ground state energy deviation and success probability as a function of system size. As particular examples we consider NP-hard problems embedded in the Ising model, namely graph partitioning and the knapsack problem. We find that locally bistable polariton networks act as classical simulators for solving optimization problems, which can potentially present an improvement within the exponential complexity class.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
O. Kyriienko, H. Sigurdsson, T. C. H. Liew. 2018-07-31. Solving NP-hard problems with bistable polaritonic networks. https://doi.org/10.1103/physrevb.99.195301
Cite the original work for its findings. Save a collection to share your selection of sources.