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 401–500 of 1,007
Adiabatic optimization versus diffusion Monte Carlo methods
Jarret, M., Jordan, S. P., & Lackey, B. (2016) · Physical Review A · doi:10.1103/physreva.94.042318 · Cited by 36
Complexity Classification of Local Hamiltonian Problems
Cubitt, T. S., & Montanaro, A. (2014) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2014.21 · Cited by 42
Wireless quantum key distribution in indoor environments
Elmabrok, O., & Razavi, M. (2018) · Journal of the Optical Society of America B · doi:10.1364/josab.35.000197 · Cited by 41
“This is a huge threat to the security of our online communications, such as email correspondence and banking transactions, especially considering the progress made in the past few years in quantum computing [6], [7], [8].”
BackgroundControllable Josephson junction for photon Bose-Einstein condensates
Vretenar, M., Kassenberg, B., Bissesar, S., Toebes, C., & Klaers, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.023167 · Cited by 47
“[4] M.”
MethodQuantum simulation of Cayley-tree Ising Hamiltonians with three-dimensional Rydberg atoms
Song, Y., Kim, M., Hwang, H., Lee, W., & Ahn, J. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013286 · Cited by 51
New trends in quantum machine learning (a)
Buffoni, L., & Caruso, F. (2020) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/132/60004 · Cited by 43
Folding lattice proteins with quantum annealing
Irbäck, A., Knuthson, L., Mohanty, S., & Peterson, C. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043013 · Cited by 54
“These technologies are being developed along two main tracks: quantum annealers [1] and gatebased systems [2].”
The quantum transition of the two-dimensional Ising spin glass
Bernaschi, M., González-Adalid Pemartín, I., Martín-Mayor, V., & Parisi, G. (2024) · Nature · doi:10.1038/s41586-024-07647-y · Cited by 35
“Massimo Bernaschi 1 , Isidoro González-Adalid Pemartín 2 ✉ , Víctor Martín-Mayor 2 & Giorgio Parisi 3,4 Quantum annealers are commercial devices that aim to solve very hard computational problems 1 , typically those involving spin glasses 2,3 .”
BackgroundInfluentialSukulthanasorn, N., Xiao, J., Wagatsuma, K., Nomura, R., Moriguchi, S., & Terada, K. (2025) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2025.117746 · Cited by 36
“Examples include the IBM Quantum Computer [4], D-Wave [5,6], Fujitsu Digital Annealer [7], Hitachi CMOS Annealing Machine [8], Toshiba Simulated Bifurcation Machine [9], and Fixstars Amplify Annealing Engine [10].”
Tunneling spectroscopy using a probe qubit
Berkley, A. J., Przybysz, A. J., Lanting, T., Harris, R., Dickson, N., Altomare, F., Amin, M. H., Bunyk, P., Enderud, C., Hoskinson, E., et al. (2013) · Physical Review B · doi:10.1103/physrevb.87.020502 · Cited by 35
Self-citationWalschaers, M., Schlawin, F., Wellens, T., & Buchleitner, A. (2016) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031115-011327 · Cited by 38
Quantum Annealing via Environment-Mediated Quantum Diffusion
Smelyanskiy, V., Venturelli, D., Perdomo‐Ortiz, A., Knysh, S., & Dykman, M. I. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.066802 · Cited by 44
Continuous black-box optimization with an Ising machine and random subspace coding
Izawa, S., Kitai, K., Tanaka, S., Tamura, R., & Tsuda, K. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023062 · Cited by 42
Towards optimization of photonic-crystal surface-emitting lasers via quantum annealing
Inoue, T., Seki, Y., Tanaka, S., Togawa, N., Ishizaki, K., & Noda, S. (2022) · Optics Express · doi:10.1364/oe.476839 · Cited by 40
Multidimensional hyperspin machine
Strinati, M. C., & Conti, C. (2022) · Nature Communications · doi:10.1038/s41467-022-34847-9 · Cited by 43
“Ising spin simulators include two-component BoseEinstein condensates [17, 18], superconducting circuits [19], digital computers [20–22], electrical oscillators [23], optoelectronical oscillators [24], and degenerate optical parametric oscillators (POs) [25–34] forming a coherent Ising machine (CIM).”
BackgroundProbing entanglement in adiabatic quantum optimization with trapped ions
Hauke, P., Bonnes, L., Heyl, M., & Lechner, W. (2015) · Frontiers in Physics · doi:10.3389/fphy.2015.00021 · Cited by 34
“Procedures in this spirit have been implemented in so-called quantum annealers such as the D-Wave device [23–27] or nuclear magnetic resonance setups [28].”
MethodHu, F., Lamata, L., Sanz, M., Chen, X., Chen, X., Wang, C., & Solano, E. (2020) · Physics Letters A · doi:10.1016/j.physleta.2019.126214 · Cited by 44
“[15] is devoted to commercial quantum computing with prototypes based on the quantum annealing paradigm [16], and mainly aimed at three categories of software applications and algorithms: Monte Carlo simulations, optimization, and machine learning.”
Memristors can implement fuzzy logicPreprint
Klimo, M., & Šuch, O. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.2074 · Cited by 43
“There are other approaches that promise a dramatic leap in computer performance, such as quantum computing [12], [13].”
Performance of two different quantum annealing correction codes
Mishra, A., Albash, T., & Lidar, D. A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1201-z · Cited by 36
A quantum-walk-inspired adiabatic algorithm for solving graph isomorphism problems
Tamascelli, D., & Zanetti, L. (2014) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/47/32/325302 · Cited by 40
Boosting quantum annealer performance via sample persistence
Karimi, H., & Rosenberg, G. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1615-x · Cited by 28
“Quantum annealers are now commercially available [5,20].”
Quantum Monte Carlo tunneling from quantum chemistry to quantum annealing
Mazzola, G., Smelyanskiy, V., & Troyer, M. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.134305 · Cited by 40
Toward the Implementation of a Quantum RBM
de Freitas, N. (2011) · Cited by 34
Variational Quantum Circuits for Machine Learning. An Application for the Detection of Weak Signals
Griol-Barres, I., Milla, S., Cebrián, A., Mansoori, Y., & Millet, J. (2021) · Applied Sciences · doi:10.3390/app11146427 · Cited by 40
“These two interlocked qubits can be interpreted as a single object with four possible states [34].”
BackgroundSolving the resource constrained project scheduling problem with quantum annealing
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-67168-6 · Cited by 53
Job, J., & Lidar, D. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabd9b · Cited by 34
A Fully-Connected Ising Model Embedding Method and Its Evaluation for CMOS Annealing Machines
Oku, D., Terada, K., HAYASHI, M., Yamaoka, M., Tanaka, S., & Togawa, N. (2019) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2018edp7411 · Cited by 39
“There have been proposed many researches on solving combinatorial optimization problems recently using Ising models but almost all of them target the D-Wave quantum annealing machine [5], [6].”
BackgroundMethodCompressed Quadratization of Higher Order Binary Optimization Problems
Mandal, A., Roy, A., Upadhyay, S., & Ushijima‐Mwesigwa, H. (2020) · DCC · doi:10.1109/dcc47342.2020.00090 · Cited by 60
Towards quantum belief propagation for LDPC decoding in wireless networks
Kasi, S., & Jamieson, K. (2020) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3372224.3419207 · Cited by 44
“, couplers) between pairs of devices are realized with a tunable magnetic coupling using a programmable on-chip control circuitry [35, 40].”
MethodQuantum Annealing based factory layout planning
Klar, M., Schworm, P., Wu, X., Glatt, M. F., & Aurich, J. C. (2022) · Manufacturing Letters · doi:10.1016/j.mfglet.2022.03.003 · Cited by 33
Relaxation versus adiabatic quantum steady-state preparation
Venuti, L. C., Albash, T., Marvian, M., Lidar, D. A., & Zanardi, P. (2017) · Physical Review A · doi:10.1103/physreva.95.042302 · Cited by 35
FPGA-based Annealing Processor for Ising Model
Yoshimura, C., Hayashi, M., Okuyama, T., & Yamaoka, M. (2016) · International Symposium on Computing and Networking · doi:10.1109/candar.2016.0081 · Cited by 38
“Then, the interaction between spin units is executed repeatedly by updating the spin value.”
BackgroundEnd-To-End Quantum Machine Learning Implemented with Controlled Quantum Dynamics
Wu, R.-B., Cao, X., Xie, P., & Liu, Y.-X. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.064020 · Cited by 37
“[27] M.”
MethodHybrid quantum annealing via molecular dynamics
Irie, H., Liang, H., Doi, T., Gongyo, S., & Hatsuda, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-87676-z · Cited by 32
“ptimizations. They utilize adiabatic evolution of quantum bits (qubits) to nd the ground state of Ising spin-glass models. Since quantum-annealing processors (quantum annealers) have become available [6], practical usage as well as fundamental researches on quantum optimization has largely been developed in recent yea…”
Quantum computing basics, applications and future perspectives
Balamurugan, K. S., Sivakami, A., Mathankumar, M., Prasad, Y. J. D. S., & Ahmad, I. (2024) · Journal of Molecular Structure · doi:10.1016/j.molstruc.2024.137917 · Cited by 54
A Review of Ising Machines Implemented in Conventional and Emerging Technologies
Zhang, T., Tao, Q., Liu, B., Grimaldi, A., Raimondo, E., Jiménez, M., Avedillo, M. J., Núñez, J., Linares-Barranco, B., Serrano‐Gotarredona, T., et al. (2024) · IEEE Transactions on Nanotechnology · doi:10.1109/tnano.2024.3457533 · Cited by 47
Improving the Solving of Optimization Problems: A Comprehensive Review of Quantum Approaches
Volpe, D., Orlandi, G., & Turvani, G. (2025) · Quantum Reports · doi:10.3390/quantum7010003 · Cited by 51
“Currently, two main methods are employed: quantum annealers (QAs) [10,11], special-purpose devices for optimization tasks, and algorithms based on quantum circuits or quantum gate arrays (QGAs) [7], which run on general-purpose quantum hardware or classical simulators.”
Passarelli, G., Filippis, G. D., Cataudella, V., & Lucignano, P. (2018) · Physical Review A · doi:10.1103/physreva.97.022319 · Cited by 35
Liu, W., Zheng, D. N., & Zhao, S.-P. (2018) · Chinese Physics B · doi:10.1088/1674-1056/27/2/027401 · Cited by 36
Practical integer-to-binary mapping for quantum annealers
Karimi, S., & Ronagh, P. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2213-x · Cited by 47
Optimization of neural networks via finite-value quantum fluctuations
Ohzeki, M., Okada, S., Terabe, M., & Taguchi, S. (2018) · Scientific Reports · doi:10.1038/s41598-018-28212-4 · Cited by 32
Quantum Annealing Simulation of Out-of-Equilibrium Magnetization in a Spin-Chain Compound
King, A. D., Batista, C. D., Raymond, J., Lanting, T. M., Ozfidan, I., Poulin-Lamarre, G., Zhang, H., & Amin, M. H. S. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030317 · Cited by 47
Self-citationEfficient sampling of ground and low-energy Ising spin configurations with a coherent Ising machine
Ng, E., Onodera, T., Kako, S., McMahon, P. L., Mabuchi, H., & Yamamoto, Y. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013009 · Cited by 44
“As a result, significant interest has developed towards leveraging physical Ising-like systems as special-purpose computational hardware for tackling problems such as combinatorial optimization, with ongoing research on platforms ranging from quantum annealers built from microwave superconducting circuits [4, 5] to co…”
BackgroundFEqa: Finite element computations on quantum annealers
Raisuddin, O. M., & De, S. (2022) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2022.115014 · Cited by 42
“Quantum annealers simulate an Ising Hamiltonian, which can be programmed to minimize an objective function of interest (Johnson et al., 2011).”
BackgroundSimulated bifurcation for higher-order cost functions
Kanao, T., & Goto, H. (2022) · Applied Physics Express · doi:10.35848/1882-0786/acaba9 · Cited by 47
Designing quantum annealing schedules using Bayesian optimization
Finžgar, J. R., Schuetz, M. J. A., Brubaker, J. K., Nishimori, H., & Katzgraber, H. G. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023063 · Cited by 52
Schedule path optimization for adiabatic quantum computing and optimization
Zeng, L., Zhang, J., & Sarovar, M. (2016) · Journal of Physics A: Mathematical and Theoretical · doi:10.1088/1751-8113/49/16/165305 · Cited by 31
Pelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 61
“QA has been physically implemented using superconducting flux qubits in commercial devices by companies such as D-Wave [8].”
From local to global ground states in Ising spin glasses
Zintchenko, I., Hastings, M. B., & Troyer, M. (2015) · Physical Review B · doi:10.1103/physrevb.91.024201 · Cited by 37
Do multipartite correlations speed up adiabatic quantum computation or quantum annealing?
Batle, J. A. I., Ooi, C. H. R., Farouk, A., Abutalib, M. M., & Abdalla, S. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1324-x · Cited by 35
Practical engineering of hard spin-glass instances
Marshall, J., Martin-Mayor, V., & Hen, I. (2016) · Physical Review A · doi:10.1103/physreva.94.012320 · Cited by 32
“edu A huge amount of progress has recently been made in the building of experimental quantum annealers [9, 10], the most notable of which are the D-Wave processors consisting of hundreds of coupled superconducting flux qubits.”
BackgroundFast Preparation of Critical Ground States Using Superluminal Fronts
Agarwal, K., Bhatt, R. N., & Sondhi, S. L. (2018) · Physical Review Letters · doi:10.1103/physrevlett.120.210604 · Cited by 34
Large-scale Coherent Ising Machine
Takesue, H., Inagaki, T., Inaba, K., Ikuta, T., & Honjo, T. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061014 · Cited by 34
Combinatorial optimization by weight annealing in memristive hopfield networks
Fahimi, Z., Mahmoodi, M. R., Nili, H., Polishchuk, V., & Strukov, D. B. (2021) · Scientific Reports · doi:10.1038/s41598-020-78944-5 · Cited by 39
Unconventional computing based on magnetic tunnel junction
Cai, B., He, Y., Xin, Y., Yuan, Z., Zhang, X., Zhu, Z., & Liang, G. (2023) · Applied Physics A · doi:10.1007/s00339-022-06365-4 · Cited by 41
“Various IMs based on different physical mechanisms have been extensively [189] with the authors’ permission studied, including Quantum-based [190], Optical-based [191, 192], and Electrical LC-based [193, 194], but these approaches also have their problems.”
BackgroundSolving larger maximum clique problems using parallel quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2023) · Quantum Information Processing · doi:10.1007/s11128-023-03962-x · Cited by 44
Geller, M. R., Martinis, J. M., Sornborger, A. T., Stancil, P. C., Pritchett, E., You, H., & Galiautdinov, A. (2015) · Physical Review A · doi:10.1103/physreva.91.062309 · Cited by 38
High-fidelity adiabatic quantum computation via dynamical decoupling
Quiroz, G., & Lidar, D. A. (2012) · Physical Review A · doi:10.1103/physreva.86.042333 · Cited by 37
Towards a feasible implementation of quantum neural networks using quantum dots
Altaisky, M. V., Zolnikova, N. N., Kaputkina, N. E., Krylov, V. A., Lozovik, Y. E., & Dattani, N. S. (2016) · Applied Physics Letters · doi:10.1063/1.4943622 · Cited by 23
Pakin, S. (2016) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2016.7761637 · Cited by 31
“Although the computational technique is over 30 years old, there have been only relatively recent developments in constructing physical annealers, using either conventional CMOS [3] or more exotic superconducting technology that exploits quantum effects [4].”
BackgroundHessian-based optimization of constrained quantum control
Dalgaard, M., Motzoi, F., Jensen, J. H. M., & Sherson, J. F. (2020) · Physical Review A · doi:10.1103/physreva.102.042612 · Cited by 34
Harnessing Intrinsic Noise in Memristor Hopfield Neural Networks for Combinatorial OptimizationPreprint
Cai, F., Kumar, S., Vaerenbergh, T. V., Liu, R., Li, C., Yu, S., Xia, Q., Yang, J. J., Beausoleil, R. G., Lu, W. D., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.11194 · Cited by 41
“These performance gains can be attributed to (1) the highly efficient matrix vector multiplication performed in the analog domain, (2) intrinsic access to a tunable noise source within the memristor crossbar circuit, (3) high parallelism in the dot-product operations as well as multiple crossbar circuits running separ…”
BackgroundAnalog nature of quantum adiabatic unstructured search
Slutskii, M., Albash, T., Barash, L., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab51f9 · Cited by 31
“[19] M.”
BackgroundFragility of flux qubits against quasiparticle tunneling
Leppäkangas, J., & Marthaler, M. (2012) · Physical Review B · doi:10.1103/physrevb.85.144503 · Cited by 30
D-Wave and predecessors: From simulated to quantum annealing
Cohen, E., & Tamir, B. (2014) · International Journal of Quantum Information · doi:10.1142/s0219749914300022 · Cited by 40
Landau-Zener transitions in an open multilevel quantum system
Ashhab, S. (2016) · Physical Review A · doi:10.1103/physreva.94.042109 · Cited by 31
Disorder-assisted distribution of entanglement in XY spin chains
Almeida, G. M. A., de Moura, F. A. B. F., Apollaro, T. J. G., & Lyra, M. L. (2017) · Physical Review A · doi:10.1103/physreva.96.032315 · Cited by 31
Wishart planted ensemble: A tunably rugged pairwise Ising model with a first-order phase transition
Hamze, F., Raymond, J., Pattison, C. A., Biswas, K., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.052102 · Cited by 36
Self-citationQuantum annealing using vacuum states as effective excited states of driven systems
Goto, H., & Kanao, T. (2020) · Communications Physics · doi:10.1038/s42005-020-00502-2 · Cited by 33
Comparing Relaxation Mechanisms in Quantum and Classical Transverse-Field Annealing
Albash, T., & Marshall, J. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014029 · Cited by 34
Maronese, M., Moro, L. D., Rocutto, L., & Prati, E. (2022) · Springer eBooks · doi:10.1007/978-3-030-89746-8_2 · Cited by 51
Scalable and robust quantum computing on qubit arrays with fixed coupling
Le, N. H., Cykiert, M., & Ginossar, E. (2023) · npj Quantum Information · doi:10.1038/s41534-022-00668-3 · Cited by 35
Comparative study of the performance of quantum annealing and simulated annealing
Nishimori, H., Tsuda, J., & Knysh, S. (2015) · Physical Review E · doi:10.1103/physreve.91.012104 · Cited by 40
Finding Maximum Cliques on a Quantum Annealer
Chapuis, G., Djidjev, H. N., Hahn, G., & Rizk, G. (2017) · ACM International Conference on Computing Frontiers (CF) · doi:10.1145/3075564.3075575 · Cited by 39
“Each loop encodes both a 0 and 1 (or, alternatively, -1 and +1) value at the same time through two superimposed currents in both clockwise and counter-clockwise directions until the annealing process has been completed and the system turns classical [3, 10].”
BackgroundFinding the ground state of spin Hamiltonians with reinforcement learning
Mills, K., Ronagh, P., & Tamblyn, I. (2020) · Nature Machine Intelligence · doi:10.1038/s42256-020-0226-x · Cited by 45
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
“Over the past years there has been an impressive progress in the field of AQC [12, 13, 14], with many practical problems within the field of combinatorial optimization are proposed to be solved using this approach [15, 16, 17, 18, 19, 20].”
BackgroundBallester, R., Cerquides, J., & Artiles, L. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00292-2 · Cited by 45
“In 2011, the Canadian company D-Wave was the first to commercial-ize a quantum annealer (Johnson et al. 2011).”
Constrained quantum annealing of graph coloring
Kudo, K. (2018) · Physical Review A · doi:10.1103/physreva.98.022301 · Cited by 38
Exploring More-Coherent Quantum Annealing
Novikov, S. P., Hinkey, R. T., Disseler, S., Basham, J. I., Albash, T., Risinger, A., Ferguson, D., Lidar, D. A., & Zick, K. M. (2018) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2018.8638625 · Cited by 41
“In the annealed state, the qubit is in a strong double-well potential regime, where the inter-well barrier is high enough that the tunneling rate between the two wells is negligibly small [24].”
BackgroundVepsäläinen, A. P., & Paraoanu, G. S. (2020) · Advanced Quantum Technologies · doi:10.1002/qute.201900121 · Cited by 33
“For adiabatic quantum computers [56], quantum-annealing processors [57, 58], and holonomic quantum computing [59–61] this would be one important route to achieving quantum advantage [62].”
MethodTackling the Challenge of a Huge Materials Science Search Space with Quantum‐Inspired Annealing
Hatakeyama‐Sato, K., Kashikawa, T., Kimura, K., & Oyaizu, K. (2021) · Advanced Intelligent Systems · doi:10.1002/aisy.202000209 · Cited by 31
Limitations of error corrected quantum annealing in improving the performance of Boltzmann machines
Li, R. Y., Albash, T., & Lidar, D. A. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9aab · Cited by 36
Evaluation of Quantum Annealer Performance via the Massive MIMO Problem
Tabi, Z., Marosits, Á., Kallus, Z., Vaderna, P., Godor, I., & Zimborás, Z. (2021) · IEEE Access · doi:10.1109/access.2021.3114543 · Cited by 37
“A Quantum Annealer (QA) [3]–[5], one of the promising heuristic devices in this NISQ era, is capable of solving complex opti-The associate editor coordinating the review of this manuscript and approving it for publication was Luyu Zhao . mization problems using thousands of noisy qubits.”
BackgroundSpatial computing architecture using randomness of memory cell stability under voltage control
Yoshimura, C., Yamaoka, M., Aoki, H., & Mizuno, H. (2013) · European Conference on Circuit Theory and Design · doi:10.1109/ecctd.2013.6662276 · Cited by 29
“Thus, several analog computers for performing GSS by using superconductivity [7] and laser [8] have been are proposed.”
MethodDirect comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 34
Yarkoni, S., Plaat, A., & Bäck, T. (2018) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2018.8477865 · Cited by 37
“QPUs are physical implementations of the Ising model, using superconducting loops of niobium metal as the quantum bits, or qubits [1].”
MethodHearing the Shape of the Ising Model with a Programmable Superconducting-Flux Annealer
Vinci, W., Markström, K., Boixo, S., Roy, A., Spedalieri, F. M., Warburton, P. A., & Severini, S. (2014) · Scientific Reports · doi:10.1038/srep05703 · Cited by 31
Stability of the quantum Sherrington-Kirkpatrick spin glass model
Young, A. P. (2017) · Physical review. E · doi:10.1103/physreve.96.032112 · Cited by 40
Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy
Kechedzhi, K., & Smelyanskiy, V. (2016) · Physical Review X · doi:10.1103/physrevx.6.021028 · Cited by 36
Ohyama, T., Kawamoto, Y., & Kato, N. (2021) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2021.3115107 · Cited by 34
“D-Wave machine hardware has already been commercialized to realize quantum annealing operations [22].”
BackgroundMallick, A., Zhao, Z., Bashar, M. K., Alam, S., Islam, M. M., Xiao, Y., Xu, Y., Aziz, A., Narayanan, V., Ni, K., et al. (2023) · Scientific Reports · doi:10.1038/s41598-023-28217-8 · Cited by 39
Quantum Annealing Designs Nonhemolytic Antimicrobial Peptides in a Discrete Latent Space
Tučs, A., Berenger, F., Yumoto, A., Tamura, R., Uzawa, T., & Tsuda, K. (2023) · ACS Medicinal Chemistry Letters · doi:10.1021/acsmedchemlett.2c00487 · Cited by 34
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 33
Performance of quantum annealing inspired algorithms for combinatorial optimization problems
Zeng, Q., Cui, X., Liu, B., Wang, Y., Mosharev, P. A., & Yung, M. (2024) · Communications Physics · doi:10.1038/s42005-024-01705-7 · Cited by 50
“However, experimental results have demonstrated that QA ’ s current performance is suboptimal when handling dense graphs, owing to limited qubit connectivity and physical noise 11 – 14 .”
Simulated-quantum-annealing comparison between all-to-all connectivity schemes
Albash, T., Vinci, W., & Lidar, D. A. (2016) · Physical Review A · doi:10.1103/physreva.94.022327 · Cited by 33
“The observation that such models can also be solved via quantum annealing [3–5] has spurred a great deal of recent interest in building special-purpose analog quantum devices [6, 7] with the hope of realizing quantum speedups [8].”
BackgroundAn Ising model mapping to solve rectangle packing problem
Terada, K., Oku, D., Kanamaru, S., Tanaka, S., Hayashi, M., Yamaoka, M., Yanagisawa, M., & Togawa, N. (2018) · International Symposium on VLSI Design, Automation and Test · doi:10.1109/vlsi-dat.2018.8373233 · Cited by 27
“Some physical annealing machines have been developed in [2], [7], [9], [10].”
BackgroundOptimization of Robot-Trajectory Planning with Nature-Inspired and Hybrid Quantum Algorithms
Schuetz, M. J. A., Brubaker, J. K., Montagu, H., van Dijk, Y., Klepsch, J., Ross, P., Luckow, A., Resende, M. G. C., & Katzgraber, H. G. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.054045 · Cited by 38
“Specifically, the advent of quantum annealing devices such as the D-Wave Systems Inc. quantum annealers [2–5] has spawned an increased interest in the development of quantum-native, heuristic approaches to solve discrete optimization problems.”
BackgroundMethodDomino, K., Kundu, A., Salehi, Ö., & Krawiec, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03670-y · Cited by 47
“Commercially available quantum annealers are provided by the D-Wave company [10].”
MethodMüller, F., Christiansen, H., Schnabel, S., & Wolfhard Janke, E. (2023) · Physical Review X · doi:10.1103/physrevx.13.031006 · Cited by 27
First application of quantum annealing to IMRT beamlet intensity optimization
Nazareth, D. P., & Spaans, J. (2015) · Physics in Medicine and Biology · doi:10.1088/0031-9155/60/10/4137 · Cited by 38
“Circuitry has been designed to define a class of programmable cost functions and which when cooled to near absolute zero manifests the quantum effects necessary for QA (Johnson et al 2011).”
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.