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 201–300 of 796
Quantum-enhanced greedy combinatorial optimization solver
Dupont, M., Evert, B., Hodson, M. J., Sundar, B., Jeffrey, S., Yamaguchi, Y., Feng, D., Maciejewski, F. B., Hadfield, S., Alam, M. S., et al. (2023) · Science Advances · doi:10.1126/sciadv.adi0487 · Cited by 77
“A tremendous amount of work has been dedicated to quantum annealers, which leverage adiabatic evolution [8–10], while the focus for gate-based quantum computers has been mainly on parameterized quantum circuits like the quantum approximate optimization algo-rithm (QAOA) [2, 3, 11–15].”
Self-citationA primer for quantum computing and its applications to healthcare and biomedical research
Durant, T. J. S., Knight, E., Nelson, B. G., Dudgeon, S. N., Lee, S. J., Walliman, D., Young, H. P., Ohno-Machado, L., & Schulz, W. L. (2024) · Journal of the American Medical Informatics Association · doi:10.1093/jamia/ocae149 · Cited by 55
Lanting, T., King, A. D., Evert, B., & Hoskinson, E. (2017) · Physical Review A · doi:10.1103/physreva.96.042322 · Cited by 40
Analogue simulation with the use of artificial quantum coherent structures
Zagoskin, A. M. (2017) · Reviews in Physics · doi:10.1016/j.revip.2017.11.001 · Cited by 42
“…comparing the statistics of the performance of an adiabatic annealer don a large set of optimization problems with known solutions to that of di ff erent types of optimization algorithms [77,78]), do not allow an unequivocal interpretation [79] and are not scalable beyond several hundred qubits.”
BackgroundPedretti, G., Mannocci, P., Hashemkhani, S., Milo, V., Melnic, O., Chicca, E., & Ielmini, D. (2020) · IEEE Journal on Exploratory Solid-State Computational Devices and Circuits · doi:10.1109/jxcdc.2020.2992691 · Cited by 43
“[28], [29], photonic computing [30], and IMC [31]–[33].”
BackgroundCan Nonlinear Parametric Oscillators Solve Random Ising Models?
Strinati, M. C., Bello, L., Torre, E. G. D., & Pe’er, A. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.143901 · Cited by 48
Chaos in spin glasses revealed through thermal boundary conditions
Wang, W., Machta, J. L., & Katzgraber, H. G. (2015) · Physical Review B · doi:10.1103/physrevb.92.094410 · Cited by 43
“[39–44]).”
Reexamination of the evidence for entanglement in a quantum annealer
Albash, T., Hen, I., Spedalieri, F. M., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.062328 · Cited by 49
Self-citationLuo, L., Mi, Z., Huang, J., & Ruan, Z. (2023) · Science Advances · doi:10.1126/sciadv.adg6238 · Cited by 62
Quantum annealing with ultracold atoms in a multimode optical resonator
Torggler, V., Krämer, S., & Ritsch, H. (2017) · Physical Review A · doi:10.1103/physreva.95.032310 · Cited by 45
Koshka, Y., & Novotny, M. A. (2020) · IEEE Journal on Selected Areas in Information Theory · doi:10.1109/jsait.2020.3014192 · Cited by 47
“The physics of the GS determination by the D-Wave QA has been extensively investigated [26]–[28].”
BackgroundHeavy Tails in the Distribution of Time to Solution for Classical and Quantum Annealing
Steiger, D. S., Rønnow, T. F., & Troyer, M. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.230501 · Cited by 39
Self-citationAlgorithm engineering for a quantum annealing platform
King, A. D., & McGeoch, C. C. (2014) · arXiv · doi:10.48550/arxiv.1410.2628 · Cited by 39
“26 28 v2 [ cs .”
A quantum annealing approach for boolean satisfiability problem
Su, J., Tu, T., & He, L. (2016) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/2897937.2897973 · Cited by 53
“A few researches have discussed the error rate and the trustiness of the solution returned by quantum annealer [2] [4].”
BackgroundResultVariational Autoencoder Reconstruction of Complex Many-Body Physics
Luchnikov, I. A., Ryzhov, A., Stas, P.-J., Filippov, S. N., & Ouerdane, H. (2019) · Entropy · doi:10.3390/e21111091 · Cited by 47
Resummation for Nonequilibrium Perturbation Theory and Application to Open Quantum Lattices
Li, A. C. Y., Petruccione, F., & Koch, J. (2015) · Physical Review X · doi:10.1103/physrevx.6.021037 · Cited by 32
“[19] S.”
BackgroundQuantum-annealing correction at finite temperature: Ferromagnetic p -spin models
Matsuura, S., Nishimori, H., Vinci, W., Albash, T., & Lidar, D. A. (2017) · Physical Review A · doi:10.1103/physreva.95.022308 · Cited by 41
Self-citationCharacteristic functions based on a quantum jump trajectory
Liu, F., & Xi, J. (2016) · Physical review. E · doi:10.1103/physreve.94.062133 · Cited by 43
Glover, F., Lewis, M. A., & Kochenberger, G. A. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.08.025 · Cited by 46
“In addition, a new type of quantum computer based on quantum annealing with an integrated physical network structure of qubits known as a Chimera graph has also been demonstrated to very quickly find good solutions to QUBO in Boixo et al. (2014) .”
BackgroundSolving the optimal trading trajectory problem using a quantum annealer
Rosenberg, G., Haghnegahdar, P., Goddard, P., Carr, P., Wu, K. J., & de Prado, M. L. (2015) · High Performance Computational Finance · doi:10.1145/2830556.2830563 · Cited by 52
Karimi, H., Rosenberg, G., & Katzgraber, H. G. (2017) · Physical Review E · doi:10.1103/physreve.96.043312 · Cited by 37
Fast forward of the adiabatic spin dynamics of entangled states
Setiawan, I., Gunara, B. E., Masuda, S., & Nakamura, K. (2017) · Physical Review A · doi:10.1103/physreva.96.052106 · Cited by 37
Nonequilibrium thermodynamics of erasure with superconducting flux logic
Saira, O.-P., Matheny, M. H., Katti, R., Fon, W., Wimsatt, G., Crutchfield, J. P., Han, S., & Roukes, M. L. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.013249 · Cited by 41
“Owing to these features, high-performance processors implementing complex logical functions have been realized with superconducting architectures [25–27].”
BackgroundA Performance Estimator for Quantum Annealers: Gauge selection and Parameter SettingPreprint
Perdomo‐Ortiz, A., Fluegemann, J., Biswas, R., & Smelyanskiy, V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01083 · Cited by 46
“Althoughour strategy allows us to select the best Hamiltonian specification in quantum annealers, we do not expect that it will be enough to change the complexity class seen in scaling studies [10, 14].”
BackgroundInfluentialProjective quantum Monte Carlo simulations guided by unrestricted neural network states
Inack, E. M., Santoro, G. E., Dell’Anna, L., & Pilati, S. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.235145 · Cited by 36
Controllable Josephson junction for photon Bose-Einstein condensates
Vretenar, M., Kassenberg, B., Bissesar, S., Toebes, C., & Klaers, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023167 · Cited by 47
Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
Arai, S., Ohzeki, M., & Tanaka, K. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.033006 · Cited by 44
Quantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
Song, Y., Kim, M., Hwang, H., Lee, W., & Ahn, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013286 · Cited by 51
Folding lattice proteins with quantum annealing
Irbäck, A., Knuthson, L., Mohanty, S., & Peterson, C. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043013 · Cited by 54
“In quantum annealing (QA) [3–5], the idea is to encode the solution to a given optimization problem in the ground state of a Hamiltonian and efficiently locate the energy minimum by exploiting quantum fluctuations and tunneling, in analogy with the role played by thermal fluctuations in classical…”
Efficient subgraph-based sampling of Ising-type models with frustrationPreprint
Selby, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1409.3934 · Cited by 36
“These were chosen because originally the aim was to compare ([13], [15]) classical optimisation with that of D-Wave hardware [2] — a quantum device whose current implementation is based on a Chimera graph.”
MethodThe pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
Probing entanglement in adiabatic quantum optimization with trapped ions
Hauke, P., Bonnes, L., Heyl, M., & Lechner, W. (2015) · Frontiers in Physics · doi:10.3389/fphy.2015.00021 · Cited by 34
“Procedures in this spirit have been implemented in so-called quantum annealers such as the D-Wave device [23–27] or nuclear magnetic resonance setups [28].”
BackgroundMethodQuantum Computation using Arrays of N Polar Molecules in Pendular States
Wei, Q., Cao, Y., Kais, S., Friedrich, B., & Herschbach, D. R. (2016) · ChemPhysChem · doi:10.1002/cphc.201600781 · Cited by 38
Artificial quantum thermal bath: Engineering temperature for a many-body quantum system
Shabani, A., & Neven, H. (2016) · Physical Review A · doi:10.1103/physreva.94.052301 · Cited by 42
Low Rank Non-Negative Matrix Factorization with D-Wave 2000QPreprint
Ottaviani, D., & Amendola, A. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.08721 · Cited by 48
“Solving a linear system whose vector of unknowns follows the rules described by equation (5) corresponds to carrying out an iteration of the matrix factorization knowing in advance the point of global minimum to be reached.”
BackgroundMethodInfluentialLifted Probabilistic Inference for Asymmetric Graphical Models
den Broeck, G. V., & Niepert, M. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9678 · Cited by 35
Boosting quantum annealer performance via sample persistence
Karimi, H., & Rosenberg, G. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1615-x · Cited by 28
“There is evidence that quantum effects, namely entanglement and finite-range multiqubit tunnelling, do indeed occur on these quantum annealing chips [2,3,11,26].”
BackgroundJob, J., & Lidar, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabd9b · Cited by 34
Self-citationTowards quantum belief propagation for LDPC decoding in wireless networks
Kasi, S., & Jamieson, K. (2020) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3372224.3419207 · Cited by 44
“The historical trend is encouraging, with the DW2Q having a 5× annealing time improvement over the circa-2011 D-Wave One [10].”
BackgroundQuantum versus simulated annealing in wireless interference network optimization
Wang, C., Chen, H., & JONCKHEERE, E. A. (2016) · Scientific Reports · doi:10.1038/srep25797 · Cited by 43
Continuous Measurement of a Non-Markovian Open Quantum System
Shabani, A., Roden, J., & Whaley, K. B. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.113601 · Cited by 32
Entanglement of superconducting qubits via acceleration radiation
García-Álvarez, L., Felicetti, S., Rico, E., Solano, E., & Sabín, C. (2017) · Scientific Reports · doi:10.1038/s41598-017-00770-z · Cited by 33
“Circuit Quantum Electrodynamics (cQED) [1–4] offers both a promising architecture for quantum technologies, such as quantum computers [5, 6] and simulators [7–9], and a natural arena for the study of quantum field theory and relativistic effects, either in a direct or simulated fashion [10–14].”
Passarelli, G., Filippis, G. D., Cataudella, V., & Lucignano, P. (2018) · Physical Review A · doi:10.1103/physreva.97.022319 · Cited by 35
Efficient sampling of ground and low-energy Ising spin configurations with a coherent Ising machine
Ng, E., Onodera, T., Kako, S., McMahon, P. L., Mabuchi, H., & Yamamoto, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013009 · Cited by 44
“As a result, significant interest has developed towards leveraging physical Ising-like systems as special-purpose computational hardware for tackling problems such as combinatorial optimization, with ongoing research on platforms ranging from quantum annealers built from microwave superconducting circuits [4, 5] to co…”
BackgroundHigh-Quality Thermal Gibbs Sampling with Quantum Annealing Hardware
Nelson, J., Vuffray, M., Lokhov, A. Y., Albash, T., & Coffrin, C. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.044046 · Cited by 51
“It is worth noting that these models are reminiscent of the RAN and RANF models that have been used to benchmark earlier generations of QA processors [64, 65].”
Schedule path optimization for adiabatic quantum computing and optimization
Zeng, L., Zhang, J., & Sarovar, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165305 · Cited by 31
Error correction for encoded quantum annealing
Pastawski, F., & Preskill, J. P. (2016) · Physical Review A · doi:10.1103/physreva.93.052325 · Cited by 42
“1: The bipartite Forney-style factor graph (FFG) for the [7, 4, 3] Hamming code, with linear constraint nodes denoted ⊕ and variable nodes denoted (=).”
BackgroundPractical engineering of hard spin-glass instances
Marshall, J., Martin-Mayor, V., & Hen, I. (2016) · Physical Review A · doi:10.1103/physreva.94.012320 · Cited by 32
“Indeed, direct comparison tests between the 128-qubit D-Wave One and later the 512-qubit D-Wave Two (DW2) processors and classical state of the art algorithms on randomly-generated Isingmodel instances have shown no evidence of a quantum speedup [15, 16, 19].”
BackgroundFast Preparation of Critical Ground States Using Superluminal Fronts
Agarwal, K., Bhatt, R. N., & Sondhi, S. L. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.210604 · Cited by 34
Simulated quantum annealing as a simulator of nonequilibrium quantum dynamics
Bando, Y., & Nishimori, H. (2021) · Physical Review A · doi:10.1103/physreva.104.022607 · Cited by 37
“This method is known to reproduce some features of the outputs from the quantum device, the D-Wave quantum annealer [22, 23].”
MethodCombinatorial optimization by weight annealing in memristive hopfield networks
Fahimi, Z., Mahmoodi, M. R., Nili, H., Polishchuk, V., & Strukov, D. B. (2021) · Scientific Reports · doi:10.1038/s41598-020-78944-5 · Cited by 39
Hidden frustrated interactions and quantum annealing in trapped-ion spin-phonon chains
Nevado, P., & Porras, D. (2016) · Physical Review A · doi:10.1103/physreva.93.013625 · Cited by 33
Geller, M. R., Martinis, J. M., Sornborger, A. T., Stancil, P. C., Pritchett, E., You, H., & Galiautdinov, A. (2015) · Physical Review A · doi:10.1103/physreva.91.062309 · Cited by 38
Self-citationQuantum-Enhanced Reinforcement Learning for Finite-Episode Games with Discrete State Spaces
Neukart, F., Dollen, D. V., Seidel, C., & Compostella, G. (2018) · Frontiers in Physics · doi:10.3389/fphy.2017.00071 · Cited by 39
Wishart planted ensemble: A tunably rugged pairwise Ising model with a first-order phase transition
Hamze, F., Raymond, J., Pattison, C. A., Biswas, K., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.052102 · Cited by 36
“In the case of an ensemble, averages may be poorly defined and so the median is used [70].”
Quantum annealing using vacuum states as effective excited states of driven systems
Goto, H., & Kanao, T. (2020) · Communications Physics · doi:10.1038/s42005-020-00502-2 · Cited by 33
Comparative study of the performance of quantum annealing and simulated annealing
Nishimori, H., Tsuda, J., & Knysh, S. (2015) · Physical Review E · doi:10.1103/physreve.91.012104 · Cited by 40
Finding the ground state of spin Hamiltonians with reinforcement learning
Mills, K., Ronagh, P., & Tamblyn, I. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0226-x · Cited by 45
Benchmarking Digital Quantum Simulations Above Hundreds of Qubits Using Quantum Critical Dynamics
Miessen, A., Egger, D. J., Tavernelli, I., & Mazzola, G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.040320 · Cited by 73
“In the presence of suffi-ciently strong thermal noise that destroys coherence, the density of defects could still decrease with t f , since the machine may behave like a classical thermal annealer (at low temperature) or as a machine featuring incoherent quantum tunneling events [66–68].”
Vepsäläinen, A. P., & Paraoanu, G. S. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.201900121 · Cited by 33
“For adiabatic quantum computers [56], quantum-annealing processors [57, 58], and holonomic quantum computing [59–61] this would be one important route to achieving quantum advantage [62].”
MethodGershenzon, I., Arwas, G., Gadasi, S., Tradonsky, C., Friesem, A. A., Raz, O., & Davidson, N. (2018) · Nanophotonics · doi:10.1515/nanoph-2020-0137 · Cited by 35
GPS: A New TSP Formulation for Its Generalizations Type QUBO
González-Bermejo, S., Alonso-Linaje, G., & Atchade-Adelomou, P. (2022) · Mathematics · doi:10.3390/math10030416 · Cited by 43
“During state of the art carried out, we have found several articles [33, 34, 41] that solve the TSP and VRP (focusing on minimizing distance and not time) for annealing computers [7, 30, 42].”
BackgroundToward Prediction of Financial Crashes with a D-Wave Quantum Annealer
Ding, Y., Gonzalez-Conde, J., Lamata, L., Martín‐Guerrero, J. D., Lizaso, E., Mugel, S., Chen, X., Orús, R., Solano, E., & Sanz, M. (2023) · Entropy · doi:10.3390/e25020323 · Cited by 42
“Unfortunately, this hardware has not been realized yet, as stateof-the-art quantum annealers are restricted to two-qubit interactions [15].”
BackgroundDirect comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 34
Hearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
Vinci, W., Markström, K., Boixo, S., Roy, A., Spedalieri, F. M., Warburton, P. A., & Severini, S. (2014) · Scientific Reports · doi:10.1038/srep05703 · Cited by 31
Self-citationToroidal qubits: naturally-decoupled quiet artificial atoms
Zagoskin, A. M., Chipouline, A. V., Il’ichev, E., Johansson, J. R., & Nori, F. (2015) · Scientific Reports · doi:10.1038/srep16934 · Cited by 30
Self-learning projective quantum Monte Carlo simulations guided by restricted Boltzmann machines
Pilati, S., Inack, E. M., & Pieri, P. (2019) · Physical review. E · doi:10.1103/physreve.100.043301 · Cited by 39
“[18] S.”
BackgroundBenchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 33
“classical heuristics that perform at least as well as D-Wave on the types of instances used by McGeoch and Wang ([19], [20], [25]; we observe this as well in Section 5.”
BackgroundMethodResultInfluentialPerformance of quantum annealing inspired algorithms for combinatorial optimization problems
Zeng, Q., Cui, X., Liu, B., Wang, Y., Mosharev, P. A., & Yung, M. (2024) · Communications Physics · doi:10.1038/s42005-024-01705-7 · Cited by 50
“We compare QAIA with other physics-based algorithms, QA and some exact solvers from published literature 13,45 .”
Simulated-quantum-annealing comparison between all-to-all connectivity schemes
Albash, T., Vinci, W., & Lidar, D. A. (2016) · Physical Review A · doi:10.1103/physreva.94.022327 · Cited by 33
Self-citationDegeneracy, degree, and heavy tails in quantum annealing
King, A. D., Hoskinson, E., Lanting, T., Andriyash, E., & Amin, M. H. (2016) · Physical Review A · doi:10.1103/physreva.93.052320 · Cited by 28
Quantum Monte Carlo simulations of tunneling in quantum adiabatic optimization
Brady, L. T., & van Dam, W. (2016) · Physical Review A · doi:10.1103/physreva.93.032304 · Cited by 27
Optimally Stopped Optimization
Vinci, W., & Lidar, D. A. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054016 · Cited by 27
Self-citationQuantum Enhanced Inference in Markov Logic Networks
Wittek, P., & Gogolin, C. (2017) · Scientific Reports · doi:10.1038/srep45672 · Cited by 28
Vinci, W., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.97.022308 · Cited by 30
Self-citationOptimal working point in dissipative quantum annealing
Arceci, L., Barbarino, S., Rossini, D., & Santoro, G. E. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.064307 · Cited by 29
Quantum-Assisted Cluster Analysis on a Quantum Annealing Device
Neukart, F., Dollen, D. V., & Seidel, C. (2018) · Frontiers in Physics · doi:10.3389/fphy.2018.00055 · Cited by 33
Evaluating Ising Processing Units with Integer Programming
Coffrin, C., Nagarajan, H., & Bent, R. W. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-19212-9_11 · Cited by 36
“Indeed, as a result of these minor imperfections, every D-Wave IPU developed to date has a unique topology [32,33,34].”
BackgroundOptimal large-scale quantum state tomography with Pauli measurements
Cai, T., Kim, D., Wang, Y., Yuan, M., & Zhou, H. H. (2016) · The Annals of Statistics · doi:10.1214/15-aos1382 · Cited by 49
Optimizing the Spin Reversal Transform on the D-Wave 2000Q
Pelofske, E., Hahn, G., & Djidjev, H. (2019) · 2019 IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2019.8914719 · Cited by 26
“However, in [1], the authors demonstrate that significant correlations exist between different gauge transforms.”
BackgroundSu, Y., Kim, T. T.-H., & Kim, B. (2024) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2024.3352907 · Cited by 32
“Recently, Ising machines have been demonstrated in various technologies, including quantum computing [26], [27], [28], [29], coherent optics [30], [31], [32], and CMOS technologies [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17].”
BackgroundGuest Column: Adiabatic Quantum Computing Challenges
Calude, C. S., Calude, E., & Dinneen, M. J. (2015) · ACM SIGACT News · doi:10.1145/2744447.2744459 · Cited by 30
“The questions about whether D-Wave machines perform quantum computation and allow a quantum speed-up have been heatedly debated [8, 53, 55].”
BackgroundQuantum annealing speedup over simulated annealing on random Ising chains
Zanca, T., & Santoro, G. E. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.224431 · Cited by 40
Off-diagonal expansion quantum Monte Carlo
Albash, T., Wagenbreth, G., & Hen, I. (2017) · Physical review. E · doi:10.1103/physreve.96.063309 · Cited by 35
Using quantum annealing to design lattice proteins
Irbäck, A., Knuthson, L., Mohanty, S., & Peterson, C. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013162 · Cited by 35
Encrypt me! A game-based approach to Bell inequalities and quantum cryptography
López-Incera, A., Hartmann, A., & Dür, W. (2020) · European Journal of Physics · doi:10.1088/1361-6404/ab9a67 · Cited by 30
Stochasticity of the magnon parametron
Elyasi, M., Saitoh, E., & Bauer, G. E. W. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.054403 · Cited by 27
Parameter setting for quantum annealers
Pudenz, K. L. (2016) · 2016 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2016.7761619 · Cited by 24
“INTRODUCTION AND MOTIVATION At this point in the development of practical quantum annealing devices, there has been a great deal published regarding specialized benchmarking problems designed for existing hardware [1], [2], [3], [4], [5].”
BackgroundAdvantages of Unfair Quantum Ground-State Sampling
Zhang, B. H., Wagenbreth, G., Martín-Mayor, V., & Hen, I. (2017) · Scientific Reports · doi:10.1038/s41598-017-01096-6 · Cited by 35
“To overcome the inhomogeneity of the processor as well as other systematic errors, each anneal is carried out with a randomly generated gauge (see Ref.[27] for more details).”
MethodInfluentialSteering random spin systems to speed up the quantum adiabatic algorithm
Özgüler, A. B., Joynt, R., & Vavilov, M. (2018) · Physical Review A · doi:10.1103/physreva.98.062311 · Cited by 29
Nikmehr, N., Zhang, P., Zheng, H., Wei, T.-C., He, G., & Shamash, Y. (2024) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2024.3399122 · Cited by 33
Fast-Converging Simulated Annealing for Ising Models Based on Integral Stochastic Computing
Onizawa, N., Katsuki, K., Shin, D., Gross, W. J., & Hanyu, T. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2022.3159713 · Cited by 29
“We next compare SA methods with QA [31].”
ResultQuantum Annealing with Markov Chain Monte Carlo Simulations and D-Wave Quantum Computers
Wang, Y., Wu, S., & Zou, J. (2016) · Statistical Science · doi:10.1214/16-sts560 · Cited by 29
Shortcuts to adiabatic classical spin dynamics mimicking quantum annealing
Hatomura, T., & Mori, T. (2018) · Physical review. E · doi:10.1103/physreve.98.032136 · Cited by 28
Towards Hybrid Classical-Quantum Computation Structures in Wirelessly-Networked Systems
Kim, M., Venturelli, D., & Jamieson, K. (2020) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/3422604.3425924 · Cited by 33
“1For details on how it works in some concrete use cases, see for instance Refs [5, 12, 13, 18, 27, 38].”
BackgroundQuantum state preparation for coupled period tripling oscillators
Lörch, N., Zhang, Y., Bruder, C., & Dykman, M. I. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.023023 · Cited by 27
An Analog Neuro-Optimizer with Adaptable Annealing Based on 64×64 0T1R Crossbar Circuit
Mahmoodi, M. R., Kim, H., Fahimi, Z., Nili, H., Sedov, L., Polishchuk, V., & Strukov, D. B. (2019) · Technical digest - International Electron Devices Meeting/Technical digest · doi:10.1109/iedm19573.2019.8993442 · Cited by 23
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
Yan, B., & Sinitsyn, N. A. (2022) · Nature Communications · doi:10.1038/s41467-022-29887-0 · Cited by 51
“For the transverse field protocol (7) withH M , the same annealing time τa in [42] is achieved if we set”
BackgroundMethodQuantum and classical dynamics in adiabatic computation
Crowley, P. J. D., Đurić, T., Vinci, W., Warburton, P. A., & Green, A. G. (2014) · Physical Review A · doi:10.1103/physreva.90.042317 · Cited by 29
Hard combinatorial problems and minor embeddings on lattice graphs
Lucas, A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2323-5 · Cited by 26
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.