The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Bounds for the adiabatic approximation with applications to quantum computation
Open accessAbstract
We present straightforward proofs of estimates used in the adiabatic approximation. The gap dependence is analyzed explicitly. We apply the result to interpolating Hamiltonians of interest in quantum computing.
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
Quantal phase factors accompanying adiabatic changes
Berry, M. V. (1984) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1984.0023 · Cited by 9,252 · cited 1×
“Berry [20] pointed out that time evolution of a quantum system in the adiabatic limit becomes geometric.”
BackgroundZur Quantentheorie der Molekeln
Born, M., & Oppenheimer, R. (1927) · Annalen der Physik · doi:10.1002/andp.19273892002 · Cited by 4,958
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
Holonomy, the Quantum Adiabatic Theorem, and Berry's Phase
Simon, B. (1983) · Physical Review Letters · doi:10.1103/physrevlett.51.2167 · Cited by 1,919
Born, M., & Fock, V. (1928) · Zeitschrift f�r Physik · doi:10.1007/bf01343193 · Cited by 1,494
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
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Adiabatic theorems and applications to the quantum hall effect
Avron, J. E., Seiler, R., & Yaffe, L. G. (1987) · Communications in Mathematical Physics · doi:10.1007/bf01209015 · Cited by 230
Self-citationAdiabatic Theorem without a Gap Condition
Avron, J. E., & Elgart, A. (1999) · Communications in Mathematical Physics · doi:10.1007/s002200050620 · Cited by 207
Inconsistency in the Application of the Adiabatic Theorem
Marzlin, K.-P., & Sanders, B. C. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.160408 · Cited by 196
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum Algorithms for Quantum Field Theories
Jordan, S. P., Lee, K. S. M., & Preskill, J. (2012) · Science · doi:10.1126/science.1217069 · Cited by 517
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
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
Quantum algorithms for algebraic problems
Childs, A. M., & van Dam, W. (2010) · Reviews of Modern Physics · doi:10.1103/revmodphys.82.1 · Cited by 344
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
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
Quantum Algorithms for Systems of Linear Equations Inspired by Adiabatic Quantum Computing
Subaşı, Y., Somma, R. D., & Orsucci, D. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.060504 · Cited by 183
Quantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
Superadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, A. C., & Sarandy, M. S. (2015) · Scientific Reports · doi:10.1038/srep15775 · Cited by 125
Optimal Protocols in Quantum Annealing and QAOA Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2020) · arXiv · doi:10.48550/arxiv.2003.08952 · Cited by 117
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114
“The running time T of the algorithm determines the efficiency, or complexity, of the algorithm and should be large compared to the inverse of the minimum gap [14, 16, 17].”
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 Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102
General conditions for quantum adiabatic evolution
Comparat, D. (2009) · Physical Review A · doi:10.1103/physreva.80.012106 · Cited by 95
Topological networks for quantum communication between distant qubits
Lang, N., & Büchler, H. P. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0047-x · Cited by 78
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Quantum Optimization via Four-Body Rydberg Gates
Dlaska, C., Ender, K., Mbeng, G. B., Kruckenhauser, A., Lechner, W., & van Bijnen, R. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120503 · Cited by 51
“[41], we get the following rigorous upper bound:”
BackgroundOn the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“…starting energy matrices, (cid:98) E 0 , and a sufficiently slow annealing time, the adiabatic theorem demonstrates that a quantum system remains at the minimal eigenvector of the interpolating matrix, (cid:98) E a (Γ) [10, 45, 40], and therefore achieves the minimum energy of the target problem.”
BackgroundAdiabatic optimization versus diffusion Monte Carlo methods
Jarret, M., Jordan, S. P., & Lackey, B. (2016) · Physical Review A · doi:10.1103/physreva.94.042318 · Cited by 36
Energetic Cost of Superadiabatic Quantum Computation
Coulamy, I. B., Santos, A. C., Hen, I., & Sarandy, M. S. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00019 · Cited by 38
Schedule path optimization for adiabatic quantum computing and optimization
Zeng, L., Zhang, J., & Sarovar, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165305 · Cited by 31
Spectral-gap analysis for efficient tunneling in quantum adiabatic optimization
Brady, L. T., & van Dam, W. (2016) · Physical Review A · doi:10.1103/physreva.94.032309 · Cited by 17
Metadata
- Authors
- Jansen, S., Ruskai, M.-B., & Seiler, R.
- Venue
- Journal of Mathematical Physics
- Publisher
- AIP Publishing
- Published
- 2007-10-01
- Volume
- 48
- Issue
- 10
- ISSN
- 0022-2488 (ISSN-L)
- 1089-7658
- OpenAlex
- W2089974384
- Cited by
- 384
- References
- 16
- FWCI
- 11.82
- 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.