Evidence for quantum annealing with more than one hundred qubits

@article{Boixo2014EvidenceFQ,
  title={Evidence for quantum annealing with more than one hundred qubits},
  author={Sergio Boixo and Troels F. Ronnow and Sergei V. Isakov and Zhihui Wang and Dave Wecker and Daniel A. Lidar and John M. Martinis and Matthias Troyer},
  journal={Nature Physics},
  year={2014},
  volume={10},
  pages={218-224}
}
Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions regarding the functioning of devices such as D-Wave One. A numerical and experimental investigation of its performance shows evidence for quantum annealing with 108 qubits. 
Performance of quantum annealing hardware
TLDR
An introduction to quantum annealers, which are analogue quantum computing devices, and their potential application to solve hard optimisation problems, and benchmarks performed on a "Wave Two" machine by Canadian company D-Wave Systems Inc.
Quantum computation: Model versus machine
Comparisons between classically simulated models and the actual performance of a 100-qubit D-Wave processor stimulate, but do not settle, the debate about how quantum annealing really works.
Classical signature of quantum annealing
A pair of recent articles concluded that the D-Wave One machine actually operates in the quantum regime, rather than performing some classical evolution. Here we give a classical model that leads to
Algorithm engineering for a quantum annealing platform
TLDR
Some operational parameters that drive performance are described, approaches for mitigating sources of error are discussed, and experimental results from a D-Wave Two quantum annealing processor are presented.
The Current State and Potential of Quantum Computing
In the wake of the recent purchase of a quantum computer by Google and NASA, this synthesis paper examines relevant articles surrounding the architecture and potential applications for quantum
Notes on Adiabatic Quantum Computers
TLDR
This chapter describes quantum adiabatic computation, quantum annealing, and the strong relations between the three, as well as some physical implementations of the quantum circuit model.
Error-corrected quantum annealing with hundreds of qubits.
TLDR
A substantial improvement over the performance of the processors in the absence of error correction is demonstrated, paving the way towards large-scale noise-protected adiabatic quantum optimization devices, although a threshold theorem such as has been established in the circuit model of quantum computing remains elusive.
A Transmon Quantum Annealer: Decomposing Many-Body Ising Constraints Into Pair Interactions
Adiabatic quantum computing is an analog quantum computing scheme with various applications in solving optimization problems. In the parity picture of quantum optimization, the problem is encoded in
Multivariable optimization: Quantum annealing and computation
Recent developments in quantum annealing techniques have been indicating potential advantage of quantum annealing for solving NP-hard optimization problems. In this article we briefly indicate and
A Probabilistic Game of Life on a Quantum Annealer
We implement a probabilistic version of the game of life on a quantum annealer in a very direct manner, demonstrating possible use cases for (currently very noisy) quantum annealing devices in the
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 64 REFERENCES
Classical signature of quantum annealing
A pair of recent articles concluded that the D-Wave One machine actually operates in the quantum regime, rather than performing some classical evolution. Here we give a classical model that leads to
Experimental evaluation of an adiabiatic quantum system for combinatorial optimization
TLDR
An experimental study of a novel computing system (algorithm plus platform) that carries out quantum annealing, a type of adiabatic quantum computation, to solve optimization problems to solve NP-hard problem domains is described.
Thermally assisted quantum annealing of a 16-qubit problem.
TLDR
It is experimentally demonstrated that, even with annealing times eight orders of magnitude longer than the predicted single-qubit decoherence time, the probabilities of performing a successful computation are similar to those expected for a fully coherent system.
Quantum simulations with ultracold quantum gases
Experiments with ultracold quantum gases provide a platform for creating many-body systems that can be well controlled and whose parameters can be tuned over a wide range. These properties put these
Quantum annealing of a disordered magnet
TLDR
Thermal and quantum annealing are compared in a model disordered magnet, where the effects of quantum mechanics can be tuned by varying an applied magnetic field, and the results indicate that quantumAnnealing hastens convergence to the optimum state.
Colloquium : Quantum annealing and analog quantum computation
The recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations is reviewed here. The concept is introduced in successive
Experimental signature of programmable quantum annealing.
TLDR
This experiment uses groups of eight superconducting flux qubits with programmable spin-spin couplings, embedded on a commercially available chip with >100 functional qubits, and suggests that programmable quantum devices, scalable with currentsuperconducting technology, implement quantum annealing with a surprising robustness against noise and imperfections.
Theory of Quantum Annealing of an Ising Spin Glass
TLDR
By comparing classical and quantum Monte Carlo annealing protocols on the two-dimensional random Ising model (a prototype spin glass), this work confirms the superiority of quantumAnnealing relative to classical annealed and proposes a theory of quantum annealer based on a cascade of Landau-Zener tunneling events.
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
TLDR
For the small examples that the authors could simulate, the quantum adiabatic algorithm worked well, providing evidence that quantum computers (if large ones can be built) may be able to outperform ordinary computers on hard sets of instances of NP-complete problems.
Experimental Signature of Programmable Quantum Annealing (Author's Manuscript)
Abstract : Quantum annealing is a general strategy for solving difficult optimization problems with the aid of quantum adiabatic evolution [1, 2]. Both analytical and numerical evidence suggests that
...
1
2
3
4
5
...