Minor embedding with Stuart-Landau oscillator networks

Abstract

We theoretically implement a strategy from quantum computation to simulate Stuart-Landau oscillator dynamics in all-to-all connected networks, also referred as complete graphs. The technique builds upon the triad structure minor embedding which expands dense graphs of interconnected elements into sparse ones which can potentially be realised in future on-chip solid state technologies with tunable edge weights. Our analysis reveals that the minor embedding procedure allows simulating the XY model on complete graphs, thus bypassing a severe geometric constraint.

Solving the Max-3-Cut Problem with Coherent Networks

“…Our study provides experimental evidence that polariton condensate networks can potentially serve as optical annealers for max-3-cut, and opens perspectives on the role of coherent nonlinear optical networks as fast approximate analog solvers for complex combinatorial problems. While interactions between polariton condensates are inherently planar, work has begun to address the possibility of all-to-all connectivity [59][60][61]. We also study the more complex applications of image segmentation and CVM in circuit design, which we heuristically solve using our proposed method and simulations on both Stuart-Landau oscillator networks and polariton condensate networks.…”