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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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 · cited 2×
“[11] P.”
BackgroundDavies, E. B. (1974) · Communications in Mathematical Physics · doi:10.1007/bf01608389 · Cited by 934 · cited 1×
“One way of deriving such a master equation is to consider the weak coupling limit, in which λ≪ 1 [19].”
BackgroundFault-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
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
Experimental investigation of an eight-qubit unit cell in a superconducting optimization processor
Harris, R., Johnson, M. W., Lanting, T., Berkley, A. J., Johansson, J., Bunyk, P., Tolkacheva, E., Ladizinsky, E., Ladizinsky, N., Oh, T., et al. (2010) · Physical Review B · doi:10.1103/physrevb.82.024511 · Cited by 273
Li, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0060-8 · Cited by 202
“When QA is implemented in a physical device, temperature and other noise effects play an important role; thermal excitation and relaxation cannot be neglected and affect performance [28–30].”
BackgroundGrover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Alicki, R., Lidar, D. A., & Zanardi, P. (2006) · Physical Review A · doi:10.1103/physreva.73.052311 · Cited by 132
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
A study of heuristic guesses for adiabatic quantum computation
Perdomo-Ortiz, A., Venegas-Andraca, S. E., & Aspuru-Guzik, A. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0168-z · Cited by 111
“Adiabatic quantum computation (AQC) [1] is a promising paradigm of quantum computation because of its robustness [ 2 ,3], and its intuitive mapping from NP-complete and NP-hard problems to potentially realizable Hamiltonians [1,4–6].”
BackgroundBenchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
“[49] Andrew M Childs, Edward Farhi, and John Preskill.”
BackgroundNested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Braine, L., Egger, D. J., Glick, J., & Woerner, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3063635 · Cited by 51
“Adiabatic quantum computing [13], [14] and variational algorithms, such as the variational quantum eigensolver (VQE) [9] and the quantum approximate optimization algorithm (QAOA) [10], are designed to tackle quadratic unconstrained binary optimization (QUBO) problems.”
MethodQuantum gates with controlled adiabatic evolutions
Hen, I. (2015) · Physical Review A · doi:10.1103/physreva.91.022309 · Cited by 37
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
“ting (AQC) [7] and gate model quantum computing [8].1 Each paradigm can be realized within various systems [9, 10, 11, 12]. Over the past years there has been an impressive progress in the eld of AQC [12, 13, 14], with many practical problems within the eld of combinatorial optimization are proposed to be solved using…”
BackgroundQuantum Adiabatic Computation with a Constant Gap Is Not Useful in One Dimension
Hastings, M. B. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.050502 · Cited by 22
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.