Energetic Cost of Superadiabatic Quantum Computation
Open accessAbstract
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search over an unstructured list. We show that the additional energy resources required by superadiabaticity for arbitrary controlled evolutions can be minimized by using probabilistic dynamics, so that the optimal success probability is fixed by the choice of the evolution time. In the case of analog quantum search, we show that the superadiabatic approach induces a non-oracular counter-diabatic Hamiltonian, with the same energy-time complexity as equivalent adiabatic implementations.
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?
Fermi's golden rule for time-dependent perturbation theory states that the rate of quantum transitions is determined by the time-integrated magnitude of the perturbation.
“This rule states that the rate of quantum transitions is determined by the time-integrated magnitude of the perturbation.”
From Trade-Off Between Speed and Cost in Shortcuts to Adiabaticity (2017) · cites this paper as [76]
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 · cited 2× · see citing works
“An adiabaticQC approach for the quantum search through Grover’s algorithm (Grover, 1997) was first proposed in Farhi et al.”
MethodA 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
Transitionless quantum driving
Berry, M. (2009) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/42/36/365303 · Cited by 1,039 · see citing works
Adiabatic Population Transfer with Control Fields
Demirplak, M., & Rice, S. A. (2003) · The Journal of Physical Chemistry A · doi:10.1021/jp030708a · Cited by 749 · see citing works
Torrontegui, E., Ibañez, S., Martínez-Garaot, S., Modugno, M., del Campo, A., Guéry-Odelin, D., Ruschhaupt, A., Chen, X., & Muga, J. G. (2013) · Advances in atomic, molecular, and optical physics · doi:10.1016/b978-0-12-408090-4.00002-5 · Cited by 665 · see citing works
Quantum 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
Shortcuts to Adiabaticity by Counterdiabatic Driving
del Campo, A. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.100502 · Cited by 536 · see citing works
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 455 · see citing works
Assisted Adiabatic Passage Revisited
Demirplak, M., & Rice, S. A. (2005) · The Journal of Physical Chemistry B · doi:10.1021/jp040647w · Cited by 395 · see citing works
Adiabatic Perturbation Theory in Quantum Dynamics
Teufel, S. (2003) · Lecture notes in mathematics · doi:10.1007/b13355 · Cited by 386 · see citing works
Bounds for the adiabatic approximation with applications to quantum computation
Jansen, S., Ruskai, M.-B., & Seiler, R. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2798382 · Cited by 385 · see citing works
del Campo, A., Rams, M. M., & Zurek, W. H. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.115703 · Cited by 304 · see citing works
Energy–time uncertainty relation for driven quantum systems
Deffner, S., & Lutz, E. (2013) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/46/33/335302 · Cited by 199 · see citing works
Fast adiabatic qubit gates using only σ z control
Martinis, J. M., & Geller, M. R. (2014) · Physical Review A · doi:10.1103/physreva.90.022307 · Cited by 196 · see citing works
How powerful is adiabatic quantum computation?
van Dam, W., Mosca, M., & Vazirani, U. (2001) · Proceedings 42nd IEEE Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2001.959902 · Cited by 175 · see citing works
Efficient shortcuts to adiabatic passage for fast population transfer in multiparticle systems
Chen, Y., Xia, Y., Chen, Q.-Q., et al. (2014) · Physical Review A · doi:10.1103/physreva.89.033856 · Cited by 152 · see citing works
Adiabatic tracking of quantum many-body dynamics
Saberi, H., Opatrný, T., Mølmer, K., & del Campo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.060301 · Cited by 145 · see citing works
Efficient Synthesis of Universal Repeat-Until-Success Quantum Circuits
Bocharov, A., Roetteler, M., & Svore, K. M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.080502 · Cited by 142 · see citing works
Chen, Y., Xia, Y., Chen, Q.-Q., & Song, J. (2015) · Physical Review A · doi:10.1103/physreva.91.012325 · Cited by 136 · see citing works
Lu, M., Xia, Y., Shen, L.-T., et al. (2014) · Physical Review A · doi:10.1103/physreva.89.012326 · Cited by 130 · see citing works
Superadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, A. C., & Sarandy, M. S. (2015) · Scientific Reports · doi:10.1038/srep15775 · Cited by 125 · see citing works
Self-citationConsistency 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
Self-citationShortcut to adiabatic gate teleportation
Santos, A. C., Silva, R. D., & Sarandy, M. S. (2016) · Physical Review A · doi:10.1103/physreva.93.012311 · Cited by 79 · see citing works
Self-citationUniversality of entanglement and quantum-computation complexity
Orús, R., & Latorre, J. I. (2004) · Physical Review A · doi:10.1103/physreva.69.052308 · Cited by 75 · see citing works
Chen, Y.-H., Xia, Y., Song, J., et al. (2015) · Scientific Reports · doi:10.1038/srep15616 · Cited by 62 · see citing works
Chen, Y., Xia, Y., Chen, Q.-Q., & Song, J. (2014) · Laser Physics Letters · doi:10.1088/1612-2011/11/11/115201 · Cited by 47 · see citing works
Quantum gates with controlled adiabatic evolutions
Hen, I. (2015) · Physical Review A · doi:10.1103/physreva.91.022309 · Cited by 37 · see citing works
Self-citationEnergy and efficiency of adiabatic quantum search algorithms
Das, S., Kobes, R., & Kunstatter, G. (2003) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/36/11/313 · Cited by 34 · see citing works
Lu, M., Xia, Y., Shen, L.-T., et al. (2014) · Laser Physics · doi:10.1088/1054-660x/24/10/105201 · Cited by 29 · see citing works
On the power of coherently controlled quantum adiabatic evolutions
Kieferová, M., & Wiebe, N. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/12/123034 · Cited by 20 · see citing works
ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
Jiayan, W., & Qiu, D. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908004249 · Cited by 9 · see citing works
ENTANGLEMENT PROPERTIES OF ADIABATIC QUANTUM ALGORITHMS
Jiayan, W., Huang, Y., & Qiu, D. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909006000 · Cited by 5 · see citing works
Flagged first, then by citations
Research works printed but not linked: 4
- Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. MIT-CTP-2936 (arXiv:quant-ph/0001106). · arXiv
- Nielsen, M. A., and Chuang, I. L. (2000). Quantum Computation and Quantum Information. Cambridge: Cambridge University Press.
- S0219749909006000 · DOI
- Zheng, Y., Campbell, S., Chiara, G., and Poletti, D. (2015). Cost of transitionless driving and work output. e-print arXiv:1509.01882 · arXiv
Cited by
Sorted by citations
Quantum speed limits: from Heisenberg’s uncertainty principle to optimal quantum control
Deffner, S., & Campbell, S. (2017) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8121/aa86c6 · Cited by 585 · see citing works
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
Energy efficient quantum machines
Abah, O., & Lutz, E. (2017) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/118/40005 · Cited by 101 · see citing works
- Authors
- Coulamy, I. B., Santos, A. C., Hen, I., & Sarandy, M. S.
- Affiliations
- Universidade Federal Fluminense (BR)
- University of Southern California (US)
- Corresponding author
- Sarandy, Marcelo S.
- ORCID
- Sarandy, Marcelo S.
- Venue
- Frontiers in ICT
- Publisher
- Frontiers Media SA
- Published
- 2016-09-15
- Volume
- 3
- ISSN
- 2297-198X (ISSN-L)
- OpenAlex
- W2308643809
- Cited by
- 38
- References
- 32
- Citations by year
- 2024: 1 · 2023: 1 · 2022: 2 · 2021: 3 · 2020: 4 · 2019: 8 · 2018: 5 · 2017: 12 · 2016: 2
- FWCI
- 7.42
- Type
- journal article
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- cc-by
- Locations
- Frontiers in ICT (publishedVersion, cc-by)
- arXiv (Cornell University) (publishedVersion)
- arXiv (Cornell University)
- Funders
- Conselho Nacional de Desenvolvimento Científico e Tecnológico
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- shortcuts to adiabaticity, unstructured search, stochastic dynamics, energy costs
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
