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 101–200 of 796
A cross-disciplinary introduction to quantum annealing-based algorithms
Venegas-Andraca, S. E., Cruz-Santos, W., McGeoch, C., & Lanzagorta, M. (2018) · Contemporary Physics · doi:10.1080/00107514.2018.1450720 · Cited by 83
“Each depicted frequency is the average over 100 gauge transformations [81].”
BackgroundResultAdiabatic evolution on a spatial-photonic Ising machine
Pierangeli, D., Marcucci, G., & Conti, C. (2020) · Optica · doi:10.1364/optica.398000 · Cited by 104
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
Multiple query optimization on the D-Wave 2X adiabatic quantum computer
Trummer, I., & Koch, C. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2947618.2947621 · Cited by 75
Classical signature of quantum annealing
Smolin, J. A., & Smith, G. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00052 · Cited by 79
“[1, 2] attempt to distinguish between these possibilities by proposing tests for quantumness that the D-Wave machine passes but a purely classical computer should fail.”
BackgroundMethodInfluentialHibat-Allah, M., Inack, E. M., Wiersema, R., Melko, R. G., & Carrasquilla, J. (2021) · Nature Machine Intelligence · doi:10.1038/s42256-021-00401-3 · Cited by 78
Zero-temperature quantum annealing bottlenecks in the spin-glass phase
Knysh, S. (2016) · Nature Communications · doi:10.1038/ncomms12370 · Cited by 79
“Benchmarking of a hardware implementation of QA, courtesy of D-Wave Systems, shows no improvement in the scaling of the performance 13,14 .”
MethodA quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo-Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., & Smelyanskiy, V. N. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02347-y · Cited by 75
Recent Progress in Quantum Simulation Using Superconducting Circuits
Paraoanu, G. S. (2014) · Journal of Low Temperature Physics · doi:10.1007/s10909-014-1175-8 · Cited by 87
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 99
“Precise hardware developments implemented in the D-wave’s quantum annealer [18,19,20,21,25,26,27,29,30,31] have opened a new paradigm for analog quantum computation.”
BackgroundPhase-Binarized Spin Hall Nano-Oscillator Arrays: Towards Spin Hall Ising Machines
Houshang, A., Zahedinejad, M., Muralidhar, S., Chęciński, J., Khymyn, R., Rajabali, M., Fulara, H., Awad, A. A., Dvornik, M., & Åkerman, J. J. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014003 · Cited by 90
Prime factorization using quantum annealing and computational algebraic geometry
Dridi, R., & Alghassi, H. (2017) · Scientific Reports · doi:10.1038/srep43048 · Cited by 76
Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 71
Self-citationQuantum Volume in Practice: What Users Can Expect From NISQ Devices
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3184764 · Cited by 75
“Lastly, the QV metric is designed specifically for gate model (i.e. universal) quantum computation devices; however there are restricted quantum computational devices in the NISQ-era including Quantum Annealers [19, 29, 44, 35, 13, 31] and Boson Samplers [24, 6, 48, 1].”
BackgroundZhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 76
“Tests [21, 22, 24, 27] by different research teams suggest that the D-Wave quantum annealer does benefit from quantum effects.”
BackgroundNoise‐enhanced spatial‐photonic Ising machine
Pierangeli, D., Marcucci, G., Brunner, D., & Conti, C. (2018) · Nanophotonics · doi:10.1515/nanoph-2020-0119 · Cited by 92
Mandrà, S., Zhu, Z., & Katzgraber, H. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070502 · Cited by 72
“tained by considering level crossings between ground states and low-energy excited states: instances with less degeneracy tend to be harder and more likely to have level crossings [33, 42]; therefore, a longer annealing time is required to reach a stationary distribution of ground states.”
BackgroundChancellor, N., Zohren, S., & Warburton, P. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0022-6 · Cited by 76
Unraveling Quantum Annealers using Classical Hardness
Martin-Mayor, V., & Hen, I. (2015) · Scientific Reports · doi:10.1038/srep15324 · Cited by 61
Quantum Neuromorphic Computing with Reservoir Computing Networks
Ghosh, S., Nakajima, K., Krisnanda, T., Fujii, K., & Liew, T. C. H. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100053 · Cited by 90
Quantum computation via Floquet topological edge modes
Bomantara, R. W., & Gong, J. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.165421 · Cited by 78
“Such control of magnetic field is expected to be plausible with current technology [69].”
BackgroundMany-body localization and quantum ergodicity in disordered long-range Ising models
Hauke, P., & Heyl, M. (2015) · Physical Review B · doi:10.1103/physrevb.92.134204 · Cited by 85
Scalable Spin-Glass Optical Simulator
Pierangeli, D., Rafayelyan, M. S., Conti, C., & Gigan, S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034087 · Cited by 81
Lappala, A. (2024) · Current Opinion in Structural Biology · doi:10.1016/j.sbi.2024.102919 · Cited by 70
Temperature Scaling Law for Quantum Annealing Optimizers
Albash, T., Martin-Mayor, V., & Hen, I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.110502 · Cited by 65
Autonomous Probabilistic Coprocessing With Petaflips per Second
Sutton, B., Faria, R., Ghantasala, L. A., Jaiswal, R., Camsari, K. Y., & Datta, S. (2020) · IEEE Access · doi:10.1109/access.2020.3018682 · Cited by 84
Experimental Observation of Phase Transitions in Spatial Photonic Ising Machine
Fang, Y., Huang, J., & Ruan, Z. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.043902 · Cited by 80
Quantum algorithms for jet clustering
Wei, A. Y., Naik, P., Harrow, A. W., & Thaler, J. (2020) · Physical review. D/Physical review. D. · doi:10.1103/physrevd.101.094015 · Cited by 75
“In a quantum annealer such as the D-Wave system [8], the solution to an optimization problem is encoded in the ground state of a target Hamiltonian.”
BackgroundMany-body quantum heat engines with shortcuts to adiabaticity
Hartmann, A., Mukherjee, V., Niedenzu, W., & Lechner, W. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023145 · Cited by 76
“[71] S.”
MethodDiscrete time crystal in globally driven interacting quantum systems without disorder
Yu, W. C., Tangpanitanon, J., Glaetzle, A. W., Jaksch, D., & Angelakis, D. G. (2019) · Physical Review A · doi:10.1103/physreva.99.033618 · Cited by 67
Efficiency of quantum vs. classical annealing in nonconvex learning problems
Baldassi, C., & Zecchina, R. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1711456115 · Cited by 64
Smelyanskiy, V., Kechedzhi, K., Boixo, S., Isakov, S. V., Neven, H., & Altshuler, B. L. (2020) · Physical Review X · doi:10.1103/physrevx.10.011017 · Cited by 85
Self-citationGenome assembly using quantum and quantum-inspired annealing
Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-88321-5 · Cited by 63
“One of the examples of available hardware for quantum annealing is the devices by D-Wave System [29–31]; however, their ability to demonstrate computation speed-up is still a subject of debates [31–36].”
MethodQuantum Algorithms for Scientific Computing and Approximate Optimization
Hadfield, S. (2018) · arXiv (Cornell University) · doi:10.7916/d8x650c9 · Cited by 31
“It remains an important open problem whether or not such devices, or even future improved versions, can provide advantages for real-world optimization problems [42, 78].”
BackgroundQuantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 67
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Readiness of Quantum Optimization Machines for Industrial Applications
Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S. V., Zhu, Z., O’Gorman, B., Katzgraber, H. G., Diedrich, A., Neven, H., de Kleer, J., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014004 · Cited by 62
“Bimodal instances were the first to be used in benchmarking studies [12, 13] and are the simplest to generate.”
InfluentialSelf-citationA transmon quantum annealer: decomposing many-body Ising constraints into pair interactions
Leib, M., Zoller, P., & Lechner, W. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015008 · Cited by 63
“dered so far. Adiabatic quantum computing [5] has recently gained considerable attention because of the prospect to solve problems that can be mapped to classical optimizations [6, 7, 8, 9] eciently [10, 11, 12, 13, 14, 15, 16]. In the spin-glass formulation of adiabatic quantum annealing [5], the system is slowly swi…”
BackgroundImplementation of Quantum Annealing: A Systematic Review
Yulianti, L. P., & Surendro, K. (2022) · IEEE Access · doi:10.1109/access.2022.3188117 · Cited by 79
Jiang, M., Shan, K., He, C., & Li, C. (2023) · Nature Communications · doi:10.1038/s41467-023-41647-2 · Cited by 97
“To overcome these limitations, researchers have explored various analog technologies including superconducting qubits 6,7 , coherent lights 8 – 10 , CMOS oscillators 11,12 , nano oscillators 13 – 15 , and memristors-based analog Ising machines 16 – 18 .”
On Complexity of the Quantum Ising Model
Bravyi, S. B., & Hastings, M. B. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2787-4 · Cited by 110
“Finally, Theorem 2 offers new insights on the computational power of the adiabatic quantum computing (AQC) with TIM which received a significant attention recently [21, 22, 23].”
BackgroundPrakash, P. Y., Irinyi, L., Halliday, C. L., Chen, W., Robert, V., & Meyer, W. (2017) · Journal of Clinical Microbiology · doi:10.1128/jcm.02084-16 · Cited by 90
“Future trends may also be a foreseeable application of quantum computing (QBITS) with advanced processing abilities for an aptly manageable, interlinked, and easily retrievable online fungal database (55).”
BackgroundGPU-based Ising computing for solving max-cut combinatorial optimization problems
Cook, C., Zhao, H., Sato, T. G., Hiromoto, M., & Tan, S. X.-D. (2019) · Integration · doi:10.1016/j.vlsi.2019.07.003 · Cited by 70
Shortcuts to adiabaticity for quantum annealing
Takahashi, K. (2017) · Physical Review A · doi:10.1103/physreva.95.012309 · Cited by 70
Computational complexity continuum within Ising formulation of NP problems
Kalinin, K. P., & Berloff, N. G. (2022) · Communications Physics · doi:10.1038/s42005-021-00792-0 · Cited by 78
“The standard quantitative measure of performance of such stochastic algorithms is the time to solution metric 57,59 , which re fl ects the time it takes to fi nd the ground state with 99% con fi dence: where t run is the time for running an algorithm once, R 99 is the number of runs for fi nding the…”
BackgroundIlla, M., & Savage, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052605 · Cited by 79
Dissipation in adiabatic quantum computers: lessons from an exactly solvable model
Keck, M., Montangero, S., Santoro, G. E., Fazio, R., & Rossini, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cef · Cited by 72
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Self-citationQuantum Approximate Optimization With Parallelizable Gates
Lechner, W. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3034798 · Cited by 57
“It is an open question whether a quantum speedup for hard combinatorial problems can be expected with this protocol [27], [28].”
BackgroundRapid laser solver for the phase retrieval problem
Tradonsky, C., Gershenzon, I., Pal, V., Chriki, R., Friesem, A. A., Raz, O., & Davidson, N. (2019) · Science Advances · doi:10.1126/sciadv.aax4530 · Cited by 57
Mitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 69
“D-Wave have currently launched a 5000 qubits processor named as Advantage.”
Wang, Z., & Wang, X. (2025) · International Journal for Numerical Methods in Engineering · doi:10.1002/nme.70073 · Cited by 57
“Their inherent parallelism and superior computational speed for specific tasks—evident in Grover’s search algorithm [25], quantum annealing [24, 26, 27], and quantum neural networks [28–30]—could drastically reduce computational time and resource demands.”
Self-citationBenchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
Zaborniak, T., & de Sousa, R. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3050449 · Cited by 70
Scalable Emulation of Sign-Problem–Free Hamiltonians with Room-Temperature p -bits
Camsari, K. Y., Chowdhury, S., & Datta, S. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.034061 · Cited by 67
Obstructions to classically simulating the quantum adiabatic algorithm
Hastings, M. B. (2013) · Quantum Information and Computation · doi:10.26421/qic13.11-12-8 · Cited by 32
Monte Carlo simulation of stoquastic Hamiltonians
Bravyi, S. B. (2015) · Quantum Information and Computation · doi:10.26421/qic15.13-14-3 · Cited by 104
Shaping the Future of the Application of Quantum Computing in Intelligent Transportation System
Wang, S., Pei, Z., Wang, C., & Wu, J. (2021) · Intelligent and Converged Networks · doi:10.23919/icn.2021.0019 · Cited by 61
Liu, C.-W., Polkovnikov, A., & Sandvik, A. W. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.147203 · Cited by 55
Quantum annealing: The fastest route to quantum computation?
Laumann, C. R., Moessner, R., Scardicchio, A., & Sondhi, S. L. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02344-2 · Cited by 54
Clustering of Nonergodic Eigenstates in Quantum Spin Glasses
Baldwin, C. L., Laumann, C. R., Pal, A., & Scardicchio, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.127201 · Cited by 57
Training Restricted Boltzmann Machines With a D-Wave Quantum Annealer
Dixit, V., Selvarajan, R., Alam, M. A., Humble, T. S., & Kais, S. (2021) · Frontiers in Physics · doi:10.3389/fphy.2021.589626 · Cited by 74
Experimental quantum annealing: case study involving the graph isomorphism problem
Zick, K. M., Shehab, O., & French, M. (2015) · Scientific Reports · doi:10.1038/srep11168 · Cited by 64
Boosting Monte Carlo simulations of spin glasses using autoregressive neural networks
McNaughton, B., Miloševıć, M. V., Perali, A., & Pilati, S. (2020) · Physical review. E · doi:10.1103/physreve.101.053312 · Cited by 67
“[52]).”
Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
Hartmann, A., & Lechner, W. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab14a0 · Cited by 66
Programmable Quantum Annealing Architectures with Ising Quantum Wires
Qiu, X., Zoller, P., & Li, X. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020311 · Cited by 62
Challenges of variational quantum optimization with measurement shot noise
Scriva, G., Astrakhantsev, N., Pilati, S., & Mazzola, G. (2024) · Physical Review A · doi:10.1103/physreva.109.032408 · Cited by 81
“This procedure is standard in benchmarking quantum devices, such as quantum annealers, versus classical optimizers [6, 7, 9].”
BackgroundA quantum annealer with fully programmable all-to-all coupling via Floquet engineering
Onodera, T., Ng, E., & McMahon, P. L. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0279-z · Cited by 61
Quantum Annealing versus Digital Computing: An Experimental Comparison
Jünger, M., Lobe, E., Mutzel, P., Reinelt, G., Rendl, F., Rinaldi, G., & Stollenwerk, T. (2021) · ACM Journal of Experimental Algorithmics · doi:10.1145/3459606 · Cited by 47
“Often, special purpose algorithms tailored to the considered optimization problem have been used in these comparisons with the result that the classical algorithms dominate the quantum annealing [1, 11, 38, 57, 59, 68].”
Jiang, J., & Chu, C.-W. (2023) · IEEE Access · doi:10.1109/access.2023.3318206 · Cited by 66
“However, as mentioned in [26], there are ongoing scientific debates [27], [28], [29], [30] arguing whether quantum annealers can provide better problem solving capabilities than classical computers.”
BackgroundUncertain fate of fair sampling in quantum annealing
Könz, M. S., Mazzola, G., Ochoa, A. J., Katzgraber, H. G., & Troyer, M. (2019) · Physical Review A · doi:10.1103/physreva.100.030303 · Cited by 69
“[21] S.”
Self-citationBuilding an iterative heuristic solver for a quantum annealer
Rosenberg, G., Vazifeh, M., Woods, B., & Haber, E. (2016) · Computational Optimization and Applications · doi:10.1007/s10589-016-9844-y · Cited by 49
Coherent Ising Machines with Optical Error Correction Circuits
Reifenstein, S., Kako, S., Khoyratee, F., Leleu, T. G., & Yamamoto, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100077 · Cited by 59
Non-stoquastic Hamiltonians in quantum annealing via geometric phases
Vinci, W., & Lidar, D. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0037-z · Cited by 48
Self-citationQuantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-32041-5_13 · Cited by 47
Maximum-Entropy Inference with a Programmable Annealer
Chancellor, N., Szoke, S., Vinci, W., Aeppli, G., & Warburton, P. A. (2016) · Scientific Reports · doi:10.1038/srep22318 · Cited by 46
“In the case where minimum energy ( i.e. maximum likelihood) solutions are retained, its use in machine learning [31, 32] and a number of other applications [33, 34, 35, 36, 37, 38] has been proposed and/or demonstrated.”
Scaling analysis and instantons for thermally assisted tunneling and quantum Monte Carlo simulations
Jiang, Z., Smelyanskiy, V. N., Isakov, S. V., Boixo, S., Mazzola, G., Troyer, M., & Neven, H. (2017) · Physical Review A · doi:10.1103/physreva.95.012322 · Cited by 49
Self-citationScaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 97
“These types of instances have been widely used to benchmark the previous D-Wave QPUs (with the Chimera hardware graph) against classical algorithms [4, 8, 9].”
Self-citationAdame, J. I., & McMahon, P. L. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab935a · Cited by 42
“These problems have previously been studied in the context of quantum annealing in references [5, 6, 34].”
BackgroundMishra, A., Albash, T., & Lidar, D. A. (2018) · Nature Communications · doi:10.1038/s41467-018-05239-9 · Cited by 56
Self-citationTropical Tensor Network for Ground States of Spin Glasses
Liu, J.-G., Wang, L., & Zhang, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.090506 · Cited by 69
“[63].”
AlKawak, O. A., Ozturk, B. A., Jabbar, Z. S., & Mohammed, H. J. (2022) · Optik · doi:10.1016/j.ijleo.2022.170396 · Cited by 50
Determination and correction of persistent biases in quantum annealers
Perdomo-Ortiz, A., O’Gorman, B., Fluegemann, J., Biswas, R., & Smelyanskiy, V. N. (2016) · Scientific Reports · doi:10.1038/srep18628 · Cited by 43
“Early research into the performance of D-Wave devices has indicated the presence of significant imprecision in the setting of the fields that define the problem to be solved, a consequentially significant impairment to the successful solution of the problem [13, 18, 20, 21].”
BackgroundResource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013) · Annalen der Physik · doi:10.1002/andp.201300120 · Cited by 33
“A vigorous debate on the quantum nature of the D-Wave computer is currently underway [16, 18, 19].”
BackgroundQuantum algorithm for energy matching in hard optimization problems
Baldwin, C. L., & Laumann, C. R. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.224201 · Cited by 57
Low-Depth Mechanisms for Quantum Optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030312 · Cited by 43
Self-citationIsing Machine Based on Electrically Coupled Spin Hall Nano-Oscillators
McGoldrick, B. C., Sun, J., & Liu, L. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014006 · Cited by 49
“[8] [52] [53] [4, 54] [6, 55] [8, 56] [this work]”
Low depth mechanisms for quantum optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2020) · arXiv · doi:10.48550/arxiv.2008.08615 · Cited by 45
Self-citationThermalization, Freeze-out, and Noise: Deciphering Experimental Quantum Annealers
Marshall, J., Rieffel, E. G., & Hen, I. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064025 · Cited by 46
“This knowledge circumvents the need to verify the ground state energy using exact (provable) solvers, which rapidly become too expensive computationally as the number of variables grows, and which were employed in earlier benchmarking studies [33, 34].”
Analyzing the Quantum Annealing Approach for Solving Linear Least Squares Problems
Borle, A., & Lomonaco, S. J. (2018) · Lecture notes in computer science · doi:10.1007/978-3-030-10564-8_23 · Cited by 48
Temperature Control in Dissipative Cavities by Entangled Dimers
Dağ, C. B., Niedenzu, W., Özaydin, F., Müstecaplıoğlu, Ö. E., & Kurizki, G. (2019) · The Journal of Physical Chemistry C · doi:10.1021/acs.jpcc.8b11445 · Cited by 50
From Charge to Spin and Spin to Charge: Stochastic Magnets for Probabilistic Switching
Camsari, K. Y., Debashis, P., Ostwal, V., Pervaiz, A. Z., Shen, T., Chen, Z., Datta, S., & Appenzeller, J. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2020.2966925 · Cited by 47
“Indeed, there has been a lot of work in the context of special solvers for computationally hard problems in recent years, leveraging quantum effects, optical devices, digital logic, magnetic, and other types of materials [16]–[25].”
BackgroundSuzuki, K., & Takahashi, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.032016 · Cited by 46
“t is a method solving combinatorial optimization problems and has attracted intensive attention recently, as quantum annealing [15–19], due to its use for a device manufactured by DWave Systems, Inc. [20, 21]. The solution of the problem is set to thegroundstate ofthe IsingHamiltonian. TheHamiltonian is slowly changed…”
MethodQuantum Information Processing Algorithms with Emphasis on Machine Learning
Uehara, G. S., Spanias, A., & Clark, W. (2021) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa52424.2021.9555570 · Cited by 49
“Regarding implementation, we note that quantum algorithms can also run on quantum annealing systems [128], [129].”
MethodEmbedding Overhead Scaling of Optimization Problems in Quantum Annealing
Könz, M. S., Lechner, W., Katzgraber, H. G., & Troyer, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040322 · Cited by 67
Self-citationOn the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“However, through careful comparison with both complete search solvers [59, 67, 18] and specialized heuristics [73, 8, 72, 56, 55, 70, 36, 2], it was determined that the available QA hardware was a far cry from state-of-the-art optimization methods.”
BackgroundMethodInfluentialFujii, K., & Nakajima, K. (2021) · Natural computing series · doi:10.1007/978-981-13-1687-6_18 · Cited by 106
Quantum Simulation of Dissipative Processes without Reservoir Engineering
Candia, R. D., Pedernales, J. S., del Campo, A., Solano, E., & Casanova, J. (2015) · Scientific Reports · doi:10.1038/srep09981 · Cited by 51
Enhancing quantum annealing performance for the molecular similarity problem
Hernandez, M., & Aramon, M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1586-y · Cited by 43
“A common strategy to average out systematic errors is to perform gauge transformations between each call to the quantum annealer [7].”
BackgroundProbabilistic nonunitary gate in imaginary time evolution
Liu, T., Liu, J.-G., & Fan, H. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03145-6 · Cited by 63
Charged particle tracking with quantum annealing optimization
Zlokapa, A., Anand, A., Vlimant, J.-R., Duarte, J. M., Job, J., Lidar, D. A., & Spiropulu, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00054-w · Cited by 54
“Although QA is not thought to generally yield a ground state solution to a QUBO problem in polynomial time, it may reduce the size of the constant c in the time complexity ∑K i=1 exp (cmi), potentially offering a significant speedup over classical methods [37, 38].”
BackgroundSelf-citation
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.