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 401–500 of 796
Thermal, quantum and simulated quantum annealing: analytical comparisons for simple models
Bapst, V., & Semerjian, G. (2013) · Journal of Physics Conference Series · doi:10.1088/1742-6596/473/1/012011 · Cited by 15
Classical verification of quantum circuits containing few basis changes
Demarie, T. F., Ouyang, Y., & Fitzsimons, J. F. (2018) · Physical Review A · doi:10.1103/physreva.97.042319 · Cited by 17
From Ansätze to Z-Gates: A NASA View of Quantum Computing
Rieffel, E. G., Hadfield, S., Hogg, T., Mandrà, S., Marshall, J., Mossi, G., O’Gorman, B., Plamadeala, E., Tubman, N. M., Venturelli, D., et al. (2019) · Advances in parallel computing · doi:10.3233/apc190010 · Cited by 19
Quantum computation and quantum simulation
Heng, F. (2018) · Acta Physica Sinica · doi:10.7498/aps.67.20180710 · Cited by 13
Building a Quantum Engineering Undergraduate Program
Asfaw, A., Blais, A., Brown, K. R., Candelaria, J., Cantwell, C., Carr, L. D., Combes, J., Debroy, D. M., Donohue, J. M., Economou, S. E., et al. (2022) · IEEE Transactions on Education · doi:10.1109/te.2022.3144943 · Cited by 12
“Quantum computers, whose nonclassical properties seem to evade the bounds of the extended Church-Turing hypothesis, could provide breakthrough capabilities in optimization [15] and machine learning [16], [17].”
BackgroundQuantum-Inspired Genetic Algorithms for Combinatorial Optimization Problems
Mansori, A., & Nguyeni, S. K. (2023) · Algorithm Asynchronous · doi:10.61963/jaa.v1i1.47 · Cited by 12
“In compared to traditional annealing strategies, quantum-inspired annealing and optimization techniques have shown enhanced performance in tackling optimization issues (Boixo et al., 2014).”
BackgroundDual time scales in simulated annealing of a two-dimensional Ising spin glass
Rubin, S. J., Xu, N., & Sandvik, A. W. (2017) · Physical review. E · doi:10.1103/physreve.95.052133 · Cited by 12
Dynamics of trace distance and Bures correlations in a three-qubit XY chain: Intrinsic noise model
Mohamed, A. ‐. A., Abdel‐Aty, A., & Eleuch, H. (2020) · Physica E Low-dimensional Systems and Nanostructures · doi:10.1016/j.physe.2020.114529 · Cited by 12
A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine
Fukada, K., Parizy, M., Tomita, Y., & Togawa, N. (2021) · IEEE Access · doi:10.1109/access.2021.3116038 · Cited by 15
Fistul, M. V., Neyenhuys, O., Bocaz, A. B., Lisitskiy, M., & Eremin, I. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.104516 · Cited by 12
“For example various SQAs have been used to obtain the ground states of seminal strongly interacting spin systems, namely, the spin-glasses [8], the XY [9] and spin-ice models [10].”
MethodFrustrated Ising Model on D-wave Quantum Annealing Machine
Park, H., & Lee, H. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.074001 · Cited by 18
Mehta, V., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2022) · Physical Review A · doi:10.1103/physreva.105.062406 · Cited by 14
“This is in contrast with the observations in [31], where a unimodal distribution is only obtained for the success probability of solving spin glass problems using simulated annealing.”
BackgroundResultInfluentialExploring Quantum Annealing Architectures: A Spin Glass Perspective
Jaumà, G., García‐Ripoll, J. J., & Pino, M. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300245 · Cited by 13
Witnessing the quantumness of a system by observing only its classical features
Marletto, C., & Vedral, V. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0040-4 · Cited by 13
Sharmin, S., Shim, Y. S., & Roy, K. (2017) · Scientific Reports · doi:10.1038/s41598-017-11732-w · Cited by 12
“∑ ∝ = ± H W x x where j i , 1 (4) B u v v j u i , , ,”
Imoto, T., Seki, Y., & Matsuzaki, Y. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.064004 · Cited by 17
“The Hamiltonian of the flux qubit [54, 55, 31] or capacitively shunted FQs [39] is given by H = 2 L∑ j=1 σ̂(j)z + ∆G 2 L∑ j=1 σ̂(j)x + λ cosωt L∑ j=1 σ̂(j)y + g L−1∑ j=1 σ̂(j)z σ̂ (j+1) z .”
BackgroundInfluentialEfficient realization of quantum search algorithm using quantum annealing processor with dissipation
Homid, A. H., Abdel‐Aty, A., Abdel‐Aty, M., Badawi, A., & Obada, A. ‐. F. (2015) · Journal of the Optical Society of America B · doi:10.1364/josab.32.002025 · Cited by 12
Quantum Annealing and GNN for Solving TSP with QUBO
He, H. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-7801-0_12 · Cited by 22
“During its evolution process, the system’s Hamiltonian becomes minimized, indicating that the system transitions gradually from an initial state to its ground state within the context of quantum states [1].”
BackgroundMethodImplementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor
Lu, Y., Chen, W., Zhang, S., Zhang, K., Zhang, J., Zhang, J.-N., & Kim, K. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.050602 · Cited by 28
Noise amplification at spin-glass bottlenecks of quantum annealing: A solvable model
Roberts, D., Cincio, Ł., Saxena, A., Petukhov, A. G., & Knysh, S. (2020) · Physical Review A · doi:10.1103/physreva.101.042317 · Cited by 19
“Quantum Annealing (QA), a quantum heuristic for approximately solving NP-hard binary optimization problems, is already in commercial use [1–7] in machine learning and artificial intelligence applications.”
BackgroundAdvantage of Pausing: Parameter Setting for Quantum Annealers
Izquierdo, Z. G., Grabbe, S. R., Idris, H., Wang, Z., Marshall, J., & Rieffel, E. G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054056 · Cited by 12
“[ For n = 12, all embeddings have R J ∈ 15 , 30] and R h ∈ [3 , 5] except for the one that did not solve at | J F | = 0 .”
BackgroundSelf-citationSupervised learning of random quantum circuits via scalable neural networks
Cantori, S., Vitali, D., & Pilati, S. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acc4e2 · Cited by 14
“For adiabatic quantum computers, quantum Monte Carlo algorithms have emerged as the standard benchmark [36, 37, 38, 39].”
Novotny, M. A., Jin, F., Yuan, S., Miyashita, S., Raedt, H. A. D., & Michielsen, K. F. L. (2016) · Physical Review A · doi:10.1103/physreva.93.032110 · Cited by 12
Adiabatic quantum games and phase-transition-like behavior between optimal strategies
de Ponte, M. A., & Santos, A. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1918-6 · Cited by 11
Dynamics of simulated quantum annealing in random Ising chains
Mbeng, G. B., Privitera, L., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.064201 · Cited by 15
Arai, S., Ohzeki, M., & Tanaka, K. (2019) · Physical review. E · doi:10.1103/physreve.99.032120 · Cited by 13
Quantum phase transition in a multiconnected Jaynes-Cummings lattice
Xue, J. Y., Seo, K., Tian, L., & Xiang, T. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.174502 · Cited by 15
Classical Simulation and Theory of Quantum Annealing in a Thermal Environment
Oshiyama, H., Suzuki, S., & Shibata, N. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.170502 · Cited by 12
A QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing
Zaborniak, T., Giraldo, J., Müller, H. A., Jabbari, H., & Stege, U. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00037 · Cited by 19
Fiorelli, E., Rotondo, P., Marcuzzi, M., Garrahan, J. P., & Lesanovsky, I. (2019) · Physical Review A · doi:10.1103/physreva.99.032126 · Cited by 12
Realization of Heisenberg models of spin systems with polar molecules in pendular states
Yue, W., Wei, Q., Kais, S., Friedrich, B., & Herschbach, D. R. (2022) · Physical Chemistry Chemical Physics · doi:10.1039/d2cp00380e · Cited by 11
Quantum Computing for Genomics: Conceptual Challenges and Practical Perspectives
Maurizio, A., & Mazzola, G. (2025) · PRX Life · doi:10.1103/h49j-bsc6 · Cited by 23
“[111 – 114] However, QUBO problems can also be executed on digital quantum devices and tailored to algorithms such as the Quantum Approximate Optimization Algorithm (QAOA).”
What Is the Optimal Annealing Schedule in Quantum Annealing
Galindo, O., & Крейнович, В. (2020) · IEEE Symposium Series on Computational Intelligence (SSCI) · doi:10.1109/ssci47803.2020.9308407 · Cited by 14
“, [2], [3], [4], [6], [9], [11], [12], [14], [16], [17], [18], [20].”
Chancellor, N., Crowley, P. J. D., Đurić, T., Vinci, W., Amin, M. H. S., Green, A. G., Warburton, P. A., & Aeppli, G. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00580-w · Cited by 17
Quantum optimization within lattice gauge theory model on a quantum simulator
Yan, Z., Zhou, Z., Zhou, Y.-H., Wang, Y.-C., Qiu, X., Meng, Z. Y., & Zhang, X. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00755-z · Cited by 20
“Following recent technological advancements in manufacturing coupled qubit systems, the QA algorithm can be embedded into superconducting flux qubits [34–36].”
MethodInfluentialQuantum annealing with error mitigation
Shingu, Y., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2024) · Physical Review A · doi:10.1103/physreva.109.042606 · Cited by 15
ReAIM: A ReRAM-based Adaptive Ising Machine for Solving Combinatorial Optimization Problems
Chiang, H.-W., Nien, C.-F., Cheng, H.-Y., & Huang, K.-P. (2024) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca59077.2024.00015 · Cited by 12
“…using the time-to-solution (TTS) metric, which is commonly used to balance between solution accuracy and computation speed for annealer research [10], [45], [48], [64], [73], defined as follows: where P a ( t a ) shows the probability of obtaining a near-optimal solution within computing time t…”
MethodAndreanov, A., & Fistul, M. V. (2019) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab013d · Cited by 11
“Such Josephson couplings are provided by the so-called π-Josephson junctions that can be fabricated on basis of superconductor-ferromagnet-superconductor junctions [31], different facets of grain boundaries of high temperature superconductors [32, 33], Josephson junctions between two-bands superconductors [34, 35], or…”
MethodImproved QUBO Formulation of the Graph Isomorphism Problem
Hua, R., & Dinneen, M. J. (2019) · SN Computer Science · doi:10.1007/s42979-019-0020-1 · Cited by 10
Dispersive and dissipative coupling of photon Bose-Einstein condensates
Toebes, C., Vretenar, M., & Klaers, J. (2022) · Communications Physics · doi:10.1038/s42005-022-00832-3 · Cited by 10
A Method for Reducing Time-to-Solution in Quantum Annealing Through Pausing
Zielewski, M. R., & Takizawa, H. (2022) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3492805.3492815 · Cited by 12
“The baseline schedule we select is forward annealing with minimum possible annealing time, which has previously been shown to lead to a solution in the shortest time [6, 28].”
MethodQuantum annealing for microstructure equilibration with long-range elastic interactions
Sandt, R., Bouar, Y. L., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33232-w · Cited by 11
On the quantum spin glass transition on the Bethe lattice
Mossi, G., Parolini, T., Pilati, S., & Scardicchio, A. (2017) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aa5286 · Cited by 11
Semiclassical approach to finite-temperature quantum annealing with trapped ions
Raventós, D., Graß, T., Juliá-Díaz, B., & Lewenstein, M. (2018) · Physical Review A · doi:10.1103/physreva.97.052310 · Cited by 9
Tunneling through high energy barriers in simulated quantum annealingPreprint
Crosson, E., & Deng, M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1410.8484 · Cited by 16
“In [4] the success probabilities of QA and SQA are found to be highly correlated across random instances of quadratic unconstrained binary optimization on the Chimera graph, while the distribution of success probabilities for SA on the same set of instances bears little resemblance to that of QA and SQA.”
ResultQuantum ground state isoperimetric inequalities for the energy spectrum of local HamiltoniansPreprint
Crosson, E., & Bowen, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.10133 · Cited by 16
“A commonly cited failure mode of transverse field adiabatic optimization occurs when the cost function f has near degenerate local minima corresponding to computational basis states that are far separated in Hamming distance [11].”
BackgroundA Spin Hall Ising MachinePreprint
Houshang, A., Zahedinejad, M., Muralidhar, S., Chęciński, J., Awad, A. A., & Åkerman, J. J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.02236 · Cited by 10
“All devices are made of a bilayer of Pt(5)/NiFe(3) (numbers in parentheses indicated the thickness in nm) in which dusting the interface with an ultra thin Hf layer of 0.”
BackgroundOnizawa, N., & Hanyu, T. (2021) · IEEE Nanotechnology Magazine · doi:10.1109/mnano.2021.3126094 · Cited by 9
Vodeb, J., Diego, M., Vaskivskyi, Y., Logarić, L., Gerasimenko, Y. A., Kabanov, V. V., Lipovšek, B., Topič, M., & Mihailovic, D. (2024) · Nature Communications · doi:10.1038/s41467-024-49179-z · Cited by 9
Robust surface code topology against sparse fabrication defects in a superconducting-qubit array
Tang, Y., & Miao, G. (2016) · Physical Review A · doi:10.1103/physreva.93.032322 · Cited by 10
Vacancies in graphene: an application of adiabatic quantum optimization
Carnevali, V., Siloi, I., Felice, R. D., & Fornari, M. (2020) · Physical Chemistry Chemical Physics · doi:10.1039/d0cp04037a · Cited by 9
Perils of embedding for quantum sampling
Marshall, J., Mossi, G., & Rieffel, E. G. (2022) · Physical Review A · doi:10.1103/physreva.105.022615 · Cited by 12
Sparse Matrix Ordering Method with a Quantum Annealing Approach and its Parameter Tuning
Komiyama, T., & Suzuki, T. (2021) · IEEE International Symposium on Embedded Multicore/Many-core Systems-on-Chip (MCSoC) · doi:10.1109/mcsoc51149.2021.00045 · Cited by 11
Combinatorial optimization with photonics-inspired clock models
Honari-Latifpour, M., Mills, M. S., & Miri, M. (2022) · Communications Physics · doi:10.1038/s42005-022-00874-7 · Cited by 10
“These include, the D-Wave’s quantum annealing machine [5, 19], the coherent Ising machine [7, 8], Hitachi’s CMOS Ising solver [20], Fujitsu’s digital annealer [21], and Toshiba’s simulated bifurcations machine [16].”
MethodTrade-off relations of quantum resource theory in Heisenberg models
Ali, A., Al-Kuwari, S. M., & Haddadi, S. (2024) · Physica Scripta · doi:10.1088/1402-4896/ad3a45 · Cited by 9
Cavity-assisted dynamical quantum phase transition at bifurcation points
Tian, L. (2016) · Physical Review A · doi:10.1103/physreva.93.043850 · Cited by 10
Nanoscale Superconducting Quantum Interference Devices Add Another Dimension
Gallop, J. C., & Hao, L. (2016) · ACS Nano · doi:10.1021/acsnano.6b04844 · Cited by 9
Quantum Robotics: A Primer on Current Science and Future Perspectives
Tandon, P., Lam, S., Shih, B., Mehta, T., Mitev, A., & Ong, Z. (2017) · Synthesis lectures on quantum computing · doi:10.2200/s00746ed1v01y201612qmc010 · Cited by 11
Mathematical Methods for a Quantum Annealing Computer
Warren, R. H. (2018) · Journal of Advances in Applied Mathematics · doi:10.22606/jaam.2018.33002 · Cited by 9
“Authors [7, 12, 13, 20] describe D-Wave QACs.”
BackgroundQuantum annealing in spin-boson model: from a perturbative to an ultrastrong mediated coupling
Pino, M., & García‐Ripoll, J. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aaeeea · Cited by 11
“pped ions [5{7]. In this reduced framework of combinatorial problems, existing AQC devices behave very much like Monte Carlo Quantum Annealing methods for preparing ground states of spin Hamiltonians [8]. It seems that the performance of the adiabatic quantum algorithm is linked to the efficiency of quantum tunneling…”
BackgroundFast high-fidelity multiqubit state transfer with long-range interactions
Hong, Y., & Lucas, A. (2021) · Physical Review A · doi:10.1103/physreva.103.042425 · Cited by 10
Quantum security and 6G critical infrastructure
Hoschek, M. (2021) · Serbian Journal of Engineering Management · doi:10.5937/sjem2101001h · Cited by 10
Yacoby, R., Schaar, N., Kellerhals, L., Raz, O., Hermelin, D., & Pugatch, R. (2022) · Physical review. E · doi:10.1103/physreve.105.035305 · Cited by 11
“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.”
BackgroundBabbush, R., Denchev, V. S., Ding, N., Isakov, S. V., & Neven, H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4203 · Cited by 15
Self-citationUnconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Quantum chaos in random Ising networks
Grabarits, A., Swain, K. R., Heydari, M. S., Chandarana, P., Gómez-Ruiz, F. J., & del Campo, A. (2025) · Physical Review Research · doi:10.1103/physrevresearch.7.013146 · Cited by 14
Ising Machine by Dimensional Collapse of Nonlinear Polarization Oscillators
Chiavazzo, S., Strinati, M. C., Conti, C., & Pierangeli, D. (2025) · Physical Review Letters · doi:10.1103/qs29-2xqc · Cited by 8
“Realizations range from classical and quantum annealers made by optical devices [3–11], superconducting circuits [12], magnetic junctions [13] and memristors [14], to dynamical-system solvers made by networks of electronic [15–22], acoustic [23], and optical oscillators [24, 25], lasers [26, 27]…”
Youn, S., Kim, K., Park, J., & Kim, H. (2025) · Nano Energy · doi:10.1016/j.nanoen.2025.111633 · Cited by 9
Ultrastrong Capacitive Coupling of Flux Qubits
Hita-Pérez, M., Jaumà, G., Pino, M., & García-Ripoll, J. J. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.014028 · Cited by 8
Ion-native variational ansatz for quantum approximate optimization
Rabinovich, D., Adhikary, S., Campos, E., Akshay, V., Anikin, E. V., Sengupta, R., Lakhmanskaya, O., Lakhmanskiy, K., & Biamonte, J. (2022) · Physical Review A · doi:10.1103/physreva.106.032418 · Cited by 12
“With long enough circuits, QAOA can approximate the adiabatic evolution [6–8], which certifies success.”
BackgroundAlgorithms, Analytics, and Artificial Intelligence
Brusset, X., Torre, D. L., & Broekaert, J. (2022) · Elsevier eBooks · doi:10.1016/b978-0-323-91614-1.00006-x · Cited by 10
Clustering method for time-series images using quantum-inspired digital annealer technology
Inoue, T., Kubota, K., Ikami, T., Egami, Y., Nagai, H., Kashikawa, T., Kimura, K., & Matsuda, Y. (2024) · Communications Engineering · doi:10.1038/s44172-023-00158-0 · Cited by 8
Evaluation of Quantum and Hybrid Solvers for Combinatorial Optimization
Bertuzzi, A., Ferrari, D., Manzalini, A., & Amoretti, M. (2024) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3649153.3649205 · Cited by 8
“D-Wave machines do not strictly use an AQC model, which requires operating at zero temperature, but rather Quantum Annealing (QA) devices [3, 26].”
BackgroundBenchmarking quantum annealing with maximum cardinality matching problems
Vert, D., Willsch, M., Yenilen, B., Sirdey, R., Louise, S., & Michielsen, K. F. L. (2024) · Frontiers in Computer Science · doi:10.3389/fcomp.2024.1286057 · Cited by 10
Endo, K., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · PLoS ONE · doi:10.1371/journal.pone.0304594 · Cited by 13
Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
Onizawa, N., Sasaki, R., Shin, D., Gross, W. J., & Hanyu, T. (2024) · IEEE Access · doi:10.1109/access.2024.3431540 · Cited by 11
“In addition to the classical approach, quantum annealing (QA) [21] is an alternative solution implemented using quantum devices, such as D-Wave quantum annealers [22].”
GPU-accelerated simulated annealing based on p-bits with real-world device-variability modeling
Onizawa, N., & Hanyu, T. (2025) · Scientific Reports · doi:10.1038/s41598-025-90520-3 · Cited by 12
“Quantum annealing (QA) promises faster solutions [27, 28] but is currently limited by device performance [29, 30].”
Quantum Annealing for Active User Detection in NOMA Systems
Piron, R., & Goursaud, C. (2024) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/ieeeconf60004.2024.10943100 · Cited by 8
“Nevertheless, the emergence of quantum algorithms [8] offers an interesting perspective to deal with this issue.”
From quantum-enhanced to quantum-inspired Monte Carlo
Christmann, J., Ivashkov, P., Chiurco, M., & Mazzola, G. (2025) · Physical Review A · doi:10.1103/physreva.111.042615 · Cited by 14
Obstacles to quantum annealing in a planar embedding of XORSAT
Patil, P., Kourtis, S., Chamon, C., Mucciolo, E. R., & Ruckenstein, A. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.054435 · Cited by 8
Accuracy-enhanced coherent Ising machine using the quantum adiabatic theorem
Li, L., Liu, H., Huang, N., & Wang, Z. (2021) · Optics Express · doi:10.1364/oe.426476 · Cited by 10
Self-citationLocal Energy Distribution Based Hyperparameter Determination for Stochastic Simulated Annealing
Onizawa, N., Kuroki, K., Shin, D., & Hanyu, T. (2023) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2023.3329756 · Cited by 10
“Quantum annealing (QA) is another optimization method that uses quantum mechanics to solve combinatorial optimization problems [6], [7].”
MethodAn overview of Quantum Information Systems
Ghonaimy, M. A. R. (2013) · International Conference on Computer Engineering & Systems (ICCES) · doi:10.1109/icces.2013.6707155 · Cited by 9
“The probability of obtaining any given outcome is given by: = <Ψ| |Ψ> (11) The average value of the observable A is given by: <A> = ∑ (12) The standard deviation ∆A is then, ∆ = < > − < > (13) It is then possible to state the Heisenberg uncertainty principle, the proof of which could be found at [Benenti, 2004]: Suppo…”
BackgroundQuantum and quantum-inspired optimization for solving the minimum bin packing problem
Bozhedarov, A. A., Usmanov, S. R., Salakhov, G. V., Boev, A. S., Kiktenko, E. O., & Fedorov, A. K. (2024) · Journal of Physics Conference Series · doi:10.1088/1742-6596/2701/1/012129 · Cited by 18
Melchert, O., Katzgraber, H. G., & Novotny, M. A. (2016) · Physical review. E · doi:10.1103/physreve.93.042128 · Cited by 9
“In addition, there have been attempts to create hard benchmark problems using planted solutions [35].”
BackgroundTunneling in projective quantum Monte Carlo simulations with guiding wave functions
Parolini, T., Inack, E. M., Giudici, G., & Pilati, S. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.214303 · Cited by 8
“Quantum annealers are special purpose adiabatic quantum computers designed to solve complex optimization problems [1].”
BackgroundFinding Hadamard Matrices by a Quantum Annealing Machine
Suksmono, A. B., & Minato, Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-50473-w · Cited by 11
“[30] S Boixo, T.”
Quantum-assisted finite-element design optimizationPreprint
van Vreumingen, D., Neukart, F., Dollen, D. V., Othmer, C., Hartmann, M., Voigt, A.-C., & Bäck, T. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.03947 · Cited by 13
“Quantum annealing devices such as the ones produced by D-Wave systems are typically used for solving optimization and sampling tasks [1–15], and in both academia and industry the characterization of their usefulness is subject to active research.”
MethodUnraveling reverse annealing: A study of D-Wave quantum annealers
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/vfxh-gjgy · Cited by 9
Quantum annealing-based clustering of single cell RNA-seq data
Kubacki, M. L., & Niranjan, M. (2023) · Briefings in Bioinformatics · doi:10.1093/bib/bbad377 · Cited by 7
“However, in this work we focus exclusively on the quantum annealer, as it has been shown to be a very promising alternative to simulated annealing capable of outperforming it in terms of both time and solution quality(24)(25)(26)(27).”
Atomic Energy Optimization: A Novel Meta-Heuristic Inspired by Energy Dynamics and Dissipation
Omari, M., Kaddi, M., Salameh, K., Alnoman, A. A., & Benhadji, M. (2024) · IEEE Access · doi:10.1109/access.2024.3524322 · Cited by 8
Koshka, Y., Perera, D., Hall, S., & Novotny, M. A. (2016) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2016.7727438 · Cited by 7
“To overcome this difficulty, a RBM embedding that combined qubits in order to significantly increase the connectivity between hidden and visible units of the RBM was investigated.”
MethodQuantum Monte Carlo annealing with multi-spin dynamics
Mazzola, G., & Troyer, M. (2017) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aa6de1 · Cited by 10
Self-citationNoise-tolerant quantum speedups in quantum annealing without fine tuning
Kapit, E., & Oganesyan, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abd59a · Cited by 9
A game of quantum advantage: linking verification and simulation
França, D. S., & García−Patrón, R. (2022) · Quantum · doi:10.22331/q-2022-06-30-753 · Cited by 10
“A few years back the series of claims of the advantage of quantum annealers followed by rebuttals and an intense debate inside the quantum computation community [51, 52, 12, 56] can be seen as an example of that.”
BackgroundBrowne, D. E. (2014) · Nature Physics · doi:10.1038/nphys2914 · Cited by 9
Characterization of Quantum States Based on Creation Complexity
Hu, Z., & Kais, S. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000043 · Cited by 7
Calculation of a capacitively-coupled floating gate array toward quantum annealing machine
Tanamoto, T., Higashi, Y., & Deguchi, J. (2018) · Journal of Applied Physics · doi:10.1063/1.5040513 · Cited by 7
Characterizing quantum circuits with qubit functional configurations
Hu, Z., & Kais, S. (2023) · Scientific Reports · doi:10.1038/s41598-023-31980-3 · Cited by 10
“The development of quantum algorithms with efficient quantum circuits has been a central part of quantum computation, which has seen enormous progress in the last 30 years in both the theoretical and experimental fronts [1-13].”
BackgroundRecall Performance for Content-Addressable Memory Using Adiabatic Quantum Optimization
Schrock, J., McCaskey, A., Hamilton, K. E., Humble, T. S., & Imam, N. (2017) · Entropy · doi:10.3390/e19090500 · Cited by 15
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.