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
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
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J., Degroote, M., Johnson, P., Kieferová, M., Kivlichan, I., Menke, T., Peropadre, B., Sawaya, N., et al. (n.d.) · OPUS - Open Publications of UTS Scholars (University of Technology Sydney) · Cited by 1,265
Shortcuts to adiabaticity: Concepts, methods, and applications
Guéry-Odelin, D., Ruschhaupt, A., Kiely, A., Torrontegui, E., Martínez-Garaot, S., & Muga, J. G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045001 · Cited by 1,087
Programmable quantum simulations of spin systems with trapped ions
Monroe, C. R., Campbell, W. C., Duan, L.-M., Gong, Z., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N. M., Pagano, G., et al. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025001 · Cited by 891
Programmable Quantum Simulations of Spin Systems with Trapped Ions
Monroe, C., Campbell, W. C., Duan, L. M., Gong, Z. X., Gorshkov, A. V., Hess, P., Islam, R., Kim, K., Linke, N., Pagano, G., et al. (2019) · arXiv · doi:10.48550/arxiv.1912.07845 · Cited by 806
Spatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725
Colloquium : 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
Quantum computing for finance: Overview and prospects
Orús, R., Mugel, S., & Lizaso, E. (2019) · Reviews in Physics · doi:10.1016/j.revip.2019.100028 · Cited by 785
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 612
Optimal Control at the Quantum Speed Limit
Caneva, T., Murphy, M., Calarco, T., Fazio, R., Montangero, S., Giovannetti, V., & Santoro, G. E. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.240501 · Cited by 509
Robustness of adiabatic quantum computation
Childs, A. M., Farhi, E., & Preskill, J. P. (2001) · Physical Review A · doi:10.1103/physreva.65.012322 · Cited by 468
Bason, M. G., Viteau, M., Malossi, N., Huillery, P., Arimondo, E., Ciampini, D., Fazio, R., Giovannetti, V., Mannella, R., & Morsch, O. (2012) · Nature Physics · doi:10.1038/nphys2170 · Cited by 462
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 optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Childs, A. M. (2010) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0930-1 · Cited by 411
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O. (2008) · SIAM Review · doi:10.1137/080734479 · Cited by 395
“In [9,30] it was shown that Grover’s quadratic speed-up for an unsorted search [16] can be realized as an adiabatic computation.”
BackgroundBounds 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
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322
Quantum Machine Learning: What Quantum Computing Means to Data Mining
Wittek, P. (2014) · Cited by 319
Solving strongly correlated electron models on a quantum computer
Wecker, D., Hastings, M. B., Wiebe, N., Clark, B. K., Nayak, C., & Troyer, M. (2015) · Physical Review A · doi:10.1103/physreva.92.062318 · Cited by 285
Scalable architecture for a room temperature solid-state quantum information processor
Yao, N. Y., Jiang, L., Gorshkov, A. V., Maurer, P. C., Giedke, G., Cirac, J. I., & Lukin, M. D. (2012) · Nature Communications · doi:10.1038/ncomms1788 · Cited by 245
Fast-forward of adiabatic dynamics in quantum mechanics
Masuda, S., & Nakamura, K. (2009) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2009.0446 · Cited by 233
Computational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V., Shabani, A., Isakov, S. V., Dykman, M. I., Denchev, V. S., Amin, M. H. S., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 232
Bounds for the adiabatic approximation with applications to quantum computationPreprint
Jansen, S., Ruskai, M. B., & Seiler, R. (2006) · Cited by 217
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
Adiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
Consistency of the Adiabatic Theorem
Amin, M. H. S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.102.220401 · Cited by 201
Quantum Factorization of 143 on a Dipolar-Coupling Nuclear Magnetic Resonance System
Xu, N., Zhu, J., Lu, D., Zhou, X., Peng, X., & Du, J. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.130501 · Cited by 187
Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation
Peng, X., Liao, Z., Xu, N., Qin, G., Zhou, X., Suter, D., & Du, J. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.220405 · Cited by 175
NISQ computing: where are we and where do we go?
Lau, J. W. Z., Lim, K. H., Shrotriya, H., & Kwek, L. C. (2022) · AAPPS bulletin · doi:10.1007/s43673-022-00058-z · Cited by 198
Adiabatic approximation with exponential accuracy for many-body systems and quantum computation
Lidar, D. A., Rezakhani, A. T., & Hamma, A. (2009) · Journal of Mathematical Physics · doi:10.1063/1.3236685 · Cited by 170
Towards Quantum Simulation with Circular Rydberg Atoms
Nguyen, T. L., Raimond, J. M., Sayrin, C., Cortiñas, R. G., Cantat-Moltrecht, T., Assémat, F., Dotsenko, I., Gleyzes, S., Haroche, S., Roux, G., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.011032 · Cited by 187
Quantum Adiabatic Brachistochrone
Rezakhani, A. T., Kuo, W.-J., Hamma, A., Lidar, D. A., & Zanardi, P. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.080502 · Cited by 163
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
Aharonov, D., van Dam, W., Kempe, J., Landau, Z. A., Lloyd, S., & Regev, O. (2004) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2004.8 · Cited by 171
Quantitative Conditions Do Not Guarantee the Validity of the Adiabatic Approximation
Tong, D. M., Singh, K., Kwek, L. C., & Oh, C. H. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.110407 · Cited by 153
Decoherence in adiabatic quantum computation
Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.062320 · Cited by 147
Acceleration of adiabatic quantum dynamics in electromagnetic fields
Masuda, S., & Nakamura, K. (2011) · Physical Review A · doi:10.1103/physreva.84.043434 · Cited by 143
Adiabatic quantum dynamics of a random Ising chain across its quantum critical point
Caneva, T., Fazio, R., & Santoro, G. E. (2007) · Physical Review B · doi:10.1103/physrevb.76.144427 · Cited by 142
Near-optimal quantum circuit for Grover's unstructured search using a transverse field
Zhang, J., Rieffel, E. G., & Wang, Z. (2017) · Physical Review A · doi:10.1103/physreva.95.062317 · Cited by 145
Hybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 166
Quantum adiabatic machine learning
Pudenz, K. L., & Lidar, D. A. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0506-4 · Cited by 141
Prospects for quantum enhancement with diabatic quantum annealing
Crosson, E., & Lidar, D. A. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00313-6 · Cited by 153
Quantum annealing with antiferromagnetic fluctuations
Seki, Y., & Nishimori, H. (2012) · Physical Review E · doi:10.1103/physreve.85.051112 · Cited by 134
Quantum machine learning in high energy physics
Guan, W., Perdue, G., Pesah, A. C., Schuld, M., Terashi, K., Vallecorsa, S., & Vlimant, J.-R. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/abc17d · Cited by 152
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.10.002 · Cited by 135
Jörg, T., Krząkała, F., Kurchan, J., Maggs, A. C., & Pujos, J. S. (2010) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/89/40004 · Cited by 122
Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.070505 · Cited by 119
Optimal Protocols in Quantum Annealing and QAOA Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2020) · arXiv · doi:10.48550/arxiv.2003.08952 · Cited by 117
First-order quantum phase transition in adiabatic quantum computation
Amin, M. H. S., & Choi, V. (2009) · Physical Review A · doi:10.1103/physreva.80.062326 · Cited by 115
Thermally Assisted Adiabatic Quantum Computation
Amin, M. H. S., Love, P. J., & Truncik, C. J. S. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.060503 · Cited by 120
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
Mandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 108
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 124
Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
Isakov, S. V., Mazzola, G., Smelyanskiy, V., Zhang, J., Boixo, S., Neven, H., & Troyer, M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.180402 · Cited by 102
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
Noise resistance of adiabatic quantum computation using random matrix theory
Roland, J., & Cerf, N. J. (2005) · Physical Review A · doi:10.1103/physreva.71.032330 · Cited by 102
Self-citationWittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00004-9 · Cited by 101
Adiabatic quantum computing for random satisfiability problems
Hogg, T. (2003) · Physical Review A · doi:10.1103/physreva.67.022314 · Cited by 93
An, D., & Lin, L. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3498331 · Cited by 111
General conditions for quantum adiabatic evolution
Comparat, D. (2009) · Physical Review A · doi:10.1103/physreva.80.012106 · Cited by 95
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 112
Review: Quantum metrology and sensing with many-body systems
Montenegro, V., Mukhopadhyay, C., Yousefjani, R., Sarkar, S., Mishra, U., Paris, M. G. A., & Bayat, A. (2025) · Physics Reports · doi:10.1016/j.physrep.2025.05.005 · Cited by 131
Martínez-Garaot, S., Ruschhaupt, A., Gillet, J., Busch, T., & Muga, J. G. (2015) · Physical Review A · doi:10.1103/physreva.92.043406 · Cited by 91
An introduction to quantum information processing: applications and realizations
Spiller, T. P., Munro, W. J., Barrett, S. D., & Kok, P. (2005) · Contemporary Physics · doi:10.1080/00107510500293261 · Cited by 87
Quantum-walk approach to searching on fractal structures
Agliari, E., Blumen, A., & Mülken, O. (2010) · Physical Review A · doi:10.1103/physreva.82.012305 · Cited by 89
Decoherence in adiabatic quantum computation
Amin, M. H. S., Averin, D. V., & Nesteroff, J. A. (2009) · Physical Review A · doi:10.1103/physreva.79.022107 · Cited by 88
Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · OakTrust (Texas A&M University Libraries) · Cited by 86
Tunneling and Speedup in Quantum Optimization for Permutation-Symmetric Problems
Muthukrishnan, S., Albash, T., & Lidar, D. A. (2016) · Physical Review X · doi:10.1103/physrevx.6.031010 · Cited by 82
Intrinsic geometry of quantum adiabatic evolution and quantum phase transitions
Rezakhani, A. T., Abasto, D. F., Lidar, D. A., & Zanardi, P. (2010) · Physical Review A · doi:10.1103/physreva.82.012321 · Cited by 84
A review on quantum search algorithms
Giri, P. R., & Korepin, V. E. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1768-7 · Cited by 84
Error Suppression and Error Correction in Adiabatic Quantum Computation: Techniques and Challenges
Young, K. C., Sarovar, M., & Blume-Kohout, R. (2013) · Physical Review X · doi:10.1103/physrevx.3.041013 · Cited by 87
Childs, A. M., Deotto, E., Farhi, E., Goldstone, J., Gutmann, S., & Landahl, A. J. (2002) · Physical Review A · doi:10.1103/physreva.66.032314 · Cited by 78
SU(2) lattice gauge theory on a quantum annealer
Rahman, S. A., Lewis, R., Mendicelli, E., & Powell, S. J. M. (2021) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.104.034501 · Cited by 80
The detectability lemma and quantum gap amplification
Aharonov, D., Arad, I., Landau, Z. A., & Vazirani, U. V. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536472 · Cited by 77
Adiabatic quantum algorithms as quantum phase transitions: First versus second order
Schützhold, R., & Schaller, G. (2006) · Physical Review A · doi:10.1103/physreva.74.060304 · Cited by 79
Quantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 92
Scaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 79
Speeding 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
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 77
Universality of entanglement and quantum-computation complexity
Orús, R., & Latorre, J. I. (2004) · Physical Review A · doi:10.1103/physreva.69.052308 · Cited by 83
Zhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 74
Ground-state statistics from annealing algorithms: quantum versus classical approaches
Matsuda, Y., Nishimori, H., & Katzgraber, H. G. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/073021 · Cited by 71
On quantum mean-field models and their quantum annealing
Bapst, V., & Semerjian, G. (2012) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2012/06/p06007 · Cited by 74
Experimental Study of the Validity of Quantitative Conditions in the Quantum Adiabatic Theorem
Du, J., Hu, L.-Z., Wang, Y., Wu, J., Zhao, M., & Suter, D. (2008) · Physical Review Letters · doi:10.1103/physrevlett.101.060403 · Cited by 73
Quantum Algorithm Design: Techniques and Applications
Shao, C., Yang, L., & Li, H. (2019) · Journal of Systems Science and Complexity · doi:10.1007/s11424-019-9008-0 · Cited by 74
Richerme, P., Senko, C., Smith, J., Lee, A., Korenblit, S. É., & Monroe, C. R. (2013) · Physical Review A · doi:10.1103/physreva.88.012334 · Cited by 66
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta‐Shma, A. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780543.780546 · Cited by 80
Theory versus practice in annealing-based quantum computing
McGeoch, C. C. (2020) · Theoretical Computer Science · doi:10.1016/j.tcs.2020.01.024 · Cited by 72
Improved error-scaling for adiabatic quantum evolutions
Wiebe, N., & Babcock, N. S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/1/013024 · Cited by 70
Accuracy versus run time in an adiabatic quantum search
Rezakhani, A. T., Pimachev, A., & Lidar, D. A. (2010) · Physical Review A · doi:10.1103/physreva.82.052305 · Cited by 74
Hybrid Quantum-Classical Computing for Future Network Optimization
Fan, L., & Han, Z. (2022) · IEEE Network · doi:10.1109/mnet.001.2200150 · Cited by 73
Adiabatic Quantum State Generation
Aharonov, D., & Ta‐Shma, A. (2007) · SIAM Journal on Computing · doi:10.1137/060648829 · Cited by 78
On quantum mean-field models and their quantum annealingPreprint
Bapst, V., & Semerjian, G. (2012) · HAL · Cited by 74
Counterdiabatic driving in the quantum annealing of the p -spin model: A variational approach
Passarelli, G., Cataudella, V., Rosario Fazio, B., & Lucignano, P. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013283 · Cited by 65
Time-dependent unbounded Hamiltonian simulation with vector norm scaling
An, D., Fang, D., & Lin, L. (2021) · Quantum · doi:10.22331/q-2021-05-26-459 · Cited by 64
Temperature Scaling Law for Quantum Annealing Optimizers
Albash, T., Martín-Mayor, V., & Hen, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.110502 · Cited by 73
Experimental critical quantum metrology with the Heisenberg scaling
Liu, R., Chen, Y., Jiang, M., Yang, X., Wu, Z., Li, Y., Yuan, H., Peng, X., & Du, J. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00507-x · Cited by 74
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
