Robustness of adiabatic quantum computation
Top Cited Papers
- 14 December 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 65 (1) , 012322
- https://doi.org/10.1103/physreva.65.012322
Abstract
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Holonomic quantum computationPhysics Letters A, 1999
- Topological Quantum ComputationPublished by Springer Nature ,1999
- Quantum Annealing of a Disordered MagnetScience, 1999
- Quantum annealing in the transverse Ising modelPhysical Review E, 1998
- Universal Quantum SimulatorsScience, 1996
- On the computational complexity of Ising spin glass modelsJournal of Physics A: General Physics, 1982
- The proper form of the generator in the weak coupling limitZeitschrift für Physik B Condensed Matter, 1979
- Markovian master equationsCommunications in Mathematical Physics, 1974
- On the Adiabatic Theorem of Quantum MechanicsJournal of the Physics Society Japan, 1950