Quantum Adiabatic Algorithm and Scaling of Gaps at First-Order Quantum Phase Transitions
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first-order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum antiferromagnetic Ising chain in a staggered field can exhibit a first-order transition with only an algebraically small gap. In addition, we construct a simple classical translationally invariant one-dimensional Hamiltonian containing nearest-neighbor interactions only, which exhibits an exponential gap at a thermodynamic quantum first-order transition of essentially topological origin. This establishes that (i) the QAA can be successful even across first-order transitions but also that (ii) it can fail on exceedingly simple problems readily solved by inspection, or by classical annealing.
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
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
The quantum adiabatic optimization algorithm and local minima
Reichardt, B. W. (2004) · Proceedings of the thirty-sixth annual ACM symposium on Theory of computing · doi:10.1145/1007352.1007428 · Cited by 110
HOW TO MAKE THE QUANTUM ADIABATIC ALGORITHM FAIL
FARHI, E., GOLDSTONE, J., GUTMANN, S., & NAGAJ, D. (2008) · International Journal of Quantum Information · doi:10.1142/s021974990800358x · Cited by 81
Cited by
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“Another interesting example of a local spin model that leads StoqAQC astray was given in (Laumann et al., 2012).”
BackgroundQuantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
Scholl, P., Schuler, M., Williams, H. J., Eberharter, A. A., Barredo, D., Schymik, K.-N., Lienhard, V., Henry, L.-P., Lang, T. C., Lahaye, T., et al. (2021) · Nature · doi:10.1038/s41586-021-03585-1 · Cited by 688
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
Quantum many-body scars and Hilbert space fragmentation: a review of exact results
Moudgalya, S., Bernevig, B. A., & Regnault, N. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac73a0 · Cited by 431
Unconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Enhancement of quantum annealing via n-local catalysts
Ghosh, R., Nutricati, L. A., Feinstein, N., Warburton, P. A., & Bose, S. (2024) · arXiv · doi:10.48550/arxiv.2409.13029 · Cited by 2
Metadata
- Authors
- Laumann, C. R., Moessner, R., Scardicchio, A., & Sondhi, S. L.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2012-07-19
- Volume
- 109
- Issue
- 3
- Pages
- 030502-030502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2073096239
- Cited by
- 72
- References
- 3
- FWCI
- 4.75
- 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.