Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
The DOI matches its Crossref record; 36 of the 36 references it cites were found in a registry or an index.
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
Items 301–395 of 395
’n Universele programmeerbare kwantumrekenaar?
Potgieter, P. H., Heidema, J., & Jones, E. G. (2008) · Suid-Afrikaanse Tydskrif vir Natuurwetenskap en Tegnologie · doi:10.4102/satnt.v27i3.91
Quantum Algorithms and Complexity for Numerical Problems
Zhang, C. (2011) · doi:10.7916/d8gf11gx
“Quantum adiabatic computation has been proved to be polynomially equivalent to the quantum circuit model [3].”
MethodParametrizações otimais de trajetórias adiabáticas em sistemas quânticos dissipativos
Gontijo, M. M. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.43.2012.tde-05122014-101358
“Essa nova abordagem já apresenta diversas aplicações ([28], [20], [3], [25], [36], [2], [1], [17]).”
BackgroundInfluentialО реализации стандартных квантовых вычислительных сетей посредством адиабатической эволюции
Zobov, V. E., & Ермилов, А. С. (2007) · Теоретическая и математическая физика · doi:10.4213/tmf5990
Developing A Quantum Circuit Simulator API
Dorian, S. M., & Marin, P. E. (2015) · Acta Universitatis Cibiniensis Technical Series · doi:10.1515/aucts-2015-0084
Active quantum walks: a framework for quantum walks with adiabatic quantum evolution
Wu, N., Song, F., & Li, X. (2016) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2228440
Montangero, S. (2018) · Graduate texts in physics · doi:10.1007/978-3-030-01409-4_8
Caracterização da evolução adiabática em cadeias de spin
Grajales, J. A. V. (2018) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.76.2018.tde-05062018-151545
Quantum Adiabatic Evolution with a Special Kind of Interpolating Paths
Sun, J., Lu, S., & Gao, C. (2018) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-03405-4_51
Realizing an adiabatic quantum search algorithm with shortcuts to adiabaticity in an ion-trap system
Wu, W., & Zhang, J. (2019) · Quantum Information and Measurement (QIM) · doi:10.1364/qim.2019.f5a.18
Quantum feedback for measurement and controlPreprint
Martin, L. S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.09766 · Cited by 5
“By smoothly varying H from a simple, non-interacting Hamiltonian to HP , one can efficiently implement any algorithm[2].”
MethodDynamics of Quantum Annealers: Ising Model with Transverse Field Study
Więckowski, A., & Ptok, A. (2020) · Acta Physica Polonica A · doi:10.12693/aphyspola.138.686
Statistical Analysis of Quantum AnnealingPreprint
Song, X., Wang, Y., Wu, S., & Kim, D. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.06854
“The ground state success probability of quantum annealing is usually derived under the unique ground state condition in an asymptotic sense, that is, we obtain some expressions or bounds for the leading terms of the ground state success probability by taking tf to go to infinity (Aharonov et al., 2008; Born and Fock,…”
BackgroundInfluentialFidelity-based Deep Adiabatic Scheduling
Ovits, E., & Wolf, L. (2021) · International Conference on Learning Representations
Experimental verification of the inertial theorem control protocolsPreprint
Hu, C.-K., Dann, R., Cui, J., Huang, Y., Li, C., Guo, G., Santos, A. C., & Kosloff, R. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.00404
Towards algorithm-free physical equilibrium model of computing
Mousavi, S. (2021) · Quantum Information and Computation · doi:10.26421/qic21.15-16-3
McMahon, D. (2007) · doi:10.1002/9780470181386.refs
Um Estudo sobre o uso de fases geométricas na física
Costa, M. R. C., Rodrigues, M. L., & Cavalcante, E. (2021) · Revista Física no Campus · doi:10.29327/256539.1.1-6
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0003
Quantum description of light–matter coupling
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0005
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0009
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0012 · Cited by 1
Strong coupling: resonant effects
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0007
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0011
Kempe, J., & Vidick, T. (2010) · Lecture notes in physics · doi:10.1007/978-3-642-11914-9_10 · Cited by 4
“Recently it has been shown [2] that also any quantum circuit can be simulated efficiently by an appropriate adiabatic algorithm; hence these two models of computation are essentially equivalent.”
BackgroundSelf-citationKavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0010
Strong Coupling: Polariton Bose Condensation
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0008
(2013) · Taylor & Francis eBooks · doi:10.1201/b13866-5
Zulehner, A., & Wille, R. (2020) · Springer eBooks · doi:10.1007/978-3-030-41753-6_1
Classical Description of Light
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0002
Preface to The Revised Paperback Edition
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0006
Derivation of the Landau Criterion of Superfluidity and Landau Formula
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0002
Landau Quantisation and Renormalisation of Rabi Splitting
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0003
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0004
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0005
Scattering Rates of Polariton Relaxation
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0001
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0012
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0009
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0007
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0011
Control limit for the quantum state preparation under stochastic control errors
Kobayashi, K. (2023) · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rspa.2023.0215 · Cited by 2
“[9] Aharonov D, van Dam W, Kempe J, Landau Z, Lloyd S, Regev O.”
BackgroundA quantum annealing approach to solve max-cover problem
Uyen, N. T., An, N. C., Trang, D. M., & Sang, T. X. (2022) · Vinh University Journal of Science · doi:10.56824/vujs.2022nt29
Bożejko, W., Klempous, R., Pempera, J., Rozenblit, J. W., Smutnicki, C., Uchroński, M., & Wodecki, M. (2023) · doi:10.36227/techrxiv.22677721
Sub-exponential ML Algorithm for Predicting Ground State Properties
Preston, L., & Shivashankar (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_5
“Adiabatic quantum computation [Farhi et al., 2000, Aharonov et al., 2008, Wan and Kim, 2020], focuses on finding ground states of special Hamiltonian to perform computation.”
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0006
Microwave resonators for superconducting devices
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0013
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0003
The rotating wave approximation
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0007
Quantum simulation of Hamiltonian eigenstates
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0012
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0002
Quantum simulation of Hamiltonian dynamics
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0011
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0009
The molecular Hamiltonian in second quantization
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0008
Oblivious amplitude amplification lemma
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0005
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.005.0006
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0003
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0001
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0014
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0005
(2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.002.0004
Manenti, R., & Motta, M. (2023) · Oxford University Press eBooks · doi:10.1093/oso/9780198787488.003.0010
Quantum Computing and Quantum Computing Optimization: An Introduction
Nannicini, G. (2023) · Springer eBooks · doi:10.1007/978-3-030-54621-2_848-1 · Cited by 1
A Hybrid Quantum-Classical Segment-Based Stereo Matching Algorithm
Heidari, S., & Delmas, P. J. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45382-3_1
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_1
Zulehner, A., & Wille, R. (2023) · Springer eBooks · doi:10.1007/978-3-031-36751-9_2
Physics for secure and efficient societies
Barbato, F. C. T., Barthélemy, M., Beck, C., Biamonte, J., Cirac, J. I., Malz, D., Marino, A., Seskir, Z. C., & Ventura‐Traveset, J. (2024) · Institute of Physics eBooks · doi:10.1088/978-0-7503-6342-6ch7 · Cited by 1
On a Piecewise Linear Function Approximation for Quantum Computation
Okazaki, H. (2023) · IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) · doi:10.1109/apccas60141.2023.00088
“The paper does not deal with the adiabatic model for two reasons: first, the adiabatic and the circuit models are equivalent [13], and therefore there is discretion to choose whatever model is more convenient; second, the circuit model is more natural for computer scientists and is the one used in…”
BackgroundConvergence Rate of Algorithm for Solving Linear Equations by Quantum Annealing
Tikhomirov, S. B., & Shalgin, V. S. (2024) · Computational Mathematics and Mathematical Physics · doi:10.1134/s0965542524700325
“It is known that the adiabatic model is equivalent to the universal circuit model of quantum computations [11].”
Reale, S., & Nitto, E. D. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00017
“The relationship between AQC and the standard quantum gate computation model is explored in [3] and in [4].”
BackgroundSolving Delivery Allocation for Logistic Network Using Quantum Annealing
Bhattacharjee, S., Das, K., & Sarkar, B. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-97-4799-3_4
Superstate Quantum MechanicsPreprint
Belov, M. G., Dubov, V. V., Ivanov, V. K., Maslov, A. Y., Proshina, O. V., & Malyshkin, V. G. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5120609
Cao, J., Lin, J., Geng, R.-F., Wang, V., Kou, J., Tamura, R., & Geng, W. T. (2025) · Research Square · doi:10.21203/rs.3.rs-6265697/v1
Об оценке временной сложности адиабатических вычислений для одного класса целочисленных решеток
Lysakov, I. V. (2025) · Математические вопросы криптографии · doi:10.4213/mvk490
Improving adiabatic quantum factorization via chopped random-basis optimization
Yang, T., Xiong, M., Xue, M., Li, X., & Li, J. (2025) · Physical Review A · doi:10.1103/physreva.111.052617 · Cited by 4
“An alternative approach for implementing factorization algorithms is adiabatic quantum computing (AQC) [6– 17], which was pioneered by Farhi et al. [18, 19] and presents a promising alternative to the standard quantum computing framework [10, 20–26].”
Pangenome-guided sequence assembly via binary optimisationPreprint
Cudby, J., Bonfield, J., Zhou, C., Durbin, R. M., & Strelchuk, S. (2025) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.1101/2025.08.06.668889
“In the limit as 𝑝 → ∞ , QAOA approaches adiabatic quantum computing, which is known to be universal for quantum computing [26].”
Jansen, N. D., & Hunt, K. L. C. (2025) · Entropy · doi:10.3390/e27090891 · Cited by 1
“Aharonov et al. have established that adiabatic quantum computation is equivalent to standard circuit-based quantum computation in terms of capabilities and outcomes [47].”
Q-CHOP: Quantum constrained Hamiltonian optimization
Perlin, M. A., Shaydulin, R., Hall, B., Minssen, P., Li, C., Dubey, K., Rines, R., Anschuetz, E. R., Pistoia, M., & Gokhale, P. (2025) · ACM Transactions on Quantum Computing · doi:10.1145/3778864 · Cited by 6
“Adiabatic quantum computing is an alternative model of quantum computation that is polynomially equivalent to—and can be efficiently simulated by—standard gate-based quantum compuation [17].”
Solving Helmholtz problems with finite elements on a quantum annealer
Rémi, A., Damanet, F., & Geuzaine, C. (2025) · Physical Review A · doi:10.1103/l4l6-qlj4 · Cited by 1
Tower of Structured Excited States from Measurements
Guo, Y., & Ashida, Y. (2026) · Physical Review Letters · doi:10.1103/vywt-16r7
Guo, X., Miao, G., Nishizawa, S., Kimura, S., & Sato, T. G. (2026) · IEEE Transactions on Computers · doi:10.1109/tc.2026.3654172 · Cited by 1
“Another model of quantum computing is adiabatic quantum computing (AQC) [10], [11], which has been proven to be polynomially equivalent to the standard gate-based quantum computing model [12].”
AQUA: An Agile Process to Develop Quantum Annealing Applications
Marchesi, L., Nasharti, A., & Marchesi, M. (2026) · IEEE Access · doi:10.1109/access.2026.3728144
“In principle, AQC is computationally equivalent to gate-based quantum computing and thus capable of universal quantum computation [1].”
PulseCIM: A Preconditioned Lookahead Simulated Coherent IsingMachinePreprint
Bonici, M. M., & Salloum, H. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6446548
Quantum algorithms for machine learning
Luongo, A. (2020) · theses.fr (ABES) · doi:10.70675/c80148f7z9fe9z44b0zba38zc37d3d609124 · Cited by 1
Étude des performances des machines à recuit quantique pour la résolution de problèmes combinatoires
Vert, D. (2021) · theses.fr (ABES) · doi:10.70675/785ae50cz79e3z4923zb9a6zfd30be202ce4 · Cited by 1
Quantum Finite Element Method via Quantum Annealing for Solid MechanicsPreprint
Wang, X., Wang, X., Xu, L., Cao, G., Chen, Y., & Wang, Z. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.6668084
A Pipeline for Solving Edge-Matching Puzzles and Their Implications for Protein FoldingPreprint
Seifer, S. (2026) · bioRxiv (Cold Spring Harbor Laboratory) · doi:10.64898/2026.05.23.727379
“Additional promise lies in realization of the quantum annealer by quantum gate circuits [15], allowing for algorithmic enhancements.”
Nonadiabatic self-healing of Trotter errors in digitized counterdiabatic dynamics
Vizzuso, M., Passarelli, G., Cantele, G., Lucignano, P., Chen, X., & Paul, K. (2026) · Physical Review A · doi:10.1103/5ck5-tp69 · Cited by 2
Quantum annealing: optimisation, sampling, and many-body dynamics
Abel, S. A., Constantin, A., & Nutricati, L. A. (2026) · Contemporary Physics · doi:10.1080/00107514.2026.2675146 · Cited by 1
“A central theoretical result is that AQC and the standard circuit model are computationally equivalent [10].”
Imaginary Time Evolution and Ground State Preparation Using Unitary Multi-Copy Protocols
Anonymous, Zache, T. V., Pichler, H., & Sadeghpour, H. R. (2026) · PRX Quantum · doi:10.1103/1tf6-bc55 · Cited by 5
Barati, C. N., Croitoru, A., Gore, R. J., Jarret, M., Kennedy, W. G., Maciejunes, A., Malikov, M., & Mendelson, S. S. (2026) · SIMULATION · doi:10.1177/00375497261467053
Complex systems for quantum technologies
Braungardt, S. (2011) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-94467
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.