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 601–700 of 796
Open-system modeling of quantum annealing: theory and applications
Yip, K.-W. (2021) · arXiv (Cornell University) · doi:10.25549/usctheses-c89-443939 · Cited by 3
Administration, U. A. S. F. H. R. A., Alexeev, Y., USDOE Office of Science (SC), Eidenbenz, S., Mezzacapo, A., & Pakin, S. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2280557 · Cited by 3
Sahai, T., Mishra, A., Pasini, J. M., & Jha, S. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i02.5524 · Cited by 2
Phase and frequency-resolved microscopy of operating spin Hall nano-oscillator arrays
Alemán, A., Awad, A. A., Muralidhar, S., Khymyn, R., Kumar, A., Houshang, A., Hanstorp, D., & Åkerman, J. J. (2024) · Nanoscale Horizons · doi:10.1039/d4nh00260a · Cited by 2
Hashem, M., Mohamed, A. A., Hessian, H. A., Breaz, D. V., Amourah, A., & El-Deeb, S. M. (2025) · Symmetry · doi:10.3390/sym17030400 · Cited by 2
Addressing the Connectivity Bottleneck With BEOL FeFETs for 3-D CMOS + X Ising Machines
Pantha, T. H., Khanna, A., Ye, H., Niazi, S., Kamal, M. P., Chakraborty, B., Alam, S., Weinstock, E. G., Babu, N., Mukhopadhyay, S., et al. (2025) · IEEE Transactions on Electron Devices · doi:10.1109/ted.2025.3562510 · Cited by 2
“These include super-conducting qubits [5], [6], CMOS oscillators [7], [8], [9], [10], phase-transition nano-oscillators (PTNOs) [3], [11], degenerate optical parametric oscillators [12], [13], probabilistic-bit (p-bit) [4], [14], and chaotic-bit (c-bit) [15], [16].”
Henke, K., Pelofske, E., Kenyon, G. T., & Hahn, G. (2025) · npj Unconventional Computing · doi:10.1038/s44335-025-00028-2 · Cited by 3
“D-Wave manufactures quantum annealers using superconducting fl ux qubits 6,7 ,severalgenerationsofwhichhavebeenutilizedinalargenumberof studies of different optimization problems and physical spin systems 34 – 38 .”
Iterative quantum optimization of spin glass problems with rapidly oscillating transverse fields
Barton, B., Sagal, J., Feeney, S., Grattan, G., Patnaik, P., Oganesyan, V., Carr, L. D., & Kapit, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae0f4d · Cited by 4
“A wide array of heuristic quantum algorithms such as analog quantum annealing [1, 2, 3, 4, 5, 6, 7], adiabatic quantum computing (AQC) [8, 9], quantum approximation optimization algorithms (QAOA) [10], and more exotic variations such as adaptive derivative assembled problem tailored (ADAPT)-QAOA…”
Dynamic programming in economics on a quantum annealer
Fernández‐Villaverde, J., & Hull, I. (2026) · Quantitative Economics · doi:10.3982/qe2555 · Cited by 6
“Long chains reduce the number of available qubits to represent the problem and require tuning a chain strength hyperparameter.”
A Resource Efficient Ising Model‐Based Quantum Sudoku Solver
Wang, W.-L., Tang, M.-H., Wang, K., Basit, M. A., Tian, Y., & Haque, M. S. (2026) · Software Practice and Experience · doi:10.1002/spe.70063 · Cited by 2
Brady, L. T., & van Dam, W. (2017) · Physical Review A · doi:10.1103/physreva.95.052350 · Cited by 2
Vandelli, M., Lignarolo, A., Cavazzoni, C., & Dragoni, D. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04560-1 · Cited by 6
“So far, problems of industrial interest were mainly studied with quantum annealing techniques [12–14], which is specifically tailored to tackle this kind of problems [15–21], including optimization of antenna networks [22–24].”
Transforming machine learning: An exploration of quantum algorithms and their applications
Pawan, Y. V. R. N., & Kolla, B. P. (2025) · Advances in computers · doi:10.1016/bs.adcom.2025.06.005 · Cited by 2
Reliability of Digitized Quantum Annealing and the Decay of Entanglement
Peterson, J. P. S., Sarthour, R. S., Souza, A. M., Oliveira, I. S., Brito, F., & de Melo, F. (2018) · Annalen der Physik · doi:10.1002/andp.201800007 · Cited by 3
Efficient Criteria of Quantumness for a Large System of Qubits
Watabe, S., Serikow, M. Z., Kawabata, S., & Zagoskin, A. M. (2022) · Frontiers in Physics · doi:10.3389/fphy.2021.773128 · Cited by 3
“[20, 22] are consistent with quantum annealing.”
BackgroundInfluentialDecimeter Level Cooperative Direct Localization With Ising Model Approach
Akbari, S., & Valaee, S. (2024) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2024.3413671 · Cited by 2
“Although QUBO problems and Ising model problems, such as (21), are NP-hard, their structure allows us to use efficient solvers, such as the quantum-based solvers, to find their solution [52].”
BackgroundSandt, R., Bouar, Y. L., & Spatschek, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033047 · Cited by 2
Compressed sensing enhanced by a quantum approximate optimization algorithm
Chevalier, B., Roga, W., & Takeoka, M. (2024) · Physical Review A · doi:10.1103/physreva.110.062410 · Cited by 4
Dissipation-induced quantum homogenization for temporal information processing
Yosifov, A., Iyer, A., & Vedral, V. (2025) · Physical Review A · doi:10.1103/physreva.111.012622 · Cited by 2
PearSAN: A Machine Learning Method for Inverse Design Using Pearson Correlated Surrogate Annealing
Bezick, M., Wilson, B. A., Iyer, V., Chen, Y., Shalaev, V. M., Kais, S., Kildishev, A. V., Lackey, B., & Boltasseva, A. E. (2026) · Advanced Optical Materials · doi:10.1002/adom.202500249 · Cited by 3
Recursive simulation of quantum annealing
Sowa, A., Everitt, M. J., Samson, J. H., Savel'ev, S. E., Zagoskin, A. M., Heidel, S., & Zúñiga-Anaya, J. C. (2015) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/48/41/415301 · Cited by 2
Performance of the quantum adiabatic algorithm on constraint satisfaction and spin glass problems
Hen, I., & Young, A. P. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02343-3 · Cited by 2
Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-15)
Barták, R., & Salido, M. Á. (2015) · Cited by 2
Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation
Yuge, T. (2018) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.87.124002 · Cited by 2
Quantum Information and Statistical Mechanics: An Introduction to Frontier
Fujii, K. (2013) · Interdisciplinary Information Sciences · doi:10.4036/iis.2013.1 · Cited by 3
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0006 · Cited by 3
Cloning and Beyond: A Quantum Solution to Duplicate Code
Jhaveri, S., Krone-Martins, A., & Lopes, C. V. (2023) · ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!) · doi:10.1145/3622758.3622889 · Cited by 7
Liao, Z., Tang, S., Sarker, M. S., Yamahara, H., Seki, M., & Tabata, H. (2024) · Advanced Physics Research · doi:10.1002/apxr.202400035 · Cited by 2
Comparison of quantum annealing and simulated annealing
Nishimori, H. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02338-0 · Cited by 3
Three-step implementation of any n×n unitary with a complete graph of n qubits
Katabarwa, A., & Geller, M. R. (2015) · Physical Review A · doi:10.1103/physreva.92.032306 · Cited by 2
Quantum Artificial Intelligence for Natural Language Processing Applications
Ayanzadeh, R. (2018) · ACM Technical Symposium on Computer Science Education (SIGCSE) · doi:10.1145/3159450.3162338 · Cited by 3
Fundamental Limitation on Cooling under Classical Noise
Jing, J., Chhajlany, R. W., & Wu, L.-A. (2017) · Scientific Reports · doi:10.1038/s41598-017-00194-9 · Cited by 2
Padilha, D., Weinstock, S., & Hodson, M. J. (2019) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2019.8916450 · Cited by 3
“Sampling from this Boltzmann distribution has previously been used to study the behavior of NISQ devices such as those by D-Wave Systems[8], [9], [41].”
BackgroundMethodYoshimura, N., Tawada, M., Tanaka, S., Arai, J., Yagi, S., Uchiyama, H., & Togawa, N. (2021) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2020edp7026 · Cited by 2
“TTS is often used as an indicator of the optimization performance in the community of Ising machines [5], [19].”
MethodBoosting and Adiabatic Quantum Computing
Wittek, P. (2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00014-1 · Cited by 2
Gates for Adiabatic Quantum ComputingPreprint
Warren, R. H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.2354 · Cited by 4
“References [10-13] describe a superconducting adiabatic quantum processor which currently has 512 qubits.”
BackgroundMethodINFORMATION TRANSMISSION THROUGH BOSONIC GAUSSIAN QUANTUM CHANNELS
Schäfer, J., & Cerf, N. J. (2013) · Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) · Cited by 4
Asynchronous Operations on Qubits in Distributed Simulation Environments using QooSimPreprint
vanBrandwijk, J. J., & Parakh, A. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1612.08609 · Cited by 5
Yacoby, R., Schaar, N., Kellerhals, L., Raz, O., Hermelin, D., & Pugatch, R. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.00537 · Cited by 3
“In [8] it was demonstrated that D-wave is indeed a “quantum annealer”, by comparing its performance to an exact quantum MonteCarlo simulation of D wave system.”
BackgroundSweeping quantum annealing algorithm for constrained optimization problemsPreprint
Yan, Z., Zhou, Z., Wang, Y.-C., Meng, Z. Y., & Zhang, X.-F. (2021) · Research Square · doi:10.21203/rs.3.rs-556216/v1 · Cited by 2
(2014) · Elsevier eBooks · doi:10.1016/b978-0-12-800953-6.00020-7 · Cited by 2
Nguyen, T. L. (2016) · theses.fr (ABES) · doi:10.70675/1a85e00dzb9dcz4e09zad02z778fffaa913f · Cited by 8
Effect of quantum statistics on computational power of atomic quantum annealers
Luo, Y., & Li, X. (2023) · Physical Review A · doi:10.1103/physreva.107.012608 · Cited by 2
Prjamkov, D., Dremel, K., Lang, T., Semmler, S., Weule, M., Firsching, M., Kasperl, S., & Fuchs, T. O. J. (2024) · e-Journal of Nondestructive Testing · doi:10.58286/29236 · Cited by 1
Anomalously slow dynamics of inhomogeneous quantum annealing
Dadgar, M., & Baldwin, C. L. (2025) · Physical Review A · doi:10.1103/physreva.111.062601 · Cited by 3
Infraestrutura Óptica para Comunicação Quântica: Planejamento e Otimização
Assis, K. D. R. (2025) · doi:10.5753/sbrc.2025.6000 · Cited by 1
Kong, Y., Jia, J., Lu, A., Waqar, F., Luo, Y.-C., Li, H., Young, I. A., & Yu, S. (2025) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas56072.2025.11043817 · Cited by 1
Direct comparison of stochastic driven nonlinear dynamical systems for combinatorial optimization
Hou, J., Barzegar, A., & Katzgraber, H. G. (2025) · Physical review. E · doi:10.1103/9vbb-h73q · Cited by 5
Singkanipa, P., Xia, Z., & Lidar, D. A. (2025) · Quantum · doi:10.22331/q-2025-08-05-1821 · Cited by 2
Self-citationVariational determination of penalty parameters in quantum annealing
Qin, J.-Q., Yunlong, Y., & Wang, X. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae30a2 · Cited by 1
“To enhance solution accuracy, one may either evolve the system slowly to approach adiabaticity or conduct repeated short-time QA runs in the diabatic regime with low single-run fidelity [40, 41].”
Globally guided simulated bifurcation for enhanced optimization
Xiao, Z., Huang, Z., Qiu, Q., Liu, Y., Zhuang, J.-P., & Yung, M. (2026) · Physical Review Applied · doi:10.1103/sdb2-stbs · Cited by 3
Quantum Computing in Healthcare: A New Frontier
Gandhi, K., Garg, D., Shah, M., Goel, P., & Gite, S. (2026) · Smart sensors, measurement and instrumentation · doi:10.1007/978-3-032-05507-1_26 · Cited by 1
Adishesha, V. B., Kim, T., Park, S., & Yang, H. (2025) · Technical digest - International Electron Devices Meeting/Technical digest · doi:10.1109/iedm50572.2025.11353732 · Cited by 1
Tabu-Enhanced Simulated Bifurcation for combinatorial optimization
Tao, X.-Z., Zeng, Q.-G., Huang, Z.-J., Zuo, B.-W., Liu, Y.-Q., Zhuang, J., Okawa, H., & Yung, M. (2026) · Communications Physics · doi:10.1038/s42005-026-02538-2 · Cited by 3
Phase analysis of Ising machines and their implications on optimization
Anonymous, Wong, K. Y. M., Wang, J., Hui, D. S. W., Ebler, D., & Sun, J. (2026) · Physical Review Research · doi:10.1103/y38h-f27q · Cited by 3
Comment on “Adiabatically implementing quantum gates” [J. Appl. Phys. 115, 224901 (2014)]
Warren, R. H. (2015) · Journal of Applied Physics · doi:10.1063/1.4918543 · Cited by 1
Can We See or Compute our Way out of Plato's Cave?
Sowa, A. M. Z. A. P. (2014) · Journal of Applied & Computational Mathematics · doi:10.4172/2168-9679.1000192 · Cited by 1
Quantum estimation via parametric amplification in circuit-QED arrays
Wilkins, A., & Sabín, C. (2015) · Physical Review A · doi:10.1103/physreva.92.062102 · Cited by 1
How can the D-Wave machine exhibit long-time quantum behaviour
Drakova, D., & Doyen, G. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/626/1/012057 · Cited by 1
Novotny, M. A., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2016) · Journal of Physics Conference Series · doi:10.1088/1742-6596/750/1/012021 · Cited by 1
Semiclassical description of light–matter coupling
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0004 · Cited by 1
Problem Relaxation Methods for Quantum Minimum Fill-in Algorithm
Komiyama, T., & Suzuki, T. (2023) · IEEE Access · doi:10.1109/access.2023.3324378 · Cited by 1
“Since the development of QA machines with superconducting integrated circuits [3], [4], QA has attracted attention as a metaheuristic solution method for combinatorial optimization problems.”
MethodSubsampling factorization machine annealing
Hama, Y., & Kadowaki, T. (2025) · Physical Review Research · doi:10.1103/qgpq-6dmr · Cited by 4
Relation of classical non-equilibrium dynamics and quantum annealing
Nishimori, H. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/638/1/012016 · Cited by 2
Quantum tunneling vs. thermal effects in experiments on adiabatic quantum computing
Silevitch, D. M., Rosenbaum, T. F., & Aeppli, G. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02340-6 · Cited by 3
Classical Simulated Annealing Using Quantum Analogues
Cour, B. R. L., Troupe, J. E., & Mark, H. M. (2016) · Journal of Statistical Physics · doi:10.1007/s10955-016-1570-4 · Cited by 1
“This problem, also known as the “weak-strong cluster networks” problem, arises from the work byBoixo,Denchev, and colleagues,who use it to study the effects of collective tunneling on quantum annealing [17,19].”
BackgroundFuture Computing Systems (FCS) to Support "Understanding" Capability
Beausoleil, R. G., Vaerenbergh, T. V., Bresniker, K., Graves, C., Keeton, K., Kumar, S., Li, C., Milojicic, D. S., Serebryakov, S., & Strachan, J. P. (2019) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2019.8914712 · Cited by 1
“, entanglement in super-conducting qubits [10]), and classical regime (e.”
BackgroundComputing and optimizing over all fixed-points of discrete systems on large networks
Riehl, J. R., Zimmerman, M. I., Singh, M. F., Bowman, G. R., & Ching, S. (2020) · Journal of The Royal Society Interface · doi:10.1098/rsif.2020.0126 · Cited by 1
Optimization and benchmarking of the thermal cycling algorithm
Barzegar, A., Kankani, A., Mandrà, S., & Katzgraber, H. G. (2021) · Physical review. E · doi:10.1103/physreve.104.035302 · Cited by 1
“As the measure of performance, we use the TTS [33,34] that is defined in the following way: TTS(α) = n(α) τrun, (2) where n(α) is the number of times that the algorithm must be repeated, for a given parameter set α, to find the ground state at least once with a desired probability of pd . τrun is the average run time,…”
BackgroundMethodInfluentialStatistical Bias in D-Wave Qubits
Krauss, T., Giffen, A., Truppelli, P., & Michaels, A. J. (2021) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1936/1/012010 · Cited by 1
“2 role to thermal fluctuations and has allowed for the development of a new class of computing hardware based on adiabatic quantum annealing [4].”
BackgroundResolution of the Frobenius Problem with an Adiabatic Quantum Computer
Ossorio-Castillo, J., & Tornero, J. M. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-80119-9_16 · Cited by 1
On the application of matrix congruence to QUBO formulations for systems of linear equations
Park, S. W., Lee, H., Kim, B. C., Woo, Y., & Jun, K. (2021) · International Conference on Information and Communication Technology Convergence (ICTC) · doi:10.1109/ictc52510.2021.9620851 · Cited by 1
“As one of such computing techniques, quantum annealing method focuses on returning solutions which minimize energy level functions associated to optimization problems [1], [2].”
MethodMany Known Quantum Algorithms Are Optimal: Symmetry-Based Proofs
Крейнович, В., Galindo, O., & Kosheleva, O. M. (2022) · International Journal of Computing · doi:10.47839/ijc.21.4.2776 · Cited by 1
“, [4]–[6], [8], [18], [21], [22], [24], [28], [31], [32], [34].”
Embedding quantum optimization problems using AC driven quantum ferromagnets
Mossi, G., Oganesyan, V., & Kapit, E. (2026) · Physica Scripta · doi:10.1088/1402-4896/ae5fec · Cited by 5
“In contrast, analog quantum optimizers, including quantum annealers (QA) [1, 2, 3, 4, 5, 6, 7, 8, 9, 10] and more recent Rydberg atom systems [11, 12, 13], are much more resilient can routinely solve problems with hundreds or even thousands of variables.”
BackgroundNotes on Adiabatic Quantum ComputersPreprint
Tamir, B., & Cohen, E. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.07617 · Cited by 4
“The coherence time of the SQUID is about 10 ns while the annealing time needed is 5-15 µ s [9].”
BackgroundInfluentialClassical and Quantum Computation in Ground States and Beyond
Crosson, E. (2015) · ResearchWorks at the University of Washington (University of Washington) · Cited by 1
Quantum Annealing Machine based on Floating Gate ArrayPreprint
Tanamoto, T., Higashi, Y., Marukame, T., & Deguchi, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.07565 · Cited by 1
Decomposition Models for Complex Scheduling Applications
Tran, T. T. (2017) · TSpace (University of Toronto) · Cited by 1
Non-local electrodynamics of superconducting wires: implications for flux noise and inductance
Arachchige, S. Y., & Viduranga, P. (2017) · UVic’s Research and Learning Repository (University of Victoria) · Cited by 1
GPU-based Ising Computing for Solving Balanced Min-Cut Graph Partitioning ProblemPreprint
Cook, C., Jin, W., & Tan, S. X.-D. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.00210 · Cited by 1
The Potential of Quantum Annealing for Rapid Solution Structure Identification [Slides]
Coffrin, C., & (NNSA), U. N. N. S. A. (2020) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1599019 · Cited by 2
Author Correction: Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00297-8 · Cited by 3
Self-citationFinding high-order Hadamard matrices by using quantum computersPreprint
Suksmono, A. B., & Minato, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.10919 · Cited by 1
“by introducing a transverse field given by [14, 15]”
MethodTheory of the Magnon ParametronPreprint
Elyasi, M., Saitoh, E., & Bauer, G. E. W. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.09117 · Cited by 2
Alternative Paradigms of ComputationPreprint
Gasarch, W. I., Hayes, N., Kaplitz, E., & Regli, W. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.08916 · Cited by 1
“It must be noted that there is a company called D-Wave that claims to have surpassed 2000 qubits with a technique called “quantum annealing,” but there are heavy doubts as to whether their computers classify as truly quantum [130].”
BackgroundRevolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361 · Cited by 1
Laser trapped Circular Rydberg atoms for quantum simulation
Cortiñas, R. G. (2020) · theses.fr (ABES) · doi:10.70675/bf035e50z0730z4356zbac9z5f57bc8db50a · Cited by 3
Quantum algorithms for energy management optimization problems
Veshchezerova, M. (2022) · theses.fr (ABES) · doi:10.70675/f0d70a66z3066z4c81z8aa7zf9e72830f940 · Cited by 6
Fiszer, R. (2000) · doi:10.15760/etd.2107
“Despite controversy, D-Wave Systems produced a functional quantum computer, and this past year, 2013, a team of scientists proved that it is in fact taking advantage of quantum phenomena, making it a true quantum computer [28].”
BackgroundLocality and complexity in simulations of complex quantum systems
Kliesch, M. (2015) · Universitätsbibliothek der FU Berlin Hochschulschriftenstelle u. Dokumentenserver · doi:10.17169/refubium-11923
Numerical Studies of the Quantum Adiabatic Algorithm
Young, A. P., & Hen, I. (2015) · Journal of Physics Conference Series · doi:10.1088/1742-6596/640/1/012038
“Thus one can compare the running time of real quantum hardware with that of numerical simulations, both classical and simulated quantum annealing, for non-trivial optimization problems [11, 17].”
BackgroundMethodInfluentialFast post processing algorithms for fault tolerant quantum computation using surface codes
Zaribafiyan, A. (2014) · cIRcle (University of British Columbia) · doi:10.14288/1.0166069
“As we can see the sorted list of weights is [1,2,2,100].”
BackgroundShortcuts to adiabaticity and applications to Quantum ComputationPreprint
Santos, A. C. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1603.05071
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.174425 · Cited by 1
2D implementation of quantum annealing algorisms for fourth order binary optimization problemsPreprint
Tang, Y., & Miao, G. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.03887
Mecânica Quântica: da Física para a Computação
Feitosa, S. D. S., Nogueira, C. L., & Vizzotto, J. K. (2016) · Revista ComInG - Communications and Innovations Gazette · doi:10.5902/2448190421137
“Ao invés disso, ele utiliza algo chamado de “annealing”, através do modelo de programação “adiabático” [Boixo et al. 2014].”
From Massive Parallelization to Quantum Computing: Seven Novel Approaches to Query Optimization
Trummer, I. (2016) · Infoscience (Ecole Polytechnique Fédérale de Lausanne) · doi:10.5075/epfl-thesis-6995
“Recent publications seem to answer the first question positively [14, 30, 50, 93], as acknowledged by MIT professor and D-Wave critic Scott Aaronson (“this completely nails down the case for computationally-relevant collective quantum tunneling in the D-Wave machine”4) and other experts.”
BackgroundCOMPILING PROGRAMS FOR AN ADIABATIC QUANTUM COMPUTER
Snow-Kropla, E. (2014) · DalSpace (Dalhousie University)
Computational study of frustrated magnets and disordered bosons
Xu, J. (2014) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r37w67d9w
Current Quantum Information Science and Technology
Pulkkis, G., & Grahn, K. J. (2014) · Advances in information quality and management · doi:10.4018/978-1-4666-5888-2.ch420
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.