The DOI matches its Crossref record; 8 of the 9 references it cites were found in a registry or an index.
Quantum search by local adiabatic evolution
Open accessAbstract
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover's problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate of the Hamiltonian so as to keep the evolution adiabatic on each infinitesimal time interval, the total running time is of order $\sqrt{N},$ where N is the number of items in the database. We thus recover the advantage of Grover's standard algorithm as compared to a classical search, scaling as N. This is in contrast with the constant-rate adiabatic approach of Farhi et al. (e-print quant-ph/0001106), where the requirement of adiabaticity is expressed only globally, resulting in a time of order N.
Overview
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
Verification
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?
In the citing paper
“It is also worth mentioning that we achieved a transfer time faster than that obtained (for Ising coupling) in Ref. [19].”
From Optimal Control at the Quantum Speed Limit (2009) · cites this paper as [19]
In the citing paper
“Interestingly enough, however, our method only uses single-site local pulses while in Ref. [19] this was achieved using global pulses that operate jointly on the whole chain.”
From Optimal Control at the Quantum Speed Limit (2009) · cites this paper as [19]
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
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×
“We therefore recover the advantage of Grover’s usual algorithm compared to a classical search [3].”
BackgroundResultA 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
Grover’s quantum searching algorithm is optimal
Zalka, C. (1999) · Physical Review A · doi:10.1103/physreva.60.2746 · Cited by 635
Proceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365747 · Cited by 617
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536
Analog analogue of a digital quantum computation
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.57.2403 · Cited by 389
Joachain, C. J., & Bransden, B. H. (2000) · Cited by 149
Nested quantum search and structured problems
Cerf, N. J., Grover, L. K., & Williams, C. P. (2000) · Physical Review A · doi:10.1103/physreva.61.032303 · Cited by 115
Self-citation
Flagged first, then by citations
1 of the 9 references couldn’t be matched to a known paper.
Research works printed but not linked: 2
- S. L. Braunstein, 2000, Fortschr. Phys., 48, 767
- N. J. Cerf, 2000, Phys. Rev. A, 61, 032
Cited by
Sorted by citations
Items 501–600 of 633
Sun, J., Qian, L., Cai, D., Huang, Z., & Lu, S. (2025) · The European Physical Journal D · doi:10.1140/epjd/s10053-025-01003-z · Cited by 1
Analytical shortcuts to adiabaticity of weakly driven processes
Nazé, P. (2025) · Physical review. E · doi:10.1103/x5vw-5934 · Cited by 5
On the quantum circuit model of a kind of quantum adiabatic evolution
Sun, J. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04850-2 · Cited by 1
Noise tolerance via reinforcement: learning a reinforced quantum dynamics
Ramezanpour, A. (2025) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ae1a4c · Cited by 1
Counterdiabatic driving for random-gap Landau–Zener transitions
Theologou, G., Andersen, M. F., & Wimberger, S. (2025) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ae2c28 · Cited by 1
Variational determination of penalty parameters in quantum annealing
Qin, J.-Q., Yunlong, Y., & Wang, X. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae30a2 · Cited by 1
Invalid quantum partial adiabatic search can be remedied
Sun, J., Zheng, H., Zhang, Z., & Lu, S. (2026) · International Journal of Quantum Information · doi:10.1142/s0219749926500012 · Cited by 1
Kou, H.-C., Zhang, Z., Wu, X.-H., Zhou, Y., Chen, G., & Li, P. (2026) · Physical review. B./Physical review. B · doi:10.1103/5xrs-z9ls · Cited by 1
Sun, J., Zhang, Z., & Lu, S. (2026) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ae7758 · Cited by 1
A Toolbox to Understand the Physics of Quantum Data Management
Mauerer, W., & Schönberger, M. (2026) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3811628.3811835 · Cited by 1
Chang, B. R., & Tsai, H. F. (2007) · International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP) · doi:10.1109/iihmsp.2007.4457479 · Cited by 1
Quantum Mechanical Search and Harmonic Perturbation
Jiang, J.-H. R., Chiou, D.-W., & Wu, C.-E. R. (2007) · Quantum Information Processing · doi:10.1007/s11128-007-0062-5 · Cited by 1
Hamiltonian and Measuring Time for Analog Quantum Search
Hsieh, J.-Y., Li, C.-M., & Chuu, D.-S. (2005) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.74.2945 · Cited by 1
Multipartite entanglement in adiabatic quantum searching algorithm
Jiayan, W., & Wei, C. (2012) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2012.6234553 · Cited by 2
Speed-up of Neuromorphic Adiabatic Quantum Computation by Local Adiabatic Evolution
Kinjo, M., & Shimabukuro, K. (2011) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2011.63 · Cited by 1
Is the addition of an assisted driving Hamiltonian always useful for adiabatic evolution?
Sun, J., Lu, S., & Li, L. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1553-7 · Cited by 1
Quasiadiabatic Grover search via the Wentzel-Kramers-Brillouin approximation
Muthukrishnan, S., & Lidar, D. A. (2017) · Physical Review A · doi:10.1103/physreva.96.012329 · Cited by 1
Larson, J., Sjöqvist, E., & Öhberg, P. (2020) · Lecture notes in physics · doi:10.1007/978-3-030-34882-3_2 · Cited by 1
On the time–energy uncertainty relation of Kieu applied to quantum evolutions of Grover’s search
Sun, J., & Lu, S. (2020) · International Journal of Quantum Information · doi:10.1142/s0219749920500215 · Cited by 1
Tunable Tradeoff between Quantum and Classical Computation via Nonunitary Zeno-like Dynamics
Pyshkin, P. V., Gábris, A., Luo, D.-W., You, J. Q., & Wu, L.-A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.044060 · Cited by 1
Veszeli, M. T., & Vattay, G. (2022) · PLoS ONE · doi:10.1371/journal.pone.0264412 · Cited by 1
Efficient quantum algorithm for solving structured problems via multistep quantum computation
Wang, H., Yu, S., & Xiang, H. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.l012004 · Cited by 2
Quantum-Walk-Inspired Dynamic Adiabatic Local Search
Chiang, C.-F., & Alsing, P. M. (2023) · Entropy · doi:10.3390/e25091287 · Cited by 3
Fast generation of GHZ state by designing the evolution operators with Rydberg superatom
Wang, J. P., Yang, L. P., Ji, Y., Liu, Y. L., Dong, L., & Xiu, X. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04587-4 · Cited by 1
Pareto-optimality of pulses for robust population transfer in a ladder-type qutrit
McCord, J. J., Kuzmanović, M., & Paraoanu, G. S. (2025) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-025-00424-4 · Cited by 1
Geometry and Dynamics of a Quantum Search Algorithm for an Ordered Tuple of Multi-Qubits
Uwano, Y. (2013) · InTech eBooks · doi:10.5772/53187 · Cited by 1
Majorization in quantum adiabatic algorithms
Wei, Z., Ji, Z., & Ying, M. (2006) · Physical Review A · doi:10.1103/physreva.74.042320 · Cited by 1
Das, A., & Suzuki, S. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02337-1 · Cited by 1
On the usefulness of an assisted driving Hamiltonian for quantum adiabatic evolution
Sun, J., & Lu, S. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/11/110306 · Cited by 1
Study on Brachistochrone Problem for Grover’s Quantum Search Algorithm
崔, 晓. (2018) · Applied Physics · doi:10.12677/app.2018.811058 · Cited by 1
Nonadiabatic Quantum Search Algorithm with Analytical Success Rate
Li, F., Bao, W., Li, T., Huang, H.-L., Zhang, S., & Fu, X.-Q. (2018) · International Journal of Theoretical Physics · doi:10.1007/s10773-018-3986-x · Cited by 1
Entangling Problem Hamiltonian for Adiabatic Quantum Computation
Lychkovskiy, O. V. (2022) · Lobachevskii Journal of Mathematics · doi:10.1134/s1995080222100262 · Cited by 2
Finite temperature quantum condensations in the space of states: general proof
Ostilli, M., & Carlo Presilla, A. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/acad49 · Cited by 1
Quantum computing from a mathematical perspective: a description of the quantum circuit modelPreprint
Ossorio-Castillo, J., & Tornero, J. M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.08277 · Cited by 6
Learning adiabatic quantum algorithms for solving optimization problemsPreprint
Pastorello, D., & Blanzieri, E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.06870 · Cited by 1
Quantum Adiabatic Feature SelectionPreprint
Sharma, K. K. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.08732 · Cited by 1
Network medicine-based epistasis detection in complex diseases: ready for quantum computingPreprint
Hoffmann, M., Poschenrieder, J., Incudini, M., Baier, S., Fitz, A., Maier, A., Hartung, M., Hoffmann, C., Trummer, N., Adamowicz, K., et al. (2023) · medRxiv · doi:10.1101/2023.11.07.23298205 · Cited by 1
An optimal adiabatic quantum query algorithm.Preprint
Brandeho, M., & Roland, J. (2014) · arXiv (Cornell University)
Self-citationO’Hara, M. J. (2008) · University Libraries (University of Maryland)
Simulations of error in quantum adiabatic computations of random 2-SAT instances
Gill, J. S. (2006) · DSpace@MIT (Massachusetts Institute of Technology)
Roland, J., & Cerf, N. J. (2004) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 1
Self-citationOn the Role of Prior Probability in Adiabatic Quantum Algorithms
Sun, J., Lu, S., & Yang, L. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2778-9
Controlling quantum information
Landahl, A. J. (2002) · CERN Document Server (European Organization for Nuclear Research) · doi:10.7907/bj0q-c297
Chang, B. R., Young, C.-P., Tsai, H. F., Chen, S. H., Chen, Y. C., & Tseng, Y.-K. (2007) · International Conference on Innovative Computing, Information and Control · doi:10.1109/icicic.2007.410
Fault tolerant analogue search algorithm within a quantum network
Song, J., Sun, X., Xia, Y., & Song, H. (2011) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/44/11/115503
Inexact and exact quantum searches with a preparation state in a three-dimensional subspace
Bautista-Ramos, C., Guillén-Galván, C., Rangel-Huerta, A., Amaro, D. A. V., & Amezcua-Ortega, J. M. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0810-2
Alternative Models of Quantum Computation
Williams, C. P. (2010) · Texts in computer science · doi:10.1007/978-1-84628-887-6_15
Path Independence in Adiabatic Quantum Computing for Hadamard Gate
Kosasih, J. S., Suhadi, S., & Zen, F. P. (2014) · Journal of Mathematical and Fundamental Sciences · doi:10.5614/j.math.fund.sci.2014.46.1.3
Free-Time and Fixed End-Point Multitarget Optimal Control Theory Applied to Quantum Computing
Mishima, K., & Yamashita, K. (2016) · Biological magnetic resonance · doi:10.1007/978-1-4939-3658-8_5
Quantum Algorithms and Complexity for Numerical Problems
Zhang, C. (2011) · doi:10.7916/d8gf11gx
Bounding Run-Times of Local Adiabatic Algorithms
Rao, M. V. P. (2007) · Springer eBooks · doi:10.1007/978-3-540-72504-6_41
Discrete adiabatic quantum computation with quadric variation
El-fiky, M., Ono, S., & Nakayama, S. (2010) · World Congress on Nature and Biologically Inspired Computing (NaBIC) · doi:10.1109/nabic.2010.5716272
Mani, A., & Patvardhan, C. (2011) · International Conference on Information Technology: New Generations · doi:10.1109/itng.2011.218
Parametrizações otimais de trajetórias adiabáticas em sistemas quânticos dissipativos
Gontijo, M. M. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.43.2012.tde-05122014-101358
Towards optimized dynamical error control and algorithms for quantum information processing
Kuo, W.-J. (2012) · ProQuest Demo Repository · doi:10.25549/usctheses-c3-65763
An adiabatic quantum optimization for exact cover 3 problem
Zhang, Y., Xu, L.-L., & Li, J. (2014) · Chinese Physics B · doi:10.1088/1674-1056/23/3/030308
Numerical Studies of the Quantum Adiabatic Algorithm
Young, A. P., & Hen, I. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/640/1/012038
О реализации стандартных квантовых вычислительных сетей посредством адиабатической эволюции
Zobov, V. E., & Ермилов, А. С. (2007) · Теоретическая и математическая физика · doi:10.4213/tmf5990
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.174425
Quantum Annealing for Ising Anyonic Syatems
Sato, M. (2016)
Neuromorphic Adiabatic Quantum Computation
Sato, S., & Kinjo, M. (2009) · IGI Global eBooks · doi:10.4018/978-1-60566-214-5.ch014
Continuous time quantum algorithms
Childs, A. M. (2003)
Correlações quânticas e o modelo DQC1
Santos, M. J. Z. D. (2015) · doi:10.14393/ufu.te.2015.101 · Cited by 1
A useful fundamental speed limit for the imaginary-time Schrodinger equationPreprint
Okuyama, M., & Ohzeki, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1806.09040
Montangero, S. (2018) · Springer eBooks · doi:10.1007/978-3-030-01409-4_8
Quantum Adiabatic Evolution with a Special Kind of Interpolating Paths
Sun, J., Lu, S., & Gao, C. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-03405-4_51
How to make assisted driving Hamiltonian useful in quantum adiabatic computation?
Sun, J., Lu, S., & Li, L. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500023
A family of system Hamiltonian in quantum adiabatic search type problem
Sun, J., & Lu, S. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500151
Combining Learned Representations for Combinatorial OptimizationPreprint
Patel, S., & Salahuddin, S. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1909.03978
Realizing an adiabatic quantum search algorithm with shortcuts to adiabaticity in an ion-trap system
Wu, W., & Zhang, J. (2019) · Quantum Information and Measurement (QIM) · doi:10.1364/qim.2019.f5a.18
Non-equilibrium processes and ergodicity-breaking in isolated quantum systems
Taylor, S. R. (2019) · St Andrews Research Repository (St Andrews Research Repository) · doi:10.17630/10023-17867
Numerical Engineering of Adiabatic Quantum Operations
Tabatabaei, S. S. (2020) · UWSpace (University of Waterloo)
On Quantum Simulators and Adiabatic Quantum Algorithms
Mostame, S. (2008) · Qucosa (Saxon State and University Library Dresden)
Fidelity-based Deep Adiabatic Scheduling
Ovits, E., & Wolf, L. (2021) · International Conference on Learning Representations
Benchmarks and Controls for Optimization with Quantum Annealing
Grant, E. (2020)
Yan, B., & Sinitsyn, N. A. (2021) · arXiv (Cornell University)
A Novel AQC Factoring AlgorithmPreprint
Crawford, M. B. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.13313
Reflection-Based Adiabatic State PreparationPreprint
Lemieux, J., Scherer, A., & Ronagh, P. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.05461
Kempe, J., & Vidick, T. (2010) · Lecture notes in physics · doi:10.1007/978-3-642-11914-9_10
Kempe, J. (2016) · Wiley eBooks · doi:10.1002/9783527805785.ch6
Quantum adiabaticity in many-body systems and almost-orthogonality in complementary subspace
Chen, J.-H., & Cheianov, V. (2025) · SciPost Physics Core · doi:10.21468/scipostphyscore.8.4.084
Control limit for the quantum state preparation under stochastic control errors
Kobayashi, K. (2023) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2023.0215 · Cited by 1
Solving QUBO problems with the methods of statistical physics and quantum mechanics
Veszeli, M. T. (2023) · Eötvös Loránd Tudományegyetem · doi:10.15476/elte.2022.241
Fast-forwarding molecular ground state preparation with optimal control on analog quantum simulators
Castaldo, D., Rosa, M., & Corni, S. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0204618
Classical computation over quantum architectures
Schiava, A. D., Piazza, C., & Romanello, R. (2024) · Journal of Logic and Computation · doi:10.1093/logcom/exae040
He, Z., Kemper, A. F., & Freericks, J. K. (2026) · APL Quantum · doi:10.1063/5.0293153
Shallow-Depth Quantum Circuit for Unstructured Database Search
Zhan, J. (2024) · Quantum Reports · doi:10.3390/quantum6040037
Matus, F., & Cejnar, P. (2025) · Physical review. E · doi:10.1103/physreve.111.044104 · Cited by 1
Asymptotic errors in adiabatic evolution
Cohen, T. D., & Oh, H. (2025) · Physical Review A · doi:10.1103/physreva.111.042612
Superoscillating quantum control induced by sequential selections
Ding, Y., Pan, Y., & Chen, X. (2025) · Physical Review A · doi:10.1103/physreva.111.052613 · Cited by 1
Improving adiabatic quantum factorization via chopped random-basis optimization
Yang, T., Xiong, M., Xue, M., Li, X., & Li, J. (2025) · Physical Review A · doi:10.1103/physreva.111.052617 · Cited by 2
Rate function modeling of quantum many-body adiabaticity
Mishra, V., Manmana, S. R., & Kehrein, S. K. (2025) · Physical review. B./Physical review. B · doi:10.1103/xtkk-5xhw
The Riemann Hypothesis and the Monster are at the Heart of the Vacuum CatastrophePreprint
Nestor, T. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5343153
On the stability of solutions to Schrödinger’s equation short of the adiabatic limit
Bringewatt, J., Jarret, M., & Mooney, T. C. (2025) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2024.0193
Jansen, N. D., & Hunt, K. L. C. (2025) · Entropy · doi:10.3390/e27090891 · Cited by 1
Metadata
- Authors
- Roland, J., & Cerf, N. J.
- Affiliations
- Université Libre de Bruxelles (BE)
- California Institute of Technology (US)
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2002-03-26
- Volume
- 65
- Issue
- 4
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2155521441
- Cited by
- 629
- References
- 9
- Citations by year
- 2026: 29 · 2025: 50 · 2024: 35 · 2023: 26 · 2022: 43 · 2021: 35 · 2020: 34 · 2019: 44 · 2018: 28 · 2017: 16 · 2016: 28 · 2015: 24 · 2014: 30 · 2013: 17 · 2012: 26
- FWCI
- 13.10
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Locations
- Physical Review A (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- quantum search, adiabatic quantum computation, Grover's algorithm, unstructured database search, time-dependent Hamiltonian, adiabaticity, evolutionary rates, ground state, quantum algorithms
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
