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 (22)

• Global Optimization by Basin-Hopping and the Lowest Energy Structures of Lennard-Jones Clusters Containing up to 110 Atoms
• Realizing the $XY$ Hamiltonian in polariton simulators
• Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
• Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
• A practical heuristic for finding graph minors
• Quantum Optimization of Fully-Connected Spin Glasses
• Programmable Interactions and Emergent Geometry in an Atomic Array
• Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
• Dissipative phase locking of exciton-polariton condensates
• Order-of-magnitude differences in computational performance of analog Ising machines induced by the choice of nonlinearity
• Networks of non-equilibrium condensates for global optimization
• Time-Delay Polaritonics
• Readiness of Quantum Optimization Machines for Industrial Applications
• Algorithm engineering for a quantum annealing platform
• Controllable Josephson junction for photon Bose-Einstein condensates
• Solving NP-hard problems with bistable polaritonic networks
• Exact Mapping Between a Laser Network Loss Rate and the Classical XY Hamiltonian by Laser Loss Control
• Synchronization in optically-trapped polariton Stuart-Landau networks
• Simulating the classical XY model with a laser network
• Solving the max-3-cut problem using synchronized dissipative networks
• Advanced unembedding techniques for quantum annealers
• All-to-all connected networks by multi-frequency excitation of polaritons