Colloquium: Quantum annealing and analog quantum computation
From MaRDI portal
Publication:3077047
DOI10.1103/REVMODPHYS.80.1061zbMATH Open1205.81058arXiv0801.2193OpenAlexW174492123WikidataQ21563849 ScholiaQ21563849MaRDI QIDQ3077047FDOQ3077047
Authors: Arnab Das, Bikas. K. Chakrabarti 
Publication date: 21 February 2011
Published in: Reviews of Modern Physics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/0801.2193
Recommendations
Cites Work
- Optimization by simulated annealing
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Title not available (Why is that?)
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Information and computation: Classical and quantum aspects
- Topology of cosmic domains and strings
- Title not available (Why is that?)
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
- Quantum phase transitions
- Title not available (Why is that?)
- Quantum stochastic optimization
- Introduction to the replica theory of disordered statistical systems
- Statistical Physics of Spin Glasses and Information Processing
- Title not available (Why is that?)
- Determining computational complexity from characteristic ``phase transitions
- Quantum approach to classical statistical mechanics
- Study of the phase transition in the 3D Ising spin glass from out-of-equilibrium numerical simulations
- Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
- Quantum annealing and related optimization methods
- Ising spin glass in a transverse field: Replica-symmetry-breaking solution
- Convergence theorems for quantum annealing
- Convergence of quantum annealing with real-time Schrödinger dynamics
- Quantum Monte Carlo study of the infinite-range Ising spin glass in a transverse field
- Solving the Schrödinger equation for the Sherrington - Kirkpatrick model in a transverse field
Cited In (35)
- A quantum adiabatic algorithm for multiobjective combinatorial optimization
- Non-Hermitian adiabatic quantum optimization
- Fast clique minor generation in Chimera qubit connectivity graphs
- Solving larger maximum clique problems using parallel quantum annealing
- Theory versus practice in annealing-based quantum computing
- Models in quantum computing: a systematic review
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design
- 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
- D-Wave and predecessors: from simulated to quantum annealing
- Quantum Monte Carlo annealing with multi-spin dynamics
- Duality quantum computer and the efficient quantum simulations
- Quantum spin glasses, annealing and computation
- The promise of analog computation
- Microwave photonics with superconducting quantum circuits
- Adiabatic quantum counting by geometric phase estimation
- Quantum science and quantum technology
- A practitioner’s guide to quantum algorithms for optimisation problems
- Adiabatic perturbation theory and geometry of periodically-driven systems
- Classical simulated annealing using quantum analogues
- 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
- Ising Machines for Diophantine Problems in Physics
- A case study in programming a quantum annealer for hard operational planning problems
- Non-Hermitian Quantum Annealing and Superradiance
- Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications
- 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
- Physical consequences of \(P \neq\) NP and the density matrix renormalization group annealing conjecture
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)
