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 201–300 of 633
De-Signing Hamiltonians for Quantum Adiabatic Optimization
Crosson, E., Albash, T., Hen, I., & Young, A. P. (2020) · Quantum · doi:10.22331/q-2020-09-24-334 · Cited by 22
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
Yan, B., & Sinitsyn, N. A. (2022) · Nature Communications · doi:10.1038/s41467-022-29887-0 · Cited by 23
Dou, F.-Q., Liu, J., & Fu, L. (2016) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/116/60014 · Cited by 23
Solving the Hamiltonian Cycle Problem using a Quantum Computer
Mahasinghe, A., Hua, R., Dinneen, M. J., & Goyal, R. (2019) · Australasian Computer Science Week Multiconference (ACSW) · doi:10.1145/3290688.3290703 · Cited by 24
Continuous-time quantum search and time-dependent two-level quantum systems
Cafaro, C., & Alsing, P. M. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500254 · Cited by 23
Effects of dissipation on an adiabatic quantum search algorithm
de Vega, I., Bañuls, M. C., & Pérez, A. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/12/123010 · Cited by 24
Robust quantum control for adiabatic quantum computation
Quiroz, G. (2019) · Physical Review A · doi:10.1103/physreva.99.062306 · Cited by 22
Optimized adiabatic passage with dephasing
Lacour, X., Guérin, S., & Jauslin, H. R. (2008) · Physical Review A · doi:10.1103/physreva.78.033417 · Cited by 22
Exponentially-enhanced quantum sensing with many-body phase transitions
Sarkar, S., Bayat, A., Bose, S., & Ghosh, R. (2025) · Nature Communications · doi:10.1038/s41467-025-60291-6 · Cited by 24
Optimal quantum control robust against pulse inhomogeneities: Analytic solutions
Laforgue, X., Dridi, G., & Guérin, S. (2022) · Physical Review A · doi:10.1103/physreva.106.052608 · Cited by 21
Optimal thermometers with spin networks
Abiuso, P., Erdman, P. A., Ronen, M., Noé, F., Haack, G., & Perarnau-Llobet, M. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ad37d3 · Cited by 21
Network medicine-based epistasis detection in complex diseases: ready for quantum computing
Hoffmann, M., Poschenrieder, J., Incudini, M., Baier, S., Fritz, A., Maier, A., Hartung, M., Hoffmann, C., Trummer, N., Adamowicz, K., et al. (2024) · Nucleic Acids Research · doi:10.1093/nar/gkae697 · Cited by 22
Nonadiabatic quantum state engineering driven by fast quench dynamics
Herrera, M., Sarandy, M. S., Duzzioni, E. I., & Serra, R. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022323 · Cited by 21
Speedup in adiabatic evolution based quantum algorithms
Sun, J., Lu, S., & Liu, F. (2012) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-012-4854-y · Cited by 21
Speeding up adiabatic passage with an optimal modified Roland–Cerf protocol
Stefanatos, D., & Paspalakis, E. (2020) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab7423 · Cited by 21
Solving Set Cover with Pairs Problem using Quantum Annealing
Cao, Y., Jiang, S., Perouli, D., & Kais, S. (2016) · Scientific Reports · doi:10.1038/srep33957 · Cited by 21
Adiabatic evolution under quantum control
Wang, W., Hou, S. C., & Yi, X. X. (2012) · Annals of Physics · doi:10.1016/j.aop.2012.01.001 · Cited by 21
Adiabatic quantum optimization for associative memory recall
Seddiqi, H., & Humble, T. S. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00079 · Cited by 21
On the power of coherently controlled quantum adiabatic evolutions
Kieferová, M., & Wiebe, N. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/12/123034 · Cited by 20
Quantum algorithms: A survey of some recent results
Rötteler, M. (2006) · Informatik - Forschung und Entwicklung · doi:10.1007/s00450-006-0008-7 · Cited by 20
Bacon, D., Flammia, S. T., & Crosswhite, G. M. (2013) · Physical Review X · doi:10.1103/physrevx.3.021015 · Cited by 20
A benchmarking study of quantum algorithms for combinatorial optimization
Sankar, K., Scherer, A., Kako, S., Reifenstein, S., Ghadermarzy, N., Krayenhoff, W. B., Inui, Y., Ng, E., Onodera, T., Ronagh, P., et al. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00856-3 · Cited by 22
Error reduction in quantum annealing using boundary cancellation: Only the end matters
Venuti, L. C., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.98.022315 · Cited by 19
Faster Annealing Schedules for Quantum Annealing
Morita, S. (2007) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.76.104001 · Cited by 19
Minimizing Delay in Network Function Visualization with Quantum Computing
Xuan, W., Zhao, Z., Fan, L., & Han, Z. (2021) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass52906.2021.00022 · Cited by 17
Error suppression in adiabatic quantum computing with qubit ensembles
Mohseni, N., Narożniak, M., Pyrkov, A. N., Ivannikov, V., Dowling, J. P., & Byrnes, T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00405-2 · Cited by 18
Problem Solving with Hopfield Networks and Adiabatic Quantum Computing
Bauckhage, C., Sánchez, R. J., & Sifa, R. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9206916 · Cited by 19
Accelerated adiabatic quantum search algorithm via pulse control in a non-Markovian environment
Ren, F.-H., Wang, Z.-M., & Wu, L.-A. (2020) · Physical Review A · doi:10.1103/physreva.102.062603 · Cited by 18
Lower Bounds on Quantum Annealing Times
García-Pintos, L. P., Brady, L. T., Bringewatt, J., & Liu, Y.-K. (2023) · Physical Review Letters · doi:10.1103/physrevlett.130.140601 · Cited by 17
Continuous-time quantum algorithms for unstructured problems
Hen, I. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/4/045305 · Cited by 17
Hybrid classical-quantum approach to solve the heat equation using quantum annealers
Pollachini, G. G., Salazar, J. P. L. C., Góes, C. B. D., Maciel, T. O., & Duzzioni, E. I. (2021) · Physical Review A · doi:10.1103/physreva.104.032426 · Cited by 18
Improved bounds for eigenpath traversal
Chiang, H.-T. L., Xu, G., & Somma, R. D. (2014) · Physical Review A · doi:10.1103/physreva.89.012314 · Cited by 18
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 17
Quantum search by partial adiabatic evolution
Zhang, Y., & Lu, S. (2010) · Physical Review A · doi:10.1103/physreva.82.034304 · Cited by 16
Practical designs for permutation-symmetric problem Hamiltonians on hypercubes
Dodds, A. B., Kendon, V. M., Adams, C. S., & Chancellor, N. (2019) · Physical Review A · doi:10.1103/physreva.100.032320 · Cited by 14
Shirakawa, T., Seki, K., & Yunoki, S. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013004 · Cited by 16
Macroscopic hyperpolarization enhanced with quantum optimal control
Marshall, A., Reisser, T., Rembold, P., Müller, C., Scheuer, J., Gierse, M., Eichhorn, T. R., Steiner, J. M., Hautle, P., Calarco, T., et al. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043179 · Cited by 16
Singularities of Berry connections inhibit the accuracy of the adiabatic approximation
Liu, J., & Fu, L. (2007) · Physics Letters A · doi:10.1016/j.physleta.2007.05.021 · Cited by 16
Dynamics of the quantum search and quench-induced first-order phase transitions
Coulamy, I., Saguia, A., & Sarandy, M. S. (2017) · Physical review. E · doi:10.1103/physreve.95.022127 · Cited by 16
Exploring adiabatic quantum trajectories via optimal controlPreprint
Brif, C., Grace, M., Sarovar, M., & Young, K. C. (2016) · Cited by 16
Optimal Hamiltonian simulation for time-periodic systems
Mizuta, K., & Fujii, K. (2023) · Quantum · doi:10.22331/q-2023-03-28-962 · Cited by 23
Quantum control by effective counterdiabatic driving
Petiziol, F., Mintert, F., & Wimberger, S. (2024) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/ad19e3 · Cited by 15
Theorem on the existence of a nonzero energy gap in adiabatic quantum computation
Zhang, D.-J., Yu, X., & Tong, D. M. (2014) · Physical Review A · doi:10.1103/physreva.90.042321 · Cited by 14
Diabatic quantum annealing for the frustrated ring model
Côté, J., Sauvage, F., Larocca, M., Jonsson, M., Cincio, Ł., & Albash, T. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acfbaa · Cited by 16
Schulz, S., Willsch, D., & Michielsen, K. F. L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013312 · Cited by 14
Fast coherent manipulation of quantum states in open systems
Song, J., Zhang, Z., Xia, Y., Sun, X., & Jiang, Y. (2016) · Optics Express · doi:10.1364/oe.24.021674 · Cited by 14
SchWARMA: A model-based approach for time-correlated noise in quantum circuits
Schultz, K., Quiroz, G., Titum, P., & Clader, B. D. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033229 · Cited by 14
Quantum sampling algorithms, phase transitions, and computational complexity
Wild, D. S., Sels, D., Pichler, H., Zanoci, C., & Lukin, M. D. (2021) · Physical Review A · doi:10.1103/physreva.104.032602 · Cited by 19
Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
Passarelli, G., Yip, K.-W., Lidar, D. A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.032431 · Cited by 14
Quantum Computing by Coherent Cooling
Feng, J.-J., Wu, B., & Wilczek, F. A. (2022) · Physical Review A · doi:10.1103/physreva.105.052601 · Cited by 16
Design of Quantum Computing Circuits
Thapliyal, H., & Muñoz‐Coreas, E. (2019) · IT Professional · doi:10.1109/mitp.2019.2943134 · Cited by 14
Customized Quantum Annealing Schedules
Khezri, M., Dai, X., Yang, R. L., Albash, T., Lupaşcu, A., & Lidar, D. A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.044005 · Cited by 21
Irreconcilable difference between quantum walks and adiabatic quantum computing
Wong, T. G., & Meyer, D. A. (2016) · Physical Review A · doi:10.1103/physreva.93.062313 · Cited by 13
A quantum search algorithm based on partial adiabatic evolution
Zhang, Y., Hu, H., & Lu, S. (2011) · Chinese Physics B · doi:10.1088/1674-1056/20/4/040309 · Cited by 13
Diagonal catalysts in quantum adiabatic optimization
Albash, T., & Kowalsky, M. (2021) · Physical Review A · doi:10.1103/physreva.103.022608 · Cited by 13
Counterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 15
Quantum annealing: next-generation computation and how to implement it when information is missing
Ohzeki, M., Takahashi, C., Okada, S., Terabe, M., Taguchi, S., & Tanaka, K. (2018) · Nonlinear Theory and Its Applications IEICE · doi:10.1587/nolta.9.392 · Cited by 14
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
Quintero, R. A., Bernal, D. E., Tamás Terlaky, B., & Zuluaga, L. F. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03421-z · Cited by 13
Mean field approximation for solving QUBO problems
Veszeli, M. T., & Vattay, G. (2022) · PLoS ONE · doi:10.1371/journal.pone.0273709 · Cited by 12
Deep recurrent networks predicting the gap evolution in adiabatic quantum computing
Mohseni, N., Navarrete–Benlloch, C., Byrnes, T., & Marquardt, F. (2023) · Quantum · doi:10.22331/q-2023-06-12-1039 · Cited by 15
Demonstrating Majorana non-Abelian properties using fast adiabatic charge transfer
Krøjer, S., Souto, R. S., & Karsten Flensberg, B. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.045425 · Cited by 13
Nonperturbative embedding for highly nonlocal Hamiltonians
Subaşı, Y., & Jarzynski, C. (2016) · Physical Review A · doi:10.1103/physreva.94.012342 · Cited by 13
Patch-planting spin-glass solution for benchmarking
Wang, W., Mandrà, S., & Katzgraber, H. G. (2017) · Physical review. E · doi:10.1103/physreve.96.023312 · Cited by 14
Symmetry‐Protected Quantum Adiabatic Evolution in Spontaneous Symmetry‐Breaking Transitions
Zhuang, M., Huang, J., Ke, Y., & Lee, C. (2020) · Annalen der Physik · doi:10.1002/andp.201900471 · Cited by 14
Nonadiabatic quantum search algorithms
Pérez, A., & Romanelli, A. (2007) · Physical Review A · doi:10.1103/physreva.76.052318 · Cited by 13
Partial evolution based local adiabatic quantum search
Sun, J., Lu, S., Liu, F., & Yang, L. (2012) · Chinese Physics B · doi:10.1088/1674-1056/21/1/010306 · Cited by 12
Quantum partial search for uneven distribution of multiple target items
Zhang, K., & Korepin, V. E. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1907-9 · Cited by 12
Deep learning optimal quantum annealing schedules for random Ising models
Hegde, P. R., Passarelli, G., Cantele, G., & Lucignano, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace547 · Cited by 15
A class of time-energy uncertainty relations for time-dependent Hamiltonians
Kieu, T. D. (2019) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2019.0148 · Cited by 16
Ultrafast critical ground state preparation via bang–bang protocols
Innocenti, L., Chiara, G. D., Paternostro, M., & Puebla, R. (2020) · New Journal of Physics · doi:10.1088/1367-2630/abb1df · Cited by 16
Reservoir-engineering shortcuts to adiabaticity
Menu, R., Langbehn, J., Koch, C. P., & Morigi, G. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033005 · Cited by 12
Dynamical Quantum Phase Transitions
Schützhold, R. (2008) · Journal of Low Temperature Physics · doi:10.1007/s10909-008-9831-5 · Cited by 12
Quantum search by parallel eigenvalue adiabatic passage
Daems, D., Guérin, S., & Cerf, N. J. (2008) · Physical Review A · doi:10.1103/physreva.78.042322 · Cited by 12
Self-citationPartial adiabatic quantum search algorithm and its extensions
Sun, J., Lu, S., & Liu, F. (2013) · Quantum Information Processing · doi:10.1007/s11128-013-0557-1 · Cited by 11
Elementary proof of QAOA convergence
Binkowski, L., Koßmann, G., Ziegler, T., & Schwonnek, R. (2024) · New Journal of Physics · doi:10.1088/1367-2630/ad59bb · Cited by 14
How fast can quantum annealers count?
Hen, I. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/23/235304 · Cited by 11
Hollenberg, L. C. L. (2012) · Nature Physics · doi:10.1038/nphys2222 · Cited by 11
NMR realization of adiabatic quantum algorithms for the modified Simon problem
Yu, L., Feng, G., Tang, Y., Qin, W., & Long, G. (2013) · Physical Review A · doi:10.1103/physreva.88.012306 · Cited by 11
Accelerated Quantum Adiabatic Transfer in Superconducting Qubits
Zheng, W., Xu, J., Wang, Z., Dong, Y., Lan, D., Tan, X., & Yu, Y. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.044014 · Cited by 12
Quantum pattern recognition with multi-neuron interactions
Fard, E. R., Aghayar, K., & Amniat-Talab, M. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1816-y · Cited by 11
Free-time and fixed end-point multi-target optimal control theory: Application to quantum computing
Mishima, K., & Yamashita, K. (2010) · Chemical Physics · doi:10.1016/j.chemphys.2010.10.003 · Cited by 11
LIMITATIONS OF SOME SIMPLE ADIABATIC QUANTUM ALGORITHMS
Ioannou, L. M., & Mosca, M. (2008) · International Journal of Quantum Information · doi:10.1142/s0219749908003724 · Cited by 11
Maximum Speed of Quantum Evolution
Andrecut, M., & Ali, M. K. (2004) · International Journal of Theoretical Physics · doi:10.1023/b:ijtp.0000048594.07696.e5 · Cited by 10
Ultra-cold atoms as quantum simulators for relativistic phenomena
Schützhold, R. (2025) · Progress in Particle and Nuclear Physics · doi:10.1016/j.ppnp.2025.104198 · Cited by 15
Probing critical phenomena in open quantum systems using atom arrays
Fang, F., Wang, K., Liu, V. S., Wang, Y., Cimmino, R., Wei, J., Bintz, M., Parr, A., Kemp, J., Ni, K.-K., et al. (2025) · Science · doi:10.1126/science.adq0278 · Cited by 30
Many-Qudit Representation for the Travelling Salesman Problem Optimisation
Vargas-Calderón, V., Parra-A., N., Vinck-Posada, H., & González, F. A. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.114002 · Cited by 10
Problem-size-independent angles for a Grover-driven quantum approximate optimization algorithm
Headley, D., & Wilhelm, F. K. (2023) · Physical Review A · doi:10.1103/physreva.107.012412 · Cited by 13
Quantum approximate optimization algorithm applied to the binary perceptron
Torta, P., Mbeng, G. B., Baldassi, C., Zecchina, R., & Santoro, G. E. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.094202 · Cited by 10
Grover-algorithm-like operator using only single-qubit gates
Kato, G. (2005) · Physical Review A · doi:10.1103/physreva.72.032319 · Cited by 10
Quantum search using non-Hermitian adiabatic evolution
Nesterov, A. I., & Berman, G. P. (2012) · Physical Review A · doi:10.1103/physreva.86.052316 · Cited by 10
Adiabatic rotation, quantum search, and preparation of superposition states
Siu, M. S. (2007) · Physical Review A · doi:10.1103/physreva.75.062337 · Cited by 10
Optimizing the quantum adiabatic algorithm
Hu, H.-Y., & Wu, B. (2016) · Physical Review A · doi:10.1103/physreva.93.012345 · Cited by 10
Optimizing adiabatic quantum pathways via a learning algorithm
Yang, X., Liu, R., Li, J., & Peng, X. (2020) · Physical Review A · doi:10.1103/physreva.102.012614 · Cited by 10
NMR implementation of adiabatic SAT algorithm using strongly modulated pulses
Mitra, A., Mahesh, T. S., & Kumar, A. (2008) · The Journal of Chemical Physics · doi:10.1063/1.2835542 · Cited by 10
Non-Hermitian quantum annealing in the ferromagnetic Ising model
Nesterov, A. I., Zepeda, J. C. B., & Berman, G. P. (2013) · Physical Review A · doi:10.1103/physreva.87.042332 · Cited by 10
Fourier-transforming with quantum annealers
Hen, I. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00044 · Cited by 9
Sensitivity of quantum speedup by quantum annealing to a noisy oracle
Muthukrishnan, S., Albash, T., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.032324 · Cited by 8
How to Compute Using Quantum Walks
Kendon, V. M. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.315.1 · Cited by 11
Adiabatic quantum computing with phase modulated laser pulses
Goswami, D. (2005) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/38/38/l02 · Cited by 10
Simulations of the adiabatic quantum optimization for the Set Partition ProblemPreprint
Smelyanskiy, V., von Toussaint, U., & Timuçin, D. A. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0112143 · Cited by 10
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
