The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Quantum Adiabatic Brachistochrone
Open accessAbstract
We formulate a time-optimal approach to adiabatic quantum computation (AQC). A corresponding natural Riemannian metric is also derived, through which AQC can be understood as the problem of finding a geodesic on the manifold of control parameters. This geometrization of AQC is demonstrated through two examples, where we show that it leads to improved performance of AQC, and sheds light on the roles of entanglement and curvature of the control manifold in algorithmic performance.
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
Entanglement in Quantum Critical Phenomena
Vidal, G., Latorre, J. I., Rico, E., & Kitaev, A. (2003) · Physical Review Letters · doi:10.1103/physrevlett.90.227902 · Cited by 2,793
Geometry, Topology and Physics
Nakahara, M. (1990) · doi:10.1887/0750306068 · Cited by 1,620
Quantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629
Quantum Computation as Geometry
Nielsen, M. A., Dowling, M. R., Gu, M., & Doherty, A. C. (2006) · Science · doi:10.1126/science.1121541 · Cited by 539
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
Quantum Computers Can Search Arbitrarily Large Databases by a Single Query
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.4709 · Cited by 432
Cited by
Colloquium: Nonequilibrium dynamics of closed interacting quantum systems
Polkovnikov, A., Sengupta, K., Silva, A., & Vengalattore, M. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.863 · Cited by 2,562
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Self-citationFast Optimal Frictionless Atom Cooling in Harmonic Traps: Shortcut to Adiabaticity
Chen, X., Ruschhaupt, A., Schmidt, S., del Campo, A., Guéry-Odelin, D., & Muga, J. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.063002 · Cited by 695
Shortcut to Adiabatic Passage in Two- and Three-Level Atoms
Chen, X., Lizuain, I., Ruschhaupt, A., Guéry-Odelin, D., & Muga, J. G. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.123003 · Cited by 627
Chopped random-basis quantum optimization
Caneva, T., Calarco, T., & Montangero, S. (2011) · Physical Review A · doi:10.1103/physreva.84.022326 · Cited by 400
Minor-embedding in adiabatic quantum computation: II. Minor-universal graph design
Choi, V. (2011) · Quantum Information Processing · doi:10.1007/s11128-010-0200-3 · Cited by 278
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
Minimizing irreversible losses in quantum systems by local counterdiabatic driving
Sels, D., & Polkovnikov, A. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619826114 · Cited by 267
Optimizing Variational Quantum Algorithms Using Pontryagin’s Minimum Principle
Yang, Z.-C., Rahmani, A., Shabani, A., Neven, H., & Chamon, C. (2017) · Physical Review X · doi:10.1103/physrevx.7.021027 · Cited by 210
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
Wang, X., Allegra, M., Jacobs, K., Lloyd, S., Lupo, C., & Mohseni, M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.170501 · 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
Self-citationSpeeding up critical system dynamics through optimized evolution
Caneva, T., Calarco, T., Fazio, R., Santoro, G. E., & Montangero, S. (2011) · Physical Review A · doi:10.1103/physreva.84.012312 · Cited by 78
Experimental Time-Optimal Universal Control of Spin Qubits in Solids
Geng, J., Wu, Y., Wang, X., Xu, K., Shi, F., Xie, Y., Rong, X., & Du, J. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.170501 · Cited by 68
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
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
Quantum approximate algorithm for NP optimization problems with constraints
Ruan, Y., Marsh, S., Xue, X., Li, X., Liu, Z., & Wang, J. (2020) · arXiv · doi:10.48550/arxiv.2002.00943 · Cited by 9
Metadata
- Authors
- Rezakhani, A. T., Kuo, W.-J., Hamma, A., Lidar, D. A., & Zanardi, P.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2009-08-21
- Volume
- 103
- Issue
- 8
- Pages
- 080502-080502
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2022034486
- Cited by
- 162
- References
- 6
- FWCI
- 12.65
- 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.