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 101–200 of 633
General error estimate for adiabatic quantum computing
Schaller, G., Mostame, S., & Schützhold, R. (2006) · Physical Review A · doi:10.1103/physreva.73.062307 · Cited by 64
Role of single-qubit decoherence time in adiabatic quantum computation
Amin, M. H. S., Truncik, C. J. S., & Averin, D. V. (2009) · Physical Review A · doi:10.1103/physreva.80.022303 · Cited by 67
Exponential complexity of an adiabatic algorithm for an NP-complete problem
Žnidarič, M., & Horvat, M. (2006) · Physical Review A · doi:10.1103/physreva.73.022329 · Cited by 61
Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz
Mele, A. A., Mbeng, G. B., Santoro, G. E., Collura, M., & Torta, P. (2022) · Physical Review A · doi:10.1103/physreva.106.l060401 · Cited by 59
Dissipation in adiabatic quantum computers: lessons from an exactly solvable model
Keck, M., Montangero, S., Santoro, G. E., Fazio, R., & Rossini, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cef · Cited by 58
Necessary condition for the quantum adiabatic approximation
Boixo, S., & Somma, R. D. (2010) · Physical Review A · doi:10.1103/physreva.81.032308 · Cited by 60
Fast adiabatic evolution by oscillating initial Hamiltonians
Petiziol, F., Dive, B., Mintert, F., & Wimberger, S. (2018) · Physical Review A · doi:10.1103/physreva.98.043436 · Cited by 58
Scalable Architecture for Adiabatic Quantum Computing of Np-Hard Problems
Kaminsky, W. M., & Lloyd, S. (2004) · Springer eBooks · doi:10.1007/978-1-4419-9092-1_25 · Cited by 58
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Variational learning of Grover's quantum search algorithm
Morales, M. E. S., Tlyachev, T., & Biamonte, J. (2018) · Physical Review A · doi:10.1103/physreva.98.062333 · Cited by 57
Adiabatic quantum computation and quantum phase transitions
Latorre, J. I., & Orús, R. (2004) · Physical Review A · doi:10.1103/physreva.69.062302 · Cited by 62
Reverse quantum annealing of the p -spin model with relaxation
Passarelli, G., Yip, K.-W., Lidar, D. A., Nishimori, H., & Lucignano, P. (2020) · Physical Review A · doi:10.1103/physreva.101.022331 · Cited by 55
A shortcut tour of quantum control methods for modern quantum technologies
Stefanatos, D., & Paspalakis, E. (2020) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/132/60001 · Cited by 53
Eigenpath traversal by phase randomization
Boixo, S., Knill, E., & Somma, R. D. (2009) · Quantum Information and Computation · doi:10.26421/qic9.9-10-7 · Cited by 74
3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers
Kowalsky, M., Albash, T., Hen, I., & Lidar, D. A. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac4d1b · Cited by 52
Adiabatic Spectroscopy and a Variational Quantum Adiabatic Algorithm
Schiffer, B. F., Brugués, J. T. I., & Cirac, J. (2021) · PRX Quantum · doi:10.1103/prxquantum.3.020347 · Cited by 50
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
Quantum pattern recognition with liquid-state nuclear magnetic resonance
Neigovzen, R., Neves, J. L., Sollacher, R., & Glaser, S. J. (2009) · Physical Review A · doi:10.1103/physreva.79.042321 · Cited by 49
Improving quantum annealing of the ferromagnetic p -spin model through pausing
Passarelli, G., Cataudella, V., & Lucignano, P. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024302 · Cited by 47
Possible implementation of adiabatic quantum algorithm with superconducting flux qubits
Grajcar, M., Izmalkov, A., & Il’ichev, E. V. (2005) · Physical Review B · doi:10.1103/physrevb.71.144501 · Cited by 46
Error suppression and error correction in adiabatic quantum computation: non-equilibrium dynamics
Sarovar, M., & Young, K. C. (2013) · New Journal of Physics · doi:10.1088/1367-2630/15/12/125032 · Cited by 46
Quantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise
Morley, J. G., Chancellor, N., Bose, S., & Kendon, V. M. (2019) · Physical Review A · doi:10.1103/physreva.99.022339 · Cited by 45
Robustness of the adiabatic quantum search
Åberg, J., Kult, D., & Sjöqvist, E. (2005) · Physical Review A · doi:10.1103/physreva.71.060312 · Cited by 46
Graph isomorphism and adiabatic quantum computing
Gaitan, F., & Clark, L. (2014) · Physical Review A · doi:10.1103/physreva.89.022342 · Cited by 51
Quantum Finance: Exploring the Implications of Quantum Computing on Financial Models
Zhou, J. (2025) · Computational Economics · doi:10.1007/s10614-025-10894-4 · Cited by 56
Quantum-circuit model of Hamiltonian search algorithms
Roland, J., & Cerf, N. J. (2003) · Physical Review A · doi:10.1103/physreva.68.062311 · Cited by 45
Self-citationMalossi, N., Bason, M. G., Viteau, M., Arimondo, E., Mannella, R., Morsch, O., & Ciampini, D. (2013) · Physical Review A · doi:10.1103/physreva.87.012116 · Cited by 45
Mosca, M. (2009) · Springer eBooks · doi:10.1007/978-0-387-30440-3_423 · Cited by 44
Why and When Pausing is Beneficial in Quantum Annealing
Chen, H., & Lidar, D. A. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014100 · Cited by 41
Non-Markovian decoherence in the adiabatic quantum search algorithm
Tiersch, M., & Schützhold, R. (2007) · Physical Review A · doi:10.1103/physreva.75.062313 · Cited by 41
Algorithmic approach to adiabatic quantum optimization
Dickson, N. G., & Amin, M. H. S. (2012) · Physical Review A · doi:10.1103/physreva.85.032303 · Cited by 39
Quantum adiabatic algorithm design using reinforcement learning
Lin, J., Lai, Z. Y., & Li, X. (2020) · Physical Review A · doi:10.1103/physreva.101.052327 · Cited by 39
Lyapunov-control-inspired strategies for quantum combinatorial optimization
Magann, A. B., Rudinger, K., Grace, M., & Sarovar, M. (2022) · Physical Review A · doi:10.1103/physreva.106.062414 · Cited by 37
Optimizing quantum annealing schedules with Monte Carlo tree search enhanced with neural networks
Chen, Y., Chen, Y., Lee, C., Zhang, S., & Hsieh, C. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00446-y · Cited by 48
Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability
Žnidarič, M. (2005) · Physical Review A · doi:10.1103/physreva.71.062305 · Cited by 38
Quantum gates with controlled adiabatic evolutions
Hen, I. (2015) · Physical Review A · doi:10.1103/physreva.91.022309 · Cited by 37
Energetic Perspective on Rapid Quenches in Quantum Annealing
Callison, A., Festenstein, M. Z., Chen, J., Nita, L., Kendon, V. M., & Chancellor, N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010338 · Cited by 41
Constant-adiabaticity radiofrequency pulses for generating long-lived singlet spin states in NMR
Rodin, B. A., Федорович, Ш. К., Kiryutin, A. S., Hill-Cousins, J. T., Brown, L. J., Brown, R. C. D., Jamain, B., Zimmermann, H. W., Зиннурович, С. Р., Yurkovskaya, A. V., et al. (2019) · The Journal of Chemical Physics · doi:10.1063/1.5079436 · Cited by 36
Genetic optimization of quantum annealing
Hegde, P. R., Passarelli, G., Scocco, A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.012612 · Cited by 36
Improved error bounds for the adiabatic approximation
Cheung, D., Høyer, P., & Wiebe, N. (2011) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/44/41/415302 · Cited by 36
Decoherence in a dynamical quantum phase transition of the transverse Ising chain
Mostame, S., Schaller, G., & Schützhold, R. (2007) · Physical Review A · doi:10.1103/physreva.76.030304 · Cited by 36
Effect of Local Minima on Adiabatic Quantum Optimization
Amin, M. H. S. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.130503 · Cited by 38
A modified quantum adiabatic evolution for the Deutsch–Jozsa problem
Wei, Z., & Ying, M. (2006) · Physics Letters A · doi:10.1016/j.physleta.2006.01.098 · Cited by 36
Quantum adiabatic search with decoherence in the instantaneous energy eigenbasis
Åberg, J., Kult, D., & Sjöqvist, E. (2005) · Physical Review A · doi:10.1103/physreva.72.042317 · Cited by 35
Exploring adiabatic quantum trajectories via optimal control
Brif, C., Grace, M. D., Sarovar, M., & Young, K. C. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/6/065013 · Cited by 35
Testing quantum adiabaticity with quench echo
Quan, H. T., & Zurek, W. H. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/9/093025 · Cited by 36
Scaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 46
Physically-motivated dynamical algorithms for the graph isomorphism problem
Shiau, S.-Y., Joynt, R., & Coppersmith, S. N. (2005) · Quantum Information and Computation · doi:10.26421/qic5.6-7 · Cited by 34
Job, J., & Lidar, D. A. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabd9b · Cited by 34
Probing entanglement in adiabatic quantum optimization with trapped ions
Hauke, P., Bonnes, L., Heyl, M., & Lechner, W. (2015) · Frontiers in Physics · doi:10.3389/fphy.2015.00021 · Cited by 44
Energetic Cost of Superadiabatic Quantum Computation
Coulamy, I. B., Santos, A. C., Hen, I., & Sarandy, M. S. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00019 · Cited by 38
Duwell, A. (2021) · Cambridge University Press eBooks · doi:10.1017/9781009104975 · Cited by 35
Relaxation versus adiabatic quantum steady-state preparation
Venuti, L. C., Albash, T., Marvian, M., Lidar, D. A., & Zanardi, P. (2017) · Physical Review A · doi:10.1103/physreva.95.042302 · Cited by 33
Exploring Potential Applications of Quantum Computing in Transportation Modelling
Cooper, C. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3132161 · Cited by 36
Spin qubits for quantum simulations
Peng, X., & Suter, D. (2009) · 物理学前沿：英文版 · doi:10.1007/s11467-009-0067-x · Cited by 33
Eigenstate tracking in open quantum systems
Jing, J., Sarandy, M. S., Lidar, D. A., Luo, D.-W., & Wu, L.-A. (2016) · Physical Review A · doi:10.1103/physreva.94.042131 · Cited by 30
Geometric algebra and information geometry for quantum computational software
Cafaro, C. (2016) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2016.11.117 · Cited by 32
Clocks in Feynman's computer and Kitaev's local Hamiltonian: Bias, gaps, idling, and pulse tuning
Caha, L., Landau, Z. A., & Nagaj, D. (2018) · Physical Review A · doi:10.1103/physreva.97.062306 · Cited by 34
Quantum adiabatic computation and adiabatic conditions
Wei, Z., & Ying, M. (2007) · Physical Review A · doi:10.1103/physreva.76.024304 · Cited by 31
High-fidelity adiabatic quantum computation via dynamical decoupling
Quiroz, G., & Lidar, D. A. (2012) · Physical Review A · doi:10.1103/physreva.86.042333 · Cited by 33
Accelerating adiabatic protocols for entangling two qubits in circuit QED
Petiziol, F., Dive, B., Carretta, S., Mannella, R., Mintert, F., & Wimberger, S. (2019) · Physical Review A · doi:10.1103/physreva.99.042315 · Cited by 31
Analog nature of quantum adiabatic unstructured search
Slutskii, M., Albash, T., Barash, L., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab51f9 · Cited by 30
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/7/073003 · Cited by 32
Hamiltonian Engineering for Adiabatic Quantum Computation: Lessons from Shortcuts to Adiabaticity
Takahashi, K. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061002 · Cited by 29
Optimal quantum annealing: A variational shortcut-to-adiabaticity approach
Passarelli, G., Fazio, R., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.022618 · Cited by 29
Adiabatic quantum search algorithm for structured problems
Roland, J., & Cerf, N. J. (2003) · Physical Review A · doi:10.1103/physreva.68.062312 · Cited by 29
Self-citationMitra, A., Ghosh, A., Das, R., Patel, A. D., & Kumar, A. (2005) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2005.08.004 · Cited by 28
Hatomura, T. (2024) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/ad38f1 · Cited by 31
Quantum computers: Definition and implementations
Pérez-Delgado, C. A., & Kok, P. (2011) · Physical Review A · doi:10.1103/physreva.83.012303 · Cited by 32
Quantum Control of Hole Spin Qubits in Double Quantum Dots
Fernández-Fernández, D., Ban, Y., & Platero, G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054090 · Cited by 28
Controlled-Controlled-Phase Gates for Superconducting Qubits Mediated by a Shared Tunable Coupler
Glaser, N. J., Roy, F., & Filipp, S. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.044001 · Cited by 31
The role of symmetries in adiabatic quantum algorithms
Schaller, G., & Schützhold, R. (2010) · Quantum Information and Computation · doi:10.26421/qic10.1-2-9 · Cited by 44
Long-Range Quantum Gates using Dipolar Crystals
Weimer, H., Yao, N. Y., Laumann, C. R., & Lukin, M. D. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.100501 · Cited by 28
Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 29
Adiabatic preparation without quantum phase transitions
Schaller, G. (2008) · Physical Review A · doi:10.1103/physreva.78.032328 · Cited by 28
Optimal suppression of defect generation during a passage across a quantum critical point
Wu, N., Nanduri, A., & Rabitz, H. (2015) · Physical Review B · doi:10.1103/physrevb.91.041115 · Cited by 26
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
Adiabatic quantum computation with a one-dimensional projector Hamiltonian
Tulsi, A. (2009) · Physical Review A · doi:10.1103/physreva.80.052328 · Cited by 27
Rodin, B. A., Eills, J., Picazo‐Frutos, R., Федорович, Ш. К., Budker, D., & Ivanov, K. L. (2021) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp06581a · Cited by 27
Adiabatic condition and the quantum hitting time of Markov chains
Krovi, H., Ozols, M., & Roland, J. (2010) · Physical Review A · doi:10.1103/physreva.82.022333 · Cited by 27
Self-citationAn integrated programming and development environment for adiabatic quantum optimization
Humble, T. S., McCaskey, A., Bennink, R. S., Billings, J. J., D'Azevedo, E. F., Sullivan, B. D., Klymko, C., & Seddiqi, H. (2014) · Computational Science & Discovery · doi:10.1088/1749-4680/7/1/015006 · Cited by 27
Resonant shortcuts for adiabatic rapid passage with only z -field control
Stefanatos, D., & Paspalakis, E. (2019) · Physical Review A · doi:10.1103/physreva.100.012111 · Cited by 27
Quantum AlgorithmsPreprint
Mosca, M. (2008) · arXiv (Cornell University) · Cited by 32
Quantum annealing speedup over simulated annealing on random Ising chains
Zanca, T., & Santoro, G. E. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.224431 · Cited by 26
Adiabatic Quantum Search in Open Systems
Wild, D. S., Gopalakrishnan, S., Knap, M., Yao, N. Y., & Lukin, M. D. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.150501 · Cited by 28
Fixed-point adiabatic quantum search
Dalzell, A. M., Yoder, T. J., & Chuang, I. L. (2017) · Physical Review A · doi:10.1103/physreva.95.012311 · Cited by 25
Bang-bang control as a design principle for classical and quantum optimization algorithms
Bapat, A., & Jordan, S. P. (2019) · Quantum Information and Computation · doi:10.26421/qic19.5-6-4 · Cited by 28
Period finding with adiabatic quantum computation
Hen, I. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/105/50005 · Cited by 29
Adiabatic Quantum Search Scheme With Atoms In a Cavity Driven by Lasers
Daems, D., & Guérin, S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.170503 · Cited by 26
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 30
Using optimal control methods with constraints to generate singlet states in NMR
Rodin, B. A., Kiryutin, A. S., Yurkovskaya, A. V., Ivanov, K. L., Yamamoto, S., Sato, K., & Takui, T. (2018) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2018.03.005 · Cited by 25
Optimal Control for Quantum Optimization of Closed and Open Systems
Venuti, L. C., D’Alessandro, D., & Lidar, D. A. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.054023 · Cited by 24
Robust arbitrary ratio power splitter by fast quasi-adiabatic elimination in optical waveguides
Sie, J. Y., Chung, H.-C., Chen, X., & Tseng, S. (2019) · Optics Express · doi:10.1364/oe.27.037622 · Cited by 25
High-fidelity fast quantum driving in nonlinear systems
Dou, F.-Q., Fu, L., & Liu, J. (2014) · Physical Review A · doi:10.1103/physreva.89.012123 · Cited by 25
Solvable Model of Quantum Random Optimization Problems
Foini, L., Semerjian, G., & Zamponi, F. (2010) · Physical Review Letters · doi:10.1103/physrevlett.105.167204 · Cited by 24
Application of Pontryagin's minimum principle to Grover's quantum search problem
Lin, C., Wang, Y., Kolesov, G., & Kalabic, U. V. (2019) · Physical Review A · doi:10.1103/physreva.100.022327 · Cited by 22
The travelling salesman problem and adiabatic quantum computation: an algorithm
Kieu, T. D. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2206-9 · Cited by 24
The adiabatic analogue of the Margolus–Levitin theorem
Andrecut, M., & Ali, M. K. (2004) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/37/15/l01 · Cited by 23
Quantum Computing in Intelligent Transportation Systems: A Survey
Zhuang, Y., Azfar, T., Wang, Y., Sun, W., Wang, X., Guo, Q., & Ke, R. (2024) · CHAIN · doi:10.23919/chain.2024.000007 · Cited by 34
Optimal time schedule for adiabatic evolution
Avron, J. E., Fraas, M., Graf, G. M., & Grech, P. (2010) · Physical Review A · doi:10.1103/physreva.82.040304 · Cited by 23
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
