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 601–700 of 1,009
Towards Ultra-High-Speed Cryogenic Single-Flux-Quantum Computing
Ishida, K., Tanaka, M., Ono, T., & Inoue, K. (2018) · IEICE Transactions on Electronics · doi:10.1587/transele.e101.c.359 · Cited by 21
“359 Real implementations are available in the market as quantum computers [1], [2].”
BackgroundSolving Set Cover with Pairs Problem using Quantum Annealing
Cao, Y., Jiang, S., Perouli, D., & Kais, S. (2016) · Scientific Reports · doi:10.1038/srep33957 · Cited by 27
“The bold triangle exemplifies the H∨ constraints in (6) that are used to enforce the logical relationship between the tij k ( ) variables and the auxiliary variables as shown in (7).”
BackgroundMethodInfluentialQuantum Science and Quantum Technology
Wang, Y., & Song, X. (2020) · Statistical Science · doi:10.1214/19-sts745 · Cited by 27
Inertial Theorem: Overcoming the quantum adiabatic limit
Dann, R., & Kosloff, R. (2021) · Physical Review Research · doi:10.1103/physrevresearch.3.013064 · Cited by 27
Matsuzaki, Y., Hakoshima, H., Sugisaki, K., Seki, Y., & Kawabata, S. (2021) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/abdf20 · Cited by 28
Single-Qubit Fidelity Assessment of Quantum Annealing Hardware
Nelson, J., Vuffray, M., Lokhov, A. Y., & Coffrin, C. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3092710 · Cited by 27
Computational overhead of locality reduction in binary optimization problems
Valiante, E., Hernandez, M., Barzegar, A., & Katzgraber, H. G. (2021) · Computer Physics Communications · doi:10.1016/j.cpc.2021.108102 · Cited by 38
Solving traveling salesman problems via a parallel fully connected ising machine
Tao, Q., & Han, J. (2022) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1145/3489517.3530595 · Cited by 26
“Various annealing-based Ising machines have been studied, including the quantum Ising machine [5] and the coherent Ising machine [6] based on quantum mechanics and optical parametric oscillators, respectively.”
MethodA Cost and Power Feasibility Analysis of Quantum Annealing for NextG Cellular Wireless Networks
Kasi, S., Warburton, P., Kaewell, J., & Jamieson, K. (2023) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2023.3326469 · Cited by 20
“Biases and coupling strengths are specified to qubits and couplers, respectively, using a programmable on-chip control circuitry [47], [48].”
MethodBenchmarking quantum annealing dynamics: The spin-vector Langevin model
Subires, D., Gómez-Ruiz, F. J., Ruiz, A., Alonso, D., & del Campo, A. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023104 · Cited by 22
A Symbolic Approach to Discrete Structural Optimization Using Quantum Annealing
Wils, K., & Chen, B. (2023) · Mathematics · doi:10.3390/math11163451 · Cited by 23
Magnetic Flux Sensor Based on Spiking Neurons with Josephson Junctions
Искандарович, К. Т., Ostrovskii, V. Y., Rybin, V. G., Druzhina, O. S., Kolev, G. Y., & Бутусов, Д. (2024) · Sensors · doi:10.3390/s24072367 · Cited by 20
“Classic SQUID types include radio frequency (RF) and direct current (DC) SQUIDs; on their basis, hybrids can be made, e.g., D-SQUID [10,11].”
BackgroundA QUBO Formulation of the k-Medoids Problem.
Bauckhage, C., Piatkowski, N., Sifa, R., Hecker, D., & Wrobel, S. (2019) · Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) · Cited by 64
Trotterized adiabatic quantum simulation and its application to a simple all-optical system
Sun, Y., Zhang, J.-Y., Byrd, M., & Wu, L.-A. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab7a31 · Cited by 32
Toward Arbitrary Control of Lattice Interactions in Nonequilibrium Condensates
Kalinin, K. P., & Berloff, N. G. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900065 · Cited by 21
Transfer learning of optimal QAOA parameters in combinatorial optimization
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04743-4 · Cited by 19
“The source code for the results shown here can be found at https://jugit.fz-juelich.de/qip/ transfer-learning-QAOA .”
A review on machine learning-guided design of energy materials
Kim, S., Xu, J., Shang, W., Xu, Z., Lee, E., & Luo, T. (2024) · Progress in Energy · doi:10.1088/2516-1083/ad7220 · Cited by 19
“Then, the quantum annealer can find the ground state and the corresponding binary state of the given QUBO within a fraction of a second, even if the problem size is large [137].”
Quantum annealing for jet clustering with thrust
Delgado, A., & Thaler, J. (2022) · Physical Review D · doi:10.1103/physrevd.106.094016 · Cited by 19
Recent Developments in Quantum‐Circuit Refrigeration
Mörstedt, T., Viitanen, A. J., Vadimov, V., Sevriuk, V., Partanen, M., Hyyppä, E., Catelani, G., Silveri, M., Tan, K. Y., & Möttönen, M. (2022) · Annalen der Physik · doi:10.1002/andp.202100543 · Cited by 19
A superconducting adiabatic neuron in a quantum regime
Bastrakova, M. V., Pashin, D. S., Rybin, D. A., Schegolev, A. E., Klenov, N. V., Soloviev, I. I., Gorchavkina, A. A., & Михайлович, С. А. (2022) · Beilstein Journal of Nanotechnology · doi:10.3762/bjnano.13.57 · Cited by 19
Programming physical quantum systems with pulse-level control
Smith, K. N., Ravi, G. S., Alexander, T., Bronn, N. T., Carvalho, A. R. R., Cervera-Lierta, A., Chong, F. T., Chow, J. M., Cubeddu, M., Hashim, A., et al. (2022) · Frontiers in Physics · doi:10.3389/fphy.2022.900099 · Cited by 32
“The D-Wave quantum annealing systems based on programmable, spin-spin couplings between superconducting quantum circuits are example implementations of analog QCs [86, 87].”
MethodCommunity detection in brain connectomes with hybrid quantum computing
Wierzbiński, M., Falcó-Roget, J., & Crimi, A. (2023) · Scientific Reports · doi:10.1038/s41598-023-30579-y · Cited by 23
Dynamic adaptive quantum approximate optimization algorithm for shallow, noise-resilient circuits
Yanakiev, N., Mertig, N., Long, C. K., & Arvidsson-Shukur, D. R. M. (2024) · Physical Review A · doi:10.1103/physreva.109.032420 · Cited by 34
Adiabatic quantum optimization for associative memory recall
Seddiqi, H., & Humble, T. S. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00079 · Cited by 23
“By comparison, Hopfield networks offer a direct application of AQO when the latter is implemented using an Ising model in a transverse field [19].”
MethodOpen Access Integrated Therapeutic and Diagnostic Platforms for Personalized Cardiovascular Medicine
Gladding, P. A., Cave, A., Zareian, M., Smith, K. K., Hussan, J. R., Hunter, P. J., Erogbogbo, F., Aguilar, Z. P., Martin, D. O., Chan, E., et al. (2013) · Journal of Personalized Medicine · doi:10.3390/jpm3030203 · Cited by 20
“Quantum computers, such as D-Wave systems [48], are ideally suited for the exponential computations required for optimization algorithms and are anticipated to be revolutionary for medical diagnostics and imaging [49].”
BackgroundSimulated quantum annealing of double-well and multiwell potentials
Inack, E. M., & Pilati, S. (2015) · Physical Review E · doi:10.1103/physreve.92.053304 · Cited by 27
Takata, K., & Yamamoto, Y. (2014) · Physical Review A · doi:10.1103/physreva.89.032319 · Cited by 21
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Hamilton, K. E., & Humble, T. S. (2017) · Quantum Information Processing · doi:10.1007/s11128-016-1513-7 · Cited by 24
“[3], which uses a well-defined hardware connectivity graph called the Chimera lattice and implements problems”
BackgroundA Classical-Quantum Hybrid Approach for Unsupervised Probabilistic Machine Learning
Date, P., Schuman, C. D., Patton, R. M., & Potok, T. E. (2019) · Lecture notes in networks and systems · doi:10.1007/978-3-030-12385-7_9 · Cited by 27
Improving performance of logical qubits by parameter tuning and topology compensation
Raymond, J., Ndiaye, N., Rayaprolu, G., & King, A. D. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00044 · Cited by 30
“Quantum processing units (QPUs) executing this algo-rithm have recently been realized at scale in specialized hardware [3].”
BackgroundAdvanced anneal paths for improved quantum annealing
Pelofske, E., Hahn, G., & Djidjev, H. N. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00040 · Cited by 25
“The HG feature was originally designed to study freeze-out points [6] and phase transitions in spin glasses [7], and allows one to weigh the linear term in eq.”
BackgroundL0 regularization-based compressed sensing with quantum–classical hybrid approach
Aonishi, T., Mimura, K., Okada, M., & Yamamoto, Y. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6f19 · Cited by 21
Yasudo, R., Nakano, K., Ito, Y., Katsuki, R., Tabata, Y., Yazane, T., & Hamano, K. (2022) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2022.04.016 · Cited by 22
Hybrid actor-critic algorithm for quantum reinforcement learning at CERN beam lines
Schenk, M., Combarro, E. F., Grossi, M., Kain, V., Li, K. S. B., Popa, M.-M., & Vallecorsa, S. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ad261b · Cited by 37
“The transverse field introduces quantum fluctuations which enable, among others, quantum tunnelling [14].”
BackgroundClassical emulation of a quantum computer
Cour, B. R. L., Ostrove, C. I., Ott, G. E., Starkey, M. J., & Wilson, G. R. (2016) · International Journal of Quantum Information · doi:10.1142/s0219749916400049 · Cited by 19
Computing: The quantum company
Jones, N. (2013) · Nature · doi:10.1038/498286a · Cited by 24
Coherence in the Ferroelectric A3ClO (A = Li, Na) Family of Electrolytes
Braga, M. H. (2021) · Materials · doi:10.3390/ma14092398 · Cited by 18
“These excitations are exceedingly improbable at the time the state is measured [10].”
BackgroundParity Quantum Optimization: Encoding Constraints
Drieb-Schön, M., Ender, K., Javanmard, Y., & Lechner, W. (2023) · Quantum · doi:10.22331/q-2023-03-17-951 · Cited by 29
Mallick, A., Bashar, M. K., Lin, Z., & Shukla, N. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.17.064064 · Cited by 27
Hidaka, R., Hamakawa, Y., Nakayama, J., & Tatsumura, K. (2023) · IEEE Access · doi:10.1109/access.2023.3341422 · Cited by 28
“[35] solved a random MIS problem with D-Wave’s quantum annealing (QA) processor [20, 21], an Ising machine based on quantum principles, and reported speed and solution-accuracy advantages over conventional MIS solvers at graph sizes of up to 40 nodes.”
MethodControlling NMR spin systems for quantum computation
Jones, J. A. (2024) · Progress in Nuclear Magnetic Resonance Spectroscopy · doi:10.1016/j.pnmrs.2024.02.002 · Cited by 37
Kashimata, T., Yamasaki, M., Hidaka, R., & Tatsumura, K. (2024) · IEEE Access · doi:10.1109/access.2024.3374089 · Cited by 29
“Many Ising machines, which are special-purpose computers for Ising problems, have been proposed and demonstrated [9, 10, 11, 12, 13, 14, 15, 16, 17].”
BackgroundModeling routing problems in QUBO with application to ride-hailing
Cattelan, M., & Yarkoni, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-70649-3 · Cited by 40
“In our work, we investigate one such real-world routing problem, namely the Ride Pooling Problem (RPP), which is formally described as follows: given a fleet of vehicles A and a set of requests ( s , f ) with pickup points s and drop-off points f for n customers, assign routes to vehicles in A to…”
BackgroundUnderstanding quantum tunneling using diffusion Monte Carlo simulations
Inack, E. M., Giudici, G., Parolini, T., Santoro, G. E., & Pilati, S. (2018) · Physical Review A · doi:10.1103/physreva.97.032307 · Cited by 19
Quench dynamics of quantum spin models with flat bands of excitations
Menu, R., & Roscilde, T. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.205145 · Cited by 25
Superconducting Digital Electronics for Controlling Quantum Computing Systems
Yoshikawa, N. (2019) · IEICE Transactions on Electronics · doi:10.1587/transele.2018sdi0003 · Cited by 18
Optimal working point in digitized quantum annealing
Mbeng, G. B., Arceci, L., & Santoro, G. E. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.224201 · Cited by 28
Error suppression in adiabatic quantum computing with qubit ensembles
Mohseni, N., Narożniak, M., Pyrkov, A. N., Ivannikov, V., Dowling, J. P., & Byrnes, T. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00405-2 · Cited by 20
Perils of embedding for sampling problems
Marshall, J., Gioacchino, A. D., & Rieffel, E. G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023020 · Cited by 25
Classical Spin Chains Mimicked by Room-Temperature Polariton Condensates
Luo, S., Liao, L., Zhang, Z., Wang, J., Shen, X., & Chen, Z. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.13.044052 · Cited by 19
Self-citationMultimodal Container Planning: A QUBO Formulation and Implementation on a Quantum Annealer
Phillipson, F., & Chiscop, I. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-77980-1_3 · Cited by 23
Problem Solving with Hopfield Networks and Adiabatic Quantum Computing
Bauckhage, C., Sánchez, R. J., & Sifa, R. (2020) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn48605.2020.9206916 · Cited by 20
“One can, for instance, realize superconducting circuits in which electrical currents flow in two directions simultaneously [13], [14].”
BackgroundMethodThe potential of quantum annealing for rapid solution structure identification
Pang, Y., Coffrin, C., Lokhov, A. Y., & Vuffray, M. (2020) · Constraints · doi:10.1007/s10601-020-09315-0 · Cited by 27
Tunable spin-glass optical simulator based on multiple light scattering
Jacucci, G., Delloye, L., Pierangeli, D., Rafayelyan, M. S., Conti, C., & Gigan, S. (2022) · Physical Review A · doi:10.1103/physreva.105.033502 · Cited by 22
Decoherence induced deformation of the ground state in adiabatic quantum computation
Deng, Q., Averin, D. V., Amin, M. H., & Smith, P. (2013) · Scientific Reports · doi:10.1038/srep01479 · Cited by 22
“Adiabatic quantum computation (AQC) [1, 2], either in its universal form [3, 4], or in the form of adiabatic quantum optimization [5, 6], or quantum simulations [7], presents a viable alternative to gate-model quantum computation (GMQC).”
BackgroundSelf-citationQuantum annealing – foundations and frontiers
Cohen, E., & Tamir, B. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02345-1 · Cited by 20
Quantum gates by inverse engineering of a Hamiltonian
Santos, A. C. (2017) · Journal of Physics B Atomic Molecular and Optical Physics · doi:10.1088/1361-6455/aa987c · Cited by 22
Using thermal boundary conditions to engineer the quantum state of a bulk magnet
Schmidt, M. A., Silevitch, D. M., Aeppli, G., & Rosenbaum, T. F. (2014) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1316070111 · Cited by 24
“The practical implication is that the performance of quantum annealing machines (10), of which our apparatus is one example (used here to solve the specific problem of finding the most probable spin states for a crystal of LiHo0.”
Quantum Optimization Algorithms in Operations Research: Methods, Applications, and ImplicationsPreprint
Klug, F. (2024) · SSRN Electronic Journal · doi:10.2139/ssrn.4854668 · Cited by 25
Coherent SAT solvers: a tutorial
Reifenstein, S., Leleu, T. G., McKenna, T. P., Jankowski, M., Suh, M., Ng, E., Khoyratee, F., Toroczkai, Z., & Yamamoto, Y. (2023) · Advances in Optics and Photonics · doi:10.1364/aop.475823 · Cited by 23
Efficient low temperature Monte Carlo sampling using quantum annealing
Sandt, R., & Spatschek, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-33828-2 · Cited by 21
“Like general purpose quantum computers, quantum annealers use qubits to process and store information, physically realized via superconducting loops, which represents different spin states via clockwise or anticlockwise circulating currents 45 .”
BackgroundQuantum-inspired encoding enhances stochastic sampling of soft matter systems
Slongo, F., Hauke, P., Faccioli, P., & Micheletti, C. (2023) · Science Advances · doi:10.1126/sciadv.adi0204 · Cited by 22
Sakabe, T., Shimomura, S., Ogura, Y., Okubo, K.-I., Yamashita, H., Suzuki, H., & Tanida, J. (2023) · Optics Express · doi:10.1364/oe.508069 · Cited by 25
“An example of a phenomenon used in such systems is the quantum mechanical effect, associated with superconducting circuits [5] and trapped ions [6].”
BackgroundNew advances for quantum‐inspired optimization
Du, Y., Wang, H., Hennig, R., Hulandageri, A., Kochenberger, G. A., & Glover, F. (2023) · International Transactions in Operational Research · doi:10.1111/itor.13420 · Cited by 19
Algebraic and group structure for bipartite anisotropic Ising model on a non-local basis
Delgado, F. (2015) · International Journal of Quantum Information · doi:10.1142/s0219749915500550 · Cited by 18
Nishimura, K., Nishimori, H., Ochoa, A. J., & Katzgraber, H. G. (2016) · Physical review. E · doi:10.1103/physreve.94.032105 · Cited by 24
Theory of Ising Machines and a Common Software Platform for Ising Machines
Tanaka, S., Matsuda, Y., & Togawa, N. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045126 · Cited by 23
“In 2011, the first commercial quantum annealing machine, D-Wave, came out [1], which triggered the attention of Ising machines.”
BackgroundAn Ising Framework for Constrained Clustering on Special Purpose Hardware
Cohen, E., Senderovich, A., & Beck, J. C. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58942-4_9 · Cited by 23
“Several new hardware platforms have adopted Ising models [19] as their mathematical formulation and, consequently, a number of existing problems have been formulated as Ising models, including clustering [22], community detection [34], and partitioning, covering, and satisfiability [26].”
MethodGuiding Principle for Minor-Embedding in Simulated-Annealing-Based Ising Machines
Shirai, T., Tanaka, S., & Togawa, N. (2020) · IEEE Access · doi:10.1109/access.2020.3040017 · Cited by 20
“For Ising machines with restricted connectivity such as D-Wave [1], [2] and CMOS annealing machines [3], [8], the mapping called minor-embedding (ME) [24] is necessary.”
BackgroundInfluentialDutta, S., Khanna, A., & Datta, S. (2020) · IEEE Journal on Exploratory Solid-State Computational Devices and Circuits · doi:10.1109/jxcdc.2020.3045074 · Cited by 22
“These include superconducting qubits and trapped ion-based quantum computing and quantum annealing [11]–[13], digital and mixed-signal complementary metal–oxide–semiconductor (CMOS) annealers”
BackgroundImanaka, Y., Anazawa, T., Kumasaka, F., & Jippo, H. (2021) · Scientific Reports · doi:10.1038/s41598-021-81243-2 · Cited by 19
Speziali, S., Bianchi, F., Marini, A., Menculini, L., Proietti, M., Termite, L. F., Garinei, A., Marconi, M., & Delogu, A. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00079 · Cited by 28
Deep Space Network Scheduling Using Quantum Annealing
Guillaume, A., Goh, E. Y., Johnston, M. D., Wilson, B. D., Ramanan, A., Tibble, F., & Lackey, B. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3199267 · Cited by 24
“For the past few years, the company D-Wave Inc. has manufactured quantum annealers that are commercially available and can be programmed by setting the linear and quadratic coefficients, Q i , i and Q i , j , to study a particular problem Hamiltonian H P [12].”
BackgroundSelf-citationA Review of Simulation Algorithms of Classical Ising Machines for Combinatorial optimization
Zhang, T., Tao, Q., Liu, B., & Han, J. (2022) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas48785.2022.9937767 · Cited by 25
Combinatorial Clustering Based on an Externally-Defined One-Hot Constraint
Kumagai, M., Komatsu, K., Takano, F., Araki, T., Sato, M., & Kobayashi, H. (2020) · International Symposium on Computing and Networking · doi:10.1109/candar51075.2020.00015 · Cited by 18
“D-Wave Systems Inc. has developed D-Wave 2000Q as a dedicated quantum annealer for QA [14].”
BackgroundAdiabatic quantum optimization with qudits
Amin, M. H. S., Dickson, N. G., & Smith, P. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0480-x · Cited by 23
“AQO is also commonly referred to as quantum annealing [10,13,17,18], as it uses quantum fluctuations for annealing in a similar way as thermal fluctuations are”
BackgroundResultSelf-citationBasis for a neuronal version of Grover's quantum algorithm
Clark, K. B. (2014) · Frontiers in Molecular Neuroscience · doi:10.3389/fnmol.2014.00029 · Cited by 16
“…ones. due to gradual progress in innovating suitable, if not optimal, device architectures, such as optical lattices, ion traps, nuclear magnetic resonators, quantum dots, and other technologies (e.g., Vandersypen et al., 2001; DiCarlo et al., 2009; Politi et al., 2009; Johnson et al., 2011).”
BackgroundLami, G., Torta, P., Santoro, G. E., & Collura, M. (2023) · SciPost Physics · doi:10.21468/scipostphys.14.5.117 · Cited by 29
“Secondly, the actual implementation of QA [9] on analogue devices, as well as that of digitized Quantum Annealing (dQA) [12] or VQAs [10] on a digital circuit-based quantum computer, usually requires an actual implementation of the unitary time evolution generated by the quantum Hamiltonian in Eq.”
MethodEEG-Based Emotion Recognition Using Quantum Machine Learning
Garg, D., Verma, G. K., & Singh, A. K. (2023) · SN Computer Science · doi:10.1007/s42979-023-01943-6 · Cited by 19
Recommending Solution Paths for Solving Optimization Problems with Quantum Computing
Poggel, B., Quetschlich, N., Burgholzer, L., Wille, R., & Lorenz, J. M. (2023) · IEEE International Conference on Quantum Software (QSW) · doi:10.1109/qsw59989.2023.00017 · Cited by 22
“Beyond gate quantum computing, quantum annealing is a quantum-inspired protocol specifically tailored to optimization problems [8], [9].”
BackgroundHybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs
Angone, A., Liu, X., Shaydulin, R., & Safro, I. (2023) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec58863.2023.10363584 · Cited by 26
“These include quantum annealers [17], gate-based quantum devices which operate using fundamental quantum gates and circuits, digital and analog annealers [1], often considered as intermediate architectures between classical and quantum computers, and Coherent Ising Machines [16].”
BackgroundZhou, Y., Su, G., Zhou, J., Liao, L., & Chen, Z. (2024) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2024.3376410 · Cited by 18
“D-wave based on quantum technology has been proven to solve COPs [7], and however, the cryogenic operating temperature and immature quantum computing technology severely limit its application.”
BackgroundQuantum error mitigation in quantum annealing
Raymond, J., Amin, M. H. S., King, A. D., Harris, R., Bernoudy, W., Berkley, A. J., Boothby, K., Smirnov, A. Y., Altomare, F., Babcock, M. C., et al. (2025) · npj Quantum Information · doi:10.1038/s41534-025-00977-3 · Cited by 36
“While QEM was initially developed and tested for circuit model quantum computing [8–12], the same principles can be applied to other quantum computing protocols, including quantum annealing (QA) [13].”
Self-citationDecentralized Global Optimization Based on a Growth Transform Dynamical System Model
Chatterjee, O., & Chakrabartty, S. (2018) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2018.2817367 · Cited by 16
“On the other hand, the quantum annealing approach [18], [19], as shown in Fig.”
MethodQuantum speedup at zero temperature via coherent catalysis
Durkin, G. A. (2019) · Physical Review A · doi:10.1103/physreva.99.032315 · Cited by 21
Piezo-driven sample rotation system with ultra-low electron temperature
Wang, P., Huang, K., Sun, J., Hu, J., Fu, H., & Lin, X. (2019) · Review of Scientific Instruments · doi:10.1063/1.5083994 · Cited by 17
A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer
Marchand, D. J. J., Noori, M., Roberts, A., Rosenberg, G., Woods, B., Yildiz, U., Coons, M., Devore, D., & Margl, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-47298-y · Cited by 15
“We evaluate the performance of our proposed algorithm over three families of molecules relevant to industry, using an algorithm that returns an exact optimal solution and the D-Wave 2000Q quantum annealer [32–34].”
MethodAnalysis and Acceleration of the Quadratic Knapsack Problem on an Ising Machine
Parizy, M., & Togawa, N. (2021) · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · doi:10.1587/transfun.2020kep0007 · Cited by 16
“Isingmachines have been gainingmomentumover the course of the last 10 years with the advent of commercialization of quantum annealers [10] and other specialized architectures targeting the same problem.”
BackgroundMethodExperimental Investigation of the Dynamics of Coupled Oscillators as Ising Machines
Bashar, M. K., Mallick, A., & Shukla, N. (2021) · IEEE Access · doi:10.1109/access.2021.3124808 · Cited by 22
Effective electromagnetic actions for Lorentz violating theories exhibiting the axial anomaly
Gómez, A., Martín-Ruiz, A., & Urrutia, L. F. (2022) · Physics Letters B · doi:10.1016/j.physletb.2022.137043 · Cited by 24
“Examples of such hardware include adiabatic quantum computers [19], complementary metal-oxide-semiconductor (CMOS) annealers [1] and coherent Ising machines [17].”
BackgroundAutomated Design of Li + ‐Conducting Polymer by Quantum‐Inspired Annealing
Hatakeyama‐Sato, K., Adachi, H., Umeki, M., Kashikawa, T., Kimura, K., & Oyaizu, K. (2022) · Macromolecular Rapid Communications · doi:10.1002/marc.202200385 · Cited by 17
Sawaya, N. P. D., Schmitz, A. T., & Hadfield, S. (2023) · Quantum · doi:10.22331/q-2023-09-14-1111 · Cited by 35
Detection and diagnosis of faulty quantum circuits
Paler, A., Polian, I., & Hayes, J. P. (2012) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/aspdac.2012.6164942 · Cited by 19
Dynamics of the quantum search and quench-induced first-order phase transitions
Coulamy, I., Saguia, A., & Sarandy, M. S. (2017) · Physical review. E · doi:10.1103/physreve.95.022127 · Cited by 22
Estimating the density of states of frustrated spin systems
Barash, L., Marshall, J., Weigel, M., & Hen, I. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab2e39 · Cited by 23
Image classification with quantum pre-training and auto-encoders
Piat, S., Usher, N., Simone Severini, B., Herbster, M., Mansi, T., & Mountney, P. (2018) · International Journal of Quantum Information · doi:10.1142/s0219749918400099 · Cited by 17
Experimental and Theoretical Study of Thermodynamic Effects in a Quantum Annealer
Kadowaki, T., & Ohzeki, M. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061008 · Cited by 17
“, in which the spin-1/2 variables are superconducting flux qubits, we can evaluate algorithms for QUBO problems in real-world settings[13].”
MethodA double-slit proposal for quantum annealing
Munoz-Bauza, H., Chen, H., & Lidar, D. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0160-0 · Cited by 18
Superconductor Amoeba-Inspired Problem Solvers for Combinatorial Optimization
Takeuchi, N., Aono, M., & Yoshikawa, N. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.044069 · Cited by 16
“Simulated (or quantum) annealing [23,24] is one of the most well-known local search algorithms; several types of hardware that implement simulated or quantum annealing have recently been proposed and are attracting much attention [25,26].”
BackgroundQuantum phase transition with inhomogeneous driving in the Lechner-Hauke-Zoller model
Hartmann, A., & Lechner, W. (2019) · Physical Review A · doi:10.1103/physreva.100.032110 · Cited by 19
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.