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 701–800 of 1,009
Homology Computation of Large Point Clouds using Quantum AnnealingPreprint
Dridi, R., & Alghassi, H. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1512.09328 · Cited by 18
“cific quantum annealer (the D-Wave II processor). A.1 Quantum Annealing Quantum annealing (QA), along with the D-Wave processor, have been the focus of much research. We refer the interested reader to Johnson et al. (2011); Calude et al. (2015); Boixo et al. (2013, 2014); Lanting et al. (2014). QA is a paradigm designe…”
MethodChook -- A comprehensive suite for generating binary optimization problems with planted solutionsPreprint
Perera, D., Akpabio, I., Hamze, F., Mandrà, S., Rose, N., Aramon, M., & Katzgraber, H. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.14344 · Cited by 16
“The advent of quantum annealing devices [1, 2] has spawned a renewed interest in the development of heuristic approaches to solve discrete optimization problems.”
Self-citationProgrammable optoelectronic Ising machine for optimization of real-world problems
Hu, Z., Ren, Y., Meng, Y., Wang, T. J., JIANG, Y., Wei, M., Xiao, Y., Li, Z., & Li, M. (2026) · Light Science & Applications · doi:10.1038/s41377-025-02100-9 · Cited by 24
“To realize such computations, various technological implementations of Ising machines have been proposed, including optical Ising machines 8 – 20 , Ising machines based on quantum adiabatic theorem 21 – 24 , and on-chip Ising machines realized through the design of specialized circuits 25 – 31 .”
Cooling arbitrary near-critical systems using hyperbolic quenches
Mitra, P., Ippoliti, M., Bhatt, R. N., Sondhi, S. L., & Agarwal, K. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.99.104308 · Cited by 19
Quantum Computing by Coherent Cooling
Feng, J.-J., Wu, B., & Wilczek, F. A. (2022) · Physical Review A · doi:10.1103/physreva.105.052601 · Cited by 19
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0001 · Cited by 15
Solving (Max) 3-SAT via Quadratic Unconstrained Binary Optimization
Nüßlein, J., Zielinski, S., Gabor, T., Linnhoff–Popien, C., & Feld, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-36030-5_3 · Cited by 25
Initial State Encoding via Reverse Quantum Annealing and H-Gain Features
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3319586 · Cited by 25
“The feature was introduced to better study freeze-out points [7] and phase transitions in spin glasses [14].”
BackgroundEfficiency optimization in quantum computing: balancing thermodynamics and computational performance
Śmierzchalski, T., Mzaouali, Z., Deffner, S., & Gardas, B. (2024) · Scientific Reports · doi:10.1038/s41598-024-55314-z · Cited by 18
Constrained Quadratic Model for Optimizing Join Orders
Saxena, P., Sabek, I., & Spedalieri, F. M. (2024) · Workshop on Quantum Computing and Quantum-Inspired Technology for Data-Intensive Systems and Applications (Q-Data) · doi:10.1145/3665225.3665447 · Cited by 21
Josephson Junctions, Superconducting Circuits, and Qubit for Quantum Technologies
Citro, R., Guarcello, C., & Pagano, S. (2024) · Lecture notes in physics · doi:10.1007/978-3-031-55657-9_1 · Cited by 22
Dynamics of open quantum spin systems: An assessment of the quantum master equation approach
Zhao, P.-L., Raedt, H. A. D., Miyashita, S., Jin, F., & Michielsen, K. F. L. (2016) · Physical review. E · doi:10.1103/physreve.94.022126 · Cited by 16
“, the field of quantum information processing, as most of the models used in this field are formulated in terms of qubits (spin(1)2 objects) [26,27].”
MethodPerforming fully parallel constraint logic programming on a quantum annealer
Pakin, S. (2018) · Theory and Practice of Logic Programming · doi:10.1017/s1471068418000066 · Cited by 18
“A quantum annealer is a special-purpose device that finds a vector, σ , of spins (Booleans, represented as ± 1 ) that minimize the energy of an Ising-model Hamiltonian (Johnson et al. 2011).”
BackgroundInfluentialBoosting Quantum Annealing Performance Using Evolution Strategies for Annealing Offsets Tuning
Yarkoni, S., Wang, H., Plaat, A., & Bäck, T. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_14 · Cited by 20
Efficient Ising Model Mapping to Solving Slot Placement Problem
Kanamaru, S., Oku, D., Tawada, M., Tanaka, S., Hayashi, M., Yamaoka, M., Yanagisawa, M., & Togawa, N. (2019) · International Conference on Consumer Electronics · doi:10.1109/icce.2019.8661947 · Cited by 15
“Ising-model-based computers Recently, various Ising model-based computers, which are also referred to as annealing machines, have been developed to solve combinatorial optimization problems efficiently enough [1]–[5].”
MethodDesign of Quantum Annealing Machine for Prime Factoring
Maezawa, M., Imafuku, K., Hidaka, M., Koike, H., & Kawabata, S. (2017) · IEEE International Superconductive Electronics Conference (ISEC) · doi:10.1109/isec.2017.8314195 · Cited by 15
Investigating the Chinese postman problem on a quantum annealer
Siloi, I., Carnevali, V., Pokharel, B., Fornari, M., & Felice, R. D. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00031-9 · Cited by 18
Experimental test of search range in quantum annealing
Chancellor, N., & Kendon, V. M. (2021) · Physical Review A · doi:10.1103/physreva.104.012604 · Cited by 19
“[12] who demonstrate that fluctuations do not “freeze out” at low temperatures as one would expect for thermal fluctuations.”
BackgroundA molecular computing approach to solving optimization problems via programmable microdroplet arrays
Guo, S. Y., Friederich, P., Cao, Y., Wu, T., Forman, C. J., Mendoza, D., Degroote, M., Cavell, A. C., Krasecki, V. K., Hickman, R. J., et al. (2021) · Matter · doi:10.1016/j.matt.2021.03.002 · Cited by 20
Breakdown of the Weak-Coupling Limit in Quantum Annealing
Bando, Y., Yip, K.-W., Chen, H., Lidar, D. A., & Nishimori, H. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.054033 · Cited by 21
“Commercial devices developed by D-Wave Systems that realize programmable quantum annealing in hardware have now been available for more than a decade [9].”
BackgroundGraber, M., & Hofmann, K. (2022) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc56010.2022.9908118 · Cited by 19
“So called Ising machines are designed to solve problems based on the Ising model by exploiting different physical principles like quantum mechanics [2], optics [3] and nano-oscillators [4] for computation.”
MethodSignatures of Open and Noisy Quantum Systems in Single-Qubit Quantum Annealing
Morrell, Z., Vuffray, M., Lokhov, A. Y., Bärtschi, A., Albash, T., & Coffrin, C. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.19.034053 · Cited by 20
Anisotropic Landau-Lifshitz-Gilbert models of dissipation in qubits
Crowley, P. J. D., & Green, A. G. (2016) · Physical Review A · doi:10.1103/physreva.94.062106 · Cited by 22
Generation of entanglement in systems of intercoupled qubits
Chakhmakhchyan, L., Leroy, C., Ananikian, N. S., & Guérin, S. (2014) · Physical Review A · doi:10.1103/physreva.90.042324 · Cited by 15
Error suppression for Hamiltonian quantum computing in Markovian environments
Marvian, M., & Lidar, D. A. (2017) · Physical Review A · doi:10.1103/physreva.95.032302 · Cited by 17
Navigating a Maze using a Quantum Annealer
Pakin, S. (2017) · doi:10.1145/3149526.3149532 · Cited by 15
Statistical-Mechanical Analysis of Compressed Sensing for Hamiltonian Estimation of Ising Spin Glass
Takahashi, C., Ohzeki, M., Okada, S., Terabe, M., Taguchi, S., & Tanaka, K. (2018) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.87.074001 · Cited by 15
Physics-Enhanced Bifurcation Optimisers: All You Need is a Canonical Complex Network
Syed, M., & Berloff, N. G. (2023) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2023.3235334 · Cited by 22
Schworm, P., Wu, X., Glatt, M. F., & Aurich, J. C. (2023) · Procedia CIRP · doi:10.1016/j.procir.2023.09.028 · Cited by 16
Nguyen, V. D., Wu, L., Remacle, F., & Noels, L. (2024) · European Journal of Mechanics - A/Solids · doi:10.1016/j.euromechsol.2024.105254 · Cited by 19
Bae, J., Koo, J., Shim, C., & Kim, B. (2024) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc49657.2024.10454559 · Cited by 14
“10454559 Previous digital ASIC solutions [1-3] have demonstrated Ising computing using discrete-time digital processing elements that work as a large spin array while implementing spins using embedded memory with digital arithmetic-logic units for spin operations.”
MethodSchulz, S., Willsch, D., & Michielsen, K. F. L. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.013312 · Cited by 18
Hybrid quantum annealing decomposition framework for unit commitment
Ling, J., Zhang, Q., Geng, G., & Jiang, Q. (2024) · Electric Power Systems Research · doi:10.1016/j.epsr.2024.111121 · Cited by 23
Free-energy machine for combinatorial optimization
Shen, Z.-S., Pan, F. P., Wang, Y., Men, Y.-D., Xu, W., Yung, M., & Zhang, P. (2025) · Nature Computational Science · doi:10.1038/s43588-025-00782-0 · Cited by 34
“They were originally inspired by simulating the mean-field dynamics of programmable specialized hardware devices called Ising machines 12–17 and have been shown to achieve even higher performance compared with their hardware counterpart 9,11 .”
Quantum Adiabatic Optimization with Rydberg Arrays: Localization Phenomena and Encoding Strategies
Bombieri, L., Zeng, Z., Tricarico, R., Lin, R., Notarnicola, S., Cain, M., Lukin, M. D., & Pichler, H. (2025) · PRX Quantum · doi:10.1103/prxquantum.6.020306 · Cited by 39
Simulating long-distance entanglement in quantum spin chains by superconducting flux qubits
Zippilli, S., Grajcar, M., Il’ichev, E. V., & Illuminati, F. (2015) · Physical Review A · doi:10.1103/physreva.91.022315 · Cited by 15
Quantum annealing with capacitive-shunted flux qubits
Matsuzaki, Y., Hakoshima, H., Seki, Y., & Kawabata, S. (2020) · Japanese Journal of Applied Physics · doi:10.7567/1347-4065/ab5b30 · Cited by 18
“A superconducting flux qubit (FQ) [12, 13] has been used to demonstrate the QA in the previous demonstration [14].”
BackgroundMethodAndreanov, A., & Fistul, M. V. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.102.140405 · Cited by 14
Quantum phase transitions in non-Hermitian PT -symmetric transverse-field Ising spin chains
Starkov, G. A., Fistul, M. V., & Eremin, I. (2023) · Annals of Physics · doi:10.1016/j.aop.2023.169268 · Cited by 14
Theorem on the existence of a nonzero energy gap in adiabatic quantum computation
Zhang, D.-J., Yu, X., & Tong, D. M. (2014) · Physical Review A · doi:10.1103/physreva.90.042321 · Cited by 14
A subgradient approach for constrained binary optimization via quantum adiabatic evolution
Karimi, S., & Ronagh, P. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1639-2 · Cited by 16
“In particular, quantum anneal-ers manufactured by D-Wave Systems Inc. solve a spin glass model problem where couplings connect pairs of quantum bits [11].”
MethodViewing vanilla quantum annealing through spin glasses
Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab6ba · Cited by 20
A hybrid quantum-classical paradigm to mitigate embedding costs in quantum annealing
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500424 · Cited by 21
Practical designs for permutation-symmetric problem Hamiltonians on hypercubes
Dodds, A. B., Kendon, V. M., Adams, C. S., & Chancellor, N. (2019) · Physical Review A · doi:10.1103/physreva.100.032320 · Cited by 17
Solving Generalized Polyomino Puzzles Using the Ising Model
Takabatake, K., Yanagisawa, K., & Akiyama, Y. (2022) · Entropy · doi:10.3390/e24030354 · Cited by 19
“Examples include the quantum annealing machine from D-Wave Systems [16] and the coherent Ising machine (CIM) from NTT [17].”
MethodImplementation of a quantum adiabatic algorithm for factorization on two qudits
Zobov, V. E., & Ermilov, A. S. (2012) · Journal of Experimental and Theoretical Physics · doi:10.1134/s106377611205007x · Cited by 17
Patch-planting spin-glass solution for benchmarking
Wang, W., Mandrà, S., & Katzgraber, H. G. (2017) · Physical review. E · doi:10.1103/physreve.96.023312 · Cited by 20
Maximum-Likelihood Channel Decoding with Quantum Annealing MachinePreprint
Ide, N., Asayama, T., Ueno, H., & Ohzeki, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2007.08689 · Cited by 14
“From the D-Wave's hybrid API, we got the information of runtime, charge time and QPU access time.”
BackgroundInfluentialIsing Machine Based on Bistable Microelectromechanical Systems
Ezawa, M., Lebrasseur, É., & Mita, Y. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.114601 · Cited by 15
Bae, J., Oh, W., Koo, J., Yu, C., & Kim, B. (2023) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2023.3318586 · Cited by 16
“…machine is one of the alternative computers, and it has been implemented using various technologies (quantum annealers with superconducting qubits [8], field-programmable gate arrays (FPGAs) [9], [10], and application-specific integrated circuits (ASICs) [11], [12], [13], [14], [15], [16], [16],…”
BackgroundDeveloping intelligent cyber threat detection systems through quantum computing
Azeez, M., Nenebi, C. T., Asiam, L. K., Isoghie, E. J., Adesanya, O. R., & Abimbola, T. (2024) · International Journal of Science and Research Archive · doi:10.30574/ijsra.2024.12.2.1369 · Cited by 13
Encoding Arbitrary Ising Hamiltonians on Spatial Photonic Ising Machines
Sakellariou, J., Askitopoulos, A., Pastras, G., & Tsintzos, S. I. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.203801 · Cited by 30
Metrics for spin-based computing
Kurebayashi, H., Finocchio, G., Everschor‐Sitte, K., Gartside, J. C., Taniguchi, T., Litvinenko, A. N., Kumar, A., Åkerman, J. J., Vasilaki, E., Selçuk, K., et al. (2026) · Nature Reviews Physics · doi:10.1038/s42254-025-00918-1 · Cited by 27
“IMs can be implemented in a wide range of different hardware, broadly categorized into spatial networks on the one hand, such as commercial quantum annealer 149 and classical oscillator networks 152 , and time-multiplexed networks on the other, such as the optical Coherent IM 150 .”
Influence of hydrostatic pressure on superconducting properties of niobium thin film
Pristáš, G., Gabáni, S., Gažo, E., Komanický, V., Orendáč, M., & You, H. (2014) · Thin Solid Films · doi:10.1016/j.tsf.2014.01.062 · Cited by 13
Feedback-controlled adiabatic quantum computation
Wilson, R. D., Zagoskin, A. M., Savel'ev, S. E., Everitt, M. J., & Nori, F. (2012) · Physical Review A · doi:10.1103/physreva.86.052306 · Cited by 15
Ising formulation of associative memory models and quantum annealing recall
Santra, S., Shehab, O., & Balu, R. (2017) · Physical Review A · doi:10.1103/physreva.96.062330 · Cited by 18
Josephson ladders as a model system for 1D quantum phase transitions
Bell, M. T., Douçot, B., Gershenson, M. E., Ioffe, L. B., & Petković, A. (2018) · Comptes Rendus Physique · doi:10.1016/j.crhy.2018.09.002 · Cited by 13
“Recently, the transverse-field Ising model was realized in the chain of artificial and fully-controllable spins - eight flux qubits with tunable spin–spin couplings [14].”
BackgroundAcampora, G., Cataudella, V., Hegde, P. R., Lucignano, P., Passarelli, G., & Vitiello, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00011-8 · Cited by 14
Optimization of quantum computing models inspired by D-wave quantum annealing
Wang, B., Hu, F., & Wang, C. (2020) · Tsinghua Science & Technology · doi:10.26599/tst.2019.9010030 · Cited by 14
“The basic idea of QA [29] is to use quantum fluctuations to build optimization algorithms.”
MethodLeveraging special-purpose hardware for local search heuristics
Liu, X., Ushijima‐Mwesigwa, H., Mandal, A., Upadhyay, S., Safro, I., & Roy, A. (2022) · Computational Optimization and Applications · doi:10.1007/s10589-022-00354-2 · Cited by 20
“Examples of such special-purpose hardware include adiabatic quantum computers [26], complementary metal-oxide-semiconductor (CMOS) annealers [1, 63, 64] and coherent Ising machines [25, 31, 37].”
BackgroundCharacterization of QUBO reformulations for the maximum k-colorable subgraph problem
Quintero, R. A., Bernal, D. E., Terlaky, T., & Zuluaga, L. F. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03421-z · Cited by 20
“, [14, 28, 36, 45]), and algorithms (such as the quantum approximate optimization algorithm (QAOA)) for gate-based quantum computers (see, e.”
BackgroundQuantum and classical annealing in a continuous space with multiple local minima
Koh, Y. W., & Nishimori, H. (2022) · Physical Review A · doi:10.1103/physreva.105.062435 · Cited by 18
Albertsson, D. I., & Rusu, A. (2023) · Scientific Reports · doi:10.1038/s41598-023-31155-0 · Cited by 21
Preparation for quantum simulation of the (1+1) -dimensional O(3) nonlinear σ model using cold atoms
Ciavarella, A. N., Caspar, S., Singh, H., & Savage, M. J. (2023) · Physical Review A · doi:10.1103/physreva.107.042404 · Cited by 20
A Hybrid Quantum-Classical Algorithm for Multichannel Quantum Scattering of Atoms and Molecules
Xing, X., Cadavid, A. G., Izmaylov, A. F., & Tscherbul, T. V. (2023) · The Journal of Physical Chemistry Letters · doi:10.1021/acs.jpclett.3c00985 · Cited by 18
Tatsumura, K., Hidaka, R., Nakayama, J., Kashimata, T., & Yamasaki, M. (2023) · IEEE Access · doi:10.1109/access.2023.3316727 · Cited by 17
Practical Entanglement Estimation for Spin-System Quantum Simulators
Marty, O., Cramer, M., & Plenio, M. B. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.105301 · Cited by 16
Entanglement in a quantum neural network based on quantum dots
Altaĭsky, M. V., Zol’nikova, N. N., Kaputkina, N. E., Крылов, В. А., Lozovik, Y. E., & Dattani, N. S. (2017) · Photonics and Nanostructures - Fundamentals and Applications · doi:10.1016/j.photonics.2017.02.001 · Cited by 13
“Present solid state quantum annealing computers are based on SQUID qubits with the programmable weights implemented as inductive couplings between the SQUIDs [5, 6].”
BackgroundMethodInfluentialLarge-scale Ising-machines composed of magnetic neurons
Mizushima, K., Goto, H., & Sato, R. (2017) · Applied Physics Letters · doi:10.1063/1.5007231 · Cited by 13
Takase, T., Oyama, S., & Kurihara, M. (2018) · Neural Computation · doi:10.1162/neco_a_01089 · Cited by 13
“The D-wave machine (Johnson et al., 2011), the first commercial computer incorporating quantum annealing, has been attracting attention.”
BackgroundQuantum computation and quantum simulation
Heng, F. (2018) · Acta Physica Sinica · doi:10.7498/aps.67.20180710 · Cited by 13
Kumagai, M., Komatsu, K., Takano, F., Araki, T., Sato, M., & Kobayashi, H. (2021) · International Journal of Networking and Computing · doi:10.15803/ijnc.11.2_463 · Cited by 14
“D-Wave Systems Inc. has developed D-Wave 2000Q as a dedicated quantum annealer for QA [16].”
BackgroundA complete restricted Boltzmann machine on an adiabatic quantum computer
Rocutto, L., & Prati, E. (2021) · International Journal of Quantum Information · doi:10.1142/s0219749921410033 · Cited by 15
Control System of Superconducting Quantum Computers
He, Y., Liu, J., Zhao, C., Huang, R., Dai, G., & Chen, W. (2022) · Journal of Superconductivity and Novel Magnetism · doi:10.1007/s10948-021-06104-5 · Cited by 18
“Direct coupling mainly includes capacitive [11, 12, 36, 90–93] and inductive coupling [94, 95].”
BackgroundMethodBehaviour of two‐level quantum system driven by non‐classical inputs
Daeichian, A., & Sheikholeslam, F. (2013) · IET Control Theory and Applications · doi:10.1049/iet-cta.2013.0195 · Cited by 13
“INTRODUCTION In the recent years, establishing systems on the theory of quantum, called quantum technology, has drawn much attention of scientists because of more efficiency than classical technology and exclusive properties of quantum systems such as superposition and entanglement [1], [2], [3], [4], [5], [6].”
BackgroundFactorization in spin systems under general fields and separable ground-state engineering
Cerezo, M., Rossignoli, R., & Canosa, N. (2016) · Physical Review A · doi:10.1103/physreva.94.042335 · Cited by 15
Unfolding measurement distributions via quantum annealing
Cormier, K. J. R., Sipio, R. D., & Wittek, P. (2019) · Journal of High Energy Physics · doi:10.1007/jhep11(2019)128 · Cited by 13
Quantum Boltzmann machine algorithm with dimension-expanded equivalent Hamiltonian
Xiao, T., Bai, D., Fan, J., & Zeng, G. (2020) · Physical Review A · doi:10.1103/physreva.101.032304 · Cited by 16
Noise dynamics of quantum annealers: estimating the effective noise using idle qubits
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/accbe6 · Cited by 12
Yamamoto, K., Takemoto, T., Yoshimura, C., Mashimo, M., & Yamaoka, M. (2021) · IEEE Asian Solid-State Circuits Conference (A-SSCC) · doi:10.1109/a-sscc53895.2021.9634769 · Cited by 12
Xiao, J., Endo, K., Muramatsu, M., Nomura, R., Moriguchi, S., & Terada, K. (2024) · International Journal for Numerical and Analytical Methods in Geomechanics · doi:10.1002/nag.3800 · Cited by 14
Vector Ising spin annealer for minimizing Ising Hamiltonians
Cummins, J., & Berloff, N. G. (2025) · Communications Physics · doi:10.1038/s42005-025-02145-7 · Cited by 17
“The Ising model’s exploration of ground states in physical systems parallels the search for minimum cost functions in optimization, while its energy landscapes mirror the loss landscapes in machine learning, offering a unique perspective on optimization problems.”
Review of the application of quantum annealing-related technologies in transportation optimization
Mohammed, M. Q., Meeß, H., & Otte, M. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04870-y · Cited by 21
Quantum and quantum-inspired computing in civil engineering
Ploennigs, J., Smarsly, K., Berger, M., Dragos, K., & Kliesch, M. (2025) · Advanced Engineering Informatics · doi:10.1016/j.aei.2025.103960 · Cited by 13
Nag, T. (2016) · Physical review. E · doi:10.1103/physreve.93.062119 · Cited by 14
A frequency and sensitivity tunable microresonator array for high-speed quantum processor readout
Whittaker, J. D., Swenson, L. J., Volkmann, M. H., Spear, P., Altomare, F., Berkley, A. J., Bumble, B., Bunyk, P., Day, P. K., Eom, B. H., et al. (2016) · Journal of Applied Physics · doi:10.1063/1.4939161 · Cited by 12
Self-citationDual time scales in simulated annealing of a two-dimensional Ising spin glass
Rubin, S. J., Xu, N., & Sandvik, A. W. (2017) · Physical review. E · doi:10.1103/physreve.95.052133 · Cited by 12
Thermal management of a 3D packaging structure for superconducting quantum annealing machines
Feng, W., Kikuchi, K., Hidaka, M., Yamamori, H., Araga, Y., Makise, K., & Kawabata, S. (2021) · Applied Physics Letters · doi:10.1063/5.0039822 · Cited by 13
Mean field approximation for solving QUBO problems
Veszeli, M. T., & Vattay, G. (2022) · PLoS ONE · doi:10.1371/journal.pone.0273709 · Cited by 13
“In a real physical device, like the D-Wave system [19], this is useful, but for a simulation on a classical computer, it is impractical to simulate a large quantum mechanical system.”
MethodSolving the Shipment Rerouting Problem with Quantum Optimization Techniques
Yarkoni, S., Huck, A., Schülldorf, H., Speitkamp, B., Tabrizi, M. S., Leib, M., Bäck, T., & Neukart, F. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-87672-2_33 · Cited by 17
A Three-Stage Annealing Method Solving Slot-Placement Problems Using an Ising Machine
Fukada, K., Parizy, M., Tomita, Y., & Togawa, N. (2021) · IEEE Access · doi:10.1109/access.2021.3116038 · Cited by 15
“(Stage 2) Then, we perform the annealing process on an Ising machine [3], [4], [8], [23], [24] as usual.”
MethodNew advanced computing architecture for cryptography design and analysis by D-Wave quantum annealer
Ji, X., Wang, B., Hu, F., Wang, C., & Zhang, H. (2021) · Tsinghua Science & Technology · doi:10.26599/tst.2021.9010022 · Cited by 12
Analog quantum approximate optimization algorithm
Barraza, N., Barrios, G. A., Peng, J., Lamata, L., Solano, E., & Albarrán-Arriagada, F. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac91f0 · Cited by 17
“One of the most important approaches for solving optimization problems is employing quantum annealers, with remarkable advances by D-Wave company [1, 2].”
Frustrated Ising Model on D-wave Quantum Annealing Machine
Park, H., & Lee, H. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.074001 · Cited by 18
“Recently, another attempt to solve optimization problems has been performing on the D-wave quantum annealing machine (D-QAM) based on superconducting qubits [3].”
BackgroundMethodResearch on Quantum Annealing Integer Factorization Based on Different Columns
Wang, B., Yang, X., & Zhang, D. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.914578 · Cited by 17
“FIGURE 1 | Comparison of the working principle of the simulated annealing algorithm and quantum annealing algorithm [23].”
MethodMehta, V., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2022) · Physical Review A · doi:10.1103/physreva.105.062406 · Cited by 14
Quantum and Digital Annealing for the Quadratic Assignment Problem
Codognet, P., Díaz, D., & Abreu, S. P. (2022) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw55613.2022.00016 · Cited by 19
“Following the theoretical work of [4] and [5], Quantum Annealing (QA) has been developed as a new method for solving combinatorial problems and hardware implementations on quantum machines have been developed since about a decade by D-Wave Systems [6], [7].”
MethodSecurity and Quantum Computing: An Overview
Ravi, P., Chattopadhyay, A., & Bhasin, S. (2022) · IEEE Latin American Test Symposium (LATS) · doi:10.1109/lats57337.2022.9936966 · Cited by 13
“In general, quantum computers can be broadly classified into universal gate quantum computers and quantum anneal-ers [1].”
BackgroundHuang, Z., Jiang, D., Wang, X., & Yao, E. (2023) · IEEE Transactions on Circuits & Systems II Express Briefs · doi:10.1109/tcsii.2023.3249763 · Cited by 12
“On this basis, the quantum annealing processor was proposed to solve COPs with high accuracy and high speed [8].”
MethodExploring Quantum Annealing Architectures: A Spin Glass Perspective
Jaumà, G., García‐Ripoll, J. J., & Pino, M. (2024) · Advanced Quantum Technologies · doi:10.1002/qute.202300245 · Cited by 13
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.