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 901–1,000 of 1,009
Karanikolas, V. D., & Kawabata, S. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.094003 · Cited by 13
Beyond quantum annealing: optimal control solutions to maxcut problems
Pecci, G., Wang, R., Torta, P., Mbeng, G. B., & Santoro, G. E. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad60f2 · Cited by 16
Correlation free large-scale probabilistic computing using a true-random chaotic oscillator p-bit
Lee, W., Kim, H., Jung, H., Choi, Y., Jeon, J., & Kim, C. (2025) · Scientific Reports · doi:10.1038/s41598-025-93218-8 · Cited by 13
Fast stable adiabatic charging of open quantum batteries
Fasihi, M. A., Bahrbeig, R. J., Mojaveri, B., & Mohammadzadeh, R. H. (2025) · Physical review. E · doi:10.1103/6c73-ll23 · Cited by 15
Beyond the Born-Markov approximation: Dissipative dynamics of a single qubit
Cangemi, L. M., Passarelli, G., Cataudella, V., Lucignano, P., & Filippis, G. D. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.184306 · Cited by 9
Efficient Ising Model Mapping for Induced Subgraph Isomorphism Problems Using Ising Machines
Yoshimura, N., Tawada, M., Tanaka, S., Arai, J., Yagi, S., Uchiyama, H., & Togawa, N. (2019) · International Conference on Consumer Electronics · doi:10.1109/icce-berlin47944.2019.8966218 · Cited by 9
“Ising machines, which are also referred to as Ising modelbased computers or annealing machines, have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems [1] [5] [6] [8] [15] [16].”
BackgroundSolving systems of Boolean multivariate equations with quantum annealing
Ramos-Calderer, S., Bravo-Prieto, C., Lin, R., Bellini, E., Manzano, M., Aaraj, N., & Latorre, J. I. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013096 · Cited by 12
“[4] Mark W Johnson, Mohammad HS Amin, Suzanne”
BackgroundDesign Optimization of Noise Filter Using Quantum Annealer
Okada, A., Yoshida, H., Kidono, K., MATSUMORI, T., Takeno, T., & Kadowaki, T. (2023) · IEEE Access · doi:10.1109/access.2023.3271969 · Cited by 14
Shirai, T., & Togawa, N. (2024) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2024.3376721 · Cited by 14
“Recent advances in quantum technology have realized quantum devices, such as quantum annealers [4], [5], and gate-based quantum devices [6].”
BackgroundA Copositive Framework for Analysis of Hybrid Ising-Classical Algorithms
Brown, R., Bernal, D. E., Venturelli, D., & Pavone, M. (2024) · SIAM Journal on Optimization · doi:10.1137/22m1514581 · Cited by 21
“Recent years have seen significant advances in quantum and quantum-inspired Ising solvers, such as quantum annealers [1], quantum approximate optimization circuits [2], or coherent Ising machines [3].”
BackgroundA novel quantum algorithm for converting between one-hot and binary encodings
Chen, B., Wu, H.-Q., Yuan, H., Wu, L., & Li, X. (2024) · Quantum Information Processing · doi:10.1007/s11128-024-04403-z · Cited by 9
“• Uniform superposition states often serve as the initial state in various quantum algorithms, such as quantum phase estimation [12], quantum approximate optimization algorithm (QAOA) [13, 14], and quantum annealing [15, 16].”
Engineering of a quantum state by time-dependent decoherence-free subspaces
Wu, S. L. (2015) · Physical Review A · doi:10.1103/physreva.91.032104 · Cited by 9
Computing the maximum violation of a Bell inequality is an NP-problem
Batle, J. A. I., Ooi, C. H. R., Abdalla, S., & Bagdasaryan, A. G. (2016) · Quantum Information Processing · doi:10.1007/s11128-016-1275-2 · Cited by 10
Behrman, E., Steck, J. E., & Moustafa, M. A. (2017) · Quantum Information and Computation · doi:10.26421/qic17.5-6-6 · Cited by 11
Aonishi, T., Mimura, K., Utsunomiya, S., Okada, M., & Yamamoto, Y. (2017) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.86.104002 · Cited by 9
Microscopic Tunneling Model of Nb–AlN–NbN Josephson Flux-Flow Oscillator
Gulevich, D. R., Filippenko, L. V., & Koshelets, V. P. (2018) · Journal of Low Temperature Physics · doi:10.1007/s10909-018-2106-x · Cited by 9
Effective spin models of Kerr-nonlinear parametric oscillators for quantum annealing
Miyazaki, R. (2022) · Physical Review A · doi:10.1103/physreva.105.062457 · Cited by 11
Combinatorial optimization with photonics-inspired clock models
Honari-Latifpour, M., Mills, M. S., & Miri, M. (2022) · Communications Physics · doi:10.1038/s42005-022-00874-7 · Cited by 10
“These include, the D-Wave’s quantum annealing machine [5, 19], the coherent Ising machine [7, 8], Hitachi’s CMOS Ising solver [20], Fujitsu’s digital annealer [21], and Toshiba’s simulated bifurcations machine [16].”
BackgroundMethodApplications of Quantum Annealing to Music Theory
Arya, A., Botelho, L., Cañete, F., Kapadia, D., & Salehi, Ö. (2022) · Springer eBooks · doi:10.1007/978-3-031-13909-3_15 · Cited by 9
Dihedral lattice gauge theories on a quantum annealer
Fromm, M., Philipsen, O., & Winterowd, C. (2023) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00188-9 · Cited by 20
“On the side of adiabatic quantum computing [7], despite the fact that it has been commercially available for more than a decade in the form of quantum annealers (QA) [8], this approach has only recently been used for LGT calculations.”
MethodnSQUID arrays as conveyers of quantum information
Deng, Q., & Averin, D. V. (2014) · Journal of Experimental and Theoretical Physics · doi:10.1134/s1063776114120012 · Cited by 10
Fourier-transforming with quantum annealers
Hen, I. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00044 · Cited by 11
Quantum Robotics: A Primer on Current Science and Future Perspectives
Tandon, P., Lam, S., Shih, B., Mehta, T., Mitev, A., & Ong, Z. (2017) · Synthesis lectures on quantum computing · doi:10.2200/s00746ed1v01y201612qmc010 · Cited by 11
Deterministic quantum annealing expectation-maximization algorithm
Miyahara, H., Tsumura, K., & Sughiyama, Y. (2017) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/aa967e · Cited by 12
Exciton-polariton Josephson junctions at finite temperatures
Lebedev, M. E., Dolinina, D. A., Hong, K., Lu, T., Kavokin, A. V., & Alodjants, A. P. (2017) · Scientific Reports · doi:10.1038/s41598-017-09824-8 · Cited by 10
Mathematical Methods for a Quantum Annealing Computer
Warren, R. H. (2018) · Journal of Advances in Applied Mathematics · doi:10.22606/jaam.2018.33002 · Cited by 10
“Johnson and his colleagues [12] have an excellent description and diagram of the physical makeup of a qubit in a D-Wave computer.”
BackgroundQuantum annealing in spin-boson model: from a perturbative to an ultrastrong mediated coupling
Pino, M., & García‐Ripoll, J. J. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aaeeea · Cited by 14
“re problems that are of practical interest, include families of NP-hard problems and, most important, map to Ising models H p= P ij ˙ x i ˙ x j that have been implemented using superconducting qubits [4] or trapped ions [5{7]. In this reduced framework of combinatorial problems, existing AQC devices behave very much l…”
MethodEfficient Quantum and Simulated Annealing of Potts Models Using a Half-hot Constraint
Okada, S., Ohzeki, M., & Tanaka, K. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.094801 · Cited by 10
“developed commercial QA machines based on superconducting flux qubits [18].”
Single Electron Memory Effect Using Random Telegraph Signals at Room Temperature
Ibukuro, K., Husain, M. K., Li, Z., Hillier, J., Liu, F., Tomita, I., Tsuchiya, Y., Rutt, H. N., & Saito, S. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00152 · Cited by 9
Kota, T., Oku, D., Matsuda, Y., Tanaka, S., & Togawa, N. (2019) · International Conference on Consumer Electronics · doi:10.1109/icce-berlin47944.2019.8966167 · Cited by 9
“As a non-Neumann-type calculation technology, Ising machines have been developed to solve combinatorial optimization problems [1]–[6] Particularly, simulating-annealingbased (SA-based) Ising machines have been developed [4], which can accommodate relatively large number of spins and any two of them can be connected to…”
BackgroundValidating multi-photon quantum interference with finite data
Flamini, F., Walschaers, M., Spagnolo, N., Wiebe, N., Buchleitner, A., & Sciarrino, F. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/aba03a · Cited by 14
Image Analysis Based on Nonnegative/Binary Matrix Factorization
Asaoka, H., & Kudo, K. (2020) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.89.085001 · Cited by 9
Adiabatic Quantum Computing for Solving the Multi-Target Data Association Problem
Govaers, F., Stoob, V., & Ulmke, M. (2021) · IEEE International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI) · doi:10.1109/mfi52462.2021.9591187 · Cited by 9
Accelerating Neural Network Ensemble Learning Using Optimization and Quantum Annealing Techniques
Jooya, A., Keshavarz-Hedayati, B., Dimopoulos, N. J., & Oberoi, J. S. (2017) · doi:10.1145/3149526.3149528 · Cited by 12
“Quantum annealing on such a system is performed by slowly evolving the system Hamiltonian [8] where Γ decreases from 1 to 0 while Λ increases from 0 to 1 as time passes.”
BackgroundBabbush, R., Denchev, V. S., Ding, N., Isakov, S. V., & Neven, H. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1406.4203 · Cited by 15
Microwave Photonic Ising MachinePreprint
Cen, Q., Hao, T., Ding, H., Guan, S., Qin, Z., Xu, K., Dai, Y., & Li, M. (2020) · Research Square · doi:10.21203/rs.3.rs-79539/v1 · Cited by 9
“based on trapped ions (12,13), superconducting circuits (14), molecules (15,16), and optical systems (17-21) have been reported.”
BackgroundUnconventional quantum annealing methods for difficult trial problems
Tang, Z., & Kapit, E. (2021) · Physical Review A · doi:10.1103/physreva.103.032612 · Cited by 8
Parametric Frequency Divider Based Ising Machines
Casilli, N., Kaisar, T., Colombo, L., Ghosh, S., Feng, P. X. ‐., & Cassella, C. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.147301 · Cited by 8
“The power auxiliary generator ( pAG ) technique has only recently been introduced to overcome this limit [8].”
BackgroundMethodBoltzmann sampling with quantum annealers via fast Stein correction
Shibukawa, R., Tamura, R., & Tsuda, K. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043050 · Cited by 8
Using continuation methods to analyse the difficulty of problems solved by Ising machines
Lamers, J., Verschaffelt, G., & der Sande, G. V. (2024) · Communications Physics · doi:10.1038/s42005-024-01867-4 · Cited by 13
“So far, various physical systems have been investigated to act as an Ising machine 10 such as superconducting-circuit quantum annealers 11 and classical thermal annealers 12 .”
Scheduling of Satellite Constellation Operations in EO Missions Using Quantum Optimization
Marchioli, V., Boggio, M., Volpe, D., Massotti, L., & Novara, C. (2024) · Communications in computer and information science · doi:10.1007/978-3-031-77432-4_16 · Cited by 9
Quantum Algorithms for the Physical Layer: Potential Applications to Physical Layer Security
Matsumine, T., Ochiai, H., & Shikata, J. (2025) · IEEE Access · doi:10.1109/access.2025.3528443 · Cited by 14
“A substantial number of proof-of-principle demonstrations have been conducted [43], [45], [46], [47], [48], [49], [50], [51], and currently, the D-Wave quantum annealer has over 5,000 qubits [52].”
Gomez-Tejedor, A., Osaba, E., & Villar-Rodríguez, E. (2026) · Future Generation Computer Systems · doi:10.1016/j.future.2026.108481 · Cited by 17
An adiabatic quantum algorithm and its application to DNA motif model discovery
Cao, H., Wang, D., & Cao, F. (2014) · Information Sciences · doi:10.1016/j.ins.2014.10.057 · Cited by 9
Adiabatic Quantum Computing for Kernel k=2 Means Clustering.
Bauckhage, C., Ojeda, C., Sifa, R., & Wrobel, S. (2018) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 21
Coherent Potts machine based on an optical loop with a multilevel phase-sensitive amplifier
Inoue, K., Yoshida, K., & Kitahara, S. (2022) · Optics Communications · doi:10.1016/j.optcom.2022.129022 · Cited by 8
Quantum Computing for Applications in Data Fusion
Stoos, V., Ulmke, M., & Govaers, F. (2022) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2022.3212026 · Cited by 11
“In the AQC approach the Hamiltonian H ( t ) of the sys-tem is a time-dependent convex combination of a trivial beginning Hamiltonian H B and the desired end state produced by H F [8], [10], [24].”
BackgroundChen, J., Wang, Z., Xu, D., Qiao, H., Li, J., Zhong, Q., Wang, S., Zeng, J., Cai, J., Zhang, M., et al. (2023) · Superconductor Science and Technology · doi:10.1088/1361-6668/acf0f0 · Cited by 10
Quantum image denoising: a framework via Boltzmann machines, QUBO, and quantum annealing
Kerger, P., & Miyazaki, R. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1281100 · Cited by 14
“Quantum Annealers make use of quantum interactions with the primary goal of finding the ground state of Hamiltonian by initializing and then evolving a system of coupled qubits over time [14].”
BackgroundHybrid Optimization Method Using Simulated-Annealing-Based Ising Machine and Quantum Annealer
Kikuchi, S., Togawa, N., & Tanaka, S. (2023) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.92.124002 · Cited by 8
Jimbo, S., Shirai, T., Togawa, N., Motomura, M., & Kawamura, K. (2024) · IEEE Access · doi:10.1109/access.2024.3380479 · Cited by 8
“Ising machines [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14] have attracted attention in various industry fields as efficient solvers for combinatorial optimization problems (COPs).”
BackgroundMEMS Oscillators‐Network‐Based Ising Machine with Grouping Method
Deng, Y., Zhang, Y., Zhang, X., Jiang, Y., Chen, X., Yang, Y., Tong, X., Cai, Y. Q., Liu, W., Sun, C., et al. (2024) · Advanced Science · doi:10.1002/advs.202310096 · Cited by 8
Benchmarking quantum annealing with maximum cardinality matching problems
Vert, D., Willsch, M., Yenilen, B., Sirdey, R., Louise, S., & Michielsen, K. F. L. (2024) · Frontiers in Computer Science · doi:10.3389/fcomp.2024.1286057 · Cited by 10
Endo, K., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · PLoS ONE · doi:10.1371/journal.pone.0304594 · Cited by 13
A quantum annealing protocol to solve the nuclear shell model
Costa, E., Pérez-Obiol, A., Menéndez, J., Rios, A., García-Sáez, A., & Juliá-Díaz, B. (2025) · SciPost Physics · doi:10.21468/scipostphys.19.2.062 · Cited by 14
“When we deal with Quantum An-nealers [50], where the target Hamiltonian ˆ H T is generally a classical spin Hamiltonian, the common driver Hamiltonian ˆ H D corresponds to a transverse field, perfect for adding quantum fluctuations to the system, since [ ˆ H T , ˆ H D ] ̸ = 0 .”
Highly Versatile FPGA-Implemented Cyber Coherent Ising Machine
Aonishi, T., Nagasawa, T., Koizumi, T., Gunathilaka, M. D. S. H., Mimura, K., Okada, M., Kako, S., & Yamamoto, Y. (2024) · IEEE Access · doi:10.1109/access.2024.3504008 · Cited by 9
Efficient quantum algorithm for lattice protein folding
Wang, Y., & Zhou, X. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ada08e · Cited by 13
Parallel circuit implementation of variational quantum algorithms
Cattelan, M., Yarkoni, S., & Lechner, W. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00982-6 · Cited by 18
“Quantum annealing (QA) is one of the original quantum optimization algorithms designed to solve combinatorial optimization problems by exploiting adiabatic evolution, both in simulation and in programmable quantum hardware, known as quantum annealers 34,35 .”
From quantum-enhanced to quantum-inspired Monte Carlo
Christmann, J., Ivashkov, P., Chiurco, M., & Mazzola, G. (2025) · Physical Review A · doi:10.1103/physreva.111.042615 · Cited by 14
“Historically, disordered spin glasses have been considered an ideal testbed for developing and testing novel classical [3, 17, 28–30] and quantum algorithms and hardware [11, 31–35].”
Preserving privacy in a smart grid scenario using quantum mechanics
Borges, F., Santos, R. A. M., & Marquezino, F. D. L. (2014) · Security and Communication Networks · doi:10.1002/sec.1152 · Cited by 9
Modeling circuits with spins and magnets for all-spin logic
Behin‐Aein, B., Sarkar, A., & Datta, S. (2012) · European Solid-State Device Research Conference · doi:10.1109/essderc.2012.6343328 · Cited by 9
Signal-transparent wavelength conversion and light-speed back propagation through fiber
Namiki, S., Tan, H. N., Solis-Trapala, K., & Inoue, T. (2016) · Optical Fiber Communication Conference · doi:10.1364/ofc.2016.th4f.1 · Cited by 8
Matter wave coupling of spatially separated and unequally pumped polariton condensates
Kalinin, K. P., Lagoudakis, P. G., & Berloff, N. G. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.094512 · Cited by 8
“Various physical platforms have been proposed to simulate universal classical spin models including superconducting qubits [15], optical lattices [16], and photon laser networks [17] among others (for the review of these and other systems also see [18]).”
BackgroundSimple Constraint Embedding for Quantum Annealers
Vyskočil, T., & Djidjev, H. N. (2018) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2018.8638624 · Cited by 8
“Quantum annealing is a model for quantum computing that aims at minimizing a quadratic binary forms Q by looking for the minimum energy of quantum system whose Hamiltonian corresponds to Q [14], [6].”
BackgroundCiani, A., & Terhal, B. M. (2021) · Physical Review A · doi:10.1103/physreva.103.042401 · Cited by 12
Adiabatic Quantum Computing for Solving the Weapon Target Assignment Problem
Stoos, V., Ulmke, M., & Govaers, F. (2021) · International Conference on Information Fusion (FUSION) · doi:10.23919/fusion49465.2021.9626902 · Cited by 8
“Besides the quantum gate programming paradigm for general purpose quantum computers and its physical implementations [2], [3], significant progress is made in the field of adiabatic quantum computing [4]–[6] making commercial devices available for applications to various optimization problems.”
BackgroundEvaluating dynamic spectrum allocation using quantum annealing
Saito, K., Ikami, A., & Ono, C. (2021) · IEICE Communications Express · doi:10.1587/comex.2021xbl0047 · Cited by 8
“In its current hardware realization [5], QA implements the transverse field Ising model.”
BackgroundMethodNonequilibrium quantum thermodynamics in non-Markovian adiabatic speedup
Wang, Z.-M., Ren, F.-H., Sarandy, M. S., & Byrd, M. (2022) · Physica A Statistical Mechanics and its Applications · doi:10.1016/j.physa.2022.127861 · Cited by 8
Using Double Well Function as a Benchmark Function for Optimization Algorithm
Wang, P., & Yang, G. (2021) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec45853.2021.9505009 · Cited by 8
Saida, D., Yamanashi, Y., Hidaka, M., Hirayama, F., Imafuku, K., Nagasawa, S., & Kawabata, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3106776 · Cited by 9
“where x and z are x and z Pauli matrices acting on qubit i, respectively [10,13,14].”
BackgroundQuantum Machine Learning for Health State Diagnosis and Prognostics
Silva, G. S. M., & Droguett, E. L. (2022) · Annual Reliability and Maintainability Symposium (RAMS) · doi:10.1109/rams51457.2022.9893971 · Cited by 12
A global Lyapunov function for the coherent Ising machine
Roychowdhury, J. (2022) · Nonlinear Theory and Its Applications IEICE · doi:10.1587/nolta.13.227 · Cited by 8
“Ising machines first came into prominence with D-Wave’s adiabatic quantum annealer [2, 3] and the Coherent Ising Machine (CIM) [4–6].”
BackgroundCardinality Constrained Portfolio Optimization on an Ising Machine
Parizy, M., Sadowski, P., & Togawa, N. (2022) · IEEE International System-on-Chip Conference (SOCC) · doi:10.1109/socc56010.2022.9908082 · Cited by 8
“Over the past 10 years, quantum-based Ising machines [7] and non-quantum based Ising machines [8], [9], [10] have shown potential when solving certain kinds of combinatorial problems formalized as a quadratic unconstrained binary optimization (QUBO) form.”
BackgroundMethodTOWARDS A NOVEL ENVIRONMENT FOR SIMULATION OF QUANTUM COMPUTING
Patrzyk, J., Patrzyk, B., Rycerz, K., & Bubak, M. (2015) · Computer Science · doi:10.7494/csci.2015.16.1.103 · Cited by 8
“Moreover, the first prototypes of a quantum central processing unit were built: one realizing the von Neumann’s architecture [28] and another exploiting quantum annealing [21, 24].”
MethodPerformance of quantum annealing in solving optimization problems: A review
Suzuki, S. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02342-4 · Cited by 8
Solving constrained quadratic binary problems via quantum adiabatic evolution
Ronagh, P., Woods, B., & Iranmanesh, E. (2016) · Quantum Information and Computation · doi:10.26421/qic16.11-12-6 · Cited by 12
Neural Networks Identify Topological Phases
Carrasquilla, J. (2017) · Physics · doi:10.1103/physics.10.56 · Cited by 8
“For another, snapshots of many-body wave functions are becoming routinely available through the use of experimental techniques such as quantum-gas microscopy [11] and quantum annealing [12].”
MethodIto, M., Shiomura, M., Saito, T., Kihara, Y., Sakai, S., & Shirakashi, J. (2017) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano.2017.8117326 · Cited by 8
Quantum Bits with Macroscopic Topologically Protected States in Semiconductor Devices
Jaworowski, B., & Hawrylak, P. (2019) · Applied Sciences · doi:10.3390/app9030474 · Cited by 12
“Some of the most robust and scalable qubits so far have been constructed using superconductors [13,14].”
BackgroundCangemi, L. M., Cataudella, V., Sassetti, M., & Filippis, G. D. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.014301 · Cited by 8
Balancing coherent and dissipative dynamics in a central-spin system
Ricottone, A., Fang, Y., & Coish, W. A. (2020) · Physical review. B./Physical review. B · doi:10.1103/physrevb.102.085413 · Cited by 9
Compact spin qubits using the common gate structure of fin field-effect transistors
Tanamoto, T., & Ono, K. (2021) · AIP Advances · doi:10.1063/5.0039521 · Cited by 9
Particle track classification using quantum associative memory
Quiroz, G., Ice, L., Delgado, A., & Humble, T. S. (2021) · Nuclear Instruments and Methods in Physics Research Section A Accelerators Spectrometers Detectors and Associated Equipment · doi:10.1016/j.nima.2021.165557 · Cited by 12
“To study the robustness of the method under different detector conditions, we compare the φ angle values reconstructed for several added noise values γ = [0, 2, 4, 6, 8, 10, 12, 14, 16] (in percentage) and simulated detector efficiencies η = [95, 96, 97, 98, 99, 100].”
MethodModelling non-Markovian dynamics in photonic crystals with recurrent neural networks
Burgess, A., & Florescu, M. (2021) · Optical Materials Express · doi:10.1364/ome.425263 · Cited by 9
Constraint Solving by Quantum Annealing
Codognet, P. (2021) · International Conference on Parallel Processing Workshops (ICPPW) · doi:10.1145/3458744.3473364 · Cited by 9
“Initiated by the work of D-Wave Systems [10, 39], the development of quantum-based hardware has created a whole new domain for solving optimization problems.”
MethodLocalization transition induced by programmable disorder
Filho, J. L. C. D. C., Izquierdo, Z. G., Saguia, A., Albash, T., Hen, I., & Sarandy, M. S. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.134201 · Cited by 10
Mozgunov, E., & Lidar, D. A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0407 · Cited by 16
Quantum Neural Network for Solving Complex Combinatorial Optimization Problems
Takesue, H., Inagaki, T., Inaba, K., & Honjo, T. (2017) · NTT technical review · doi:10.53829/ntr201707fa2 · Cited by 8
Topological aspects of matters and Langlands program
Ikeda, K. (2023) · Reviews in Mathematical Physics · doi:10.1142/s0129055x24500053 · Cited by 10
“Here a quantum annealer [69] is a practical quantum solver of combinatorial optimization problems.”
BackgroundQuantum annealing with a nonvanishing final value of the transverse field
Nishimura, K., & Nishimori, H. (2017) · Physical Review A · doi:10.1103/physreva.96.042310 · Cited by 9
Tunneling in projective quantum Monte Carlo simulations with guiding wave functions
Parolini, T., Inack, E. M., Giudici, G., & Pilati, S. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.214303 · Cited by 9
“[12] MW Johnson, MHS Amin, S.”
Finding Hadamard Matrices by a Quantum Annealing Machine
Suksmono, A. B., & Minato, Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-50473-w · Cited by 11
“[5] M.”
Back to The Future: A Roadmap for Quantum Simulation From Vintage Quantum Chemistry
Love, P. J. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch02 · Cited by 9
“[40] M.”
BackgroundApplications of Quantum Annealing in StatisticsPreprint
Foster, R. C., Weaver, B., & Gattiker, J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1904.06819 · Cited by 10
Quantum-Assisted Greedy AlgorithmsPreprint
Ayanzadeh, R., Halem, M., Dorband, J. E., & Finin, T. (2019) · arXiv (Cornell University) · doi:10.13016/m2n5ap-kape · Cited by 8
Quantum classifiers with a trainable kernel
Xu, L., Zhang, X., Li, M., & Shen, S.-Q. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.21.054056 · Cited by 17
Quantum Computing's Role in Advancing Sustainability
Kumar, A. (2025) · Emerald Group Publishing Limited eBooks · doi:10.1108/978-1-83549-109-620251004 · Cited by 10
Unraveling reverse annealing: A study of D-Wave quantum annealers
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/vfxh-gjgy · Cited by 12
Frustration Elimination and Excited State Search in Coherent Ising Machines
Zhou, Z.-Y., Gneiting, C., You, J. Q., & Nori, F. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.090401 · Cited by 8
Multi-phase Coupled CMOS Ring Oscillator based Potts Machine
Gonul, Y. E., & Taşkın, B. (2024) · doi:10.1145/3676536.3676720 · Cited by 7
“In the Ising model that underlies the Ising machine implementations, such as those in [3, 4, 5, 6, 7, 8, 9], the spins of interacting nodes are modeled with 2 spin values.”
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.