The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
Abstract
The model of adiabatic quantum computation is a relatively recent model of quantum computation that has attracted attention in the physics and computer science communities. We describe an efficient adiabatic simulation of any given quantum circuit. This implies that the adiabatic computation model and the standard circuit-based quantum computation model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models allows one to state the main open problems in quantum computation using well-studied mathematical objects such as eigenvectors and spectral gaps of Hamiltonians.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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
“In principle, adiabatic quantum computing is equivalent to universal quantum computing [187].This universality holds only if the evolution is allowed to be nonstoquastic, meaning that the Hamiltonian has nonnegative off-diagonal elements at some point of the evolution.”
From The prospects of quantum computing in computational molecular biology (2021) · cites this paper as [187]
Citations
Cites
Fault-tolerant quantum computation by anyons
Kitaev, A. Y. (2003) · Annals of Physics · doi:10.1016/s0003-4916(02)00018-0 · Cited by 7,238 · cited 1×
“It is a crucial ingredient in topological (and later, geometrical) quantum computation [18,23,27].”
BackgroundQuantum 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 1×
“In [9,30] it was shown that Grover’s quadratic speed-up for an unsorted search [16] can be realized as an adiabatic computation.”
BackgroundQuantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339
A 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 · cited 1×
“[14, 15] suggested an ingenious paradigm for quantum algorithms calledadiabatic computation , which attracted considerable attention [14–21] since it w as shown to exhibit promising algorithmic capabilities [16–18], as well as inherent robustness against decoherence and control errors [20].”
BackgroundAn area law for one-dimensional quantum systems
Hastings, M. B. (2007) · Journal of Statistical Mechanics: Theory and Experiment · doi:10.1088/1742-5468/2007/08/p08024 · Cited by 1,131
On the Adiabatic Theorem of Quantum Mechanics
Kato, T. (1950) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.5.435 · Cited by 1,055 · cited 1×
“Experimental realizat ion of small-scale adiabatic computation was already demonstrated [31].”
MethodFeynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Geometric quantum computation using nuclear magnetic resonance
Jones, J. A., Vedral, V., Ekert, A., & Castagnoli, G. (2000) · Nature · doi:10.1038/35002528 · Cited by 812 · cited 1×
“It is a crucial ingredient in topological (and later, geometrical) quantum computation [ 18 ,23,27].”
BackgroundTheory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734 · cited 1×
“Moreover, [11,29,32] showed that adiabatic computation can ‘tunnel’ through wide energy barriers and thus outperform simulated annealing, a classical counterpart of the adiabatic model.”
BackgroundEfficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692
Research works printed but not linked: 25
- D. Aharonov, W. van Dam, J. Kempe, Z. Landau, S. Lloyd, and O. Regev, Adiabatic quantum computation is equivalent to standard quantum computation , in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, Rome, Italy, 2004, pp. 42–51. · DOI · Paper page
- D. Aharonov, D. Gottesman, S. Irani, and J. Kempe, The power of quantum systems on a line , in Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007, pp. 373–383. · DOI
- D. Aharonov, A. Kitaev, and N. Nisan, Quantum circuits with mixed states , in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 20–30. · DOI · Paper page
- D. Aharonov and T. Naveh, Quantum NP - a Survey , preprint, 2002; available online from http://arxiv.org/abs/quant-ph/0210077. · arXiv
- D. Aharonov and A. Ta-Shma, Adiabatic quantum state generation and statistical zero-knowledge , in Proceedings of the 35th Annual ACM Symposium on Theory of Computing, San Diego, CA, 2003, pp. 20–29. · DOI · Paper page
- A. Ambainis and O. Regev, An Elementary Proof of the Quantum Adiabatic Theorem , preprint, 2004; available online from http://arxiv.org/abs/quant-ph/0411152v2. · arXiv
- B. Apolloni, N. Cesa-Bianchi, and D. de Falco, A numerical implementation of quantum annealing , in Proceedings of the Ascona/Locarno Conference, 1988, pp. 97–111.
- R. Bhatia, Matrix Analysis , Grad. Texts in Math. 169, Springer-Verlag, New York, 1997. · DOI · Paper page
- A. Childs, Universal Computation by Quantum Walk , preprint, 2008; available online from http://arxiv.org/PS_cache/arxiv/pdf/0806/0806.1972v1.pdf.
- W. van Dam, M. Mosca, and U. Vazirani, How powerful is adiabatic quantum computation? , in Proceedings of the 42nd IEEE Symposium on Foundation of Computer Science, Las Vegas, NV, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 279–287. · DOI · Paper page
- L. Eldar and O. Regev, Quantum SAT for a qutrit-cinquit pair is $QMA_1$-complete , in Proceedings of the 35th International Colloquium on Automata, Languages and Programming, Reykjavik, Iceland, 2008, pp. 881–892. · DOI
- E. Farhi, J. Goldstone, and S. Gutmann, Quantum Adiabatic Evolution Algorithms versus Simulated Annealing , preprint, 2002; available online from http://arxiv.org/abs/quant-ph/0201031v1. · arXiv
- E. Farhi, J. Goldstone, and S. Gutmann, Quantum Adiabatic Evolution Algorithms with Different Paths , preprint, 2002; available online from http://arxiv.org/abs/quant-ph/0208135v1. · arXiv
- E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, Quantum Computation by Adiabatic Evolution , preprint, 2000; available online from http://arxiv.org/abs/quant-ph/0001106v1. · arXiv
- J. Friedman, Expanding Graphs , DIMACS Ser. Discrete Math. Theoret. Comput. Sci., AMS, Providence, RI, 1993. · doi:10.1090/dimacs/010
- R. A. Horn and C. R. Johnson, Matrix Analysis , Cambridge University Press, Cambridge, UK, 1985. · DOI · Paper page
- A. Kitaev, A. Shen, and M. Vyalyi, Classical and Quantum Computation , Grad. Stud. in Math. 47, AMS, Providence, RI, 2002. · DOI · Paper page
- L. Lovász, Random walks on graphs: A survey , in Combinatorics, Paul Erdős is Eighty, Vol. 2 (Keszthely, 1993), Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc., Budapest, 1996, pp. 353–397.
- A. Messiah, Quantum Mechanics , John Wiley and Sons, New York, 1958.
- D. Nagaj, Local Hamiltonians in Quantum Computation , Ph.D. thesis, MIT, 2008; available online from http://eprintweb.org/S/article/arxiv/0808.2117.
- M. Nielsen and I. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, UK, 2000.
- X. Peng, Z. Liao, N. Xu, G. Qin, X. Zhou, D. Suter, and J. Du, A Quantum Adiabatic Algorithm for Factorization and Its Experimental Implementation , preprint, 2008; available online from http://arxiv.org/abs/0808.1935v1. · DOI · Paper page
- B. Pepper, Adiabatic Computing Using 2-Local Hamiltonians on a Line , preprint.
- N. Schuch and F. Verstraete, Interacting Electrons, Density Functional Theory, and Quantum Merlin Arthur , preprint, 2007; available online from http://arxiv.org/abs/0712.0483v1. · arXiv
- A. Sinclair and M. Jerrum, Approximate counting, uniform generation, and rapidly mixing Markov chains (extended abstract), in Graph-Theoretic Concepts in Computer Science (Staffelstein, 1987), Lecture Notes in Comput. Sci. 314, Springer-Verlag, Berlin, 1988, pp. 134–148. · doi:10.1007/3-540-19422-3_11
Cited by
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
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
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Superconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544
Superconducting Qubits: Current State of PlayPreprint
Kjærgaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1,194
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
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 668
“This is a universal model of quantum computation [33], which means that it can in principle perform any quantum algorithm.”
BackgroundMethodIsing 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 543
“The Reference for publication source of the plotted data is given. important from a computational complexity perspective as adiabatic quantum computation with non-stoquastic Hamiltonians is equivalent to the circuit model of quantum computing 208 .”
BackgroundQuantum machine learning: a classical perspective
Ciliberto, C., Herbster, M., Ialongo, A. D., Pontil, M., Rocchetto, A., Severini, S., & Wossnig, L. (2018) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2017.0551 · Cited by 518
“[121] showed that AQC is universal for quantum computation, i.”
BackgroundPerspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Digitized adiabatic quantum computing with a superconducting circuit
Barends, R., Shabani, A., Lamata, L., Kelly, J., Mezzacapo, A., Heras, U. L., Babbush, R., Fowler, A. G., Campbell, B., Chen, Y., et al. (2016) · Nature · doi:10.1038/nature17658 · Cited by 463
Quantum walks: a comprehensive reviewPreprint
Venegas-Andraca, S. E. (2012) · Cited by 532
Hamiltonian simulation using linear combinations of unitary operations
Childs, A. M., & Wiebe, N. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12-1 · Cited by 392
Quantum simulation and computing with Rydberg-interacting qubits
Morgado, M., & Whitlock, S. (2021) · AVS Quantum Science · doi:10.1116/5.0036562 · Cited by 370
“It can also be thought of as a key step toward more general purpose adiabatic quantum computers, a promising alternative to digital circuit based approaches 272,273 .”
BackgroundSimulating Chemistry Using Quantum Computers
Kassal, I., Whitfield, J. D., Perdomo-Ortiz, A., Yung, M.-H., & Aspuru-Guzik, A. (2011) · Annual Review of Physical Chemistry · doi:10.1146/annurev-physchem-032210-103512 · Cited by 352
Quantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
“In principle, AQC has been shown to be polynomially equivalent to gate-based universal QC, as any quantum circuit can be represented as a time-dependent Hamiltonian with at most polynomial overhead [7, 19].”
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
Quantum computing for energy systems optimization: Challenges and opportunities
Ajagekar, A., & You, F. (2019) · Energy · doi:10.1016/j.energy.2019.04.186 · Cited by 289
“It has also been proven that an extended form of quantum annealing is theoretically equivalent to gate (circuit) model [35].”
BackgroundProvably efficient machine learning for quantum many-body problems
Huang, H.-Y., Kueng, R., Torlai, G., Albert, V. V., & Preskill, J. (2022) · Science · doi:10.1126/science.abk3333 · Cited by 228
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G., Johnson, M. W., Amin, M. H., Harris, R., Altomare, F., Berkley, A. J., Bunyk, P., Cai, J., Chapple, E. M., Chavez, P., et al. (2013) · Nature Communications · doi:10.1038/ncomms2920 · Cited by 225
“99 by annealing multiple times, as a function of the anneal time tf, computed using equation (3).”
MethodThe prospects of quantum computing in computational molecular biology
Outeiral, C., Strahm, M., Shi, J., Morris, G. M., Benjamin, S. C., & Deane, C. M. (2021) · WIREs Computational Molecular Science · doi:10.1002/wcms.1481 · Cited by 232
“In principle, adiabatic quantum computing is equivalent to universal quantum computing [187].”
BackgroundShortcuts to adiabaticity by counterdiabatic driving for trapped-ion displacement in phase space
An, S., Lv, D., del Campo, A., & Kim, K. (2016) · Nature Communications · doi:10.1038/ncomms12999 · Cited by 191
Observation of a quantum phase transition in the quantum Rabi model with a single trapped ion
Cai, M.-L., Liu, Z.-D., Zhao, W.-D., Wu, Y.-K., Mei, Q.-X., Jiang, Y., He, L., Zhang, X., Zhou, Z.-C., & Duan, L.-M. (2021) · Nature Communications · doi:10.1038/s41467-021-21425-8 · Cited by 188
Quantum Speedup by Quantum Annealing
Somma, R. D., Nagaj, D., & Kieferová, M. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050501 · Cited by 176
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 173
“This is equivalent to an alternative model which is somewhat less popular, called the adiabatic quantum computing model of computation [17], which is built on the idea of achieving a quantum computation by utilizing the adiabatic theorem in quantum mechanics.”
MethodEmerging quantum computing algorithms for quantum chemistry
Motta, M., & Rice, J. E. (2022) · WIREs Computational Molecular Science · doi:10.1002/wcms.1580 · Cited by 173
Ajagekar, A., & You, F. (2022) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2022.112493 · Cited by 184
Quantum annealing initialization of the quantum approximate optimization algorithm
Sack, S. H., & Serbyn, M. (2021) · Quantum · doi:10.22331/q-2021-07-01-491 · Cited by 256
Application of Quantum Annealing to Nurse Scheduling Problem
Ikeda, K., Nakamura, Y., & Humble, T. S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49172-3 · Cited by 139
“Among (a–c), the day-off requests are tuned differently as = g n d ( , ) 0 for (a), = g(1, 4) 1, = .”
BackgroundObservation of a quantum phase transition in the quantum Rabi model with a single trapped ion
Cai, M.-L., Liu, Z., Zhao, W.-D., Wu, Y., Mei, Q.-X., Jiang, Y., He, L., Zhang, X., Zhou, Z.-C., & Duan, L.-M. (2021) · RePEc: Research Papers in Economics · Cited by 138
Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
Hegade, N. N., Paul, K., Ding, Y., Sanz, M., Albarrán-Arriagada, F., Solano, E., & Chen, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.024038 · Cited by 170
“Although AdQC is equivalent to the standard circuit model [26], the advantage of digital quantum computation (DQC) over quantum annealers is that the circuit model offers more flexibility to construct arbitrary interactions, and it is consistent with error correction.”
BackgroundMethodQuantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 189
Quantum neuromorphic computing
Marković, D., & Grollier, J. (2020) · Applied Physics Letters · doi:10.1063/5.0020014 · Cited by 158
Hamiltonian Simulation Using Linear Combinations of Unitary Operations
Childs, A. M., & Wiebe, N. (2012) · Quantum Information and Computation · doi:10.26421/qic12.11-12 · Cited by 125
“Even before a fault-tolerant quantum computer is built, quantum simulation techniques can be used to prove equivalence between Hamiltonian-based models of quantum computing (such as adiabatic quantum computing [1] and continuous-time quantum walks [2]) and to develop novel quantum algorithms [3–7].”
MethodAlgorithms for Quantum Simulation at Finite Energies
Lu, S., Bañuls, M. C., & Cirac, J. I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.020321 · Cited by 150
Bapst, V., Foini, L., Krząkała, F., Semerjian, G., & Zamponi, F. (2012) · HAL · Cited by 123
Encoding patterns for quantum algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IET Quantum Communication · doi:10.1049/qtc2.12032 · Cited by 131
Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass
Hormozi, L., Brown, E., Carleo, G., & Troyer, M. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.95.184416 · Cited by 123
Universal quantum Hamiltonians
Cubitt, T. S., Montanaro, A., & Piddock, S. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1804949115 · Cited by 177
Squeezing and quantum state engineering with Josephson travelling wave amplifiers
Grimsmo, A. L., & Blais, A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0020-8 · Cited by 110
“(28) and (29), satisfy u ω; z ð Þ j j(2) v ω; z ð Þ j j(2) 1⁄4 1, and”
A QUBO Model for the Traveling Salesman Problem with Time Windows
Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., & Fanarioti, S. (2019) · Algorithms · doi:10.3390/a12110224 · Cited by 120
Prospects for quantum computing with an array of ultracold polar paramagnetic molecules
Karra, M., Sharma, K., Friedrich, B., Kais, S., & Herschbach, D. R. (2016) · The Journal of Chemical Physics · doi:10.1063/1.4942928 · Cited by 91
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 109
Quantum gate learning in qubit networks: Toffoli gate without time-dependent control
Banchi, L., Pancotti, N., & Bose, S. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.19 · Cited by 74
Nuclear magnetic resonance for quantum computing: Techniques and recent achievements
Xin, T., Wang, B.-X., Li, K., Kong, X., Wei, S.-J., Wang, T., Ruan, D., & Long, G. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/2/020308 · Cited by 82
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 70
Haribara, Y., Utsunomiya, S., & Yamamoto, Y. (2016) · Entropy · doi:10.3390/e18040151 · Cited by 79
Direct certification of a class of quantum simulations
Hangleiter, D., Kliesch, M., Schwarz, M., & Eisert, J. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/2/1/015004 · Cited by 79
Quantum Software Development Lifecycle
Weder, B., Barzen, J., Leymann, F., & Vietz, D. (2022) · Springer eBooks · doi:10.1007/978-3-031-05324-5_4 · Cited by 100
Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits
Ozfidan, I., Deng, C., Smirnov, A. Y., Lanting, T. M., Harris, R., Swenson, L. J., Whittaker, J. D., Altomare, F., Babcock, M. C., Baron, C., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.034037 · Cited by 72
The Quantum software lifecycle
Weder, B., Barzen, J., Leymann, F., Salm, M., & Vietz, D. (2020) · doi:10.1145/3412451.3428497 · Cited by 84
“However, it can be shown that the different models are formally equivalent [2, 31].”
BackgroundGershenson, C., & Helbing, D. (2015) · Complexity · doi:10.1002/cplx.21736 · Cited by 64
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
The NISQ Analyzer: Automating the Selection of Quantum Computers for Quantum Algorithms
Salm, M., Barzen, J., Breitenbücher, U., Leymann, F., Weder, B., & Wild, K. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-64846-6_5 · Cited by 82
Expanding Data Encoding Patterns For Quantum Algorithms
Weigold, M., Barzen, J., Leymann, F., & Salm, M. (2021) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c52384.2021.00025 · Cited by 90
“Since the first proposal of a quantum computer, various quantum computing models have been established which describe computations in a different manner, e.g., the adiabatic [20], gate-based [21] or one-way model [22].”
MethodApproaches to Quantum Error Correction
Kempe, J. (2006) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-7808-0_3 · Cited by 62
“In this system there is a gap between the groundstate and the first exited state at all times, which might make the state more robust to noise (see [FGG + 01, AvDK + 04, CFP02]).”
BackgroundSelf-citationQuantum adiabatic algorithms, small gaps, and different paths
Farhi, E., Goldstone, J., Gosset, D., Gutmann, S., Meyer, H. B., & Shor, P. W. (2011) · Quantum Information and Computation · doi:10.26421/qic11.3-4-1 · Cited by 99
“This suggests that the quantum adiabatic algorithm should in general be run on each instance with many different random paths leading to the problem Hamiltonian.”
BackgroundVasani, V., Prateek, K., Amin, R., Maity, S., & Dwivedi, A. D. (2024) · Journal of Industrial Information Integration · doi:10.1016/j.jii.2024.100594 · Cited by 80
Direct certification of a class of quantum simulations
Hangleiter, D., Kliesch, M., Schwarz, M., & Eisert, J. (2017) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-2421 · Cited by 56
A Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
“However, it is possible to show that these two approaches are polynomially equivalent [7, 71] by using the technique introduced in Reference [121].”
MethodQuantum annealing: The fastest route to quantum computation?
Laumann, C. R., Moessner, R., Scardicchio, A., & Sondhi, S. L. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02344-2 · Cited by 57
“They soon established that adiabatic evolutions could be used to simulate the evolution of quantum circuits (and vice versa) and thus that a suitably generalized QAA constitutes a completely universal model for quantum computation [2].”
BackgroundIntegrating Quantum Computing into Workflow Modeling and Execution
Weder, B., Breitenbücher, U., Leymann, F., & Wild, K. (2020) · IEEE/ACM International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc48980.2020.00046 · Cited by 61
“These models have been shown to be formally equivalent, but define quantum algorithms in different ways [21], [22].”
BackgroundHybridized Methods for Quantum Simulation in the Interaction Picture
Rajput, A., Roggero, A., & Wiebe, N. (2022) · Quantum · doi:10.22331/q-2022-08-17-780 · Cited by 73
“…is a Hamiltonian such that the groundstate of the Hamiltonian encodes a quantum superposition of the history of a quantum computer via a clockstate of the form 1 √ T t | t i| ψ ( t ) i where | ψ ( t ) i is the state of the quantum computer after t gates have been applied to it [67, 68, 69, 70].”
BackgroundQuantum Finance: Exploring the Implications of Quantum Computing on Financial Models
Zhou, J. (2025) · Computational Economics · doi:10.1007/s10614-025-10894-4 · Cited by 78
An introduction to quantum annealing
de Falco, D., & Tamascelli, D. (2011) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/2011013 · Cited by 64
“Quantum adiabatic computation [22] was welcomed by the quantum computing community due to the preliminary good results produced when applied to small random instances of NP-complete problems [21,22,51] and its equivalence to the quantum circuital model [1].”
MethodA note on the switching adiabatic theorem
Elgart, A., & Hagedorn, G. A. (2012) · Journal of Mathematical Physics · doi:10.1063/1.4748968 · Cited by 45
“niform category is the following: See, e.g., Ref. 2: Theorem (Uniform adiabatic theorem). Suppose H(s) is a τ–independent, twice differentiable family of bounded self–adjoint operators on the interval [0,1]. Suppose in addition that g := min s∈[0,1] g(s) > 0 for all s∈ [0,1]. (I.2) Then, for any s∈ [0,1], the soluti…”
BackgroundMethodInfluentialHybrid classical-quantum linear solver using Noisy Intermediate-Scale Quantum machines
Chen, C.-C., Shiau, S.-Y., Wu, M.-F., & Wu, Y.-R. (2019) · Scientific Reports · doi:10.1038/s41598-019-52275-6 · Cited by 48
A Single-Step Multiclass SVM Based on Quantum Annealing for Remote Sensing Data Classification
Delilbasic, A., Saux, B. L., Riedel, M., Michielsen, K. F. L., & Cavallaro, G. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3336926 · Cited by 53
“Despite their differences, the two models have been proven to be computationally equivalent [9].”
BackgroundAn Introduction to Quantum Computing, without the Physics
Nannicini, G. (2020) · SIAM Review · doi:10.1137/18m1170650 · Cited by 59
Towards the quantum-enabled technologies for development of drugs or delivery systems
Hassanzadeh, P. (2020) · Journal of Controlled Release · doi:10.1016/j.jconrel.2020.04.050 · Cited by 47
Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
Cui, J., Xiong, Y., Ng, S. X., & Hanzo, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3185287 · Cited by 56
Improved machine learning algorithm for predicting ground state properties
Lewis, L. H., Huang, H.-Y., Tran, V. T., Lehner, S., Kueng, R., & Preskill, J. P. (2024) · Nature Communications · doi:10.1038/s41467-024-45014-7 · Cited by 93
Fast quantum computation at arbitrarily low energy
Jordan, S. P. (2017) · Physical Review A · doi:10.1103/physreva.95.032305 · Cited by 40
“Hamiltonian to execute quantum computation “ballistically” as in Feynman’s original construction [32] not adiabatically as in [33].”
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
Wilson, B. A., Kudyshev, Z. A., Kildishev, A. V., Kais, S., Shalaev, V. M., & Boltasseva, A. E. (2021) · Applied Physics Reviews · doi:10.1063/5.0060481 · Cited by 48
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 57
“[23] Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev, “Adiabatic quantum computation is equivalent to standard quantum computation,” (2004), arXiv:quant-ph/0405098.”
BackgroundA practitioner’s guide to quantum algorithms for optimisation problems
Symons, B. C. B., Galvin, D., Sahin, E., Alexandrov, V., & Mensa, S. (2023) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ad00f0 · Cited by 55
Adiabatic optimization versus diffusion Monte Carlo methods
Jarret, M., Jordan, S. P., & Lackey, B. (2016) · Physical Review A · doi:10.1103/physreva.94.042318 · Cited by 36
“[1] Dorit Aharonov, Wim van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev.”
BackgroundUniversal Quantum Computation in Globally Driven Rydberg Atom Arrays
Cesa, F., & Pichler, H. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.170601 · Cited by 63
New frontiers of quantum computing in chemical engineering
Ajagekar, A., & You, F. (2022) · Korean Journal of Chemical Engineering · doi:10.1007/s11814-021-1027-6 · Cited by 44
Adiabatic passage and ensemble control of quantum systems
Leghtas, Z., Sarlette, A., & Rouchon, P. (2011) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/44/15/154017 · Cited by 35
“Applications of population transfer range from population inversion [1], where k and l are lowest and highest energy eigenstates, to quantum information processing [2, 3, 4], where logic gates would (selectively) permute the populations of several eigenstates.”
BackgroundHamiltonian gadgets with reduced resource requirements
Cao, Y., Babbush, R., Biamonte, J., & Kais, S. (2015) · Physical Review A · doi:10.1103/physreva.91.012315 · Cited by 35
“[1] Dorit Aharonov, Julia Kempe, Seth Lloyd, Wim Van Dam, Zeph Landau, and Oded Regev.”
BackgroundShortcuts to adiabaticity for open systems in circuit quantum electrodynamics
Yin, Z., Li, C., Allcock, J., Zheng, Y.-C., Gu, X. Q., Dai, M., Zhang, S., & An, S. (2022) · Nature Communications · doi:10.1038/s41467-021-27900-6 · Cited by 47
From quantum circuits to adiabatic algorithms
Siu, M. S. (2005) · Physical Review A · doi:10.1103/physreva.71.062314 · Cited by 35
Quantum Algorithms for Scientific Computing and Approximate OptimizationPreprint
Hadfield, S. (2018) · arXiv (Cornell University) · doi:10.7916/d8x650c9 · Cited by 106
“(2)A closely related computational model, adiabatic quantum computation [6], is universal.”
BackgroundHybrid quantum annealing via molecular dynamics
Irie, H., Liang, H., Doi, T., Gongyo, S., & Hatsuda, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-87676-z · Cited by 32
FEqa: Finite element computations on quantum annealers
Raisuddin, O. M., & De, S. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.115014 · Cited by 42
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 41
“to perform universal quantum computation [18, 3].”
Self-citationToward the Implementation of a Quantum RBM
de Freitas, N. (2011) · Cited by 34
An Application of Quantum Annealing Computing to Seismic Inversion
Souza, A. M., Martins, E. O., Roditi, I., Sá, N., Sarthour, R. S., & Oliveira, I. S. (2022) · Frontiers in Physics · doi:10.3389/fphy.2021.748285 · Cited by 38
“The adiabatic model is equivalent to the gate model [20], i.e., any problem that can be computed in the gate model will also be computable in the adiabatic model.”
BackgroundMethodSelf-Healing of Trotter Error in Digital Adiabatic State Preparation
Kovalsky, L. K., Calderon-Vargas, F. A., Grace, M., Magann, A. B., Larsen, J. B., Baczewski, A., & Sarovar, M. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.060602 · Cited by 46
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
“As AQC (at zero temperature) and gate model quantum computing are shown to be polynomially equivalent [21], a valid question would be how to solve combinatorial optimization problems on a gate model quantum computer.”
BackgroundQuantum Computer Systems: Research for Noisy Intermediate-Scale Quantum Computers
Ding, Y., & Chong, F. T. (2020) · Synthesis lectures on computer architecture · doi:10.2200/s01014ed1v01y202005cac051 · Cited by 73
Spectral analysis of product formulas for quantum simulation
Yi, C., & Crosson, E. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00548-w · Cited by 52
“[13] Dorit Aharonov, Wim Van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev.”
BackgroundQuantum computers: Definition and implementations
Pérez-Delgado, C. A., & Kok, P. (2011) · Physical Review A · doi:10.1103/physreva.83.012303 · Cited by 36
“Recently, Aharonov demonstrated a procedure for adapting any quantum circuit algorithm into an adiabatic procedure [2].”
Q-Match: Iterative Shape Matching via Quantum Annealing
Benkner, M. S., Lähner, Z., Golyanik, V., Wunderlich, C., Theobalt, C., & Moeller, M. (2021) · IEEE/CVF International Conference on Computer Vision (ICCV) · doi:10.1109/iccv48922.2021.00749 · Cited by 48
“The circuit-based and adiabatic quantum computing models are polynomially equivalent to each other in theory [1].”
BackgroundDigitized adiabatic quantum factorization
Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Chen, X., & Solano, E. (2021) · Physical Review A · doi:10.1103/physreva.104.l050403 · Cited by 33
Janzing, D. (2007) · Physical Review A · doi:10.1103/physreva.75.012307 · Cited by 28
“rd model of the quantum computer is based on one- and two-qubit unitaries there is meanwhile a large number of alternative proposals, e.g. computing by measurements only [1, 2] or adiabatic computing [3, 4, 5, 6, 7]. The latter model encodes a computational problem into an interaction such that the ground state of the…”
MethodKendon, V. M., Nemoto, K., & Munro, W. J. (2010) · Strathprints: The University of Strathclyde institutional repository (University of Strathclyde) · Cited by 27
Metadata
- Authors
- Aharonov, D., van Dam, W., Kempe, J., Landau, Z., Lloyd, S., & Regev, O.
- Venue
- SIAM Review
- Published
- 2008-01
- Volume
- 50
- Issue
- 4
- Pages
- 755-787
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2041432245
- Semantic Scholar
- ab891721d230583649a4af16d8af6f602ff2f6b8
- Cited by
- 395
- References
- 35
- Citations by year
- 2026: 15 · 2025: 30 · 2024: 26 · 2023: 53 · 2022: 36 · 2021: 48 · 2020: 40 · 2019: 25 · 2018: 20 · 2017: 36 · 2016: 9 · 2015: 12 · 2014: 7 · 2013: 4 · 2012: 9
- FWCI
- 7.93
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- SIAM Review (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- adiabatic quantum computation, eigenvectors, nearest-neighbor interactions, two-dimensional grids
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.