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
Items 301–400 of 796
Ferromagnetically Shifting the Power of Pausing
Izquierdo, Z. G., Grabbe, S. R., Hadfield, S., Marshall, J., Wang, Z., & Rieffel, E. G. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.044013 · Cited by 26
“[15] Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer, “Evidence for quantum annealing with more than one hundred qubits,” Nature Physics 10, 218–224 (2014).”
BackgroundResultSelf-citationA coherent perceptron for all-optical learning
Tezak, N., & Mabuchi, H. (2015) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-015-0023-3 · Cited by 22
“Although the exact benefits of quantum dynamics in their machines has not been conclusively established [4], recent results analyzing the role of tunneling in a quantum annealer [5] are intriguing and suggest that quantum effects can be harnessed in computational devices that are not unitary quantum…”
BackgroundComputational hardness of spin-glass problems with tile-planted solutions
Perera, D., Hamze, F., Raymond, J., Weigel, M., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.023316 · Cited by 35
Circuit depth scaling for quantum approximate optimization
Akshay, V., Philathong, H., Campos, E., Rabinovich, D., Zacharov, I., Zhang, X., & Biamonte, J. (2022) · Physical Review A · doi:10.1103/physreva.106.042438 · Cited by 38
“[4] Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer.”
A benchmarking study of quantum algorithms for combinatorial optimization
Sankar, K., Scherer, A., Kako, S., Reifenstein, S., Ghadermarzy, N., Krayenhoff, W. B., Inui, Y., Ng, E., Onodera, T., Ronagh, P., et al. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00856-3 · Cited by 41
Assessment of Quantum Annealing for the Construction of Satisfiability Filters
Azinović, M., Herr, D., Heim, B., Brown, E., & Troyer, M. (2017) · SciPost Physics · doi:10.21468/scipostphys.2.2.013 · Cited by 27
“Additionally D-wave quantum annealers where empirically shown to scale similarly to SQA for random spin glass problems [7] and a numerical partitioning problem [8].”
MethodSelf-citationProgrammable superpositions of Ising configurations
Sieberer, L. M., & Lechner, W. (2018) · Physical Review A · doi:10.1103/physreva.97.052329 · Cited by 25
Quantum trajectories for time-dependent adiabatic master equations
Yip, K.-W., Albash, T., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.97.022116 · Cited by 22
“[26], and were also used in the original AME study of the 8-qubit chain [12]).”
MethodSelf-citationA note on QUBO instances defined on Chimera graphsPreprint
Dash, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.1202 · Cited by 22
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 24
How to test the “quantumness” of a quantum computer?
Zagoskin, A. M., Il’ichev, E. V., Grajcar, M., Betouras, J. J., & Nori, F. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00033 · Cited by 22
“The exact classical optimization algorithms used in Boixo et al. [11, 12], as well as generic approximate algorithms, will take impractically long time to run for 512 qubits.”
BackgroundMethodInfluentialQUBO formulations for a system of linear equations
Jun, K. (2024) · Results in Control and Optimization · doi:10.1016/j.rico.2024.100380 · Cited by 31
Onizawa, N., & Hanyu, T. (2024) · Scientific Reports · doi:10.1038/s41598-024-51639-x · Cited by 23
“More advanced computational methods such as quantum annealing (QA) Kadowaki and Nishimori [1998], Boixo et al. [2014] have been developed, with expectations of faster processing times compared to SA Neven [2016].”
Computational quantum-classical boundary of noisy commuting quantum circuits
Fujii, K., & Tamate, S. (2016) · Scientific Reports · doi:10.1038/srep25598 · Cited by 37
“This is motivated by increasing importance of computational complexity in physics 6 , and increasing demands for experimental verification 7 of complex quantum dynamics, such as quantum simulation and quantum annealing 8–10 .”
BackgroundQuantum simulations of localization effects with dipolar interactions
Álvarez, G. A., Kaiser, R., & Suter, D. (2013) · Annalen der Physik · doi:10.1002/andp.201300096 · Cited by 22
Entanglement and deterministic quantum computing with one qubit
Boyer, M., Brodutch, A., & Mor, T. (2017) · Physical Review A · doi:10.1103/physreva.95.022330 · Cited by 22
Nested quantum annealing correction at finite temperature: p -spin models
Matsuura, S., Nishimori, H., Vinci, W., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.062307 · Cited by 22
Self-citationSolving Set Cover with Pairs Problem using Quantum Annealing
Cao, Y., Jiang, S., Perouli, D., & Kais, S. (2016) · Scientific Reports · doi:10.1038/srep33957 · Cited by 27
“With the mapping presented in Theorem 1, we arrive at an Ising instance ISING (h, J) where α = 1/4 in (10) and h, J are presented in Supplementary Material Details of the example SCP instance.”
BackgroundMethodInfluentialQuantum Science and Quantum Technology
Wang, Y., & Song, X. (2020) · Statistical Science · doi:10.1214/19-sts745 · Cited by 27
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware
Nelson, J., Vuffray, M., Lokhov, A. Y., & Coffrin, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3092710 · Cited by 27
Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Nano Convergence · doi:10.1186/s40580-024-00425-6 · Cited by 20
A Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
“Gate-model devices are fully general purpose computers, using programmable logic gates acting on qubits, whereas annealing-model devices are specialized computers, offering a means to search an optimization problem for its lowest energy configurations in a high-dimensional energy landscape [18].”
BackgroundBenchmarking quantum annealing dynamics: The spin-vector Langevin model
Subires, D., Gómez-Ruiz, F. J., Ruiz, A., Alonso, D., & del Campo, A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023104 · Cited by 22
Trotterized adiabatic quantum simulation and its application to a simple all-optical system
Sun, Y., Zhang, J.-Y., Byrd, M., & Wu, L.-A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab7a31 · Cited by 32
Stochastic differential equations for quantum dynamics of spin-boson networks
Mandt, S., Sadri, D. J., Houck, A., & Türeci, H. E. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/5/053018 · Cited by 28
A Quantum Algorithm for Model-Independent Searches for New Physics
Matchev, K. T., Shyamsundar, P., & Smolinsky, J. (2023) · Letters in High Energy Physics · doi:10.31526/lhep.2023.301 · Cited by 20
A superconducting adiabatic neuron in a quantum regime
Bastrakova, M. V., Pashin, D. S., Rybin, D. A., Schegolev, A. E., Klenov, N. V., Soloviev, I. I., Gorchavkina, A. A., & Михайлович, С. А. (2022) · Beilstein Journal of Nanotechnology · doi:10.3762/bjnano.13.57 · Cited by 19
Sampei, H., Saegusa, K., Chishima, K., Higo, T., Tanaka, S., Yayama, Y., Makoto, N., Kimura, K., & Sekine, Y. (2023) · JACS Au · doi:10.1021/jacsau.3c00018 · Cited by 30
The Future of Drug Development with Quantum Computing
Bonde, B. K., Patil, P., & Choubey, B. (2023) · Methods in molecular biology · doi:10.1007/978-1-0716-3449-3_7 · Cited by 29
Fast quantum methods for optimization
Boixo, S., Ortíz, G., & Somma, R. D. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02341-5 · Cited by 29
Self-citationSimulated quantum annealing of double-well and multiwell potentials
Inack, E. M., & Pilati, S. (2015) · Physical Review E · doi:10.1103/physreve.92.053304 · Cited by 27
Torggler, V., Aumann, P., Ritsch, H., & Lechner, W. (2019) · Quantum · doi:10.22331/q-2019-06-03-149 · Cited by 34
“Despite considerable theoretical [18] and experimental [20] efforts, quantum speedup in adiabatic quantum computing has not been demonstrated”
BackgroundComputing: The quantum company
Jones, N. (2013) · Nature · doi:10.1038/498286a · Cited by 24
Memory-Efficient FPGA Implementation of Stochastic Simulated Annealing
Shin, D., Onizawa, N., Gross, W. J., & Hanyu, T. (2023) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2023.3243260 · Cited by 22
“as quantum annealing [4], [5] or stochastic simulated annealing”
BackgroundUnderstanding quantum tunneling using diffusion Monte Carlo simulations
Inack, E. M., Giudici, G., Parolini, T., Santoro, G. E., & Pilati, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032307 · Cited by 19
Quantum Quenches in Isolated Quantum Glasses out of Equilibrium
Thomson, S. J., Urbani, P., & Schirò, M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120602 · Cited by 18
Optimal working point in digitized quantum annealing
Mbeng, G. B., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.224201 · Cited by 28
Error suppression in adiabatic quantum computing with qubit ensembles
Mohseni, N., Narożniak, M., Pyrkov, A. N., Ivannikov, V., Dowling, J. P., & Byrnes, T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00405-2 · Cited by 20
The potential of quantum annealing for rapid solution structure identification
Pang, Y., Coffrin, C., Lokhov, A. Y., & Vuffray, M. (2020) · Constraints · doi:10.1007/s10601-020-09315-0 · Cited by 27
Quantum-Inspired Hierarchy for Rank-Constrained Optimization
Yu, X., Simnacher, T., Nguyen, H. C., & Gühne, O. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010340 · Cited by 29
Tunable spin-glass optical simulator based on multiple light scattering
Jacucci, G., Delloye, L., Pierangeli, D., Rafayelyan, M. S., Conti, C., & Gigan, S. (2022) · Physical Review A · doi:10.1103/physreva.105.033502 · Cited by 22
Quantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 20
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17
Coherent SAT solvers: a tutorial
Reifenstein, S., Leleu, T. G., McKenna, T. P., Jankowski, M., Suh, M., Ng, E., Khoyratee, F., Toroczkai, Z., & Yamamoto, Y. (2023) · Advances in Optics and Photonics · doi:10.1364/aop.475823 · Cited by 23
Efficient low temperature Monte Carlo sampling using quantum annealing
Sandt, R., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33828-2 · Cited by 21
Quantum-inspired encoding enhances stochastic sampling of soft matter systems
Slongo, F., Hauke, P., Faccioli, P., & Micheletti, C. (2023) · Science Advances · doi:10.1126/sciadv.adi0204 · Cited by 22
Wang, R. Z., Cummins, J., Syed, M., Stroev, N., Pastras, G., Sakellariou, J., Tsintzos, S. I., Askitopoulos, A., Veraldi, D., Strinati, M. C., et al. (2025) · Communications Physics · doi:10.1038/s42005-025-01987-5 · Cited by 35
Nishimura, K., Nishimori, H., Ochoa, A. J., & Katzgraber, H. G. (2016) · Physical review. E · doi:10.1103/physreve.94.032105 · Cited by 24
Disorder-dressed quantum evolution
Gneiting, C. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.214203 · Cited by 22
Guiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
Shirai, T., Tanaka, S., & Togawa, N. (2020) · IEEE Access · doi:10.1109/access.2020.3040017 · Cited by 20
“We also considered the time to solution (TTS) [9], [43]–[45].”
BackgroundDutta, S., Khanna, A., & Datta, S. (2020) · IEEE Journal on Exploratory Solid-State Computational Devices and Circuits · doi:10.1109/jxcdc.2020.3045074 · Cited by 22
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 19
“However, it may be possible that a larger probability of success is achieved if the adiabatic quantum optimizer is used for a shorter evolution time, but in repeated runs [29, 43].”
BackgroundMethodInfluentialComment on "Distinguishing Classical and Quantum Models for the D-Wave Device"Preprint
Shin, S. W., Smith, G., Smolin, J. A., & Vazirani, U. V. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1404.6499 · Cited by 29
“The results in [1] showed that the model shows excellent correlation with published data about the input-output behavior of the D-Wave machine on randomly chosen input instances [2].”
MethodResultGoogle and NASA snap up quantum computer
Jones, N. (2013) · Nature · doi:10.1038/nature.2013.12999 · Cited by 17
Portfolio Asset Identification Using Graph Algorithms on a Quantum AnnealerPreprint
Kalra, A., Qureshi, F., & Tisi, M. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3333537 · Cited by 17
“The D-Wave approach has garnered both academic skepticism [Boixo, 2013], [Boixo et al., 2014], [Sco] and results showing potential (some of which are described below).”
ResultSolving Quadratic Unconstrained Binary Optimization with divide-and-conquer and quantum algorithmsPreprint
Guerreschi, G. G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.07813 · Cited by 27
“The application to QUBO problems became central to quantum computing when adiabatic quantum optimization was proposed around the turn of the century [11, 12] and quantum annealers became the first large-scale quantum devices a dozen years later [13–15].”
MethodSpectral-gap analysis for efficient tunneling in quantum adiabatic optimization
Brady, L. T., & van Dam, W. (2016) · Physical Review A · doi:10.1103/physreva.94.032309 · Cited by 17
Equivalence between spin Hamiltonians and boson sampling
Peropadre, B., Aspuru‐Guzik, A., & García‐Ripoll, J. J. (2017) · Physical Review A · doi:10.1103/physreva.95.032327 · Cited by 17
Koshka, Y., & Novotny, M. A. (2018) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2018.2871466 · Cited by 18
“A reliability and efficiency of the ground state determination by D-Wave machines has been extensively investigated [3]–[5].”
BackgroundExperimental Investigation of the Dynamics of Coupled Oscillators as Ising Machines
Bashar, M. K., Mallick, A., & Shukla, N. (2021) · IEEE Access · doi:10.1109/access.2021.3124808 · Cited by 22
Spanning Tree Calculations on D-Wave 2 Machines
Novotny, M. A., Hobl, Q. L., Hall, J. S., & Michielsen, K. F. L. (2016) · Journal of Physics Conference Series · doi:10.1088/1742-6596/681/1/012005 · Cited by 16
“This choice is similar to the gauge transformations used by others [13] to remove local biases on the chip.”
MethodResultDynamics of the quantum search and quench-induced first-order phase transitions
Coulamy, I., Saguia, A., & Sarandy, M. S. (2017) · Physical review. E · doi:10.1103/physreve.95.022127 · Cited by 22
Quantum walks via quantum cellular automata
Costa, P. C. S., Portugal, R., & de Melo, F. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1983-x · Cited by 19
A double-slit proposal for quantum annealing
Munoz-Bauza, H., Chen, H., & Lidar, D. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0160-0 · Cited by 18
Self-citationQuantum phase transition with inhomogeneous driving in the Lechner-Hauke-Zoller model
Hartmann, A., & Lechner, W. (2019) · Physical Review A · doi:10.1103/physreva.100.032110 · Cited by 19
Ostilli, M., & Presilla, C. (2017) · Physical Review A · doi:10.1103/physreva.95.062112 · Cited by 23
“Examples range from a pure gas [11] or a mixture [12] of chiral molecules at a low density to a chipset of superconducting flux qubits [13].”
BackgroundHomology Computation of Large Point Clouds using Quantum AnnealingPreprint
Dridi, R., & Alghassi, H. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.09328 · Cited by 18
Cooling arbitrary near-critical systems using hyperbolic quenches
Mitra, P., Ippoliti, M., Bhatt, R. N., Sondhi, S. L., & Agarwal, K. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.104308 · Cited by 19
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0001 · Cited by 15
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319586 · Cited by 25
Suzuki, A., & Oku, T. (2016) · Applied Surface Science · doi:10.1016/j.apsusc.2016.02.026 · Cited by 15
Investigating the Chinese postman problem on a quantum annealer
Siloi, I., Carnevali, V., Pokharel, B., Fornari, M., & Felice, R. D. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00031-9 · Cited by 15
Toward sampling from undirected probabilistic graphical models using a D-Wave quantum annealer
Koshka, Y., & Novotny, M. A. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02781-8 · Cited by 15
Quantum Computing in a Statistical Context
Wang, Y., & Liu, H. (2022) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-042720-024040 · Cited by 22
“See Albash et al. (2015), Boixo et al. (2014, 2016, 2018), Brady and van Dam (2016), Rønnow et al. (2014), and Wang et al. (2016) for more discussions.”
Breakdown of the Weak-Coupling Limit in Quantum Annealing
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.054033 · Cited by 21
Self-citationCounterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 20
Anisotropic Landau-Lifshitz-Gilbert models of dissipation in qubits
Crowley, P. J. D., & Green, A. G. (2016) · Physical Review A · doi:10.1103/physreva.94.062106 · Cited by 22
Koshka, Y., Perera, D., Hall, S., & Novotny, M. A. (2017) · Neural Computation · doi:10.1162/neco_a_00974 · Cited by 17
Classical Control of Large-Scale Quantum Computers
Devitt, S. J. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-08494-7_3 · Cited by 14
“…as Quantum Key Distribution (QKD) and Quantum random number generators and many non-physicists are aware of the D-Wave quantum computer, which while scientifically controversial is an attempt to build a analogue quantum computer capable of solving certain types of optimisation problems [9,10,11].”
BackgroundLiu, B., Zhu, L., Yang, Z., & He, G. (2023) · Communications in Computational Physics · doi:10.4208/cicp.oa-2022-0081 · Cited by 19
Probing critical phenomena in open quantum systems using atom arrays
Fang, F., Wang, K., Liu, V. S., Wang, Y., Cimmino, R., Wei, J., Bintz, M., Parr, A., Kemp, J., Ni, K.-K., et al. (2025) · Science · doi:10.1126/science.adq0278 · Cited by 56
“Second, the long-range entanglement inherent to quantum critical states is inhibited by the presence of decoherence in noisy-intermediate-scale-quantum simulators [25–28].”
Least-squares solutions to polynomial systems of equations with quantum annealing
Chang, T. H., Lux, T. C. H., & Tipirneni, S. S. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2489-x · Cited by 20
Noise can speed Markov chain Monte Carlo estimation and quantum annealing
Franzke, B., & Kosko, B. (2019) · Physical review. E · doi:10.1103/physreve.100.053309 · Cited by 15
“Advances by DWave Systems have brought quantum annealers to market and shown how adiabatic quantum computers can have real-world applications [43].”
BackgroundQuantum annealing with capacitive-shunted flux qubits
Matsuzaki, Y., Hakoshima, H., Seki, Y., & Kawabata, S. (2019) · Japanese Journal of Applied Physics · doi:10.7567/1347-4065/ab5b30 · Cited by 18
“[10] Sergio Boixo, Troels F Rønnow, Sergei V Isakov, Zhihui Wang, David Wecker, Daniel A Lidar, John M Martinis, and Matthias Troyer.”
BackgroundHilbert space fragmentation and Ashkin-Teller criticality in fluctuation coupled Ising models
Patil, P., & Sandvik, A. W. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.101.014453 · Cited by 14
Analogue Quantum Simulation: A New Instrument for Scientific Understanding
Hangleiter, D., Carolan, J., & Thébault, K. P. Y. (2022) · Springer eBooks · doi:10.1007/978-3-030-87216-8 · Cited by 22
Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
Passarelli, G., Yip, K.-W., Lidar, D. A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.032431 · Cited by 17
Self-citationThe performance of the quantum adiabatic algorithm on spike Hamiltonians
Kong, L., & Crosson, E. (2017) · International Journal of Quantum Information · doi:10.1142/s0219749917500113 · Cited by 15
“Simulated annealing (SA) has been contrasted with QA in several benchmarking studies [5, 6, 7, 8], and in some cases analytical comparisons between the methods have been made as well [9, 10].”
ResultPutting “Quantumness” to the Test
Smith, G., & Smolin, J. A. (2013) · Physics · doi:10.1103/physics.6.105 · Cited by 14
Viewing vanilla quantum annealing through spin glasses
Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab6ba · Cited by 20
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500424 · Cited by 21
Wang, C., & JONCKHEERE, E. A. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-2117-1 · Cited by 17
Can a Quantum Walk Tell Which Is Which?A Study of Quantum Walk-Based Graph Similarity
Minello, G., Rossi, L., & Torsello, A. (2019) · Entropy · doi:10.3390/e21030328 · Cited by 14
“An increasing number of researchers is looking at challenges emerging at the intersection of these two fields, from quantum annealing as an alternative to classical simulated annealing [1,2] to quantum parallelism as a source of algorithmic speedup [3,4].”
BackgroundPatch-planting spin-glass solution for benchmarking
Wang, W., Mandrà, S., & Katzgraber, H. G. (2017) · Physical review. E · doi:10.1103/physreve.96.023312 · Cited by 20
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2018) · arXiv (Cornell University) · Cited by 19
Ising formulation of associative memory models and quantum annealing recall
Santra, S., Shehab, O., & Balu, R. (2017) · Physical Review A · doi:10.1103/physreva.96.062330 · Cited by 18
FJQuantum – A Quantum Object Oriented Language
Feitosa, S. D. S., Vizzotto, J. K., Piveta, E. K., & Bois, A. R. D. (2016) · Electronic Notes in Theoretical Computer Science · doi:10.1016/j.entcs.2016.09.007 · Cited by 13
“Although there are no quantum computers for general purpose, there are several works [15,29,13,14,27,18,7] on different approaches to process quantum information.”
BackgroundA nonequilibrium quantum phase transition in strongly coupled spin chains
Mascarenhas, E., Giudice, G., & Savona, V. (2017) · Quantum · doi:10.22331/q-2017-12-20-40 · Cited by 14
Yu, S., & Nabil, T. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.730685 · Cited by 19
Practical Entanglement Estimation for Spin-System Quantum Simulators
Marty, O., Cramer, M., & Plenio, M. B. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.105301 · Cited by 16
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.