Robustness of adiabatic quantum computation
By Andrew M. Childs, Edward Farhi, John Preskill. 2001
388 citations recorded by the source corpus.
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.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/c039088d21fd015e9aedf772376cfa33603c2e96
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Vicky Siu-Ngan Choi
- Andrew M. Childs
- Julia Kempe
- Seth Lloyd
- Wim van Dam
- Oded Regev
- Dorit Aharonov
- Zeph Landau
In Computational Theory and Mathematics
- Wim van Dam
- Seth Lloyd
- Oded Regev
- Julia Kempe
- Vicky Siu-Ngan Choi
- Dorit Aharonov
- Chris Peikert
- Daniele Micciancio
Citations in the corpus
- Adiabatic quantum computation is equivalent to standard quantum computation (2004, background): “As mentioned before, there are possible advantages to this approach: adiabatic quantum computation is resilient to certain types of noise [8].”
- Minor-embedding in adiabatic quantum computation: I. The parameter setting problem (2008, background): “It is believed that AQC is advantageous over standard (the gate model) quantum computation in that it is more robust against environmental noise [11, 3, 4].”