Quantum annealing of hard problems
From MaRDI portal
Abstract: Quantum annealing is analogous to simulated annealing with a tunneling mechanism substituting for thermal activation. Its performance has been tested in numerical simulation with mixed conclusions. There is a class of optimization problems for which the efficiency can be studied analytically using techniques based on the statistical mechanics of spin glasses.
Recommendations
Cited in
(57)- Merging quantum annealing computation and particle statistics: A prospect in the search of efficient solutions to intractable problems
- Quantum computation: from the sequential approach to simulated annealing
- Quantum annealing for combinatorial clustering
- Large-scale vehicle routing problems: quantum annealing, tunings and results
- Boosting quantum annealer performance via sample persistence
- Quantum annealing with Markov chain Monte Carlo simulations and D-wave quantum computers
- Embedding equality constraints of optimization problems into a quantum annealer
- A case study in programming a quantum annealer for hard operational planning problems
- FEqa: Finite element computations on quantum annealers
- Quantum science and quantum technology
- Theory versus practice in annealing-based quantum computing
- Quantum annealing and related optimization methods
- Performance of two different quantum annealing correction codes
- Quantum vs. classical algorithms for solving the heat equation
- Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis
- A renormalization approach to quantum thermal annealing
- Optimization and quantum annealing
- D-Wave and predecessors: from simulated to quantum annealing
- Quantum annealing with antiferromagnetic fluctuations for mean-field models
- A method to change phase transition nature - toward annealing methods
- Realistic cost for the model of coherent computing
- Quantum versus classical annealing of Ising spin glasses
- Quantum spin glasses, annealing and computation
- An improved quantum annealing algorithm
- An introduction to quantum annealing
- scientific article; zbMATH DE number 5824031 (Why is no real title available?)
- Colloquium: Quantum annealing and analog quantum computation
- Convergence of quantum annealing with real-time Schrödinger dynamics
- Quantum approach to classical statistical mechanics
- Classical simulated annealing using quantum analogues
- Convergence theorems for quantum annealing
- Recursive simulation of quantum annealing
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Extended quantum annealing and quantum algorithms for optimization and thermodynamics of classical systems
- Quantum annealing of the graph coloring problem
- Performing fully parallel constraint logic programming on a quantum annealer
- scientific article; zbMATH DE number 1406122 (Why is no real title available?)
- Efficiency of quantum vs. classical annealing in nonconvex learning problems
- Reformulating the harmonious colouring problem for quantum annealing
- Quantum annealing versus digital computing. An experimental comparison
- Elimination of perturbative crossings in adiabatic quantum optimization
- The quantum random energy model as a limit of \(p\)-spin interactions
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- Quantum annealing with Jarzynski equality
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- How fast can quantum annealers count?
- scientific article; zbMATH DE number 2226658 (Why is no real title available?)
- Rigorous convergence condition for quantum annealing
- Efficient population transfer via non-ergodic extended states in quantum spin glass
- Inter-generational comparison of quantum annealers in solving hard scheduling problems
- Reliability of Digitized Quantum Annealing and the Decay of Entanglement
- Ising Machines for Diophantine Problems in Physics
- Solving larger maximum clique problems using parallel quantum annealing
- Mathematical aspects of the Digital Annealer's simulated annealing algorithm
- String Model Building on Quantum Annealers
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Simulated annealing and quantum detailed balance
This page was built for publication: Quantum annealing of hard problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3162910)
