Minor embedding with Stuart-Landau oscillator networks

Abstract

We theoretically implement a strategy from quantum computation architectures to simulate Stuart-Landau oscillator dynamics in all-to-all connected networks, also referred to 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 realized in future on-chip solid state technologies with tunable edge weights. As a case study, we reveal that the minor embedding procedure allows simulating the XY model on complete graphs, thus bypassing a severe geometric constraint.

References in corpus (5)

• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A practical heuristic for finding graph minors
• Programmable Interactions and Emergent Geometry in an Atomic Array
• Algorithm engineering for a quantum annealing platform
• Simulating the classical XY model with a laser network