Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems

@article{Goto2019CombinatorialOB,
  title={Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems},
  author={Hayato Goto and Kosuke Tatsumura and Alexander Dixon},
  journal={Science Advances},
  year={2019},
  volume={5}
}
Combinatorial optimization problems are ubiquitous but difficult to solve. [] Key Result Implementing SB with a field-programmable gate array, we demonstrate that the SB machine can obtain good approximate solutions of an all-to-all connected 2000-node MAX-CUT problem in 0.5 ms, which is about 10 times faster than a state-of-the-art laser-based machine called a coherent Ising machine. SB will accelerate large-scale combinatorial optimization harnessing digital computer technologies and also offer a new…
Massively Simulating Adiabatic Bifurcations with FPGA to Solve Combinatorial Optimization
TLDR
This work reformulated a broad range of combinatorial optimization problems with a general graph-based data structure called the Ising model, and utilized a new heuristic algorithm, simulated bifurcation, to search for solutions.
Combinatorial Optimization with Photonics-Inspired Clock Models
TLDR
This work introduces a single-variable nonlinear dynamical model that allows for efficiently approximating the ground state of the classical $q$-state planar Potts Hamiltonian, and introduces two different annealing mechanisms, adiabatic deformation and chaoticAnnealing, and shows that numerical simulations of the proposed dynamicals can efficiently approximate the solution of hard combinatorial problems.
Simulated bifurcation assisted by thermal fluctuation
Various kinds of Ising machines based on unconventional computing have recently been developed for practically important combinatorial optimization. Among them, the machines implementing a heuristic
Mathematical Mechanism on Dynamical System Algorithms of the Ising Model
TLDR
It is proved that the dynamical system algorithms can be designed to minimize a continuous function whose local minimum points give all the candidates of the Ising model and the global minimum gives the minimizer of Ising problem.
FPGA-Based Simulated Bifurcation Machine
TLDR
This work implements the SB algorithm on FPGAs by designing massively parallel custom circuits, and compares the FPGA-based SB machines with a state-of-the-art machine called a coherent Ising machine (CIM), a highly optimized implementation of simulated annealing (SA), and GPU-basedSB machines.
Large-scale combinatorial optimization in real-time systems by FPGA-based accelerators for simulated bifurcation
TLDR
This article reviews the recent works on the design and implementation of high-performance FPGA-based accelerators for SB and their applications toward innovative real-time systems that make optimal responses to ever-changing situations and shows a scale-out architecture for SB-based Ising machines with all-to-all spin-spin couplings.
Scaling out Ising machines using a multi-chip architecture for simulated bifurcation
TLDR
A scale-out architecture for Ising machines that provides enlarged machine sizes and enhanced processing speeds by using multiple connected chips and relies on an autonomous synchronization mechanism that is implemented in the information exchange processes between neighbouring chips and leads to scalability of computational throughput.
High-performance combinatorial optimization based on classical mechanics
TLDR
This work proposes an algorithm based on classical mechanics, which is obtained by modifying a previously proposed algorithm called simulated bifurcation, which allows us to achieve not only high speed by parallel computing but also high solution accuracy for problems with up to one million binary variables.
Dynamical Systems Theory and Algorithms for NP-hard Problems
TLDR
This article surveys a range of examples that illustrate the use of dynamical systems theory in the context of computational complexity analysis and novel algorithm construction and summarizes a novel approach for clustering graphs using the wave equation partial differential equation.
On computational capabilities of Ising machines based on nonlinear oscillators
...
...

References

SHOWING 1-10 OF 59 REFERENCES
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
TLDR
A quantum computer comprising such quantum nonlinear oscillators, instead of quantum bits, to solve hard combinatorial optimization problems and will open new possibilities for quantum computation, nonlinear science, and artificial intelligence.
Combinatorial optimization using dynamical phase transitions in driven-dissipative systems.
TLDR
The dynamics of driven-dissipative systems is shown to be well-fitted for achieving efficient combinatorial optimization and the heterogeneity in amplitude can be reduced by setting the parameters of the driving signal near a regime, called the dynamic phase transition, where the analog spins' DC components map more accurately the global minima of the Ising Hamiltonian which, in turn, increases the quality of solutions found.
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
TLDR
The results show that the Digital Annealer currently exhibits a time-to-solution speedup of roughly two orders of magnitude for fully connected spin-glass problems with bimodal or Gaussian couplings, over the single-core implementations of simulated annealing and parallel tempering Monte Carlo used in this study.
Boltzmann sampling from the Ising model using quantum heating of coupled nonlinear oscillators
TLDR
This numerical study suggests that the output probability distribution of the quantum bifurcation machine (QbM) is Boltzmann-like, where the energy in the BoltZmann distribution corresponds to the cost function of the optimization problem.
Quantum annealing with all-to-all connected nonlinear oscillators
TLDR
A paradigm for quantum annealing with a scalable network of two-photon-driven Kerr-nonlinear resonators to develop a noise-resilient annealer and proposes a realistic circuit QED implementation of this promising platform for implementing a large-scale quantum Ising machine.
A fully programmable 100-spin coherent Ising machine with all-to-all connections
TLDR
A scalable optical processor with electronic feedback that can be realized at large scale with room-temperature technology is presented and is able to find exact solutions of, or sample good approximate solutions to, a variety of hard instances of Ising problems.
Adiabatic quantum computation
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing,
Quantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that
Computing architecture to perform approximated simulated annealing for Ising models
TLDR
A computing architecture is proposed that performs SA for Ising models approximately and satisfies the condition by utilizing the fact that the output of the majority voter circuit with stochastically processed inputs approximately behaves in accordance with the Glauber dynamics.
Quantum annealing in the transverse Ising model
We introduce quantum fluctuations into the simulated annealing process of optimization problems, aiming at faster convergence to the optimal state. Quantum fluctuations cause transitions between
...
...