The potential of quantum annealing for rapid solution structure identification
From MaRDI portal
Publication:2074663
belief propagationdiscrete optimizationinteger programmingIsing modellarge neighborhood searchlocal searchquadratic unconstrained binary optimizationquantum annealing
Packaged methods for numerical algorithms (65Y15) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Boolean programming (90C09)
Abstract: The recent emergence of novel computational devices, such as quantum computers, coherent Ising machines, and digital annealers presents new opportunities for hardware-accelerated hybrid optimization algorithms. Unfortunately, demonstrations of unquestionable performance gains leveraging novel hardware platforms have faced significant obstacles. One key challenge is understanding the algorithmic properties that distinguish such devices from established optimization approaches. Through the careful design of contrived optimization tasks, this work provides new insights into the computation properties of quantum annealing and suggests that this model has the potential to quickly identify the structure of high-quality solutions. A meticulous comparison to a variety of algorithms spanning both complete and local search suggests that quantum annealing's performance on the proposed optimization tasks is distinct. This result provides new insights into the time scales and types of optimization problems where quantum annealing has the potential to provide notable performance gains over established optimization algorithms and suggests the development of hybrid algorithms that combine the best features of quantum annealing and state-of-the-art classical approaches.
Recommendations
- Enhancing quantum annealing performance for the molecular similarity problem
- Quantum annealing learning search for solving QUBO problems
- Biclustering with a quantum annealer
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm
- Lower bounds on circuit depth of the quantum approximate optimization algorithm
Cites work
- A case study in programming a quantum annealer for hard operational planning problems
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1327733 (Why is no real title available?)
- Information, Physics, and Computation
- Neural networks and physical systems with emergent collective computational abilities
- Optimised simulated annealing for Ising spin glasses
- Proof of the satisfiability conjecture for large k
- Pseudo-Boolean optimization
- The inviscid, compressible and rotational, 2D isotropic Burgers and pressureless Euler-Coriolis fluids: solvable models with illustrations
- Time-Dependent Statistics of the Ising Model
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Zero-temperature hysteresis in the random-field Ising model on a Bethe lattice
Cited in
(6)- Enhancing quantum annealing performance for the molecular similarity problem
- Leveraging special-purpose hardware for local search heuristics
- Analyzing the quantum annealing approach for solving linear least squares problems
- Spatial correlations in the qubit properties of D-Wave 2000Q measured and simulated qubit networks
- Quantum computing and tensor networks for laminate design: a novel approach to stacking sequence retrieval
- An improved annealing scheme for the QAP
This page was built for publication: The potential of quantum annealing for rapid solution structure identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2074663)
