Steady state distributions of network of degenerate optical parametric oscillators in solving combinatorial optimization problems
arXiv:1808.10643 · doi:10.1103/PhysRevA.98.053839
Abstract
We investigate network of degenerate optical parametric oscillators (DOPOs) as a model of the coherent Ising machine, an architecture for solving Ising problems. The network represents the interaction in the Ising model, which is a generalization of a previously proposed one for the two-DOPO case. Dynamics of the DOPOs is described by the Fokker-Planck equation in the positive representation. We obtain approximate steady state distributions for arbitrary Ising problems under some ansatz. Using the method of statistical mechanics, we analytically demonstrate that the most probable states in a particular range of the parameters correspond to the true optimal states for two rather simple problems, i.e., fully-connected ferromagnetic coupling without/with binary random fields. In particular, for the random-field problem, the distribution correctly detects the phase transition that occurs in the target Ising model with varying the magnitude of the fields.
arXiv comment13 pages, 2 figures
References in corpus (33)
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- Adiabatic Quantum Computing
- Engineered 2D Ising interactions on a trapped-ion quantum simulator with hundreds of spins
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Network of Time-Multiplexed Optical Parametric Oscillators as a Coherent Ising Machine
- A Coherent Ising Machine Based On Degenerate Optical Parametric Oscillators
- Architectural considerations in the design of a superconducting quantum annealing processor
- Large-scale Ising spin network based on degenerate optical parametric oscillators
- Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
- Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network: Toward quantum soft computing
- Intrinsic optimization using stochastic nanomagnets
- Quantum annealing with a network of all-to-all connected, two-photon driven Kerr nonlinear oscillators
- Markov Chain Monte Carlo Method without Detailed Balance
- Irreversible Monte Carlo Algorithms for Efficient Sampling
- Energy gaps in quantum first-order mean-field-like transitions: The problems that quantum annealing cannot solve
- An electromechanical Ising machine
- Simple Glass Models and their Quantum Annealing
- Robust quantum optimizer with full connectivity
- First-order transitions and the performance of quantum algorithms in random optimization problems
- Adiabaticity in open quantum systems
- A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
- The quantum adiabatic algorithm and scaling of gaps at first order quantum phase transitions
- Violation of detailed balance accelerates relaxation
- Quantum correlation in degenerate optical parametric oscillators with mutual injections
- A Quantum Model for Coherent Ising Machines: Discrete-time Measurement Feedback Formulation
- Convergence of simulated annealing by the generalized transition probability
- Performance evaluation of coherent Ising machines against classical neural networks
- Truncated Wigner function theory of coherent Ising machines based on degenerate optical parametric oscillator network
- Dynamics of the One-Dimensional Ising Model without Detailed Balance Condition
- A Quantum Model for Coherent Ising Machine: Stochastic Differential Equations with Replicator Dynamics
- Mathematical understanding of detailed balance condition violation and its application to Langevin dynamics