The DOI matches its Crossref record; 20 of the 20 references it cites were found in a registry or an index.
Robustness of adiabatic quantum computation
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Indeed, in this case, the Hamiltonian evolution can be accurately and efficiently simulated by a universal quantum computer [17].”
MethodQuantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Lundgren, A., & Preda, D. (2001) · Science · doi:10.1126/science.1057726 · Cited by 2,056
Self-citationOn the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306
On the Adiabatic Theorem of Quantum Mechanics
Kato, T. (1950) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.5.435 · Cited by 1,055
Zanardi, P., & Rasetti, M. (1999) · Physics Letters A · doi:10.1016/s0375-9601(99)00803-8 · Cited by 1,006
Davies, E. B. (1974) · Communications in Mathematical Physics · doi:10.1007/bf01608389 · Cited by 934
Fault-tolerant quantum computation
Shor, P. W. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548464 · Cited by 892
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Topological Quantum Computation
Wang, Z. (2010) · CBMS Regional Conference Series in Mathematics · doi:10.1090/cbms/112 · Cited by 576
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536
Self-citationQuantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Ekert, A., Ericsson, M., Hayden, P., Inamori, H., Jones, J. A., Oi, D. K. L., & Vedral, V. (2000) · Journal of Modern Optics · doi:10.1080/09500340008232177 · Cited by 272
The proper form of the generator in the weak coupling limit
D�mcke, R., & Spohn, H. (1979) · Zeitschrift f�r Physik B Condensed Matter and Quanta · doi:10.1007/bf01325208 · Cited by 192
Non-Equilibrium Entropy and Irreversibility
Lindblad, G. (1983) · Springer eBooks · doi:10.1007/978-94-009-7206-3 · Cited by 187
Open quantum systems with time-dependent Hamiltonians and their linear response
Davies, E. B., & Spohn, H. E. (1978) · Journal of Statistical Physics · doi:10.1007/bf01011696 · Cited by 129
Finding cliques by quantum adiabatic evolution
Childs, A. M., Farhi, E., Goldstone, J., & Gutmann, S. (2002) · Quantum Information and Computation · doi:10.26421/qic2.3-1 · Cited by 81
Self-citationTopological Quantum Computation
Ogburn, R. W., & Preskill, J. P. (1999) · Lecture notes in computer science · doi:10.1007/3-540-49208-9_31 · Cited by 79
Self-citationA Numerical Study of the Performance of a Quantum Adiabatic Evolution Algorithm for SatisfiabilityPreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0007071 · Cited by 74
Self-citation
Cited by
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447323 · Cited by 457
Minor-embedding in adiabatic quantum computation: I. The parameter setting problem
Choi, V. (2008) · Quantum Information Processing · doi:10.1007/s11128-008-0082-9 · Cited by 410
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
“As mentioned before, there are possible advantages to this approach: adiabatic quantum computation is resilient to certain types of noise [8].”
BackgroundExperimental signature of programmable quantum annealing
Boixo, S., Albash, T., Spedalieri, F. M., Chancellor, N., & Lidar, D. A. (2013) · Nature Communications · doi:10.1038/ncomms3067 · Cited by 293
Quantum adiabatic Markovian master equations
Albash, T., Boixo, S., Lidar, D. A., & Zanardi, P. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123016 · Cited by 281
Metadata
- Authors
- Childs, A. M., Farhi, E., & Preskill, J.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2001-12-14
- Volume
- 65
- Issue
- 1
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W1988801946
- Cited by
- 484
- References
- 20
- FWCI
- 12.02
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.