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 301–400 of 1,009
PT -symmetric slowing down of decoherence
Gardas, B., Deffner, S., & Saxena, A. (2016) · Physical Review A · doi:10.1103/physreva.94.040101 · Cited by 53
Realizing spin Hamiltonians in nanoscale active photonic lattices
Parto, M., Hayenga, W. E., Marandi, A., Christodoulides, D. N., & Khajavikhan, M. (2020) · Nature Materials · doi:10.1038/s41563-020-0635-6 · Cited by 53
Nonequilibrium phases in hybrid arrays with flux qubits and nitrogen-vacancy centers
Hümmer, T., Reuther, G. M., Hänggi, P., & Zueco, D. (2012) · Physical Review A · doi:10.1103/physreva.85.052320 · Cited by 54
Quantum processor-inspired machine learning in the biomedical sciences
Li, R. Y., Gujja, S., Bajaj, S. R., Gamel, O., Cilfone, N. A., Gulcher, J. R., Lidar, D. A., & Chittenden, T. W. (2021) · Patterns · doi:10.1016/j.patter.2021.100246 · Cited by 57
“One of the uncon-ventional ML approaches used in this study, quantum annealing with processors made by D-Wave Systems, 11–13 features more than 2,000 qubits, becoming large enough to solve real-world problems, 14 perform quantum simulation, 15 and compete with classical optimization algorithms.”
Short-depth QAOA circuits and quantum annealing on higher-order ising models
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00825-w · Cited by 98
Quantum Simulation of Antiferromagnetic Heisenberg Chain with Gate-Defined Quantum Dots
van Diepen, C. J., Hsiao, T.-K., Mukhopadhyay, U., Reichl, C., Wegscheider, W., & Vandersypen, L. M. K. (2021) · Physical Review X · doi:10.1103/physrevx.11.041025 · Cited by 74
“Analog quantum simulations of magnetism [1] have been performed with a rich variety of experimental platforms, ranging from ultracold atoms in optical lattices [2–7] to trapped ions [8,9], scanning tunneling microscopy of atoms on metallic surfaces [10], and superconducting circuits [11].”
BackgroundCoherent Ising Machines with Optical Error Correction Circuits
Reifenstein, S., Kako, S., Khoyratee, F., Leleu, T. G., & Yamamoto, Y. (2021) · Advanced Quantum Technologies · doi:10.1002/qute.202100077 · Cited by 59
Non-stoquastic Hamiltonians in quantum annealing via geometric phases
Vinci, W., & Lidar, D. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0037-z · Cited by 48
“Note that the geometric term transforms as a geometric connection(33) (see SM, section D): GðsÞ 1⁄4 VðsÞGðsÞVðsÞ þ iVðsÞ _ VðsÞ : (10)”
BackgroundFinding spin glass ground states using quantum walks
Callison, A., Chancellor, N., Mintert, F., & Kendon, V. M. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab5ca2 · Cited by 61
Solving SAT (and MaxSAT) with a quantum annealer: Foundations, encodings, and preliminary results
Bian, Z., Chudak, F. A., Macready, W. G., Roy, A., Sebastiani, R., & Varotti, S. (2020) · Information and Computation · doi:10.1016/j.ic.2020.104609 · Cited by 69
Su, Y., Kim, H., & Kim, B. (2022) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2021.3139901 · Cited by 48
Quantum Computing in Supply Chain Management State of the Art and Research Directions
Gachnang, P., Ehrenthal, J. C. F., Hanne, T., & Dornberger, R. (2022) · Asian Journal of Logistics Management · doi:10.14710/ajlm.2022.14325 · Cited by 49
A scalable universal Ising machine based on interaction-centric storage and compute-in-memory
Yue, W., Zhang, T., Jing, Z., Wu, K., Yang, Y., Yang, Z., Wu, Y., Bu, W., Zheng, K., Kang, J., et al. (2024) · Nature Electronics · doi:10.1038/s41928-024-01228-7 · Cited by 47
Maximum-Entropy Inference with a Programmable Annealer
Chancellor, N., Szoke, S., Vinci, W., Aeppli, G., & Warburton, P. A. (2016) · Scientific Reports · doi:10.1038/srep22318 · Cited by 46
“The D-Wave chip [29, 30] is a superconducting integrated circuit implementation of an Ising spin glass in a local (longitudinal) random field, H Ising , to which a local transverse field can be applied to relax the spins [15].”
Improving quantum annealing of the ferromagnetic p -spin model through pausing
Passarelli, G., Cataudella, V., & Lucignano, P. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.024302 · Cited by 52
Race Logic: A hardware acceleration for dynamic programming algorithms
Madhavan, A., Sherwood, T., & Strukov, D. B. (2014) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2014.6853226 · Cited by 47
Robust Classification with Adiabatic Quantum Optimization
Denchev, V. S., Ding, N., Vishwanathan, S. V. N., & Neven, H. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.1148 · Cited by 24
Quantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46
“The quantum annealer is a special quantum computer designed to solve combinatorial optimization problems with problem-size-independent time complexity 3 – 5 .”
Low-Rank Combinatorial Optimization and Statistical Learning by Spatial Photonic Ising Machine
Yamashita, H., Okubo, K.-I., Shimomura, S., Ogura, Y., Tanida, J., & Suzuki, H. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.063801 · Cited by 68
Scaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 97
“Our implementation of QAC for the D-Wave Advantage graph is available as part of the PegasusTools Python package [3].”
Adame, J. I., & McMahon, P. L. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab935a · Cited by 42
Toward Practical-Scale Quantum Annealing Machine for Prime Factoring
Maezawa, M., Fujii, G., Hidaka, M., Imafuku, K., Kikuchi, K., Koike, H., Makise, K., Nagasawa, S., Nakagawa, H., Ukibe, M., et al. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061012 · Cited by 52
Quantum Annealing with Longitudinal Bias Fields
Graß, T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.120501 · Cited by 46
Quantum Semantic Learning by Reverse Annealing of an Adiabatic Quantum Computer
Rocutto, L., Destri, C., & Prati, E. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.202000133 · Cited by 49
Reverse annealing for nonnegative/binary matrix factorization
Golden, J. K., & O’Malley, D. (2021) · PLoS ONE · doi:10.1371/journal.pone.0244026 · Cited by 47
“Recently, D-Wave’s quantum annealing hardware [6, 7] has introduced a new form of annealing—reverse annealing [8, 9].”
BackgroundTropical Tensor Network for Ground States of Spin Glasses
Liu, J.-G., Wang, L., & Zhang, P. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.090506 · Cited by 69
“Next, we consider spin glass instances with ±J coupling and no external field on the chimera graph of the actual DWave device [6] shown in Fig.”
BackgroundMethodResearch trends in combinatorial optimization
Weinand, J. M., Sörensen, K., Segundo, P. S., Kleinebrahm, M., & McKenna, R. (2021) · International Transactions in Operational Research · doi:10.1111/itor.12996 · Cited by 63
“Quantum annealing with manufactured spins (Johnson et al., 2011) 533 59 2011 Nature Hyper-heuristics: a survey of the state of the art (Burke et al.”
MethodBabbush, R., Perdomo‐Ortiz, A., O'Gorman, B., Macready, W., & Aspuru‐Guzik, A. (2014) · Advances in Chemical Physics · doi:10.1002/9781118755815.ch05 · Cited by 45
“As a final step we will reduce these Hamiltonians to a 2-local form specifically design for the D-Wave One used in [36,65–67].”
MethodDetermination and correction of persistent biases in quantum annealers
Perdomo-Ortiz, A., O’Gorman, B., Fluegemann, J., Biswas, R., & Smelyanskiy, V. N. (2016) · Scientific Reports · doi:10.1038/srep18628 · Cited by 43
“The recent introduction of QA hardware by D-Wave Systems [2, 3] has invigorated theoretical and experimental research into the computational power and practical implementation challenges of the QA paradigm.”
BackgroundInfluentialResource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013) · Annalen der Physik · doi:10.1002/andp.201300120 · Cited by 33
“D-Wave System’s current generation of quantum annealing machines are an important example of devices that implement this type of quantum Ising model Hamiltonian2 [11].”
BackgroundQuantum search with hybrid adiabatic–quantum-walk algorithms and realistic noise
Morley, J. G., Chancellor, N., Bose, S., & Kendon, V. M. (2019) · Physical Review A · doi:10.1103/physreva.99.022339 · Cited by 54
“[2] M.”
BackgroundQuantum algorithm for energy matching in hard optimization problems
Baldwin, C. L., & Laumann, C. R. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.224201 · Cited by 57
Kanao, T., & Goto, H. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00355-1 · Cited by 56
Low-Depth Mechanisms for Quantum Optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030312 · Cited by 43
Graph isomorphism and adiabatic quantum computing
Gaitan, F., & Clark, L. (2014) · Physical Review A · doi:10.1103/physreva.89.022342 · Cited by 60
Low depth mechanisms for quantum optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2020) · arXiv · doi:10.48550/arxiv.2008.08615 · Cited by 45
Dissipative Landau-Zener problem and thermally assisted Quantum Annealing
Arceci, L., Barbarino, S., Fazio, R., & Santoro, G. E. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.054301 · Cited by 56
Yoshimura, C., Hayashi, M., Okuyama, T., & Yamaoka, M. (2017) · International Journal of Networking and Computing · doi:10.15803/ijnc.7.2_154 · Cited by 51
“Some computers are based on natural phenomena such as the quantum superposition [8] or optical parametric oscillation [17].”
BackgroundThermalization, Freeze-out, and Noise: Deciphering Experimental Quantum Annealers
Marshall, J., Rieffel, E. G., & Hen, I. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064025 · Cited by 55
“In particular, we tested the freeze-out conjecture [1, 2, 9] by comparing the performance of the two machines on certain Ising problems, making use of a recent method to accurately estimate the degeneracies of such problems.”
Implementation of a Hybrid Classical-Quantum Annealing Algorithm for Logistic Network Design
Ding, Y., Chen, X., Lamata, L., Solano, E., & Sanz, M. (2021) · SN Computer Science · doi:10.1007/s42979-021-00466-2 · Cited by 55
“Nonetheless, quantum annealers have proven their capability to codify hard problems in different fields, such as condensed matter physics [16–20], engineering [21], cryptography [22, 23], biology [24] and finance [25–27], among others.”
BackgroundAhmed, I. H., Chiu, P.-W., & Kim, C. H. (2020) · Symposium on VLSI Circuits · doi:10.1109/vlsicircuits18222.2020.9162869 · Cited by 44
Travel time optimization on multi-AGV routing by reverse annealing
Haba, R., Ohzeki, M., & Tanaka, K. (2022) · Scientific Reports · doi:10.1038/s41598-022-22704-0 · Cited by 43
Benchmark Test of Black-box Optimization Using D-Wave Quantum Annealer
Koshikawa, A. S., Ohzeki, M., Kadowaki, T., & Tanaka, K. (2021) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.90.064001 · Cited by 43
Multi-car paint shop optimization with quantum annealing
Yarkoni, S., Alekseyenko, A., Streif, M., Dollen, D. V., Neukart, F., & Bäck, T. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00019 · Cited by 60
Hybrid quantum architecture for smart city security
Barletta, V. S., Caivano, D., Vincentiis, M. D., Pal, A., & Scalera, M. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112161 · Cited by 57
Arbitrarily Varying Wiretap Channels With Type Constrained States
Goldfeld, Z., Cuff, P., & Permuter, H. H. (2016) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/glocomw.2016.7848839 · Cited by 44
A long-lived capacitively shunted flux qubit embedded in a 3D cavity
Abdurakhimov, L. V., Mahboob, I., Toida, H., Kakuyanagi, K., & Saito, S. (2019) · Applied Physics Letters · doi:10.1063/1.5136262 · Cited by 48
Suzuki, K., & Takahashi, K. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.032016 · Cited by 46
“t is a method solving combinatorial optimization problems and has attracted intensive attention recently, as quantum annealing [15–19], due to its use for a device manufactured by DWave Systems, Inc. [20, 21]. The solution of the problem is set to thegroundstate ofthe IsingHamiltonian. TheHamiltonian is slowly changed…”
MethodSu, Y., Kim, H., & Kim, B. (2020) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc19947.2020.9062938 · Cited by 47
“Annealing processors [1-3] based on the convergence property of the Ising model offer an attractive means for solving combinatorial optimization problems [4].”
MethodQuantum Information Processing Algorithms with Emphasis on Machine Learning
Uehara, G. S., Spanias, A., & Clark, W. (2021) · International Conference on Information, Intelligence, Systems & Applications (IISA) · doi:10.1109/iisa52424.2021.9555570 · Cited by 49
Embedding Overhead Scaling of Optimization Problems in Quantum Annealing
Könz, M. S., Lechner, W., Katzgraber, H. G., & Troyer, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040322 · Cited by 67
“The availability of commercial quantum annealing devices [1–3] has revolutionized (quantum) optimization across many disciplines.”
BackgroundSu, Y., Mu, J., Kim, H., & Kim, B. (2022) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2022.3142896 · Cited by 49
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42
“Due to the computational difficulty of simulating quantum systems [25], the study of QA remained a theoretical pursuit until 2011, when D-Wave Systems produced a quantum hardware implementation of the QA algorithm [6, 43, 33, 42].”
From near to eternity: Spin-glass planting, tiling puzzles, and constraint-satisfaction problems
Hamze, F., Jacob, D. C., Ochoa, A. J., Perera, D., Wang, W., & Katzgraber, H. G. (2018) · Physical review. E · doi:10.1103/physreve.97.043303 · Cited by 55
“While the task of creating such problems is of theoretical interest due to their potential assistance in answering open questions about the nature of spin glasses, the pace of research has been hastened in recent years by practical motivations, in particular, the availability of quantum annealing [6, 7] and related an…”
BackgroundSelf-citationQBoost: Large Scale Classifier Training with Adiabatic Quantum Optimization.
Neven, H., Denchev, V. S., Rose, G., & Macready, W. G. (2012) · Asian Conference on Machine Learning · Cited by 100
Self-citationEnhancing quantum annealing performance for the molecular similarity problem
Hernandez, M., & Aramon, M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1586-y · Cited by 43
“The development of a quantum annealer by D-Wave Systems [25] has initiated a great deal of theoretical and experimental research into the usefulness of the QA approach and its potential supremacy over classical algorithms [17,23,27,33,41,43,45].”
Probabilistic nonunitary gate in imaginary time evolution
Liu, T., Liu, J.-G., & Fan, H. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03145-6 · Cited by 63
Quantitative Evaluation of Hardware Binary Stochastic Neurons
Hassan, O., Datta, S., & Camsari, K. Y. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.064046 · Cited by 45
Su, Y., Kim, T. T.-H., & Kim, B. (2022) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc42614.2022.9731680 · Cited by 42
Application of QUBO solver using black-box optimization to structural design for resonance avoidance
MATSUMORI, T., Taki, M., & Kadowaki, T. (2022) · Scientific Reports · doi:10.1038/s41598-022-16149-8 · Cited by 56
“(4) that relies on FM is constructed to approximate d .”
BackgroundHiromasa, S., Ogata, K., Isomura, T., Utsunomiya, S., Yamamoto, Y., & Aihara, K. (2016) · Entropy · doi:10.3390/e18100365 · Cited by 49
Quantum computing for chemistry and physics applications from a Monte Carlo perspective
Mazzola, G. (2024) · The Journal of Chemical Physics · doi:10.1063/5.0173591 · Cited by 64
“19 First of all, let’s observe that the quantum-enanched Markov chain method of Sect.”
BackgroundMethodHybrid Quantum Magnetism in Circuit QED: From Spin-Photon Waves to Many-Body Spectroscopy
Kurcz, A., Bermúdez, A., & García‐Ripoll, J. J. (2014) · Physical Review Letters · doi:10.1103/physrevlett.112.180405 · Cited by 46
Constructing SAT Filters with a Quantum Annealer
Douglass, A., King, A. D., & Raymond, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_9 · Cited by 57
“This application is a natural fit for a D-Wave Two (DW2) quantum annealer, which is capable of quickly sampling many low-energy states of a spin system in the Ising model [18,35] using open-system quantum annealing [1,3,9].”
MethodTakesue, H., & Inagaki, T. (2016) · Optics Letters · doi:10.1364/ol.41.004273 · Cited by 41
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
“Quantum coherent character of operation of a single 8-qubit register within such device is well established [76], but modelling fully quantum evolution of a hundred or more qubits with classical computers is beyond any realistic possibilities.”
BackgroundReexamination 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
Simulated bifurcation assisted by thermal fluctuation
Kanao, T., & Goto, H. (2022) · Communications Physics · doi:10.1038/s42005-022-00929-9 · Cited by 65
“Ising machines utilizing natural phenomena have been developed, such as quantum annealers [3–8] with superconducting circuits [9], coherent Ising machines with pulse lasers [10– 14], oscillator-based Ising machines [15–19], and other Ising machines with various systems, such as stochastic nanomagnets [20], gain-dissip…”
MethodLuo, L., Mi, Z., Huang, J., & Ruan, Z. (2023) · Science Advances · doi:10.1126/sciadv.adg6238 · Cited by 62
“…Ising Hamiltonians, for example, based on optical parametric oscillators ( 1 – 6 ), lasers ( 7 – 11 ), polariton ( 12 – 14 ), trapped ions ( 15 ), atomic and photonic condensates ( 16 , 17 ), electronic memorisers ( 18 ), superconducting qubits ( 19 – 21 ), and nanophotonics circuits ( 22 – 26 ).”
Quantum-Informed Recursive Optimization Algorithms
Finžgar, J. R., Kerschbaumer, A., Schuetz, M. J. A., Mendl, C. B., & Katzgraber, H. G. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020327 · Cited by 80
Quantum‐Noise‐Driven Generative Diffusion Models
Parigi, M., Martina, S., & Caruso, F. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300401 · Cited by 67
“Moreover D-Wave [34] exploits superconducting integrated circuits mainly as quantum annealers [35].”
BackgroundQuantum 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
Wilson, B. A., Kudyshev, Z. A., Kildishev, A. V., Kais, S., Shalaev, V. M., & Boltasseva, A. (2021) · Applied Physics Reviews · doi:10.1063/5.0060481 · Cited by 39
“This equivalence enables direct mapping of a broad range of physics/chemistry optimization problems into the combinatorial optimization domain and the use of various physical platforms to perform highly efficient QUBO-based optimization via physical processes 14–16 .”
MethodSelf-citationCreating electronic oscillator-based Ising machines without external injection locking
Vaidya, J., Kanthi, R. S. S., & Shukla, N. (2022) · Scientific Reports · doi:10.1038/s41598-021-04057-2 · Cited by 49
Bibliometric Analysis in the Field of Quantum Technology
Scheidsteger, T., Haunschild, R., Bornmann, L., & Ettl, C. (2021) · Quantum Reports · doi:10.3390/quantum3030036 · Cited by 53
“In 2011, the Canadian enterprise D-Wave announced to have built the first commercial quantum annealer [53].”
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
Hybrid Quantum Annealing for Larger-than-QPU Lattice-structured Problems
Raymond, J., Stevanovic, R., Bernoudy, W., Boothby, K., McGeoch, C. C., Berkley, A. J., Farré, P., Pasvolsky, J., & King, A. D. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3579368 · Cited by 39
“QA in the Advantage QPU operates with lux qubit states, which can be approximated as Ising spins [5, 24].”
Self-citationModel Predictive Control for Finite Input Systems using the D-Wave Quantum Annealer
Inoue, D., & Yoshida, H. (2020) · Scientific Reports · doi:10.1038/s41598-020-58081-9 · Cited by 39
“s obtained: A =Aˆ; B 1 =Bˆ; B 2 =0; C =I; D =0; (12) where I denotes identity matrix. We design the weight matrices in evaluation function (3) as Q =105 1 0 0 1 ; R =1: (13) For the set of inputs (2), we use Uˆ =f 60; 45; 30; 15;0;15;30;45g (14) and adopt N =6 for the prediction horizon. We show the generated input se…”
MethodInfluentialAdiabatic theorem for quantum systems with spectral degeneracy
Rigolin, G., & Ortíz, G. (2012) · Physical Review A · doi:10.1103/physreva.85.062111 · Cited by 48
Uncertain behaviours of integrated circuits improve computational performance
Yoshimura, C., Yamaoka, M., Hayashi, M., Okuyama, T., Aoki, H., Kawarabayashi, K., & Mizuno, H. (2015) · Scientific Reports · doi:10.1038/srep16213 · Cited by 42
Systematic and deterministic graph minor embedding for Cartesian products of graphs
Zaribafiyan, A., Marchand, D. J. J., & Changiz Rezaei, S. S. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1569-z · Cited by 40
“One type of quadratic solver which has garnered considerable attention in the past few years is the quantum annealing processor manufactured by D-Wave Systems [9, 10].”
BackgroundAntiferromagnetic spatial photonic Ising machine through optoelectronic correlation computing
Huang, J., Fang, Y., & Ruan, Z. (2021) · Communications Physics · doi:10.1038/s42005-021-00741-x · Cited by 52
All-Optical Scalable Spatial Coherent Ising Machine
Strinati, M. C., Pierangeli, D., & Conti, C. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.16.054022 · Cited by 46
“Remarkable examples include two-component Bose-Einstein condensates [9, 10], superconducting circuits [11], trapped ions [12, 13], digital computers [14–17], electrical oscillators [18], optoelectronical oscillators [19], polariton condensates [20–22], laser networks [23, 24],”
BackgroundAlgorithmic approach to adiabatic quantum optimization
Dickson, N. G., & Amin, M. H. S. (2012) · Physical Review A · doi:10.1103/physreva.85.032303 · Cited by 43
Self-citationQuantum-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
Energy-efficient switching of nanomagnets for computing: straintronics and other methodologies
D’Souza, N., Biswas, A., Ahmad, H., Fashami, M. S., Al-Rashid, M. M., Sampath, V., Bhattacharya, D., Abeed, M. A., Atulasimha, J., & Bandyopadhyay, S. (2018) · Nanotechnology · doi:10.1088/1361-6528/aad65d · Cited by 46
Hybrid Annealing Method Based on subQUBO Model Extraction With Multiple Solution Instances
Atobe, Y., Tawada, M., & Togawa, N. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3138629 · Cited by 38
“Isingmachinesinclude,forexample,D-Wave Systems’quantumannealingmachines[4],[16],[17],Hitachi’s CMOSannealingmachines[18],[19],andFujitsu’sdigital annealers[5],[6].”
Calculation of Molecular Vibrational Spectra on a Quantum Annealer
Teplukhin, A., Kendrick, B. K., & Babikov, D. (2019) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.9b00402 · Cited by 38
Foundation of quantum optimal transport and applications
Ikeda, K. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2519-8 · Cited by 45
Kibble-Zurek scaling in quantum speed limits for shortcuts to adiabaticity
Puebla, R., Deffner, S., & Campbell, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.032020 · Cited by 43
“Indeed, a numerical fit to a power law τ β q in the interval ωτ q ∈ [10 3 , 10 5 ] leads to β = 0 .”
Quantum neural networks: Current status and prospects for development
Altaĭsky, M. V., Kaputkina, N. E., & Крылов, В. А. (2014) · Physics of Particles and Nuclei · doi:10.1134/s1063779614060033 · Cited by 40
Quantum gates with controlled adiabatic evolutions
Hen, I. (2015) · Physical Review A · doi:10.1103/physreva.91.022309 · Cited by 37
Karimi, H., Rosenberg, G., & Katzgraber, H. G. (2017) · Physical Review E · doi:10.1103/physreve.96.043312 · Cited by 37
Takesue, H., Inaba, K., Inagaki, T., Ikuta, T., Yamada, Y., Honjo, T., Kazama, T., Enbutsu, K., Umeki, T., & Kasahara, R. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.054059 · Cited by 39
Programmable Quantum Annealers as Noisy Gibbs Samplers
Vuffray, M., Coffrin, C., Kharkov, Y. A., & Lokhov, A. Y. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020317 · Cited by 54
“State-of-the-art quantum annealing processors [6] were recently used to push the frontiers of quantum simulations [13, 14], optimization [15], and machine learning [16].”
InfluentialGPU-accelerated simulations of quantum annealing and the quantum approximate optimization algorithm
Willsch, D., Willsch, M., Jin, F., Michielsen, K., & De Raedt, H. (2022) · Computer Physics Communications · doi:10.1016/j.cpc.2022.108411 · Cited by 36
Parity Quantum Optimization: Compiler
Ender, K., ter Hoeven, R., Niehoff, B. E., Drieb-Schön, M., & Lechner, W. (2023) · Quantum · doi:10.22331/q-2023-03-17-950 · Cited by 52
Annealing Processing Architecture of 28-nm CMOS Chip for Ising Model With 512 Fully Connected Spins
Iimura, R., Kitamura, S., & Kawahara, T. (2021) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2021.3114422 · Cited by 39
Quantum Computers: A Review on How Quantum Computing Can Boom AI
Chauhan, V., Negi, S., Jain, D., Singh, P. R., Sagar, A. K., & Sharma, A. K. (2022) · International Conference on Advance Computing and Innovative Technologies in Engineering (ICACITE) · doi:10.1109/icacite53722.2022.9823619 · Cited by 37
Bae, J., Oh, W., Koo, J., & Kim, B. (2023) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc42615.2023.10067622 · Cited by 37
“A previous Ising machine, which is based on the quantum interactions between superconducting quantum bits (qubits) [1], implemented 2048 qubits, but it requires an extremely-low operating temperature (1520mK) and has significant power consumption (10-100kW).”
Background
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.