The potential of quantum annealing for rapid solution structure identification
DOI10.1007/s10601-020-09315-0zbMath1485.81022arXiv1912.01759OpenAlexW3104172996MaRDI QIDQ2074663
Andrey Y. Lokhov, Yuchen Pang, Carleton Coffrin, Marc Vuffray
Publication date: 10 February 2022
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.01759
integer programminglocal searchIsing modeldiscrete optimizationlarge neighborhood searchquantum annealingbelief propagationquadratic unconstrained binary optimization
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Boolean programming (90C09) Packaged methods for numerical algorithms (65Y15)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Optimised simulated annealing for Ising spin glasses
- A case study in programming a quantum annealer for hard operational planning problems
- The inviscid, compressible and rotational, 2D isotropic Burgers and pressureless Euler–Coriolis fluids: Solvable models with illustrations
- Proof of the Satisfiability Conjecture for Large k
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Information, Physics, and Computation
- Zero-temperature hysteresis in the random-field Ising model on a Bethe lattice
- Neural networks and physical systems with emergent collective computational abilities.
- Time-Dependent Statistics of the Ising Model
This page was built for publication: The potential of quantum annealing for rapid solution structure identification
