Evidence for quantum annealing with more than one hundred qubits
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Abstract
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators may be built with capabilities exceeding classical computers. A quantum annealer, in particular, solves optimization problems by evolving a known initial configuration at non-zero temperature towards the ground state of a Hamiltonian encoding a given problem. Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits. By studying correlations we find that the device performance is inconsistent with classical annealing or that it is governed by classical spin dynamics. In contrast, we find that the device correlates well with simulated quantum annealing. We find further evidence for quantum annealing in the form of small-gap avoided level crossings characterizing the hard problems. To assess the computational power of the device we compare it against optimized classical algorithms. Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions regarding the functioning of devices such as D-Wave One. A numerical and experimental investigation of its performance shows evidence for quantum annealing with 108 qubits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For example, the achievable rate for the transmission of classical information over a noisy quantum channel is given by the Holevo-Schumacher-Westmorel (HSW) coding theorem [136], which generalizes the Shannon's theorem in quantum settings.”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [136]
Experimental — accuracy not yet measured
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
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134 · cited 1×
“Mimicking this process in computer simulations is the idea behind simulated annealing as an optimisation method [8], which views the cost function of an optimisation problem as the energy of a physical system.”
MethodEquation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Quantum annealing in the transverse Ising model
Kadowaki, T., & Nishimori, H. (1998) · Physical Review E · doi:10.1103/physreve.58.5355 · Cited by 2,339 · cited 3×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
BackgroundMethodQuantum simulations with ultracold quantum gases
Bloch, I., Dalibard, J., & Nascimbène, S. (2012) · Nature Physics · doi:10.1038/nphys2259 · Cited by 2,339 · cited 1×
“At a time when quantum effects start to pose limits to further miniaturisation of devices and the exponential performance increase due to Moore’s law, quantum technology is maturing to the point where quantum devices, such as quantum communication systems [1], quantum random number generators [2] and quantum simulator…”
BackgroundA 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×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
MethodQuantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 3×
“In this work we report on computer simulations and experimental tests on a D-Wave One device [13] in order to address central open questions about quantum annealers: is the device actually a quantum annealer, i.”
BackgroundMethodInfluentialEquation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,306 · cited 1×
“This problem is nondeterministic polynomially (NP) hard [15], meaning that it is at least as hard as the hardest problems in NP, a class which includes notoriously difficult problems such as traveling salesman, satisfiablity of logical formulas, and ar X iv :1 30 4.”
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 3×
“[11], we also observe that the simulated quantum annealer here scales slightly worse than the simulated classical annealer.”
BackgroundMethodInfluential
Research works printed but not linked: 1
- McGeoch, C. C. & Wang, C. Proc. 2013 ACM Conf. Comput. Frontiers (ACM, 2013).
Cited by
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
“The scaling of the algorithm with n is then determined from the scaling with n of TTSopt, as, e.g., in (Boixo et al., 2014).”
MethodSelf-citationTrapped-ion quantum computing: Progress and challenges
Bruzewicz, C. D., Chiaverini, J., McConnell, R., & Sage, J. M. (2019) · Applied Physics Reviews · doi:10.1063/1.5088164 · Cited by 1,483
Microwave photonics with superconducting quantum circuits
Gu, X., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,307
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
Self-citationQuantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
“Finally, quantum annealing (QA) [393] is related to AQC in that one emulates a Hamiltonian in hardware.”
BackgroundMethodZhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
“A predecessor of QAOA, quantum annealing (QA) has been widely studied for the purpose of solving combinatorial optimization problems [39–42].”
BackgroundA fully programmable 100-spin coherent Ising machine with all-to-all connections
McMahon, P. L., Marandi, A., Haribara, Y., Hamerly, R., Langrock, C., Tamate, S., Inagaki, T., Takesue, H., Utsunomiya, S., Aihara, K., et al. (2016) · Science · doi:10.1126/science.aah5178 · Cited by 702
“In the case of recent experimental investigations of quantum annealers, there has been controversy about the operating regime and mechanism (11, 13, 35), and about whether the class of machines being considered has already delivered a speedup or will ever deliver a speedup (12,36–42).”
BackgroundQuantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
“In terms of practical implementation, a quantum annealing chipset is already commercially available from the company D-Wave1 [135].”
MethodDefining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601
Self-citationAmin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B., & Melko, R. (2018) · Physical Review X · doi:10.1103/physrevx.8.021050 · Cited by 520
Perspectives 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
A blueprint for demonstrating quantum supremacy with superconducting qubits
Neill, C., Roushan, P., Kechedzhi, K., Boixo, S., Isakov, S. V., Smelyanskiy, V., Megrant, A., Chiaro, B., Dunsworth, A., Arya, K., et al. (2018) · Science · doi:10.1126/science.aao4309 · Cited by 458
Self-citationPhysics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442
“Efforts to benchmark quantum annealers against classical counterparts such as simulated annealing (SA) [15] have abounded [14, 16–30].”
BackgroundCombinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
Goto, H., Tatsumura, K., & Dixon, A. R. (2019) · Science Advances · doi:10.1126/sciadv.aav2372 · Cited by 405
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
“This debate has now been settled in the affirmative with a sequence of publications [6,8,9,12,13,18,21] demonstrating that quantum resources are present and functional in the processors.”
BackgroundInfluentialSelf-citationUltracold quantum gases and lattice systems: quantum simulation of lattice gauge theories
Wiese, U. ‐. (2013) · Annalen der Physik · doi:10.1002/andp.201300104 · Cited by 379
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · Science Advances · doi:10.1126/sciadv.aau0823 · Cited by 328
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Bunyk, P. I., Hoskinson, E. M., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., et al. (2014) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2014.2318294 · Cited by 312
“The authors, as well as a number of other researchers, have gained some experience using this first generation processor [6]–[9].”
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337
Harnessing Disordered-Ensemble Quantum Dynamics for Machine Learning
Fujii, K., & Nakajima, K. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.024030 · Cited by 337
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · doi:10.1093/oso/9780198782995.001.0001 · Cited by 326
Quantum Machine Learning: What Quantum Computing Means to Data Mining
Wittek, P. (2014) · Cited by 482
Quantum bridge analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., Hennig, R., & Du, Y. (2022) · Annals of Operations Research · doi:10.1007/s10479-022-04634-2 · Cited by 297
“The ability to obtain a quantum speedup effect for this system applied to QUBO problems has been demonstrated in Boixo et al. (2014). Additional advances incorporating methodology from Wang et al.”
BackgroundMethodInfluentialQuantum Bridge Analytics I: a tutorial on formulating and using QUBO models
Glover, F., Kochenberger, G., & Du, Y. (2019) · 4OR · doi:10.1007/s10288-019-00424-y · Cited by 298
“The ability to obtain a quantum speedup effect for this system applied to QUBO problems has been demonstrated in [14].”
MethodDiffusive and Subdiffusive Spin Transport in the Ergodic Phase of a Many-Body Localizable System
Žnidarič, M., Scardicchio, A., & Varma, V. K. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.040601 · Cited by 288
A Tutorial on Formulating and Using QUBO Models
Glover, F., Kochenberger, G. A., & Du, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.11538 · Cited by 159
“The ability to obtain a quantum speedup effect for this system applied to QUBO problems has been demonstrated in Boixo et al. (2014).”
MethodAdiabatic Quantum Computation and Quantum Annealing: Theory and Practice
McGeoch, C. C. (2014) · Synthesis lectures on quantum computing · doi:10.2200/s00585ed1v01y201407qmc008 · Cited by 340
A quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Coherent Ising machines—optical neural networks operating at the quantum limit
Yamamoto, Y., Aihara, K., Leleu, T., Kawarabayashi, K.-I., Kako, S., Fejer, M., Inoue, K., & Takesue, H. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0048-9 · Cited by 258
Co-designing a scalable quantum computer with trapped atomic ions
Brown, K. R., Kim, J., & Monroe, C. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.34 · Cited by 250
“The quantum-annealing algorithm is similar in style, but interaction with a thermal bath complicates the dynamics.(95,96) Although a sufficiently cold bath could improve the possibility of finding the ground state, this is not always the case.”
MethodResultDemonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238
“In (a) and (b) error bars represent 95% confidence intervals (2σ) calculated using 1000 bootstraps of 100 gauge transformations [17].”
MethodResultSelf-citationComputational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V. N., Shabani, A., Isakov, S. V., Dykman, M., Denchev, V. S., Amin, M. H., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 233
“As in other lines of work, we will choose the number of sweeps to obtain a good correlation with the probability of success of the D-Wave chip for a benchmark of random Ising models with binary couplings J mn A {1, (cid:2) 1} (refs 15,18,20,23).”
BackgroundSelf-citationHigh-performance combinatorial optimization based on classical mechanics
Goto, H., Endo, K., Suzuki, M., Sakai, Y., Kanao, T., Hamakawa, Y., Hidaka, R., Yamasaki, M., & Tatsumura, K. (2021) · Science Advances · doi:10.1126/sciadv.abe7953 · Cited by 231
Bifurcation-based adiabatic quantum computation with a nonlinear oscillator network
Goto, H. (2016) · Scientific Reports · doi:10.1038/srep21686 · Cited by 226
A case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. N. (2015) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 218
“While debate continues as to the extent to which the D-Wave machine is quantum [7, 8, 23, 40, 41, 43, 45, 46], these machines provide the first opportunity for researchers to experiment with quantum annealing.”
BackgroundQuantum versus classical annealing of Ising spin glasses
Heim, B., Rønnow, T. F., Isakov, S. V., & Troyer, M. (2015) · Science · doi:10.1126/science.aaa4170 · Cited by 193
Self-citationQuantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209
“[11] Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer.”
BackgroundWhen does a physical system compute?
Horsman, D., Stepney, S., Wagner, R. C., & Kendon, V. (2014) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2014.0182 · Cited by 196
Error-corrected quantum annealing with hundreds of qubits
Pudenz, K. L., Albash, T., & Lidar, D. A. (2014) · Nature Communications · doi:10.1038/ncomms4243 · Cited by 198
Self-citationAdiabatic Quantum Simulation of Quantum Chemistry
Babbush, R., Love, P. J., & Aspuru-Guzik, A. (2014) · Scientific Reports · doi:10.1038/srep06603 · Cited by 191
“At present, optimized codes on classical hardware can find the ground state of many instances in comparable time to the D-Wave device [10].”
MethodSolving the Optimal Trading Trajectory Problem Using a Quantum Annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K., & de Prado, M. L. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2574703 · Cited by 171
Graph Partitioning using Quantum Annealing on the D-Wave System
Ushijima-Mwesigwa, H., Negre, C. F. A., & Mniszewski, S. M. (2017) · Proceedings of the Second International Workshop on Post Moores Era Supercomputing · doi:10.1145/3149526.3149531 · Cited by 185
“Machines performing QA at the hardware level such as the D-Wave computer have recently become available [2, 29], and evidence for quantum mechanical effects playing a useful role in the processing have been seen [1, 3, 28].”
BackgroundQuantum annealing: an overview
Rajak, A., Suzuki, S., Dutta, A., & Chakrabarti, B. K. (2023) · Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rsta.2021.0417 · Cited by 166
“[90] tested D-Wave’s quantum annealer to a spin glass model HP = − ∑ 〈jk〉 Jjkσ z j σ z k , where Jjk is chosen randomly from J = ±1, with N = 108 spins and reported that the results of the quantum annealer correlated well with those obtained by QA with QMC.”
MethodDesigning metamaterials with quantum annealing and factorization machines
Kitai, K., Guo, J., Ju, S., Tanaka, S., Tsuda, K., Shiomi, J., & Tamura, R. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013319 · Cited by 181
Stimulated Raman adiabatic passage in a three-level superconducting circuit
Kumar, K. S., Vepsäläinen, A., Danilin, S., & Paraoanu, G. S. (2016) · Nature Communications · doi:10.1038/ncomms10628 · Cited by 179
Quantum Hopfield neural network
Rebentrost, P., Bromley, T. R., Weedbrook, C., & Lloyd, S. (2018) · Physical Review A · doi:10.1103/physreva.98.042308 · Cited by 178
An Ising Hamiltonian solver based on coupled stochastic phase-transition nano-oscillators
Dutta, S., Khanna, A., Assoa, A. S., Paik, H., Schlom, D. G., Toroczkai, Z., Raychowdhury, A., & Datta, S. (2021) · Nature Electronics · doi:10.1038/s41928-021-00616-7 · Cited by 171
The Quantum Illumination Story
Shapiro, J. H. (2020) · IEEE Aerospace and Electronic Systems Magazine · doi:10.1109/maes.2019.2957870 · Cited by 173
“Quantum computers, if realized at sufficiently large scale, will vastly outstrip the capability of classical machines for a variety of problems in simulation [3], optimization [4], and machine learning [5].”
BackgroundProbing for quantum speedup in spin-glass problems with planted solutions
Hen, I., Job, J., Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042325 · Cited by 167
Self-citationTowards Quantum Simulation with Circular Rydberg Atoms
Nguyen, T. L., Raimond, J. M., Sayrin, C., Cortiñas, R. G., Cantat-Moltrecht, T., Assémat, F., Dotsenko, I., Gleyzes, S., Haroche, S., Roux, G., et al. (2018) · Physical Review X · doi:10.1103/physrevx.8.011032 · Cited by 198
“The experiments involved so far either only a few high-quality qubits [40, 41], a moderate number of damped systems [42] or even a large number of strongly damped ones [43], for which quantum speed-up is an open question [44].”
BackgroundSuperadiabatic population transfer in a three-level superconducting circuit
Vepsäläinen, A., Danilin, S., & Paraoanu, G. S. (2019) · Science Advances · doi:10.1126/sciadv.aau5999 · Cited by 162
Quantum annealing with all-to-all connected nonlinear oscillators
Puri, S., Andersen, C. K., Grimsmo, A. L., & Blais, A. (2017) · Nature Communications · doi:10.1038/ncomms15785 · Cited by 164
“(1) is built from Hi = ∑ i σ̂x,i and Hp = ∑ i,j Ji,j σ̂z,iσ̂z,j [9, 33].”
BackgroundSearching for quantum speedup in quasistatic quantum annealers
Amin, M. H. S. (2015) · Physical Review A · doi:10.1103/physreva.92.052323 · Cited by 195
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
King, A. D., Raymond, J., Lanting, T., Isakov, S. V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A. Y., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-20901-5 · Cited by 208
Self-citationBando, Y., Susa, Y., Oshiyama, H., Shibata, N., Ohzeki, M., Gómez-Ruiz, F. J., Lidar, D. A., Suzuki, S., del Campo, A., & Nishimori, H. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033369 · Cited by 151
Self-citationApplication of Ising Machines and a Software Development for Ising Machines
Tanahashi, K., Takayanagi, S., Motohashi, T., & Tanaka, S. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061010 · Cited by 142
Decoherence in adiabatic quantum computation
Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.062320 · Cited by 157
“In simulated quantum annealing [24, 74, 75] (SQA), Monte Carlo dynamics are used to sample from the instantaneous Gibbs state along the annealing evolution.”
MethodSelf-citationProspects for quantum enhancement with diabatic quantum annealing
Crosson, E., & Lidar, D. A. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00313-6 · Cited by 195
Self-citationConsistency tests of classical and quantum models for a quantum annealer
Albash, T., Vinci, W., Mishra, A., Warburton, P. A., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042314 · Cited by 156
Self-citationSuperadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, A. C., & Sarandy, M. S. (2015) · Scientific Reports · doi:10.1038/srep15775 · Cited by 125
“(22) and the norm provided by the Hilbert-Schmidt norm = † A Tr A A [ ] .”
BackgroundCoherent and dissipative dynamics at quantum phase transitions
Rossini, D., & Vicari, E. (2021) · Physics Reports · doi:10.1016/j.physrep.2021.08.003 · Cited by 158
High-Performance Transparent Radiative Cooler Designed by Quantum Computing
Kim, S., Shang, W., Moon, S., Pastega, T., Lee, E., & Luo, T. (2022) · ACS Energy Letters · doi:10.1021/acsenergylett.2c01969 · Cited by 119
Quantum neuromorphic computing
Marković, D., & Grollier, J. (2020) · Applied Physics Letters · doi:10.1063/5.0020014 · Cited by 158
Yamamoto, K., Kawamura, K., Ando, K., Mertig, N., Takemoto, T., Yamaoka, M., Teramoto, H., Sakai, A., Takamaeda-Yamazaki, S., & Motomura, M. (2020) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2020.3027702 · Cited by 142
“…( P ) , time required for obtaining a near-optimal solution with a probability of P , is typically used to evaluate the annealing performance [23], [24] and is calculated as follows : where t shows the annealing time for obtaining one solution and P a ( t ) shows a probability of obtaining a…”
BackgroundTowards quantum simulating QCD
Wiese, U. ‐. (2014) · Nuclear Physics A · doi:10.1016/j.nuclphysa.2014.09.102 · Cited by 125
Building a Quantum Engineering Undergraduate Program
Oliver, W. D. (2022) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 127
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3063618 · Cited by 114
Quantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
Goto, H. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061015 · Cited by 134
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2021) · arXiv · doi:10.48550/arxiv.2103.01708 · Cited by 114
“…num_reads and annealing_time , which correspond to the number of anneals and time per anneal respectively; num_spin_reversal_transforms , which sets the number of gauge transformations to be performed on the problem [32]; and auto_scale , which indicates whether h i and J ij of the Ising model (Eq.”
BackgroundSimulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing
Crosson, E., & Harrow, A. W. (2016) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2016.81 · Cited by 128
“Studies comparing QA to SA and SQA have also emerged since [18] found the success probabilities of SQA are highly correlated with the results of QA performed on D-Wave quantum hardware with hundreds of qubits, while the distribution of success probabilities for SA on the same set of instances bears little resemblance…”
ResultSeeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 145
“[33], an instance’s success probability across gauges is derived from the geometric mean of the gauges’ failure rates.”
BackgroundCoherent Coupled Qubits for Quantum Annealing
Weber, S. J., Samach, G., Hover, D. J., Gustavsson, S., Kim, D. K., Melville, A. J., Rosenberg, D., Sears, A., Yan, F., Yoder, J., et al. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.014004 · Cited by 122
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
Sanders, Y. R., Berry, D. W., Costa, P. C. S., Tessler, L. W., Wiebe, N., Gidney, C., Neven, H., & Babbush, R. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020312 · Cited by 178
Mandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 128
“In the main text we define the computational time Ttts for a given classical or quantum heuristic as the time to find a solution with 99% probability [27, 55] as:”
BackgroundMethodQuadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis
Lewis, M. W., & Glover, F. (2017) · Networks · doi:10.1002/net.21751 · Cited by 147
Unitary quantum perceptron as efficient universal approximator
Torrontegui, E., & García-Ripoll, J. J. (2019) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/125/30004 · Cited by 102
Understanding Quantum Tunneling through Quantum Monte Carlo Simulations
Isakov, S. V., Mazzola, G., Smelyanskiy, V., Zhang, J., Boixo, S., Neven, H., & Troyer, M. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.180402 · Cited by 137
Self-citationComputing With Networks of Oscillatory Dynamical Systems
Raychowdhury, A., Parihar, A., Smith, G. H., Narayanan, V., Csaba, G., Jerry, M., Porod, W., & Datta, S. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2878854 · Cited by 112
“For example, in the case of hard optimization problems, alternative paradigms and architectures include, but they are not limited to quantum computing [2]–[5], cellular automata [6], Ising modelbased systems [7]–[10], neural networks [11], [12], memcomputing [13], and stochastic searching architectures [14].”
BackgroundAlexeev, Y., Amsler, M., Barroca, M. A., Bassini, S., Battelle, T., Camps, D., Casanova, D., Choi, Y. J., Chong, F. T., Chung, C., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.04.060 · Cited by 190
Robust quantum optimizer with full connectivity
Nigg, S. E., Lörch, N., & Tiwari, R. P. (2017) · Science Advances · doi:10.1126/sciadv.1602273 · Cited by 110
Probing the Bose glass–superfluid transition using quantum quenches of disorder
Meldgin, C., Ray, U., Russ, P., Chen, D., Ceperley, D. M., & DeMarco, B. (2016) · Nature Physics · doi:10.1038/nphys3695 · Cited by 126
Electronic Structure Calculations and the Ising Hamiltonian
Xia, R., Bian, T., & Kais, S. (2017) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.7b10371 · Cited by 104
Quantum annealing correction for random Ising problems
Pudenz, K. L., Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042302 · Cited by 99
Self-citationWittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00004-9 · Cited by 103
Leveraging quantum annealing for large MIMO processing in centralized radio access networks
Kim, M., Venturelli, D., & Jamieson, K. (2019) · ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342072 · Cited by 128
“However, this improved range option, when enabled, breaks the symmetry of the Ising objective function (substituting the opposite signs for connected coefficients and their couplings, into the same problem), and hence precludes averaging over these symmetrical instances as the DW2Q does without the improved range opti…”
BackgroundAlbash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02346-0 · Cited by 96
Self-citationNonstoquastic 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
Self-citationQuantum annealing correction with minor embedding
Vinci, W., Albash, T., Paz-Silva, G. A., Hen, I., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042310 · Cited by 114
Self-citationExponential Enhancement of the Efficiency of Quantum Annealing by Non-Stoquastic Hamiltonians
Nishimori, H., & Takada, K. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00002 · Cited by 126
A coherent quantum annealer with Rydberg atoms
Glaetzle, A. W., van Bijnen, R. M. W., Zoller, P., & Lechner, W. (2017) · Nature Communications · doi:10.1038/ncomms15813 · Cited by 91
“This allows us to restrict the sum in equation (4) to pairs of atoms belonging to the same plaquette, thus realizing Ĥ& of equation (3) for the optimal parameters a1⁄4 2 and b1⁄4 1.”
BackgroundMethodInfluentialQuantum Bits with Josephson Junctions
Kockum, A. F., & Nori, F. (2019) · Springer series in materials science · doi:10.1007/978-3-030-20726-7_17 · Cited by 181
“[98, 99].”
How "Quantum" is the D-Wave Machine?
Shin, S. W., Smith, G., Smolin, J. A., & Vazirani, U. (2014) · arXiv · doi:10.48550/arxiv.1401.7087 · Cited by 89
Advances in quantum machine learningPreprint
Adcock, J. C., Allen, E. J., Day, M., Frick, S., Hinchliff, J. J., Johnson, M., Morley-Short, S., Pallister, S., Price, A. B., & Stanisic, S. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.02900 · Cited by 144
“When compared to the classical AdaBoost, an advantage was claimed [73], however the scaling of D-Wave-compatible algorithms compared to optimised classical ones has since been shown to be less than clear-cut [77].”
ResultRare Earth-Doped Crystals for Quantum Information Processing
Goldner, P., Ferrier, A., & Guillot-Noël, O. (2014) · Elsevier eBooks · doi:10.1016/b978-0-444-63260-9.00267-4 · Cited by 117
Fidelity Susceptibility Made Simple: A Unified Quantum Monte Carlo Approach
Wang, L., Liu, Y.-H., Imriška, J., Ma, P. N., & Troyer, M. (2015) · Physical Review X · doi:10.1103/physrevx.5.031007 · Cited by 104
Self-citationA 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
Takata, K., Marandi, A., Hamerly, R., Haribara, Y., Maruo, D., Tamate, S., Hiromasa, S., Utsunomiya, S., & Yamamoto, Y. (2016) · Scientific Reports · doi:10.1038/srep34089 · Cited by 87
Metadata
- Authors
- Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M.
- Affiliations
- University of Southern California (US)
- ETH Zurich (CH)
- Microsoft (United States) (US)
- University of California, Santa Barbara (US)
- Corresponding author
- Troyer, Matthias
- Venue
- Nature Physics
- Published
- 2014-02-28
- Volume
- 10
- Issue
- 3
- Pages
- 218-224
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2117762142
- Cited by
- 810
- References
- 49
- Citations by year
- 2026: 35 · 2025: 49 · 2024: 49 · 2023: 51 · 2022: 68 · 2021: 71 · 2020: 67 · 2019: 71 · 2018: 66 · 2017: 97 · 2016: 67 · 2015: 68 · 2014: 41
- FWCI
- 90.73
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (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 Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, superconducting flux qubit, avoided crossings, spin correlations, optimization problems, ground state, simulated quantum annealing
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.