Non-classical role of potential energy in adiabatic quantum annealing
Open accessAbstract
Adiabatic quantum annealing is a paradigm of analog quantum computation, where a given computational job is converted to the task of finding the global minimum of some classical potential energy function and the search for the global potential minimum is performed by employing external kinetic quantum fluctuations and subsequent slow reduction (annealing) of them. In this method, the entire potential energy landscape (PEL) may be accessed simultaneously through a delocalized wave-function, in contrast to a classical search, where the searcher has to visit different points in the landscape (i.e., individual classical configurations) sequentially. Thus in such searches, the role of the potential energy might be significantly different in the two cases. Here we discuss this in the context of searching of a single isolated hole (potential minimum) in a golf-course type gradient free PEL. We show, that the quantum particle would be able to locate the hole faster if the hole is deeper, while the classical particle of course would have no scope to exploit the depth of the hole. We also discuss the effect of the underlying quantum phase transition on the adiabatic dynamics.
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
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The Ising model can be expressed as a series of independent Landau-Zener crossings, so results for the LZ model extrapolate to driving a critical many-body system.
“As shown in Ref. [71] the Ising model can be expressed as a series of independent LZ crossings, and therefore the following results extrapolate to driving a critical many-body system.”
From Trade-Off Between Speed and Cost in Shortcuts to Adiabaticity (2017) · cites this paper as [71]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · see citing works
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · see citing works
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 · see citing works
Theory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734 · see citing works
<i>Colloquium</i> : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700 · see citing works
Self-citationQuantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629 · see citing works
Quantum 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 · see citing works
Analog analogue of a digital quantum computation
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.57.2403 · Cited by 389 · see citing works
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
Santoro, G. E., & Tosatti, E. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/36/r01 · Cited by 354 · see citing works
Quantum Annealing and Other Optimization Methods
Das, A., & Chakrabarti, B. (2005) · Lecture notes in physics · doi:10.1007/11526216 · Cited by 300 · see citing works
Self-citationRay, P., Chakrabarti, B. K., & Chakrabarti, A. (1989) · Physical review. B, Condensed matter · doi:10.1103/physrevb.39.11828 · Cited by 209 · see citing works
Quantum annealing of the traveling-salesman problem
Martoňák, R., Santoro, G. E., & Tosatti, E. (2004) · Physical Review E · doi:10.1103/physreve.70.057701 · Cited by 200 · see citing works
Consistency of the Adiabatic Theorem
Sarandy, M. S., Wu, L.-A., & Lidar, D. A. (2004) · Quantum Information Processing · doi:10.1007/s11128-004-7712-7 · Cited by 116 · see citing works
Quantum Approach to Classical Statistical Mechanics
Somma, R. D., Batista, C. D., & Ortiz, G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.030603 · Cited by 87 · see citing works
Quantum Adiabatic Evolution Algorithms versus Simulated AnnealingPreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0201031 · Cited by 84 · see citing works
Application of the quantum spin glass theory to image restoration
Inoue, J. (2001) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.63.046114 · Cited by 52 · see citing works
Quantum annealing in a kinetically constrained system
Das, A., Chakrabarti, B. K., & Stinchcombe, R. B. (2005) · Physical Review E · doi:10.1103/physreve.72.026701 · Cited by 38 · see citing works
Self-citationSantoro, G. E., & Tosatti, E. (2007) · Nature Physics · doi:10.1038/nphys706 · Cited by 12 · see citing works
Flagged first, then by citations
Research works printed but not linked: 3
- Das A and Chakrabarti B K 2008 Rev. Mod. Phys. 80 1061 International Workshop on Statistical-Mechanical Informatics 2008 (IW-SMI 2008) IOP Publishing Journal of Physics: Conference Series 143 (2009) 012001 doi:10.1088/1742-6596/143/1/012001
- Das A and Chakrabarti B K 2008 (arXiv:0803.4508) · arXiv
- van Dam W, Mosca M and Vazirani U 2001 Proceedings of the 42nd Annual Symposium on Foundations Computer Science p 279 International Workshop on Statistical-Mechanical Informatics 2008 (IW-SMI 2008) IOP Publishing Journal of Physics: Conference Series 143 (2009) 012001 doi:10.1088/1742-6596/143/1/012001
Cited by
Sorted by citations
Trade-Off Between Speed and Cost in Shortcuts to Adiabaticity
Campbell, S., & Deffner, S. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.100601 · Cited by 235 · see citing works
Zhang, J. W., Bu, J. T., Li, J. C., Meng, W., Ding, W. Q., Wang, B., Yuan, W. F., Du, H.-J., Ding, G.-Y., Chen, W.-J., et al. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.213602 · Cited by 12 · see citing works
- Authors
- Das, A.
- Affiliations
- The Abdus Salam International Centre for Theoretical Physics (ICTP) (IT)
- Corresponding author
- Das, Arnab
- Venue
- Journal of Physics: Conference Series
- Publisher
- IOP Publishing
- Published
- 2009-01-07
- Volume
- 143
- Pages
- 012001
- ISSN
- 1742-6588 (ISSN-L)
- 1742-6596
- OpenAlex
- W2004743739
- Cited by
- 2
- References
- 17
- Citations by year
- 2024: 1 · 2017: 1
- FWCI
- 0.00
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Locations
- Journal of Physics Conference Series (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Ministry of Education, Culture, Sports, Science and Technology (18079001)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- potential energy landscape, global minimum search, quantum tunneling, hole depth, quantum phase transitions, adiabatic dynamics
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
