Quantum annealing with manufactured spins
The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Abstract
Many interesting but practically intractable problems can be reduced to that of finding the ground state of a system of interacting spins; however, finding such a ground state remains computationally difficult. It is believed that the ground state of some naturally occurring spin systems can be effectively attained through a process called quantum annealing. If it could be harnessed, quantum annealing might improve on known methods for solving certain types of problem. However, physical investigation of quantum annealing has been largely confined to microscopic spins in condensed-matter systems. Here we use quantum annealing to find the ground state of an artificial Ising spin system comprising an array of eight superconducting flux quantum bits with programmable spin-spin couplings. We observe a clear signature of quantum annealing, distinguishable from classical thermal annealing through the temperature dependence of the time at which the system dynamics freezes. Our implementation can be configured in situ to realize a wide variety of different spin networks, each of which can be monitored as it moves towards a low-energy configuration. This programmable artificial spin network bridges the gap between the theoretical study of ideal isolated spin networks and the experimental investigation of bulk magnetic samples. Moreover, with an increased number of spins, such a system may provide a practical physical means to implement a quantum algorithm, possibly allowing more-effect…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Quantum annealing (QA) has the potential to signi fi cantly improve solution quality and reduce time complexity in solving combinatorial optimization problems compared to classical optimization methods.”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“The quantum annealer is a special quantum computer designed to solve combinatorial optimization problems with problem-size-independent time complexity 3 -5 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“Suf fi ciently slow evolution from H 0 to Hp enables the quantumsystem to stay at the ground state, which leads to the identi fi cation of the optimal solution of a given combinatorial optimization problem 3,40 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [3]
In the citing paper
“The most prominent exponent of this approach is the company D-Wave Systems, which has built large machines designed to implement this algorithm, 36 with the most recent such machine ( ' D-Wave 2X ' ) announced as having up to 1,152 qubits.”
From Quantum algorithms: an overview (2016) · cites this paper as [36]
Citations
Cites
Reducing the dimensionality of data with neural networks
Hinton, G. E., & Salakhutdinov, R. R. (2006) · Science · doi:10.1126/science.1127647 · Cited by 20,928
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
A 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
Manipulating the Quantum State of an Electrical Circuit
Vion, D., Aassime, A., Cottet, A., Joyez, P., Pothier, H., Urbina, C., Esteve, D., & Devoret, M. H. (2002) · Science · doi:10.1126/science.1069372 · Cited by 1,622
Rocha, A. R., García-suárez, V. M., Bailey, S. W., Lambert, C. J., Ferrer, J., & Sanvito, S. (2005) · Nature Materials · doi:10.1038/nmat1349 · Cited by 1,318
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 2×
“Here we modify this annealing procedure to perform a specialized experiment that permits us to distinguish between these two cases, by allowing the hi in equation (1) to be time dependent.”
BackgroundMethodDemonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L., Chow, J. M., Gambetta, J. M., Bishop, L. S., Johnson, B. R., Schuster, D. I., Majer, J., Blais, A., Frunzio, L., Girvin, S. M., et al. (2009) · Nature · doi:10.1038/nature08121 · Cited by 1,172
Quantum simulation of frustrated Ising spins with trapped ions
Kim, K., Chang, M.-S., Korenblit, S., Islam, R., Edwards, E. E., Freericks, J. K., Lin, G.-D., Duan, L.-M., & Monroe, C. (2010) · Nature · doi:10.1038/nature09071 · Cited by 750
Quantum annealing: A new method for minimizing multidimensional functions
Finnila, A. B., Gomez, M. A., Sebenik, C., Stenson, C., & Doll, J. D. (1994) · Chemical Physics Letters · doi:10.1016/0009-2614(94)00117-0 · Cited by 644
Quantum Annealing of a Disordered Magnet
Brooke, J., Bitko, D., F., T., Rosenbaum, & Aeppli, G. (1999) · Science · doi:10.1126/science.284.5415.779 · Cited by 518
Cited by
Items 201–300 of 1,009
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 99
Scaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J. M., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 77
Quantum phases in circuit QED with a superconducting qubit array
Zhang, Y., Yu, L., Liang, J. Q., Chen, G., Jia, S., & Nori, F. (2014) · Scientific Reports · doi:10.1038/srep04083 · Cited by 94
Prime factorization using quantum annealing and computational algebraic geometry
Dridi, R., & Alghassi, H. (2017) · Scientific Reports · doi:10.1038/srep43048 · Cited by 76
Yamamoto, K., Ando, K., Mertig, N., Takemoto, T., Yamaoka, M., Teramoto, H., Sakai, A., Takamaeda-Yamazaki, S., & Motomura, M. (2020) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc19947.2020.9062965 · Cited by 75
“First, the sparse connectivity of quantum [1] and CMOS [2] annealers limits their utility and their equivalent counts for fully connected spins are inferior.”
BackgroundDomain wall encoding of integer variables for quantum annealing and QAOA [dataset]
Chancellor, N. (2019) · Durham Research Online (Durham University) · doi:10.15128/r27d278t029 · Cited by 75
Takemoto, T., Hayashi, M., Yoshimura, C., & Yamaoka, M. (2019) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc.2019.8662517 · Cited by 98
Quantum machine learning with D‐wave quantum computer
Hu, F., Wang, B., Wang, N., & Wang, C. (2019) · Quantum Engineering · doi:10.1002/que2.12 · Cited by 68
Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 71
Zhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 76
Self-citationHybrid Quantum-Classical Computing for Future Network Optimization
Fan, L., & Han, Z. (2022) · IEEE Network · doi:10.1109/mnet.001.2200150 · Cited by 73
“We begin by examining encoding strategies and reformulation approaches that enable us to convert integer programming models to QUBO models that can be solved by the state-of-the-art quantum annealer.”
MethodInfluentialNoise‐enhanced spatial‐photonic Ising machine
Pierangeli, D., Marcucci, G., Brunner, D., & Conti, C. (2018) · Nanophotonics · doi:10.1515/nanoph-2020-0119 · Cited by 92
Chancellor, N., Zohren, S., & Warburton, P. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0022-6 · Cited by 76
“i;j;k;l ð Þ2plaquettes ~ σ i ~ σ z j ~ σ z k~ σ z l (11)”
Unraveling Quantum Annealers using Classical Hardness
Martin-Mayor, V., & Hen, I. (2015) · Scientific Reports · doi:10.1038/srep15324 · Cited by 61
Finding Maximum Cliques on the D-Wave Quantum Annealer
Chapuis, G., Djidjev, H., Hahn, G., & Rizk, G. (2019) · Journal of Signal Processing Systems · doi:10.1007/s11265-018-1357-8 · Cited by 70
“Each loop encodes both a 0 and 1 (or, alternatively, −1 and +1) value at the same time through two superimposed currents in both clockwise and counter-clockwise directions until the annealing process has been completed and the system turns classical [5, 18].”
BackgroundQuantum Optimization for the Graph Coloring Problem with Space-Efficient Embedding
Tabi, Z., El-Safty, K. H., Kallus, Z., Haga, P., Kozsik, T., Glos, A., & Zimborás, Z. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00018 · Cited by 111
“We test the limit of this approach using the commercially available quantum annealer, the D-Wave 2000Q which implements a programmable Ising spin network using superconducting flux qubits [22].”
MethodAdvances in Quantum Deep Learning: An Overview
Garg, S., & Ramakrishnan, G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.04316 · Cited by 45
“Potok et al. [68] conduct a study of performance of deep learning architectures on 3 different computing platforms: quantum (a D-Wave processor [37]), high performance, and neuromorphic and show the individual benefits of each.”
BackgroundThermodynamic control —An old paradigm with new applications
Deffner, S., & Bonança, M. V. S. (2020) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/131/20001 · Cited by 85
Boltzmann sampling from the Ising model using quantum heating of coupled nonlinear oscillators
Goto, H., Lin, Z., & Nakamura, Y. (2018) · Scientific Reports · doi:10.1038/s41598-018-25492-8 · Cited by 83
“−∞ M dx x x M dx x x (1) , ( 1) (7) i i i i i i i i ( )”
Hybrid quantum-classical machine learning for generative chemistry and drug design
Gircha, A. I., Boev, A. S., Avchaciov, K., Fedichev, P. O., & Fedorov, A. K. (2023) · Scientific Reports · doi:10.1038/s41598-023-32703-4 · Cited by 56
“ple, quantum annealing processors [20] could potentially enable more efficient solving quadratic unconstrained binary optimization problems and approximating sampling from the thermal distributions of transverse Ising systems.”
BackgroundKing, A. D., Nisoli, C., Dahl, E. D., Poulin-Lamarre, G., & Lopez-Bezanilla, A. (2021) · Science · doi:10.1126/science.abe2824 · Cited by 68
Quantum Computation and Quantum Information
Wang, Y. (2012) · Statistical Science · doi:10.1214/11-sts378 · Cited by 95
Scalable Spin-Glass Optical Simulator
Pierangeli, D., Rafayelyan, M. S., Conti, C., & Gigan, S. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.034087 · Cited by 81
Takemoto, T., Yamamoto, K., Yoshimura, C., Hayashi, M., Tada, M., Saito, H., Mashimo, M., & Yamaoka, M. (2021) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc42613.2021.9365748 · Cited by 67
Benchmark of quantum-inspired heuristic solvers for quadratic unconstrained binary optimization
Oshiyama, H., & Ohzeki, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-06070-5 · Cited by 85
“E(σ ) = 1 √ N ∑ 1≤i< j≤N Ji, jσiσ j, (3)”
Böhm, F., Vaerenbergh, T. V., Verschaffelt, G., & der Sande, G. V. (2021) · Communications Physics · doi:10.1038/s42005-021-00655-8 · Cited by 90
Demonstration of a Nonstoquastic Hamiltonian in Coupled Superconducting Flux Qubits
Ozfidan, I., Deng, C., Smirnov, A. Y., Lanting, T. M., Harris, R., Swenson, L. J., Whittaker, J. D., Altomare, F., Babcock, M. C., Baron, C., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.034037 · Cited by 78
“Early generation processors [1] for Hamiltonian-based quantum computation were designed to perform quantum annealing (QA), a heuristic algorithm for finding low-energy configurations of a system [2–4].”
BackgroundMethodSelf-citationLitvinenko, A. N., Khymyn, R., González, V. H., Ovcharov, R. V., Awad, A. A., Tiberkevich, V. S., Slavin, A. N., & Åkerman, J. J. (2023) · Communications Physics · doi:10.1038/s42005-023-01348-0 · Cited by 83
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., Bernal Neira, D., & Quantum Economic Development Consortium(QED-C) Collaboration (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3678184 · Cited by 59
“To this end, we built on the existing open-source QED-C Application-oriented Benchmark suite, enhancing it to support benchmarking of hybrid quantum-classical solutions to combinatorial optimization problems, often cited as a use case for quantum computing.”
InfluentialDuality quantum computer and the efficient quantum simulations
Wei, S.-J., & Long, G. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1263-6 · Cited by 73
“Two successful experiments of quantum annealing have been completed recently [67,68].”
BackgroundTakemoto, T., Hayashi, M., Yoshimura, C., & Yamaoka, M. (2019) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2019.2949230 · Cited by 76
“The last decade has seen impressive progress in the development of a new computer architecture, commonly known as an “annealing processor” (AP) [1]–[6].”
BackgroundThermodynamic control -- an old paradigm with new applications
Deffner, S., & Bonança, M. V. S. (2020) · Springer Link (Chiba Institute of Technology) · doi:10.13016/m2chix-jxzi · Cited by 65
Unconstrained binary models of the travelling salesman problem variants for quantum optimization
Salehi, Ö., Glos, A., & Miszczak, J. A. (2022) · Quantum Information Processing · doi:10.1007/s11128-021-03405-5 · Cited by 96
“Quantum annealing has attracted significant attention since it is realizable in the commercially available D-Wave machines [16].”
BackgroundExperimental Observation of Phase Transitions in Spatial Photonic Ising Machine
Fang, Y., Huang, J., & Ruan, Z. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.043902 · Cited by 80
Xie, S., Raman, S. R. S., Ni, C., Wang, M., Yang, M., & Kulkarni, J. P. (2022) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2022.3176610 · Cited by 78
“by leveraging natural coupling phenomena using quantum bits, lasers, or coupled oscillators [18]–[20].”
BackgroundNonequilibrium quantum phase transitions in the Ising model
Bastidas, V. M., Emary, C., Schaller, G., & Brandes, T. (2012) · Physical Review A · doi:10.1103/physreva.86.063627 · Cited by 73
Madhavan, A., Sherwood, T., & Strukov, D. B. (2014) · ACM SIGARCH Computer Architecture News · doi:10.1145/2678373.2665747 · Cited by 65
“Race Logic is especially suited for solving problems related to the traversal of directed acyclic graphs commonly used in dynamic programming algorithms.”
BackgroundA Near-Term Quantum Computing Approach for Hard Computational Problems in Space ExplorationPreprint
Smelyanskiy, V., Rieffel, E. G., Knysh, S., Williams, C. P., Johnson, M. W., Thom, M. C., Macready, W. G., & Pudenz, K. L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1204.2821 · Cited by 83
“The processor implements a quantum annealing algorithm [13] as will be described below.”
MethodSelf-citationA Leap among Quantum Computing and Quantum Neural Networks: A Survey
Massoli, F. V., Vadicamo, L., Amato, G. M., & Falchi, F. (2022) · ACM Computing Surveys · doi:10.1145/3529756 · Cited by 94
“In Reference [153], the authors performed experiments on a “D-Wave Two” quantum annealer.”
ResultQuantum Algorithms Applied to Satellite Mission Planning for Earth Observation
Rainjonneau, S., Tokarev, I., Iudin, S., Rayaprolu, S., Pinto, K., Lemtiuzhnikova, D., Koblan, M., Barashov, E., Kordzanganeh, M., Pflitsch, M., et al. (2023) · IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing · doi:10.1109/jstars.2023.3287154 · Cited by 83
“For example, both D-Wave’s Leap Hybrid solver [25] and Gurobi have difficulties solving even a small cluster with 4 requests over a time limit of 1 minute.”
BackgroundHaribara, Y., Utsunomiya, S., & Yamamoto, Y. (2015) · Lecture notes in physics · doi:10.1007/978-4-431-55756-2_12 · Cited by 79
Efficiency of quantum vs. classical annealing in nonconvex learning problems
Baldassi, C., & Zecchina, R. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1711456115 · Cited by 64
Ising-Model Optimizer with Parallel-Trial Bit-Sieve Engine
Matsubara, S., Tamura, H., Takatsu, M., Yoo, D., Vatankhahghadim, B., Yamasaki, H., Miyazawa, T., Tsukamoto, S., Watanabe, Y., Takemoto, K., et al. (2017) · Advances in intelligent systems and computing · doi:10.1007/978-3-319-61566-0_39 · Cited by 66
Scaling advantage of chaotic amplitude control for high-performance combinatorial optimization
Leleu, T. G., Khoyratee, F., Levi, T., Hamerly, R., Kohno, T., & Aihara, K. (2021) · Communications Physics · doi:10.1038/s42005-021-00768-0 · Cited by 98
“In principle, these physical systems often possess unique properties, such as coherent superposition in fl ux qubits 17 and energy ef fi ciency of memresistors 4,18 , which could lead to a distinctive advantage compared to conventional computers (see Fig.”
BackgroundThe identification of cis-regulatory elements: A review from a machine learning perspective
Li, Y., Chen, C., Kaye, A. M., & Wasserman, W. W. (2015) · Biosystems · doi:10.1016/j.biosystems.2015.10.002 · Cited by 73
Whitfield, J. D., Faccin, M., & Biamonte, J. D. (2012) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/99/57004 · Cited by 54
Event Classification with Quantum Machine Learning in High-Energy Physics
Terashi, K., Kaneda, M., Kishimoto, T., Saito, M., Sawada, R., & Tanaka, J. (2021) · Computing and Software for Big Science · doi:10.1007/s41781-020-00047-7 · Cited by 72
Readiness of Quantum Optimization Machines for Industrial Applications
Perdomo-Ortiz, A., Feldman, A., Ozaeta, A., Isakov, S. V., Zhu, Z., O’Gorman, B., Katzgraber, H. G., Diedrich, A., Neven, H., de Kleer, J., et al. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.014004 · Cited by 62
A transmon quantum annealer: decomposing many-body Ising constraints into pair interactions
Leib, M., Zoller, P., & Lechner, W. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015008 · Cited by 63
“Adiabatic quantum computing [5] has recently gained considerable attention because of the prospect to solve problems that can be mapped to classical optimizations [6, 7, 8, 9] efficiently [10, 11, 12, 13, 14, 15, 16].”
BackgroundGlobal Warming: Temperature Estimation in Annealers
Raymond, J., Yarkoni, S., & Andriyash, E. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00023 · Cited by 55
“The annealers we evaluate are the latest-model D-Wave1 quantum annealer – the D-Wave 2X (DW2X) [15, 16, 17, 18], and an implementation of simulated thermal annealing on a single CPU.”
MethodOptimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62
“To this end, we built on the existing open-source QED-C Application-oriented Benchmark suite, enhancing it to support benchmarking of hybrid quantum-classical solutions to combinatorial optimization problems, often cited as a use case for quantum computing.”
InfluentialImplementation of Quantum Annealing: A Systematic Review
Yulianti, L. P., & Surendro, K. (2022) · IEEE Access · doi:10.1109/access.2022.3188117 · Cited by 79
Simulating the Shastry-Sutherland Ising Model Using Quantum Annealing
Kairys, P., King, A. D., Ozfidan, I., Boothby, K., Raymond, J., Banerjee, A., & Humble, T. S. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020320 · Cited by 82
Max 2-SAT with up to 108 qubits
Santra, S., Quiroz, G., Ver Steeg, G., & Lidar, D. A. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045006 · Cited by 60
Quantum coherence of the Heisenberg spin models with Dzyaloshinsky-Moriya interactions
Radhakrishnan, C., Parthasarathy, M., Jambulingam, S., & Byrnes, T. (2017) · Scientific Reports · doi:10.1038/s41598-017-13871-6 · Cited by 65
“It can be potentially applied to a variety of different systems, from naturally occuring many-body systems to synthetic metamaterials [54, 70].”
BackgroundUnderstanding dynamics of coherent Ising machines through simulation of large-scale 2D Ising models
Böhm, F., Inagaki, T., Inaba, K., Honjo, T., Enbutsu, K., Umeki, T., Kasahara, R., & Takesue, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07328-1 · Cited by 72
GPU-based Ising computing for solving max-cut combinatorial optimization problems
Cook, C., Zhao, H., Sato, T. G., Hiromoto, M., & Tan, S. X.-D. (2019) · Integration · doi:10.1016/j.vlsi.2019.07.003 · Cited by 70
Neural-network states for the classical simulation of quantum computingPreprint
Jónsson, B., Bauer, B., & Carleo, G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.05232 · Cited by 94
Driver Hamiltonians for constrained optimization in quantum annealing
Hen, I., & Sarandy, M. S. (2016) · Physical Review A · doi:10.1103/physreva.93.062312 · Cited by 59
Quantum machine learning and quantum biomimetics: A perspective
Lamata, L. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab9803 · Cited by 77
Computational complexity continuum within Ising formulation of NP problems
Kalinin, K. P., & Berloff, N. G. (2022) · Communications Physics · doi:10.1038/s42005-021-00792-0 · Cited by 78
“Unconventional computing architectures were proposed for numerous systems, including superconducting qubits 1 – 3 , fi eld-programmable gate arrays 4 , optical parametric oscillators 5,6 , memristors 7 , lasers 8 – 10 , photonic simulators 11,12 , trapped ions 13 , polariton 14,15 and photon 16…”
BackgroundPenalty Weights in QUBO Formulations: Permutation Problems
Ayodele, M. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-04148-8_11 · Cited by 92
Illa, M., & Savage, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.052605 · Cited by 79
“Applications for such devices, such as D-Wave’s quantum annealers (QAs) [17], are optimization [18–23], high energy physics [24, 25], machine learning [26–38], spin systems [39–49], quantum chemistry [50–55], biology [56–59], finance [60–62], graph [63–65], multivariate [66], integer [67] and linear equations [68], an…”
BackgroundObserving the Nonequilibrium Dynamics of the Quantum Transverse-Field Ising Chain in Circuit QED
Viehmann, O., von Delft, J., & Marquardt, F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.030601 · Cited by 75
Dissipation in adiabatic quantum computers: lessons from an exactly solvable model
Keck, M., Montangero, S., Santoro, G. E., Fazio, R., & Rossini, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cef · Cited by 72
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Montañez-Barrera, J. A., Willsch, D., Maldonado-Romo, A., & Michielsen, K. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad35e4 · Cited by 57
“IV.”
Reinforcement Quantum Annealing: A Hybrid Quantum Learning Automata
Ayanzadeh, R., Halem, M., & Finin, T. (2020) · Scientific Reports · doi:10.1038/s41598-020-64078-1 · Cited by 57
Quantum approximate optimization via learning-based adaptive optimization
Cheng, L., Chen, Y., Zhang, S., & Zhang, S. (2024) · Communications Physics · doi:10.1038/s42005-024-01577-x · Cited by 80
Superconducting Computing in Large-Scale Hybrid Systems
Holmes, D., Kadin, A. M., & Johnson, M. W. (2015) · Computer · doi:10.1109/mc.2015.375 · Cited by 57
Self-citationNovel pseudo-random number generator based on quantum random walks
Yang, Y., & Zhao, Q. (2016) · Scientific Reports · doi:10.1038/srep20362 · Cited by 61
A path towards quantum advantage in training deep generative models with quantum annealers
Winci, W., Buffoni, L., Sadeghi, H., Khoshaman, A., Andriyash, E., & Amin, M. H. (2020) · Machine Learning: Science and Technology · doi:10.1088/2632-2153/aba220 · Cited by 54
Self-citationPerformance Comparison of Typical Binary-Integer Encodings in an Ising Machine
Tamura, K., Shirai, T., Katsura, H., Tanaka, S., & Togawa, N. (2021) · IEEE Access · doi:10.1109/access.2021.3081685 · Cited by 80
“Examples include simulated annealing (SA)-based machines [13]–[17], quantum annealing machines [18]–[20], and photonics-based machines [21]–[24].”
BackgroundMitigating 5G security challenges for next-gen industry using quantum computing
Mangla, C., Rani, S., Qureshi, N. M. F., & Singh, A. D. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.07.009 · Cited by 71
“In regards to practical application, D-Wave Boixo et al. (2014) Johnson et al. (2011) company is already proving a quantum annealing chip-set Boixo et al. (2013) commercially.”
Solving Quantum Chemistry Problems with a D-Wave Quantum Annealer
Streif, M., Neukart, F., & Leib, M. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_10 · Cited by 85
Benchmarking Hamiltonian Noise in the D-Wave Quantum Annealer
Zaborniak, T., & de Sousa, R. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3050449 · Cited by 70
“Quantum annealers are nonuniversal quantum computers designed to solve optimization problems [1]–[3].”
BackgroundScalable Emulation of Sign-Problem–Free Hamiltonians with Room-Temperature p -bits
Camsari, K. Y., Chowdhury, S., & Datta, S. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.034061 · Cited by 67
“In this paper, we limit our discussion to the Transverse Ising Hamiltonian [27, 28] commonly employed by quantum annealers [29], though the methodology of the mapping is general and can be used for other Hamiltonians, as long as they are stoquastic, a special class of Hamiltonians [30] that avoid the sign problem [31]…”
BackgroundMethodEmergence of Hilbert Space Fragmentation in Ising Models with a Weak Transverse Field
Yoshinaga, A., Hakoshima, H., Imoto, T., Matsuzaki, Y., & Hamazaki, R. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.090602 · Cited by 73
Optimality guarantees for crystal structure prediction
Gusev, V. V., Adamson, D., Deligkas, A., Antypov, D., Collins, C. M., Krysta, P., Potapov, I., Darling, G. R., Dyer, M. S., Spirakis, P. G., et al. (2023) · Nature · doi:10.1038/s41586-023-06071-y · Cited by 72
Liu, C.-W., Polkovnikov, A., & Sandvik, A. W. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.147203 · Cited by 55
Clustering of Nonergodic Eigenstates in Quantum Spin Glasses
Baldwin, C. L., Laumann, C. R., Pal, A., & Scardicchio, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.127201 · Cited by 57
Shim, Y. S., Jaiswal, A., & Roy, K. (2017) · Journal of Applied Physics · doi:10.1063/1.4983636 · Cited by 62
Boltzmann sampling for an XY model using a non-degenerate optical parametric oscillator network
Takeda, Y., Tamate, S., Yamamoto, Y., Takesue, H., Inagaki, T., & Utsunomiya, S. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa923b · Cited by 66
Solving flexible job shop scheduling problems in manufacturing with Quantum Annealing
Schworm, P., Wu, X., Glatt, M. F., & Aurich, J. C. (2022) · Production Engineering · doi:10.1007/s11740-022-01145-8 · Cited by 69
“At the end of QA process (i.e., A ( s ) = 0, B ( s ) = 1 ), the qubits remain in a state described by the final Hamilton, which can be applied to annealers formulated as [18]: with scalar weights Q ii , Q ij and binary variables x i , x j .”
BackgroundMethodQuantum Machine Learning for Next-G Wireless Communications: Fundamentals and the Path Ahead
Narottama, B., Mohamed, Z., & Aïssa, S. (2023) · IEEE Open Journal of the Communications Society · doi:10.1109/ojcoms.2023.3309268 · Cited by 71
Analog optical computer for AI inference and combinatorial optimization
Kalinin, K. P., Gladrow, J., Chu, J., Clegg, J., Cletheroe, D., Kelly, D. J., Rahmani, B., Brennan, G., Canakci, B., Falck, F., et al. (2025) · Nature · doi:10.1038/s41586-025-09430-z · Cited by 103
Rapid counter-diabatic sweeps in lattice gauge adiabatic quantum computing
Hartmann, A., & Lechner, W. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab14a0 · Cited by 66
Protecting Spin Coherence in a Tunable Heisenberg Model
Davis, E. J., Periwal, A., Cooper, E. S., Bentsen, G. S., Evered, S. J., Kirk, K. V., & Schleier-Smith, M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.060402 · Cited by 66
Bashar, M. K., Mallick, A., Truesdell, D. S., Calhoun, B. H., Joshi, S., & Shukla, N. (2020) · IEEE Journal on Exploratory Solid-State Computational Devices and Circuits · doi:10.1109/jxcdc.2020.3025994 · Cited by 65
“Examples of such demonstrations include the D-Wave quantum annealer [13]–[15], optical parametric”
BackgroundModels in quantum computing: a systematic review
Nimbe, P., Weyori, B. A., & Adekoya, A. F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03021-3 · Cited by 65
3-regular three-XORSAT planted solutions benchmark of classical and quantum heuristic optimizers
Kowalsky, M., Albash, T., Hen, I., & Lidar, D. A. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac4d1b · Cited by 78
Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Braine, L., Egger, D. J., Glick, J., & Woerner, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3063635 · Cited by 51
“Adiabatic quantum computing [13], [14] and variational algorithms, such as the variational quantum eigensolver (VQE) [9] and the quantum approximate optimization algorithm (QAOA) [10], are designed to tackle quadratic unconstrained binary optimization (QUBO) problems.”
MethodNoise-injected analog Ising machines enable ultrafast statistical sampling and machine learning
Böhm, F., Alonso-Urquijo, D., Verschaffelt, G., & der Sande, G. V. (2022) · Nature Communications · doi:10.1038/s41467-022-33441-3 · Cited by 74
“The noise signal is then digitized by an ADC (ADC2) and added to the feedback signal in equation (3).”
BackgroundMethodInfluentialMulti-objective Quantum Annealing approach for solving flexible job shop scheduling in manufacturing
Schworm, P., Wu, X., Klar, M., Glatt, M. F., & Aurich, J. C. (2023) · Journal of Manufacturing Systems · doi:10.1016/j.jmsy.2023.11.015 · Cited by 51
“QA is a quantum computing technique that leverages quantum mechanics to speed up solving combinatorial optimization problems [25].”
MethodChallenges of variational quantum optimization with measurement shot noise
Scriva, G., Astrakhantsev, N., Pilati, S., & Mazzola, G. (2024) · Physical Review A · doi:10.1103/physreva.109.032408 · Cited by 81
“Interestingly, optimization with quantum annealing has been the first application of commercial quantum devices [5, 6], which mostly rely on incoherent tunneling events to escape the cost-function local minima [7].”
BackgroundAn Ising Computer Based on Simulated Quantum Annealing by Path Integral Monte Carlo Method
Okuyama, T., Hayashi, M., & Yamaoka, M. (2017) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2017.8123652 · Cited by 57
“Computing architectures have been proposed that map the combinatorial optimization problems to find the lowest energy state of Ising models [1]–[3].”
BackgroundA quantum annealer with fully programmable all-to-all coupling via Floquet engineering
Onodera, T., Ng, E., & McMahon, P. L. (2020) · npj Quantum Information · doi:10.1038/s41534-020-0279-z · Cited by 61
OptiMathSAT: A Tool for Optimization Modulo Theories
Sebastiani, R., & Trentin, P. (2018) · Journal of Automated Reasoning · doi:10.1007/s10817-018-09508-6 · Cited by 51
Topology-Enhanced Nonreciprocal Scattering and Photon Absorption in a Waveguide
Nie, W., Shi, T., Nori, F., & Liu, Y.-X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.044041 · Cited by 54
“[65] M.”
BackgroundQuantum Shuttle: traffic navigation with Quantum computing
Yarkoni, S., Neukart, F., Tagle, E. M. G., Magiera, N., Mehta, B., Hire, K., Narkhede, S., & Hofmann, M. (2020) · Proceedings of the 1st ACM SIGSOFT International Workshop on Architectures and Paradigms for Engineering Quantum Software · doi:10.1145/3412451.3428500 · Cited by 50
“The physics motivating the quantum annealing algorithm used by D-Wave QPUs is beyond the scope of this work, and extensive background can be found in literature [9, 13]; instead we focus on the software engineering design choices that allowed us to use QPUs in our QWS.”
Method
Metadata
- Authors
- Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., Chapple, E. M., Enderud, C., Hilton, J. P., Karimi, K., Ladizinsky, E., Ladizinsky, N., Oh, T., Perminov, I., Rich, C., Thom, M. C., Tolkacheva, E., Truncik, C. J. S., Uchaikin, S., Wang, J., Wilson, B., & Rose, G.
- Affiliations
- D-Wave Systems (Canada) (CA)
- University of Agder (NO)
- Simon Fraser University (CA)
- Corresponding author
- Johnson, M. W.
- ORCID
- Venue
- Nature
- Published
- 2011-05
- Volume
- 473
- Issue
- 7346
- Pages
- 194-198
- ISSN
- 0028-0836 (ISSN-L)
- 1476-4687
- OpenAlex
- W2024860775
- Semantic Scholar
- d0019f2ef578736cd60d7387c99c47bca4272faf
- Cited by
- 1,891
- References
- 34
- Citations by year
- 2026: 130 · 2025: 177 · 2024: 181 · 2023: 173 · 2022: 185 · 2021: 184 · 2020: 152 · 2019: 138 · 2018: 103 · 2017: 141 · 2016: 99 · 2015: 87 · 2014: 75 · 2013: 32 · 2012: 28
- FWCI
- 41.46
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature (publishedVersion)
- PubMed (publishedVersion)
- RePEc: Research Papers in Economics (submittedVersion)
- 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 › Condensed Matter Physics › Physics of Superconductivity and Magnetism
- Keywords
- quantum annealing, Ising spin systems, superconducting flux qubit, ground state search, spin freezing, combinatorial optimization, quantum algorithms
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.