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 801–900 of 1,009
Incentivizing Demand-Side Response Through Discount Scheduling Using Hybrid Quantum Optimization
Bucher, D., Nüßlein, J., O’Meara, C., Angelov, I. B., Wimmer, B., Ghosh, K., Cortiana, G., & Linnhoff–Popien, C. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3407236 · Cited by 18
“Nevertheless, experimental evidence suggests that, depending on the spin glass model, faster evolution times still output the optimal solution with high probability [49].”
BackgroundCode-division multiple-access multiuser demodulator by using quantum fluctuations
Otsubo, Y., Inoue, J., Nagata, K., & Okada, M. (2014) · Physical Review E · doi:10.1103/physreve.90.012126 · Cited by 12
Kihara, Y., Ito, M., Saito, T., Shiomura, M., Sakai, S., & Shirakashi, J. (2017) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano.2017.8117327 · Cited by 15
A Quantum-Inspired Method for Three-Dimensional Ligand-Based Virtual Screening
Hernandez, M., Gan, G. L., Linvill, K., Dukatz, C., Feng, J., & Bhisetti, G. (2019) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.9b00195 · Cited by 15
“14 The algorithm finds the maximum weighted common subgraph (MWCS) of two molecular graphs.”
MethodSpin-entanglement wave in a coarse-grained optical lattice
Correia, P. S., & de Melo, F. (2019) · Physical Review A · doi:10.1103/physreva.100.022334 · Cited by 12
Symmetry‐Protected Quantum Adiabatic Evolution in Spontaneous Symmetry‐Breaking Transitions
Zhuang, M., Huang, J., Ke, Y., & Lee, C. (2020) · Annalen der Physik · doi:10.1002/andp.201900471 · Cited by 19
Saito, K., Aono, M., & Kasai, S. (2020) · Scientific Reports · doi:10.1038/s41598-020-77617-7 · Cited by 13
Su, Y., Mu, J., Kim, H., & Kim, B. (2021) · Custom Integrated Circuits Conference · doi:10.1109/cicc51472.2021.9431401 · Cited by 12
“P r io r - Works Simple Graphs [1-3] Complete Graph [4] Q Sim ple & scalable hardw are ® C om plex & difficult to scale Solve re latively easy problem s @ Solve m ore difficult problem s ® Local spin interaction on ly ~ ' ' " " connected-' ^ -disconnected This Work: Sim ple & scalable hardware Solve m ore difficult pr…”
BackgroundInfluentialImoto, T., Seki, Y., & Matsuzaki, Y. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.064004 · Cited by 17
“The Hamiltonian of the flux qubit [54, 55, 31] or capacitively shunted FQs [39] is given by H = 2 L∑ j=1 σ̂(j)z + ∆G 2 L∑ j=1 σ̂(j)x + λ cosωt L∑ j=1 σ̂(j)y + g L−1∑ j=1 σ̂(j)z σ̂ (j+1) z .”
BackgroundInfluentialEfficient realization of quantum search algorithm using quantum annealing processor with dissipation
Homid, A. H., Abdel‐Aty, A., Abdel‐Aty, M., Badawi, A., & Obada, A. ‐. F. (2015) · Journal of the Optical Society of America B · doi:10.1364/josab.32.002025 · Cited by 12
Macroscopic Singlet-Triplet Qubit in Synthetic Spin-One Chain in Semiconductor Nanowires
Jaworowski, B., Rogers, N., Grabowski, M., & Hawrylak, P. (2017) · Scientific Reports · doi:10.1038/s41598-017-05655-9 · Cited by 21
Quantum extension of variational Bayes inference
Miyahara, H., & Sughiyama, Y. (2018) · Physical Review A · doi:10.1103/physreva.98.022330 · Cited by 17
Neural Networks and Graph Algorithms with Next-Generation Processors
Hamilton, K. E., Schuman, C. D., Young, S. R., Imam, N., & Humble, T. S. (2018) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2018.00184 · Cited by 18
“Currently the (commercially available) state of the art quantum hardware is the quantum annealer from D-Wave [10], [11].”
BackgroundMethodAdiabatic quantum dynamics under decoherence in a controllable trapped-ion setup
Hu, C.-K., Santos, A. C., Cui, J., Huang, Y., Sarandy, M. S., Li, C., & Guo, G. (2019) · Physical Review A · doi:10.1103/physreva.99.062320 · Cited by 13
Adaptive Bulk Search: Solving Quadratic Unconstrained Binary Optimization Problems on Multiple GPUs
Yasudo, R., Nakano, K., Ito, Y., Tatekawa, M., Katsuki, R., Yazane, T., & Inaba, Y. (2020) · Proceedings of the International Conference on Parallel Processing · doi:10.1145/3404397.3404423 · Cited by 17
Tutorial: calibration refinement in quantum annealing
Chern, K., Boothby, K., Raymond, J., Farré, P., & King, A. D. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1238988 · Cited by 11
“Quantum annealing (QA) [1, 2] is a computing approach that physically realizes a system of Ising spins in a transverse magnetic field.”
BackgroundSACHI: A Stationarity-Aware, All-Digital, Near-Memory, Ising Architecture
Raman, S. R. S., John, L. K., & Kulkarni, J. P. (2024) · IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca57654.2024.00061 · Cited by 22
“The traditional realization of Ising machines captures the dynamics of the physical Ising model by using qubits [9] [8], coupled oscillators [34] [33], and optical annealers [20] [12].”
MethodCyclic quantum annealing: searching for deep low-energy states in 5000-qubit spin glass
Zhang, H., Boothby, K., & Kamenev, A. (2024) · Scientific Reports · doi:10.1038/s41598-024-80761-z · Cited by 43
Implementing Arbitrary Ising Models with a Trapped-Ion Quantum Processor
Lu, Y., Chen, W., Zhang, S., Zhang, K., Zhang, J., Zhang, J.-N., & Kim, K. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.050602 · Cited by 28
“Currently, many studies are being conducted heuristically to find quantum speed-ups with existing quantum processors [14–21].”
Scalable connectivity for Ising machines: Dense to sparse
Sajeeb, M. M. H., Aadit, N. A., Chowdhury, S., Wu, T., Smith, C., Chinmay, D., Raut, A., Camsari, K. Y., Delacour, C., & Srimani, T. (2025) · Physical Review Applied · doi:10.1103/kx8m-5h3h · Cited by 26
“These include quantum circuits [2–4], lasers [5, 6], memristors [7, 8], coupled oscillators [9, 10], nanodevices [11, 12], digital CMOS circuits [13–16] and others.”
Spin-glass dynamics: Experiment, theory, and simulation
Dahlberg, E. D., Pemartín, I. G.-A., Marinari, E., Parisi, G., Ricci‐Tersenghi, F., Martin-Mayor, V., Moreno-Gordo, J., Orbach, R., Paga, I., Ruiz-Lorenzo, J. J., et al. (2025) · Reviews of Modern Physics · doi:10.1103/ctp2-zwyr · Cited by 33
How fast can quantum annealers count?
Hen, I. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/23/235304 · Cited by 13
Noise amplification at spin-glass bottlenecks of quantum annealing: A solvable model
Roberts, D., Cincio, Ł., Saxena, A., Petukhov, A. G., & Knysh, S. (2020) · Physical Review A · doi:10.1103/physreva.101.042317 · Cited by 19
“[26–28]).”
Development of Econophysics: A Biased Account and Perspective from Kolkata
Chakrabarti, B. K., & Sinha, A. (2021) · Entropy · doi:10.3390/e23020254 · Cited by 13
“In any case, with this observation and some more developments, the quantum annealing technique was finally launched through the subsequent publications of a series of landmark papers (both theoretical and experimental; see [21]) and through a remarkable practical realization of the quantum annealers by the D-wave Grou…”
BackgroundMethodExact thermal properties of free-fermionic spin chains
Białończyk, M., Gómez-Ruiz, F. J., & del Campo, A. (2021) · SciPost Physics · doi:10.21468/scipostphys.11.1.013 · Cited by 14
“They are further amenable to quantum simulation with trapped ions [49–53], ultracold gases in optical lattices [54] and superconducting qubits [55].”
BackgroundDevelopment of Quantum Annealer Using Josephson Parametric Oscillators
Yamaji, T., Shirane, M., & Yamamoto, T. (2021) · IEICE Transactions on Electronics · doi:10.1587/transele.2021sep0006 · Cited by 12
“qubit commercial quantum annealing machine based on a superconducting circuit for the first time [17].”
BackgroundScalable fully coupled annealing processing system and multi-chip FPGA implementation
Yamamoto, K., & Kawahara, T. (2022) · Microprocessors and Microsystems · doi:10.1016/j.micpro.2022.104674 · Cited by 11
Accelerated Quantum Adiabatic Transfer in Superconducting Qubits
Zheng, W., Xu, J., Wang, Z., Dong, Y., Lan, D., Tan, X., & Yu, Y. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.044014 · Cited by 14
Advantage of Pausing: Parameter Setting for Quantum Annealers
Izquierdo, Z. G., Grabbe, S. R., Idris, H., Wang, Z., Marshall, J., & Rieffel, E. G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054056 · Cited by 12
“[9] MW Johnson, MHS Amin, S Gildert, T Lanting, F Hamze, N Dickson, R Harris, AJ Berkley, J Johansson, P Bunyk, et al.”
BackgroundLocation Estimates From Channel State Information via Binary Programming
Rahman, M. T., & Valaee, S. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3215651 · Cited by 11
“…interest in solving binary programs in general, and the Ising model in particular: extending the oft-used notion of simulated annealing [31] is the quantum annealer [32], which uses quantum fluctuation-based computations totackletheIsingenergyHamiltonian, withthespeculation of a significant speed up.”
Spin-Variable Reduction Method for Handling Linear Equality Constraints in Ising Machines
Shirai, T., & Togawa, N. (2023) · IEEE Transactions on Computers · doi:10.1109/tc.2023.3239539 · Cited by 19
“Most Ising machine hardware operates on the basis of simulated annealing (SA) [2], [3], [4], [5], [6], [7] and quantum annealing (QA) [8], [9] (see the review of Ising machines in [10]).”
BackgroundExtracting higher-conductivity designs for solid polymer electrolytes by quantum-inspired annealing
Hatakeyama‐Sato, K., Uchima, Y., Kashikawa, T., Kimura, K., & Oyaizu, K. (2023) · RSC Advances · doi:10.1039/d3ra01982a · Cited by 11
Optimizing the Production of Test Vehicles Using Hybrid Constrained Quantum Annealing
Glos, A., Kundu, A., & Salehi, Ö. (2023) · SN Computer Science · doi:10.1007/s42979-023-02071-x · Cited by 14
Nonnegative/Binary matrix factorization for image classification using quantum annealing
Asaoka, H., & Kudo, K. (2023) · Scientific Reports · doi:10.1038/s41598-023-43729-z · Cited by 14
“We identify the aspects of image classification by NBMF that are superior or inferior to classical methods and confirm the advantage of quantum technology over conventional machine-learning methods.”
Method4-Clique network minor embedding for quantum annealers
Pelofske, E. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.034023 · Cited by 24
“Figures 6, 7, 8, 9, and 10 all show there is a clear trend for the 4-clique minor embedding across annealing times; the longer annealing times result in consistently lower energy solutions.”
BackgroundMattesi, M., Asproni, L., Mattia, C., Tufano, S., Ranieri, G., Caputo, D., & Corbelletto, D. (2024) · Quantum Reports · doi:10.3390/quantum6020018 · Cited by 21
“In physics, they offer valuable insights into phenomena like spin glass theory, quantum magnetism, and lattice gauge theory [13–15].”
BackgroundQuantum data assimilation: a new approach to solving data assimilation on quantum annealers
Kotsuki, S., Kawasaki, F., & Ohashi, M. (2024) · Nonlinear processes in geophysics · doi:10.5194/npg-31-237-2024 · Cited by 12
Hayashi, M., Yamaoka, M., Yoshimura, C., Okuyama, T., Aoki, H., & Mizuno, H. (2015) · International Symposium on Computing and Networking · doi:10.1109/candar.2015.64 · Cited by 11
Hybrid annealing: Coupling a quantum simulator to a classical computer
Graß, T., & Lewenstein, M. (2017) · Physical Review A · doi:10.1103/physreva.95.052309 · Cited by 12
“While this is a powerful approach, in particular as it also admits quantum error correcting codes [12], the best scalability so far has been achieved with so-called analog quantum computers [1].”
BackgroundAccuracy of the adiabatic-impulse approximation for closed and open quantum systems
Tomka, M., Venuti, L. C., & Zanardi, P. (2018) · Physical Review A · doi:10.1103/physreva.97.032121 · Cited by 11
Adiabatic quantum games and phase-transition-like behavior between optimal strategies
de Ponte, M. A., & Santos, A. C. (2018) · Quantum Information Processing · doi:10.1007/s11128-018-1918-6 · Cited by 11
Dynamics of simulated quantum annealing in random Ising chains
Mbeng, G. B., Privitera, L., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.064201 · Cited by 15
Arai, S., Ohzeki, M., & Tanaka, K. (2019) · Physical review. E · doi:10.1103/physreve.99.032120 · Cited by 13
Disorder-assisted graph coloring on quantum annealers
Więckowski, A., Deffner, S., & Gardas, B. (2019) · Physical Review A · doi:10.1103/physreva.100.062304 · Cited by 11
“In comparison to other computational paradigms, AQC is technologically slightly more advanced due to the commercial availability of D-Wave’s quantum annealers [11–13].”
ResultQuantum phase transition in a multiconnected Jaynes-Cummings lattice
Xue, J. Y., Seo, K., Tian, L., & Xiang, T. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.174502 · Cited by 15
Mapping Constrained Slot-Placement Problems to Ising Models and its Evaluations by an Ising Machine
Kanamaru, S., Kawamura, K., Tanaka, S., Tomita, Y., Matsuoka, H., Kawamura, K., & Togawai, N. (2019) · International Conference on Consumer Electronics · doi:10.1109/icce-berlin47944.2019.8966207 · Cited by 11
“Recently, various Ising machines, which are also referred to as annealing machines, have been developed to solve combinatorial optimization problems efficiently [1]–[11].”
BackgroundClassical Simulation and Theory of Quantum Annealing in a Thermal Environment
Oshiyama, H., Suzuki, S., & Shibata, N. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.170502 · Cited by 13
Huang, Z., Zhang, J., Wu, M., Li, X., & Dong, Y. (2021) · IEEE Access · doi:10.1109/access.2021.3070650 · Cited by 11
“On this basis, we get a key guidance factor Hamiltonian [19]–[21] in quantum annealing algorithm as the guidance factor for the next step of the algorithm.”
MethodA QUBO model of the RNA folding problem optimized by variational hybrid quantum annealing
Zaborniak, T., Giraldo, J., Müller, H. A., Jabbari, H., & Stege, U. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00037 · Cited by 19
Resilience optimization in manufacturing systems using Quantum Annealing
Schworm, P., Wu, X., Klar, M., Gayer, J., Glatt, M. F., & Aurich, J. C. (2023) · Manufacturing Letters · doi:10.1016/j.mfglet.2022.12.007 · Cited by 11
Real-time simulation of flux qubits used for quantum annealing
Willsch, M., Willsch, D., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2020) · Physical Review A · doi:10.1103/physreva.101.012327 · Cited by 12
Nonreciprocal transition between two nondegenerate energy levels
Xu, X., Zhao, Y.-J., Wang, H., Chen, A., & Liu, Y.-X. (2021) · Photonics Research · doi:10.1364/prj.412904 · Cited by 14
Collective dynamics of phase-repulsive oscillators solves graph coloring problem
Crnkić, A., Povh, J., Jaćimović, V., & Levnajić, Z. (2020) · Chaos An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.5127794 · Cited by 15
“Quantum simulations that solve optimization problems typically involve finding the ground state of a suitably designed quantum system [9, 10].”
BackgroundBlockchain platform with proof-of-work based on analog Hamiltonian optimisersPreprint
Kalinin, K. P., & Berloff, N. G. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.10091 · Cited by 17
“1) [30].”
A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum ComputationsPreprint
Dridi, R., Alghassi, H., & TAYUR, S. R. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.01440 · Cited by 15
Negotiating a Quantum Computation Network: Mechanics, Machines, Mindsets
Noon, D. (2017) · Carleton University's Institutional Repository (MacOdrum Library, Carleton University) · doi:10.22215/etd/2017-11829 · Cited by 11
On good encodings for quantum annealer and digital optimization solvers
Ceselli, A., & Premoli, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-32232-0 · Cited by 10
Hybrid quantum-classical scheduling optimization in UAV-enabled IoT networks
Vista, F., Iacovelli, G., & Grieco, L. A. (2023) · Quantum Information Processing · doi:10.1007/s11128-022-03805-1 · Cited by 15
“The first physical implementation was realized in 2011 by D-Wave Systems [5].”
Physical Realization of Measurement Based Quantum Computation
Kashif, M., & Al-Kuwari, S. M. (2023) · IEEE Access · doi:10.1109/access.2023.3289005 · Cited by 13
Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
Takabayashi, T., & Ohzeki, M. (2024) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.93.034001 · Cited by 11
Quantum Parallel Training of a Boltzmann Machine on an Adiabatic Quantum Computer
Noè, D., Rocutto, L., Moro, L. D., & Prati, E. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300330 · Cited by 13
Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers
Volpe, D., Quetschlich, N., Graziano, M., Turvani, G., & Wille, R. (2024) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw62656.2024.00019 · Cited by 18
“…for optimization problems, there are two possibilities: employing a Quantum Annealer (QA)—a special-purpose quantum computer theorized in 1998 [6]–[10], using the natural properties of a quantum system evolution for obtaining the ground state—or executing algorithms entirely or partially on a…”
Yu, J.-S., Jung, S., Cho, J.-W., Park, G., Kats, M. A., Kim, S., & Lee, E. (2024) · Nanophotonics · doi:10.1515/nanoph-2024-0360 · Cited by 12
“In our computational resources, the performance of exhaustive enumeration significantly degrades when N ≥ 23, leading us to adopt quantum annealing via the D-wave leap platform for these cases [49], [50].”
Advancing the problem-solving capabilities of Ising machines based on spin Hall nano-oscillators
Liu, Y.-T., Peng, C.-C., Hung, T.-Y., Huang, Y.-H., & Pai, C. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.064009 · Cited by 10
Lee, S., Lim, Q. J., Ross, C., Lee, E., Han, S., Kim, Y., Peng, Z., & Kim, S. (2024) · IEEE Antennas and Propagation Magazine · doi:10.1109/map.2024.3498695 · Cited by 10
A First Successful Factorization of RSA-2048 Integer by D-Wave Quantum Computer
Wang, C., Yu, J., Pei, Z., Wang, Q., & Hong, C. (2024) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010028 · Cited by 16
Real World Application of Quantum-Classical Optimization for Production Scheduling
Awasthi, A., Kraus, N., Krellner, F., & Zambrano, D. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.10285 · Cited by 15
“Quantum annealers, such as those based on super-conducting qubits or neutral atoms, utilize the principles of quantum annealing to find the optimal solution by minimizing the energy of a quantum system [5].”
Performance of Quantum Annealing Machine Learning Classification Models on ADMET Datasets
Salloum, H., Sabbagh, K., Savchuk, V., Lukin, R. Y., Orabi, O., Isangulov, M., & Mazzara, M. (2025) · IEEE Access · doi:10.1109/access.2025.3531391 · Cited by 18
“The first commercially produced D-Wave processor was a programmable, superconducting integrated circuit consisting of up to 128 pair-wise coupled superconducting flux qubits [58], [59].”
Near-ultrastrong nonlinear light-matter coupling in superconducting circuits
Ye, Y., Kline, J. B., Yen, A., Cunningham, G., Tan, M., Zang, A., Gingras, M., Niedzielski, B. M., Stickler, H., Serniak, K., et al. (2025) · Nature Communications · doi:10.1038/s41467-025-59152-z · Cited by 14
“Here we exclude comparison with annealer architectures such as 38 that lack measurable qubit coherence.”
Quantum Computing for Genomics: Conceptual Challenges and Practical Perspectives
Maurizio, A., & Mazzola, G. (2025) · PRX Life · doi:10.1103/h49j-bsc6 · Cited by 23
“As of today, quantum optimization demonstrations feature two main strategies: quantum annealing (QA)[40, 130], implemented on analog quantum hardware, and the Quantum Approximate Optimization Algorithm (QAOA)[131, 132] or similar approaches based on parameterized circuits, like the Variational…”
Observation of Shapiro steps in an ultracold atomic Josephson junction
Bernhart, E., Röhrle, M., Singh, V. P., Mathey, L., Luigi Amico, A., & Ott, H. (2025) · Science · doi:10.1126/science.ads9061 · Cited by 11
An Ising Machine-Based Solver for Visiting-Route Recommendation Problems in Amusement Parks
Mukasa, Y., Wakaizumi, T., Tanaka, S., & Togawa, N. (2021) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2020edp7264 · Cited by 17
“Ising machines, which are recently expected to solve combinatorial optimization problems at high speed, have been developed [4]–[10] and utilized in many fields.”
BackgroundQuantum annealing with twisted fields
Imoto, T., Seki, Y., Matsuzaki, Y., & Kawabata, S. (2022) · New Journal of Physics · doi:10.1088/1367-2630/ac9155 · Cited by 14
“has realized QA machines composed of thousands of qubits [18].”
BackgroundChancellor, N., Crowley, P. J. D., Đurić, T., Vinci, W., Amin, M. H. S., Green, A. G., Warburton, P. A., & Aeppli, G. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00580-w · Cited by 17
“1GHz, which is reasonable based upon previous work [11].”
BackgroundMethodInfluentialSelf-citationQuantum approximate optimization algorithm applied to the binary perceptron
Torta, P., Mbeng, G. B., Baldassi, C., Zecchina, R., & Santoro, G. E. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.107.094202 · Cited by 20
Quantum annealing for the adjuster routing problem
Mori, N., & Furukawa, S. (2023) · Frontiers in Physics · doi:10.3389/fphy.2023.1129594 · Cited by 12
“Physical devices that enable quantum annealing have been developed by D-Wave Systems [3], which recently launched a quantum cloud computing service called D-Wave Leap.”
BackgroundYu, C., Mu, J., Chai, K. T. C., Kim, T., & Kim, B. (2023) · Custom Integrated Circuits Conference · doi:10.1109/cicc57935.2023.10121286 · Cited by 10
Early steps toward practical subsurface computations with quantum computing
Greer, S. Y., & O’Malley, D. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1235784 · Cited by 10
Quantum optimization within lattice gauge theory model on a quantum simulator
Yan, Z., Zhou, Z., Zhou, Y.-H., Wang, Y.-C., Qiu, X., Meng, Z. Y., & Zhang, X. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00755-z · Cited by 20
“Following recent technological advancements in manufacturing coupled qubit systems, the QA algorithm can be embedded into superconducting flux qubits [34–36].”
MethodInfluentialMean-field coherent Ising machines with artificial Zeeman terms
Gunathilaka, M. D. S. H., Inui, Y., Kako, S., Yamamoto, Y., & Aonishi, T. (2023) · Journal of Applied Physics · doi:10.1063/5.0176248 · Cited by 16
Stable and efficient seismic impedance inversion using quantum annealing with L1 norm regularization
Wang, S., Liu, C., Li, P., Chen, C., & Song, C. (2024) · Journal of Geophysics and Engineering · doi:10.1093/jge/gxae003 · Cited by 10
Finding optimal pathways in chemical reaction networks using Ising machines
Mizuno, Y., & Komatsuzaki, T. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013115 · Cited by 18
“Ising machines include quantum annealing devices developed by D-Wave systems [17, 18] and classical simulated annealing devices [19–23].”
MethodToward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem
Ohno, K., Shirai, T., & Togawa, N. (2024) · IEEE Access · doi:10.1109/access.2024.3425711 · Cited by 15
“There exist several types of Ising machines depending on the way of physical implementation: examples are quantum annealers [4], [5], coherent Ising machines [6], [7], and specialized-circuit-based digital machines [8], [9], [10], [11], [12].”
BackgroundChancellor, N., & Haas, S. (2013) · Physical Review A · doi:10.1103/physreva.87.042321 · Cited by 10
Adiabatic quantum state transfer in tight-binding chains using periodic driving fields
Longhi, S. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/107/50003 · Cited by 12
Survey and analysis of security issues on RSA algorithm for digital video data
Gagneja, K., & Singh, J. (2016) · Journal of Discrete Mathematical Sciences and Cryptography · doi:10.1080/09720529.2015.1085730 · Cited by 10
“Security of RSA depends on prime number factorization and quantum computers built since 2011 can do the same [20].”
BackgroundProbabilistic Computing with Binary Stochastic Neurons
Pervaiz, A. Z., Datta, S., & Camsari, K. Y. (2019) · IEEE BiCMOS and Compound Semiconductor Integrated Circuits and Technology Symposium (BCICTS) · doi:10.1109/bcicts45179.2019.8972719 · Cited by 10
“[33]) which is based on engineering a network of quantum spins (~σ’s: Pauli spin matrices) having an energy E = ∑ Jij ~ σi · ~ σj .”
BackgroundOptimizing adiabatic quantum pathways via a learning algorithm
Yang, X., Liu, R., Li, J., & Peng, X. (2020) · Physical Review A · doi:10.1103/physreva.102.012614 · Cited by 12
Hopfield Networks for Vector Quantization
Bauckhage, C., Ramamurthy, R., & Sifa, R. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-61616-8_16 · Cited by 12
Dispersive and dissipative coupling of photon Bose-Einstein condensates
Toebes, C., Vretenar, M., & Klaers, J. (2022) · Communications Physics · doi:10.1038/s42005-022-00832-3 · Cited by 10
Roychowdhury, J. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87993-8_9 · Cited by 10
Kelany, K. A. H., Dimopoulos, N. J., Adolphs, C. P. J., & Baniasadi, A. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3153947 · Cited by 10
Pauli String Partitioning Algorithm with the Ising Model for Simultaneous Measurements
Kurita, T., Morita, M., Oshima, H., & Sato, S. (2023) · The Journal of Physical Chemistry A · doi:10.1021/acs.jpca.2c06453 · Cited by 18
“When the number of variables {xi} is less than or equal to the number of variables that an Ising machine can handle (nbit), we can directly determine {xi}, which minimizes the target cost function using an Ising machine [26,28,29].”
Quantum annealing for microstructure equilibration with long-range elastic interactions
Sandt, R., Bouar, Y. L., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33232-w · Cited by 11
Race Logic: Abusing Hardware Race Conditions to Perform Useful Computation
Madhavan, A., Sherwood, T., & Strukov, D. B. (2015) · IEEE Micro · doi:10.1109/mm.2015.43 · Cited by 10
“At the other end of the spectrum are somewhat exotic fully customized systems that exploit novel physics and are based on nontraditional technologies such as the DWave computer, which uses quantum annealing phenomena to solve optimization problems.(4) We propose a novel computing approach, called race logic, which use…”
BackgroundProbing quantum coherence in qubit arrays
Almeida, J., de Groot, P. C., Huelga, S. F., Liguori-Schremp, A. M., & Plenio, M. B. (2013) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/0953-4075/46/10/104002 · Cited by 14
Reducing Binary Quadratic Forms for More Scalable Quantum Annealing
Hahn, G., & Djidjev, H. N. (2017) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2017.8123654 · Cited by 10
“Each qubit consists of a superconducting loop on the D-Wave chip which simultaneously encodes a quantum superposition of −1 and +1 via two superimposed currents in both clockwise and counter-clockwise directions [11, 5].”
Semiclassical approach to finite-temperature quantum annealing with trapped ions
Raventós, D., Graß, T., Juliá-Díaz, B., & Lewenstein, M. (2018) · Physical Review A · doi:10.1103/physreva.97.052310 · Cited by 9
Eigenstates Transition without Undergoing an Adiabatic Process
Mostafavi, F., Yuan, L., & Ramezani, H. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.050404 · Cited by 14
Semi-supervised time series classification method for quantum computing
Yarkoni, S., Kleshchonok, A., Dzerin, Y., Neukart, F., & Hilbert, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00042-0 · Cited by 11
“Equivalently, with gate-model QPUs such as those produced by Google, IBM, and Rigetti, the quantum approximate optimization algorithm (QAOA) is used to solve such Ising Hamiltonians.”
MethodInfluential
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.