Colloquium: Quantum annealing and analog quantum computation
From MaRDI portal
Publication:3077047
DOI10.1103/RevModPhys.80.1061zbMath1205.81058arXiv0801.2193OpenAlexW174492123WikidataQ21563849 ScholiaQ21563849MaRDI QIDQ3077047
Arnab Das, Bikas K. Chakrabarti
Publication date: 21 February 2011
Published in: Reviews of Modern Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.2193
Related Items
Fast clique minor generation in Chimera qubit connectivity graphs, Adiabatic perturbation theory and geometry of periodically-driven systems, Duality quantum computer and the efficient quantum simulations, Classical simulated annealing using quantum analogues, Non-Hermitian Quantum Annealing and Superradiance, D-Wave and predecessors: From simulated to quantum annealing, The promise of analog computation, Simulations of Shor's algorithm using matrix product states, Enhancing quantum annealing performance for the molecular similarity problem, Microwave photonics with superconducting quantum circuits, A practitioner’s guide to quantum algorithms for optimisation problems, Ising Machines for Diophantine Problems in Physics, Solving larger maximum clique problems using parallel quantum annealing, Models in quantum computing: a systematic review, Quantum annealing of the graph coloring problem, Quantum science and quantum technology, Quantum computing vs. coherent computing, Non-Hermitian quantum annealing in the antiferromagnetic Ising chain, Physical consequences of P≠NP and the density matrix renormalization group annealing conjecture, Deterministic quantum annealing expectation-maximization algorithm, Quantum Monte Carlo annealing with multi-spin dynamics, Algorithmic simulation of far-from-equilibrium dynamics using quantum computer, Quantum chaos and thermalization in isolated systems of interacting particles, Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design, A case study in programming a quantum annealer for hard operational planning problems, Adiabatic quantum counting by geometric phase estimation, A quantum adiabatic algorithm for multiobjective combinatorial optimization, Reconstruction, optimization, and design of heterogeneous materials and media: basic principles, computational algorithms, and applications, Time-dependent real-space renormalization-group approach: application to an adiabatic random quantum Ising model, NON-HERMITIAN ADIABATIC QUANTUM OPTIMIZATION, Iterative classical superadiabatic algorithm for combinatorial optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Quantum stochastic optimization
- Quantum annealing and related optimization methods
- Introduction to the Replica Theory of Disordered Statistical Systems
- Quantum Phase Transitions
- Information and computation: Classical and quantum aspects
- Convergence of Quantum Annealing with Real-Time Schrödinger Dynamics
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Quantum Approach to Classical Statistical Mechanics
- Convergence theorems for quantum annealing
- Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Topology of cosmic domains and strings
- Quantum Monte Carlo study of the infinite-range Ising spin glass in a transverse field
- Ising spin glass in a transverse field: Replica-symmetry-breaking solution
- Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
- Solving the Schrödinger equation for the Sherrington - Kirkpatrick model in a transverse field
- Statistical Physics of Spin Glasses and Information Processing
- Determining computational complexity from characteristic ‘phase transitions’
- Study of the phase transition in the 3D Ising spin glass from out-of-equilibrium numerical simulations
- Optimization using quantum mechanics: quantum annealing through adiabatic evolution
