Quantum Annealing - Foundations and Frontiers
arXiv:1408.5784 · doi:10.1140/epjst/e2015-02345-1
Abstract
We briefly review various computational methods for the solution of optimization problems. First, several classical methods such as Metropolis algorithm and simulated annealing are discussed. We continue with a description of quantum methods, namely adiabatic quantum computation and quantum annealing. Next, the new D-Wave computer and the recent progress in the field claimed by the D-Wave group are discussed. We present a set of criteria which could help in testing the quantum features of these computers. We conclude with a list of considerations with regard to future research.
arXiv comment22 pages, 6 figures. EPJ-ST Discussion and Debate Issue: Quantum Annealing: The fastest route to large scale quantum computation?, Eds. A. Das, S. Suzuki (2014)
References in corpus (41)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Computing
- The Physical Implementation of Quantum Computation
- Quantum Annealing in the Transverse Ising Model
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Two-Bit Gates are Universal for Quantum Computation
- Quantum annealing with more than one hundred qubits
- A Superconducting Persistent Current Qubit
- Tight bounds on quantum searching
- Area laws in quantum systems: mutual information and correlations
- Quantum Annealing and Analog Quantum Computation
- Quantum Logic Gates in Optical Lattices
- Quantum Annealing: A New Method for Minimizing Multidimensional Functions
- Defining and detecting quantum speedup
- Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms
- Robustness of adiabatic quantum computation
- A Simple Quantum Computer
- Experimental signature of programmable quantum annealing
- Quantum Adiabatic Markovian Master Equations
- Anderson localization casts clouds over adiabatic quantum optimization
- Quantum limit of decoherence: Environment induced superselection of energy eigenstates
- Quantum annealing of the Traveling Salesman Problem
- How Powerful is Adiabatic Quantum Computation?
- Consistency Tests of Classical and Quantum Models for a Quantum Annealer
- Gaussian quantum Monte Carlo methods for fermions
- First-order transitions and the performance of quantum algorithms in random optimization problems
- How "Quantum" is the D-Wave Machine?
- Quantum Adiabatic Evolution Algorithms versus Simulated Annealing
- Multivariable Optimization: Quantum Annealing & Computation
- Many-body transverse interactions in the quantum annealing of the p-spin ferromagnet
- The Stochastic Green Function (SGF) algorithm
- Convergence theorems for quantum annealing
- How Quantum Computers Fail: Quantum Codes, Correlations in Physical Systems, and Noise Accumulation
- Superconducting Qubits and the Physics of Josephson Junctions
- Period Finding with Adiabatic Quantum Computation
- Continuous-Time Quantum Algorithms for Unstructured Problems
- Classical signature of quantum annealing
- Robustness of Adiabatic Quantum Computing
- Energy barriers in spin glasses
- Ground-state entanglement in coupled qubits
- Minor-Embedding in Adiabatic Quantum Computation: I. The Parameter Setting Problem
Cited by in corpus (5)
- On-demand Photonic Ising Machine with Simplified Hamiltonian Calculation by Phase encoding and Intensity Detection
- Can quantum non-locality be connected to extra-dimensions?
- Realisation of Qudits in Coupled Potential Wells
- Consequences of the single-pair measurement of the Bell parameter
- Sequences of selective rotation operators to engineer interactions for quantum annealing on three qutrits