Colloquium: Quantum annealing and analog quantum computation
From MaRDI portal
Publication:3077047
Abstract: We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of such computationally hard problems to the classical spin glass problems. The quantum spin glass problems arise with the introduction of quantum fluctuations, and the annealing behavior of the systems as these fluctuations are reduced slowly to zero. This provides a general framework for realizing analog quantum computation.
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1735139 (Why is no real title available?)
- scientific article; zbMATH DE number 905275 (Why is no real title available?)
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Convergence of quantum annealing with real-time Schrödinger dynamics
- Convergence theorems for quantum annealing
- Determining computational complexity from characteristic ``phase transitions
- Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
- Information and computation: Classical and quantum aspects
- Introduction to the replica theory of disordered statistical systems
- Ising spin glass in a transverse field: Replica-symmetry-breaking solution
- Optimization by simulated annealing
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Quantum Monte Carlo study of the infinite-range Ising spin glass in a transverse field
- Quantum annealing and related optimization methods
- Quantum approach to classical statistical mechanics
- Quantum phase transitions
- Quantum stochastic optimization
- Solving the Schrödinger equation for the Sherrington - Kirkpatrick model in a transverse field
- Statistical Physics of Spin Glasses and Information Processing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Study of the phase transition in the 3D Ising spin glass from out-of-equilibrium numerical simulations
- Topology of cosmic domains and strings
Cited in
(35)- Physical consequences of \(P \neq\) NP and the density matrix renormalization group annealing conjecture
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Non-Hermitian adiabatic quantum optimization
- Fast clique minor generation in Chimera qubit connectivity graphs
- Theory versus practice in annealing-based quantum computing
- Solving larger maximum clique problems using parallel quantum annealing
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- Models in quantum computing: a systematic review
- Comment on Feynman's ``Simulating physics with computers
- Algorithmic simulation of far-from-equilibrium dynamics using quantum computer
- Iterative classical superadiabatic algorithm for combinatorial optimization
- Duality quantum computer and the efficient quantum simulations
- D-Wave and predecessors: from simulated to quantum annealing
- Quantum Monte Carlo annealing with multi-spin dynamics
- Quantum spin glasses, annealing and computation
- Microwave photonics with superconducting quantum circuits
- The promise of analog computation
- Adiabatic quantum counting by geometric phase estimation
- Quantum science and quantum technology
- A practitioner’s guide to quantum algorithms for optimisation problems
- Classical simulated annealing using quantum analogues
- Adiabatic perturbation theory and geometry of periodically-driven systems
- Quantum computing vs. coherent computing
- Quantum annealing of the graph coloring problem
- Simulations of Shor's algorithm using matrix product states
- Non-Hermitian quantum annealing in the antiferromagnetic Ising chain
- A case study in programming a quantum annealer for hard operational planning problems
- Ising Machines for Diophantine Problems in Physics
- Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications
- Non-Hermitian Quantum Annealing and Superradiance
- Enhancing quantum annealing performance for the molecular similarity problem
- Quantum annealing of hard problems
- Time-dependent real-space renormalization-group approach: application to an adiabatic random quantum Ising model
- Deterministic quantum annealing expectation-maximization algorithm
- Quantum chaos and thermalization in isolated systems of interacting particles
This page was built for publication: Colloquium: Quantum annealing and analog quantum computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3077047)
