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
Items 301–400 of 633
Quantum battery supercharging via counter-diabatic dynamics
de Moraes, L. F. C., Duriez, A., Saguia, A., Santos, A. C., & Sarandy, M. S. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad71ed · Cited by 9
Nonadiabatic quantum optimization for crossing quantum phase transitions
Grabarits, A., Balducci, F., Sanders, B. C., & del Campo, A. (2025) · Physical Review A · doi:10.1103/physreva.111.012215 · Cited by 9
Shi, Z., Zhang, C., Shen, L.-T., Xia, Y., Yi, X. X., & Zheng, S.-B. (2020) · Physical Review A · doi:10.1103/physreva.101.042314 · Cited by 9
Learning adiabatic quantum algorithms over optimization problems
Pastorello, D., Blanzieri, E., & Cavecchia, V. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00030-w · Cited by 12
Bond, L. J., Safavi-Naini, A., & Minář, J. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.170401 · Cited by 10
Adiabatic quantum trajectories in engineered reservoirs
King, E. C., Giannelli, L., Menu, R., Kriel, J. N., & Morigi, G. (2024) · Quantum · doi:10.22331/q-2024-07-30-1428 · Cited by 10
Digital–analog quantum learning on Rydberg atom arrays
Lu, J. Z., Jiao, L., Wolinski, K., Kornjača, M., Hu, H.-Y., Cantu, S., Liu, F., Yelin, S. F., & Wang, S.-T. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad9177 · Cited by 21
ON THE ADIABATIC EVOLUTION OF ONE-DIMENSIONAL PROJECTOR HAMILTONIANS
Sun, J., & Lu, S. (2012) · International Journal of Quantum Information · doi:10.1142/s0219749912500463 · Cited by 9
Measuring adiabaticity in nonequilibrium quantum systems
Skelt, A., Godby, R. W., & D’Amico, I. (2018) · Physical Review A · doi:10.1103/physreva.98.012104 · Cited by 9
Enhancing quantum annealing performance by a degenerate two-level system
Watabe, S., Seki, Y., & Kawabata, S. (2020) · Scientific Reports · doi:10.1038/s41598-019-56758-4 · Cited by 9
Quantum lower and upper speed limits using reference evolutions
Takahashi, K. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac7607 · Cited by 9
ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
Jiayan, W., & Qiu, D. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908004249 · Cited by 9
Trapped-ion Fock-state preparation by potential deformation
Simón, M. A. O., Palmero, M., Martínez-Garaot, S., & Muga, J. G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023372 · Cited by 8
How to computer using quantum walks
Kendon, V. M. (2020) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 9
Robust quantum searching with spontaneously decaying qubits
Spreeuw, R. J. C., & Hijmans, T. W. (2007) · Physical Review A · doi:10.1103/physreva.76.022306 · Cited by 10
Adiabatic quantum computation along quasienergies
Tanaka, A., & Nemoto, K. (2010) · Physical Review A · doi:10.1103/physreva.81.022320 · Cited by 9
Unconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Optimality of partial adiabatic search and its circuit model
Mei, Y., Sun, J., Lu, S., & Gao, C. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0770-6 · Cited by 8
Beyond quantum annealing: optimal control solutions to maxcut problems
Pecci, G., Wang, R., Torta, P., Mbeng, G. B., & Santoro, G. E. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad60f2 · Cited by 11
Scheduling of Satellite Constellation Operations in EO Missions Using Quantum Optimization
Marchioli, V., Boggio, M., Volpe, D., Massotti, L., & Novara, C. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-77432-4_16 · Cited by 8
Counterdiabatic Driving with Performance Guarantees
Finžgar, J. R., Notarnicola, S., Cain, M., Lukin, M. D., & Sels, D. (2025) · Physical Review Letters · doi:10.1103/pqhl-nbtk · Cited by 10
Large Deviation Full Counting Statistics in Adiabatic Open Quantum Dynamics
Paulino, P. J., Lesanovsky, I., & Carollo, F. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.260402 · Cited by 10
Solving a hidden subgroup problem using the adiabatic quantum-computing paradigm
Rao, M. V. P. (2003) · Physical Review A · doi:10.1103/physreva.67.052306 · Cited by 8
Realizable quantum adiabatic search
Hen, I. (2017) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/118/30003 · Cited by 8
Quantum Groverian geodesic paths with gravitational and thermal analogies
Cafaro, C., Felice, D., & Alsing, P. M. (2020) · The European Physical Journal Plus · doi:10.1140/epjp/s13360-020-00914-7 · Cited by 8
Universality of the fully connected vertex in Laplacian continuous-time quantum walk problems
Razzoli, L., Bordone, P., & Paris, M. G. A. (2022) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ac72d5 · Cited by 9
Perfect stimulated Raman adiabatic passage with imperfect finite-time pulses
Dogra, S., & Paraoanu, G. S. (2022) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ac7fcc · Cited by 8
Robust quantum control by smooth quasi-square pulses
Zhu, J. J., Laforgue, X., Chen, X., & Guérin, S. (2022) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ac8adf · Cited by 8
Analog Grover search by adiabatic passage in a cavity-laser-atom system
Daems, D., & Guérin, S. (2008) · Physical Review A · doi:10.1103/physreva.78.022330 · Cited by 8
Adiabatic quantum gates and Boolean functions
Andrecut, M., & Ali, M. (2004) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/37/25/l01 · Cited by 8
Decoherence in a dynamical quantum phase transition
Mostame, S., Schaller, G., & Schützhold, R. (2010) · Physical Review A · doi:10.1103/physreva.81.032305 · Cited by 8
On Models of Nonlinear Evolution Paths in Adiabatic Quantum Algorithms
Sun, J., Lu, S., & Braunstein, S. L. (2013) · Communications in Theoretical Physics · doi:10.1088/0253-6102/59/1/05 · Cited by 9
How quantum is the speedup in adiabatic unstructured search?
Hen, I. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2281-y · Cited by 7
Realizing an adiabatic quantum search algorithm with shortcuts to adiabaticity in an ion-trap system
Zhang, J., Li, F., Xie, Y., Wu, C.-W., Ou, B.-Q., Wu, W., & Chen, P. (2018) · Physical Review A · doi:10.1103/physreva.98.052323 · Cited by 8
Robust preparation of many-body ground states in Jaynes–Cummings lattices
Cai, K., Parajuli, P., Long, G., Wong, C. W., & Tian, L. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00433-y · Cited by 8
Quantum adiabatic optimization without heuristicsPreprint
Jarret, M., Lackey, B., Liu, A., & Wan, K. (2018) · arXiv.org · doi:10.48550/arxiv.1810.04686 · Cited by 15
Fast digital methods for adiabatic state preparationPreprint
Wan, K., & Kim, I. H. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.04164 · Cited by 15
Quantum search in many-body interacting systems with long-range interactions
Xing, F., Wei, Y., & Liao, Z. (2024) · Physical Review A · doi:10.1103/physreva.109.052435 · Cited by 7
On validity of quantum partial adiabatic search
Sun, J., Cai, D., Lu, S., Qian, L., & Zhang, R. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-024-00258-6 · Cited by 7
Why quantum adiabatic computation and D-Wave computers are so attractive?
Yin, Z., & Wei, Z. (2017) · 中国科学通报：英文版 · doi:10.1016/j.scib.2017.05.001 · Cited by 8
Grover Speedup from Many Forms of the Zeno Effect
Berwald, J., Chancellor, N., & Dridi, R. (2024) · Quantum · doi:10.22331/q-2024-11-20-1532 · Cited by 11
Probing nonlinear adiabatic paths with a universal integrator
Hofmann, M., & Schaller, G. (2014) · Physical Review A · doi:10.1103/physreva.89.032308 · Cited by 8
Artificial intelligence and a universal quantum computer
Wichert, A. (2016) · AI Communications · doi:10.3233/aic-160699 · Cited by 7
On the time-independent Hamiltonian in real-time and imaginary-time quantum annealing*
Sun, J., & Lu, S. (2020) · Chinese Physics B · doi:10.1088/1674-1056/aba2db · Cited by 7
Noise-tolerant quantum speedups in quantum annealing without fine tuning
Kapit, E., & Oganesyan, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abd59a · Cited by 8
The quantum annealing gap and quench dynamics in the exact cover problem
Irsigler, B., & Graß, T. (2022) · Quantum · doi:10.22331/q-2022-01-18-624 · Cited by 7
Comparing the hardness of MAX 2-SAT problem instances for quantum and classical algorithms
Mirkarimi, P., Callison, A., Light, L., Chancellor, N., & Kendon, V. M. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.023151 · Cited by 9
Scaling of errors in digitized counterdiabatic driving
Hatomura, T. (2023) · New Journal of Physics · doi:10.1088/1367-2630/acfd51 · Cited by 8
Bounding first-order quantum phase transitions in adiabatic quantum computing
Werner, M., García-Sáez, A., & Estarellas, M. P. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043236 · Cited by 7
Exciton-mediated quantum search on a star graph
Pouthier, V. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1043-8 · Cited by 7
Relationship between minimum gap and success probability in adiabatic quantum computing
Cullimore, M., Everitt, M. J., Ormerod, M. A., Samson, J. H., Wilson, R. D., & Zagoskin, A. M. (2012) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/45/50/505305 · Cited by 7
Effect of Phase Errors on a Quantum Control Protocol Using Fast Oscillations
Petiziol, F., & Wimberger, S. (2019) · Condensed Matter · doi:10.3390/condmat4010034 · Cited by 7
Resonant Quantum Search with Monitor Qubits*
Wilczek, F. A., Hu, H.-Y., & Wu, B. (2020) · Chinese Physics Letters · doi:10.1088/0256-307x/37/5/050304 · Cited by 7
Quantum algorithm for a set of quantum 2SAT problems*
Hu, Y., Zhang, Z., & Wu, B. (2020) · Chinese Physics B · doi:10.1088/1674-1056/abd741 · Cited by 7
Adiabatic quantum algorithm for factorization with growing minimum energy gap
Yan, B., Jiang, H., Gao, M. Y., Duan, Q.-H., Wang, H., & Ma, Z. (2021) · Quantum Engineering · doi:10.1002/que2.59 · Cited by 8
On the optimal schedule of adiabatic quantum computing
Isermann, S. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03227-5 · Cited by 7
Mosca, M. (2011) · Springer eBooks · doi:10.1007/978-1-4614-1800-9_144 · Cited by 7
LANDAU-ZENER TRANSITIONS IN THE PRESENCE OF SPIN ENVIRONMENT
Wan, A. T. S., Amin, M. H. S., & Wang, S. X. (2009) · International Journal of Quantum Information · doi:10.1142/s0219749909005353 · Cited by 7
Implementation of a many-qubit Grover search with trapped ultracold ions
Yang, W.-L., Wei, H., Chen, C., & Feng, M. (2008) · Journal of the Optical Society of America B · doi:10.1364/josab.25.001720 · Cited by 8
Faster annealing schedules for quantum annealing
Morita, S. (2007) · CERN Document Server (European Organization for Nuclear Research) · Cited by 7
Different Approaches for Implementing Quantum Search by Adiabatic Evolution
Sun, J., Lu, S., & Zhang, Y. (2012) · AASRI Procedia · doi:10.1016/j.aasri.2012.06.011 · Cited by 6
Comment on “Adiabatic quantum computation with a one-dimensional projector Hamiltonian”
Kay, A. (2013) · Physical Review A · doi:10.1103/physreva.88.046301 · Cited by 6
Entropy computing, a paradigm for optimization in open photonic systems
Nguyen, L., Miri, M., Rupert, R. J., Dyk, W., Wu, S. B., Vrahoretis, N., Huang, I., Begliarbekov, M., Chancellor, N., Chukwu, U., et al. (2025) · Communications Physics · doi:10.1038/s42005-025-02324-6 · Cited by 17
Optimal ultrarobust quantum gates by inverse optimization
Dridi, G., Laforgue, X., Mejatty, M., & Guérin, S. (2024) · Physical Review A · doi:10.1103/physreva.109.062613 · Cited by 6
Hard-instance learning for quantum adiabatic prime factorization
Lin, J. H., Zhang, Z., Zhang, J., & Li, X. (2022) · Physical Review A · doi:10.1103/physreva.105.062455 · Cited by 6
On the efficiency of Hamiltonian-based quantum computation for low-rank matrices
Cao, Z., & Elgart, A. (2012) · Journal of Mathematical Physics · doi:10.1063/1.3690045 · Cited by 6
A Necessary Condition for Quantum Adiabaticity Applied to the Adiabatic Grover Search
Lychkovskiy, O. (2018) · Journal of Russian Laser Research · doi:10.1007/s10946-018-9751-z · Cited by 6
de Lacy, K., Noakes, L., Twamley, J., & Wang, J. B. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2031-6 · Cited by 7
Francis, A., Zelleke, E., Zhang, Z., Kemper, A. F., & Freericks, J. K. (2022) · Symmetry · doi:10.3390/sym14040809 · Cited by 6
Robust Diabatic Grover Search by Landau–Zener–Stückelberg Oscillations
Atia, Y., Oren, Y., & Katz, N. (2019) · Entropy · doi:10.3390/e21100937 · Cited by 6
Solving satisfiability problems by the ground-state quantum computer
Mao, W. (2005) · Physical Review A · doi:10.1103/physreva.72.052316 · Cited by 6
Adiabatic Quantum Computation is Equivalent to Standard Quantum ComputationPreprint
Aharonov, D., van Dam, W., Kempe, J., Landau, Z. A., Lloyd, S., & Regev, O. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0405098 · Cited by 36
Resonant Quantum Search with Monitor QubitsPreprint
Wilczek, F. A., Wilczek, F., Wu, B., Wu, B., Wu, B., & Wu, B. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 7
On the efficiency of Hamiltonian–based quantum computation for low–rank matricesPreprint
Cao, Z., & Elgart, A. (2012) · Cited by 6
Speeding up Quantum Annealing with Engineered Dephasing
Sveistrys, M., Langbehn, J., Menu, R., Campbell, S., Morigi, G., & Koch, C. P. (2025) · Quantum · doi:10.22331/q-2025-05-05-1731 · Cited by 5
Quantum Thermodynamic Advantage in Work Extraction from Steerable Quantum Correlations
Biswas, T., Datta, C., & García-Pintos, L. P. (2025) · Physical Review Letters · doi:10.1103/9qcc-7lq5 · Cited by 6
Virtual mitigation of coherent non-adiabatic transitions by echo verification
Schiffer, B. F., van Vreumingen, D., Tura, J., & Polla, S. (2024) · Quantum · doi:10.22331/q-2024-05-14-1346 · Cited by 6
Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems
Gabbassov, E., Rosenberg, G., & Scherer, A. (2025) · Physical Review Research · doi:10.1103/53gd-2374 · Cited by 6
Polynomial time algorithms for estimating spectra of adiabatic Hamiltonians
Bringewatt, J., Dorland, W., & Jordan, S. P. (2019) · Physical Review A · doi:10.1103/physreva.100.032336 · Cited by 4
Self-protected adiabatic quantum computation
Pyshkin, P. V., Luo, D.-W., & Wu, L.-A. (2022) · Physical Review A · doi:10.1103/physreva.106.012420 · Cited by 5
Fehse, F., David, M., Pioro-Ladrière, M., & Coish, W. A. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.245303 · Cited by 6
Why adiabatic quantum annealing is unlikely to yield speed-up
Villanueva, A., Najafi, P., & Kappen, H. J. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad0439 · Cited by 5
How to experimentally evaluate the adiabatic condition for quantum annealing
Mori, Y., Kawabata, S., & Matsuzaki, Y. (2024) · Scientific Reports · doi:10.1038/s41598-024-58286-2 · Cited by 5
Malossi, N., Bason, M. G., Viteau, M., Arimondo, E., Ciampini, D., Mannella, R., & Morsch, O. (2013) · Journal of Physics Conference Series · doi:10.1088/1742-6596/442/1/012062 · Cited by 5
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
Probing coherence aspects of adiabatic quantum computation and control
Goswami, D. (2007) · The Journal of Chemical Physics · doi:10.1063/1.2768954 · Cited by 5
On the Circuit Model of Global Adiabatic Search Algorithm
Sun, J., Lu, S., Liu, F., Zhang, Z., & Zhou, Q. (2015) · International Journal of Theoretical Physics · doi:10.1007/s10773-015-2600-8 · Cited by 5
Okada, S., Ohzeki, M., & Tanaka, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.024803 · Cited by 5
Investigating the potential for a limited quantum speedup on protein lattice problems
Outeiral, C., Morris, G. M., Shi, J., Strahm, M., Benjamin, S. C., & Deane, C. M. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac29ff · Cited by 8
Minimal action control method in quantum critical models
Kazhybekova, A., Campbell, S., & Kiely, A. (2022) · Journal of Physics Communications · doi:10.1088/2399-6528/aca3fa · Cited by 5
Dynamical approach to shortcuts to adiabaticity for general two-level non-Hermitian systems
Luan, T. Z., Sun, J.-Z., & Shen, H. Z. (2023) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/acd57a · Cited by 5
Chang, B. R., & Tsai, H. F. (2008) · Expert Systems with Applications · doi:10.1016/j.eswa.2008.02.011 · Cited by 5
Combarro, E. F., Ranilla, J., & Rúa, I. F. (2019) · Computational and Mathematical Methods · doi:10.1002/cmm4.1009 · Cited by 5
Gassner, S., Cafaro, C., Ali, S. A., & Alsing, P. M. (2021) · International Journal of Geometric Methods in Modern Physics · doi:10.1142/s0219887821501279 · Cited by 5
Speed of Markovian relaxation toward the ground state
Vogl, M., Schaller, G., & Brandes, T. (2010) · Physical Review A · doi:10.1103/physreva.81.012102 · Cited by 5
Andrecut, M., & Ali, M. (2004) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/37/34/l01 · Cited by 5
A relation between fidelity and quantum adiabatic evolution
Wei, Z., & Ying, M. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.03.064 · Cited by 5
Adiabatic quantum counting by geometric phase estimation
Zhang, C., Wei, Z., & Papageorgiou, A. (2009) · Quantum Information Processing · doi:10.1007/s11128-009-0132-y · Cited by 5
Performance of equal phase-shift search for one iteration
Li, D., Chen, J., Li, X. Y., Huang, H., & Li, X. (2007) · The European Physical Journal D · doi:10.1140/epjd/e2007-00247-9 · Cited by 5
Matrix Product Operator Simulations of Quantum Algorithms
Woolfe, K. J. (2015) · Minerva Access (University of Melbourne) · Cited by 6
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
