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 501–600 of 1,008
Reconfigurable controlled two-qubit operation on a quantum photonic chip
Li, H. W., Przeslak, S., Niskanen, A. O., Matthews, J. C. F., Politi, A., Shadbolt, P., Laing, A., Lobino, M., Thompson, M. G., & O’Brien, J. L. (2011) · New Journal of Physics · doi:10.1088/1367-2630/13/11/115009 · Cited by 33
Degeneracy, degree, and heavy tails in quantum annealing
King, A. D., Hoskinson, E., Lanting, T., Andriyash, E., & Amin, M. H. (2016) · Physical Review A · doi:10.1103/physreva.93.052320 · Cited by 28
Self-citationOptimally Stopped Optimization
Vinci, W., & Lidar, D. A. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054016 · Cited by 27
Novel Ising model using dimension-control for high-speed solver for Ising machines
Someya, K., Ono, R., & Kawahara, T. (2016) · IEEE International New Circuits and Systems Conference (NEWCAS) · doi:10.1109/newcas.2016.7604797 · Cited by 27
“Recently, studies on hardware implementation of the Ising model, the Ising machine, have been carried out to determine its efficiency [3][4][5].”
BackgroundQuantum Enhanced Inference in Markov Logic Networks
Wittek, P., & Gogolin, C. (2017) · Scientific Reports · doi:10.1038/srep45672 · Cited by 28
“We can, however, turn to methods that use current or near future quantum annealing devices, for instance, technology using quantum annealing with manufactured spins 59,60 .”
MethodVinci, W., & Lidar, D. A. (2018) · Physical Review A · doi:10.1103/physreva.97.022308 · Cited by 30
Optimal working point in dissipative quantum annealing
Arceci, L., Barbarino, S., Rossini, D., & Santoro, G. E. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.98.064307 · Cited by 29
Awano, H., & Sato, T. G. (2018) · Design, Automation, and Test in Europe · doi:10.23919/date.2018.8342239 · Cited by 27
“D-wave [13] or CMOS Ising machine [14], [15] exploit this intrinsic convergence property of Ising model for solving combinatorial optimization problems, i.”
BackgroundEvaluating Ising Processing Units with Integer Programming
Coffrin, C., Nagarajan, H., & Bent, R. W. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-19212-9_11 · Cited by 36
“As the challenge of scaling traditional transistor-based Central Processing Unit (CPU) technology continues to increase, experimental physicists and high-tech companies have begun to explore radically different computational technologies, such as adiabatic quantum computers (AQCs) [1], gate-based quantum computers [2,…”
BackgroundOn-chip photonic decision maker using spontaneous mode switching in a ring laser
Homma, R., Kochi, S., Niiyama, T., Mihana, T., Mitsui, Y., Kanno, K., Uchida, A., Naruse, M., & Sunada, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-45754-3 · Cited by 29
Optimal large-scale quantum state tomography with Pauli measurements
Cai, T., Kim, D., Wang, Y., Yuan, M., & Zhou, H. H. (2016) · The Annals of Statistics · doi:10.1214/15-aos1382 · Cited by 49
Su, Y., Kim, T. T.-H., & Kim, B. (2024) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2024.3352907 · Cited by 32
“Recently, Ising machines have been demonstrated in various technologies, including quantum computing [26], [27], [28], [29], coherent optics [30], [31], [32], and CMOS technologies [6], [7], [8], [9], [10], [11], [12], [13], [14], [15], [16], [17].”
BackgroundDevelopment of optimization method for truss structure by quantum annealing
Honda, R., Endo, K., Kaji, T., Suzuki, Y., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2024) · Scientific Reports · doi:10.1038/s41598-024-64588-2 · Cited by 27
Integer Programming Techniques for Minor-Embedding in Quantum Annealers
Bernal, D. E., Booth, K. E. C., Dridi, R., Alghassi, H., Tayur, S. R., & Venturelli, D. (2020) · Lecture notes in computer science · doi:10.1007/978-3-030-58942-4_8 · Cited by 26
CMOS Annealing Machine: A Domain-Specific Architecture for Combinatorial Optimization Problem
Yoshimura, C., Hayashi, M., Takemoto, T., & Yamaoka, M. (2020) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1109/asp-dac47756.2020.9045326 · Cited by 32
Exact representations of many-body interactions with restricted-Boltzmann-machine neural networks
Rrapaj, E., & Roggero, A. (2021) · Physical review. E · doi:10.1103/physreve.103.013302 · Cited by 30
Sugie, Y., Yoshida, Y., Mertig, N., Takemoto, T., Teramoto, H., Nakamura, A., Takigawa, I., Minato, S.-I., Yamaoka, M., & Komatsuzaki, T. (2021) · Soft Computing · doi:10.1007/s00500-020-05502-6 · Cited by 39
Distance-based clustering using QUBO formulations
Matsumoto, N., Hamakawa, Y., Tatsumura, K., & Kudo, K. (2022) · Scientific Reports · doi:10.1038/s41598-022-06559-z · Cited by 38
“(2) expresses the sum of the average distances between the point pairs in each group.”
BackgroundControl of amplitude homogeneity in coherent Ising machines with artificial Zeeman terms
Inui, Y., Gunathilaka, M. D. S. H., Kako, S., Aonishi, T., & Yamamoto, Y. (2022) · Communications Physics · doi:10.1038/s42005-022-00927-x · Cited by 26
Oscillator-Network-Based Ising Machine
Zhang, Y., Deng, Y., Lin, Y., Jiang, Y., Dong, Y., Chen, X., Wang, G., Shang, D., Wang, Q., Yu, H. Y., et al. (2022) · Micromachines · doi:10.3390/mi13071016 · Cited by 31
“Schematic diagram of four different types of Ising machines: (a) quantum annealing Ising machine [5]; (b) optical coherent Ising machine [9]; (c) CMOS digital Ising machine [15]; (d) oscillator network Ising machine [18].”
MethodQuantum annealing and computation: challenges and perspectives
Chakrabarti, B. K., Leschke, H., Ray, P., Shirai, T., & Tanaka, S. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0419 · Cited by 42
Nawa, K., Suzuki, T., Masuda, K., Tanaka, S., & Miura, Y. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.024044 · Cited by 37
Period finding with adiabatic quantum computation
Hen, I. (2014) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/105/50005 · Cited by 33
Quantum annealing speedup over simulated annealing on random Ising chains
Zanca, T., & Santoro, G. E. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.224431 · Cited by 40
Off-diagonal expansion quantum Monte Carlo
Albash, T., Wagenbreth, G., & Hen, I. (2017) · Physical review. E · doi:10.1103/physreve.96.063309 · Cited by 35
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
Potok, T. E., Schuman, C. D., Young, S. R., Patton, R. M., Spedalieri, F. M., Liu, J., Yao, K.-T., Rose, G. S., & Chakma, G. (2016) · doi:10.1109/mlhpc.2016.009 · Cited by 26
Self-citationIsing Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann MachinePreprint
Patel, S., Chen, L., Canoza, P., & Salahuddin, S. (2020) · Research Square · doi:10.21203/rs.3.rs-122016/v1 · Cited by 44
Scalable On-Chip Optoelectronic Ising Machine Utilizing Thin-Film Lithium Niobate Photonics
Li, Z., Gan, R., Chen, Z., Deng, Z., Gao, R., Chen, K., Guo, C., Zhang, Y., Liu, L., Yu, S., et al. (2024) · ACS Photonics · doi:10.1021/acsphotonics.4c00003 · Cited by 32
Wang, L., Tao, W. J., Li, N., Chi, S., Jiang, C., & Fang, S.-Y. (2018) · Environmental Earth Sciences · doi:10.1007/s12665-018-7927-z · Cited by 25
Stochasticity of the magnon parametron
Elyasi, M., Saitoh, E., & Bauer, G. E. W. (2022) · Physical review. B./Physical review. B · doi:10.1103/physrevb.105.054403 · Cited by 27
An integrated coupled oscillator network to solve optimization problems
Graber, M., & Hofmann, K. (2024) · Communications Engineering · doi:10.1038/s44172-024-00261-w · Cited by 44
“Researchers are exploring different physical implementations such as quantum computing 4 , optics 5,6 , memristors 7 , and spintronics 8 – 10 to directly employ them for computation in the form of a highly ef fi cient Ising machine.”
MethodA 50-spin surface acoustic wave Ising machine
Litvinenko, A. N., Khymyn, R., Ovcharov, R. V., & Åkerman, J. J. (2025) · Communications Physics · doi:10.1038/s42005-025-01969-7 · Cited by 36
“While IMs based on the physical array architecture provide the fastest time-to-solution parameter in simulations [9, 10, 13], their computational capacity is strongly hampered by their limited connectivity due to interconnection problems.”
Parameter setting for quantum annealers
Pudenz, K. L. (2016) · 2016 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2016.7761619 · Cited by 24
“This class of quantum annealing processor uses superconducting quantum interference devices to create a quantum environment for solving Ising spin glass problems of the form described in Equation 1 and is extensively described in the literature [20], [21], [22].”
MethodAdvantages of Unfair Quantum Ground-State Sampling
Zhang, B. H., Wagenbreth, G., Martín-Mayor, V., & Hen, I. (2017) · Scientific Reports · doi:10.1038/s41598-017-01096-6 · Cited by 35
“nealing optimizer[6, 7], that quantum annealers not only produce different distributions over the set of groundstates than simulated thermal annealing optimizers, but that they offer an additional dimension of tunability that does not necessarily have a classical counterpart.”
BackgroundMethodSteering random spin systems to speed up the quantum adiabatic algorithm
Özgüler, A. B., Joynt, R., & Vavilov, M. (2018) · Physical Review A · doi:10.1103/physreva.98.062311 · Cited by 29
Towards Real Time Multi-robot Routing using Quantum Computing Technologies
Clark, J., West, T., Zammit, J. P., Guo, X., Mason, L., & Russell, D. (2019) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3293320.3293333 · Cited by 33
“Althoughthe current available quantum annealers have around 2000 qubits, quantum annealers are not universal quantum computers [12].”
BackgroundQuantum Annealing Based Binary Compressive Sensing with Matrix UncertaintyPreprint
Ayanzadeh, R., Mousavi, S., Halem, M., & Finin, T. (2019) · arXiv (Cornell University) · doi:10.13016/m2k6ga-cvu4 · Cited by 30
A coupled-oscillator-based Ising chip for combinatorial optimization
Cılasun, H., Moy, W., Zeng, Z., Islam, T., Lo, H., Vanasse, A., Tan, M., Anees, M., Ramprasath, S., Kumar, A., et al. (2025) · Nature Electronics · doi:10.1038/s41928-025-01393-3 · Cited by 50
“16,17, quantum-inspired electrical coupled-oscillator-based implementations 18–20 and optical Ising machines 21–23 fall into this category.”
Quantum dissipative dynamics of a bistable system in the sub-Ohmic to super-Ohmic regime
Magazzù, L., Carollo, A. C. M., Spagnolo, B., & Valenti, D. (2016) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/2016/05/054016 · Cited by 26
How to Reduce the Bit-Width of an Ising Model by Adding Auxiliary Spins
Oku, D., Tawada, M., Tanaka, S., & Togawa, N. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3045112 · Cited by 32
Quantum computation and simulation with superconducting qubits*
He, K., Geng, X., Huang, R., Liu, J., & Chen, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/ac16cf · Cited by 27
Potts model solver based on hybrid physical and digital architecture
Inaba, K., Inagaki, T., Igarashi, K., Utsunomiya, S., Honjo, T., Ikuta, T., Enbutsu, K., Umeki, T., Kasahara, R., Inoue, K., et al. (2022) · Communications Physics · doi:10.1038/s42005-022-00908-0 · Cited by 26
“3g, an Ising solver sometimes yields a solution consisting of two or more separated magnetic domains (see Supplementary Notes 3, 4, and also ref.”
BackgroundInfluentialTatsumura, K., Hidaka, R., Nakayama, J., Kashimata, T., & Yamasaki, M. (2023) · IEEE Access · doi:10.1109/access.2023.3326816 · Cited by 36
“Recently, special-purpose computers for NP-hard combinatorial (or discrete) optimization, called Ising machines [13], [14], [15], [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27], [28], [29], [30], have attracted intense attention.”
MethodQuantum Annealing with Markov Chain Monte Carlo Simulations and D-Wave Quantum Computers
Wang, Y., Wu, S., & Zou, J. (2016) · Statistical Science · doi:10.1214/16-sts560 · Cited by 29
Interacting lattice systems with quantum dissipation: A quantum Monte Carlo study
Yan, Z., Pollet, L., Lou, J., Wang, X., Chen, Y., & Cai, Z. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.035148 · Cited by 24
Shortcuts to adiabatic classical spin dynamics mimicking quantum annealing
Hatomura, T., & Mori, T. (2018) · Physical review. E · doi:10.1103/physreve.98.032136 · Cited by 28
Garden optimization problems for benchmarking quantum annealers
Calaza, C. D. G., Willsch, D., & Michielsen, K. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03226-6 · Cited by 36
Multi-qubit correction for quantum annealers
Ayanzadeh, R., Dorband, J. E., Halem, M., & Finin, T. (2021) · Scientific Reports · doi:10.1038/s41598-021-95482-w · Cited by 34
Chemical design with GPU-based Ising machines
Mao, Z., Matsuda, Y., Tamura, R., & Tsuda, K. (2023) · Digital Discovery · doi:10.1039/d3dd00047h · Cited by 23
Thermodynamic State Machine Network
Hylton, T. L. (2022) · Entropy · doi:10.3390/e24060744 · Cited by 24
“Examples include Ising machines realized in CMOS annealers [36–38], coupled oscillator networks [39–41], noisy memristor crossbars [42], and quantum annealers [43].”
BackgroundTatsumura, K., Hidaka, R., Yamasaki, M., Sakai, Y., & Goto, H. (2020) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas45731.2020.9181114 · Cited by 29
Analytical solution for nonadiabatic quantum annealing to arbitrary Ising spin Hamiltonian
Yan, B., & Sinitsyn, N. A. (2022) · Nature Communications · doi:10.1038/s41467-022-29887-0 · Cited by 51
“We find for the model (36) that g 1 corresponds to”
BackgroundQuantum Robustness Verification: A Hybrid Quantum-Classical Neural Network Certification Algorithm
Franco, N., Wollschläger, T., Gao, N., Lorenz, J. M., & Günnemann, S. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00033 · Cited by 32
“Quantum Annealing (QA) aims at directly solving such Ising problems on quantum hardware [37] with the only restriction being the connectivity of the qubits on QA.”
Resource Allocation Optimization by Quantum Computing for Shared Use of Standalone IRS
Ohyama, T., Kawamoto, Y., & Kato, N. (2023) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2023.3292355 · Cited by 26
“Recently, quantum annealing (QA) has attracted attention as a method for efficiently solving complex combinatorial optimization problems with the application of quantum mechanics [21] and, for this purpose, the hardware D-Wave is already commercially available [22].”
MethodUpama, P. B., Kolli, A., Kolli, H., Alam, S., Syam, M., Shahriar, H., & Ahamed, S. I. (2023) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac57700.2023.00238 · Cited by 29
Characterization of Loss Mechanisms in a Fluxonium Qubit
Sun, H., Wu, F., Ku, H., Ma, X., Qin, J., Song, Z., Wang, T., Zhang, G., Zhou, J., Shi, Y., et al. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.034016 · Cited by 26
Native Approach to Controlled- Z Gates in Inductively Coupled Fluxonium Qubits
Ma, X., Zhang, G., Wu, F., Bao, F., Chang, X., Chen, J., Deng, H., Gao, R., Gao, X., Hu, L., et al. (2024) · Physical Review Letters · doi:10.1103/physrevlett.132.060602 · Cited by 25
Quantum and classical dynamics in adiabatic computation
Crowley, P. J. D., Đurić, T., Vinci, W., Warburton, P. A., & Green, A. G. (2014) · Physical Review A · doi:10.1103/physreva.90.042317 · Cited by 29
Cascade Electronic Refrigerator Using Superconducting Tunnel Junctions
Nguyen, H. Q., Peltonen, J. T., Meschke, M., & Pekola, J. P. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054011 · Cited by 23
Computing architecture to perform approximated simulated annealing for Ising models
Okuyama, T., Yoshimura, C., Hayashi, M., & Yamaoka, M. (2016) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc.2016.7738673 · Cited by 26
“For the time evolution, natural phenomena have been researched such as quantum superposition [3] or optical parametric oscillation [4].”
BackgroundRelaxation, thermalization, and Markovian dynamics of two spins coupled to a spin bath
Raedt, H. A. D., Jin, F., Katsnelson, M. I., & Michielsen, K. F. L. (2017) · Physical review. E · doi:10.1103/physreve.96.053306 · Cited by 23
“Such system-bath spin models are relevant for the description of relaxation processes in nuclear magnetic and electron spin resonance [1,20–23] and have applications to quantum information processing [24,25].”
BackgroundHard combinatorial problems and minor embeddings on lattice graphs
Lucas, A. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2323-5 · Cited by 26
borealis—A generalized global update algorithm for Boolean optimization problems
Zhu, Z., Fang, C., & Katzgraber, H. G. (2020) · Optimization Letters · doi:10.1007/s11590-020-01570-7 · Cited by 34
Cryogenic Electronics and Quantum Information Processing
Holmes, D. S. (2021) · doi:10.1109/irds54852.2021.00012 · Cited by 31
Introduction to Quantum Information and Computation for Chemistry
Kais, S. (2014) · Advances in chemical physics · doi:10.1002/9781118742631.ch01 · Cited by 40
Schauß, P. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.09014 · Cited by 27
Finding independent sets in large-scale graphs with a coherent Ising machine
Takesue, H., Inaba, K., Honjo, T., Yamada, Y., Ikuta, T., Yonezu, Y., Inagaki, T., Umeki, T., & Kasahara, R. (2025) · Science Advances · doi:10.1126/sciadv.ads7223 · Cited by 37
Computational hardness of spin-glass problems with tile-planted solutions
Perera, D., Hamze, F., Raymond, J., Weigel, M., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.023316 · Cited by 35
Self-citationBenchmarking embedded chain breaking in quantum annealing *
Grant, E., & Humble, T. S. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac26d2 · Cited by 31
“[7] Mark W Johnson, Mohammad HS Amin, Suzanne Gildert, Trevor Lanting, Firas Hamze, Neil Dickson,”
BackgroundMethodOhyama, T., Kawamoto, Y., & Kato, N. (2022) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2022.3161542 · Cited by 25
“In particular, quantum annealing has been attracting considerable attention as an ef fi cient method for solving complex combinatorial optimization problems by applying quantum mechanics [16], and the corresponding D-Wave hardware has already been commercialized [17].”
MethodJiang, D., Wang, X., Huang, Z., Yang, Y., & Yao, E. (2023) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2023.3263923 · Cited by 26
“Recent works present a method to implement quantum annealing processors to solve the COPs using superconducting flux quantum bits exhibiting superior performances of accuracy and speed [8], [9].”
MethodCorrelated Oscillations in Kerr Parametric Oscillators with Tunable Effective Coupling
Yamaji, T., Masuda, S., Yamaguchi, A., Satoh, T., Morioka, A., Igarashi, Y., Shirane, M., & Yamamoto, T. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.014057 · Cited by 31
Namiki, S., Solis-Trapala, K., Tan, H. N., Pelusi, M. D., & Inoue, T. (2016) · Journal of Lightwave Technology · doi:10.1109/jlt.2016.2604386 · Cited by 22
“, replacing more standard DSP by completely new processes directly exploiting physical phenomena, such as quantum annealing [16] and optical Ising machines [17].”
BackgroundRobust quantum control for adiabatic quantum computation
Quiroz, G. (2019) · Physical Review A · doi:10.1103/physreva.99.062306 · Cited by 26
Thermodynamics of a quantum Ising system coupled to a spin bath
McKenzie, R. D., & Stamp, P. C. E. (2018) · Physical review. B./Physical review. B · doi:10.1103/physrevb.97.214430 · Cited by 24
A Time-Division Multiplexing Ising Machine on FPGAs
Yamamoto, K., Huang, W., Takamaeda-Yamazaki, S., Ikebe, M., Asai, T., & Motomura, M. (2017) · International Symposium on Highly Efficient Accelerators and Reconfigurable Technologies (HEART) · doi:10.1145/3120895.3120905 · Cited by 22
Embedding Equality Constraints of Optimization Problems into a Quantum Annealer
Vyskočil, T., & Djidjev, H. N. (2019) · Algorithms · doi:10.3390/a12040077 · Cited by 34
“To minimize Q , QA computers are trying to find a low-energy state of the quantum system whose Hamiltonian corresponds to Q [3,4].”
BackgroundYamaoka, M., Okuyama, T., Hayashi, M., Yoshimura, C., & Takemoto, T. (2019) · Custom Integrated Circuits Conference · doi:10.1109/cicc.2019.8780296 · Cited by 22
“Some implementations of the annealing machine are proposed [1] We have proposed a CMOS implementation of the annealing machine, a CMOS annealing machine [5][6].”
MethodQuantum adiabatic machine learning by zooming into a region of the energy surface
Zlokapa, A., Mott, A., Job, J., Vlimant, J.-R., Lidar, D. A., & Spiropulu, M. (2020) · Physical Review A · doi:10.1103/physreva.102.062405 · Cited by 28
Accelerating Scientific Computing in the Post-Moore’s Era
Hamilton, K. E., Schuman, C. D., Young, S. R., Bennink, R. S., Imam, N., & Humble, T. S. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3380940 · Cited by 27
“…our discussion on the following near-term devices: • TPU : Google’s custom design called a Tensor Processing Unit TM [125] • ABD : Annealer-based devices such as: quantum D-Wave 2X and 2000Q developed by D-Wave [57, 120], optical Ising machines, and the digital annealer developed by Fujitsu [76].”
BackgroundFast, Lifetime-Preserving Readout for High-Coherence Quantum Annealers
Grover, J. A., Basham, J. I., Marakov, A., Disseler, S., Hinkey, R. T., Khalil, M., Stegen, Z. A., Chamberlin, T., DeGottardi, W., Clarke, D. J., et al. (2020) · PRX Quantum · doi:10.1103/prxquantum.01.020314 · Cited by 29
Hayashi, M., Yamaoka, M., Yoshimura, C., Okuyama, T., Aoki, H., & Mizuno, H. (2016) · International Journal of Networking and Computing · doi:10.15803/ijnc.6.2_195 · Cited by 24
Magnetic ordered structure dependence of magnetic refrigeration efficiency
Tamura, R., Tanaka, S., Ohno, T., & Kitazawa, H. (2014) · Journal of Applied Physics · doi:10.1063/1.4891803 · Cited by 22
Using the J 1 – J 2 quantum spin chain as an adiabatic quantum data bus
Chancellor, N., & Haas, S. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/9/095025 · Cited by 24
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 24
How to test the “quantumness” of a quantum computer?
Zagoskin, A. M., Il’ichev, E. V., Grajcar, M., Betouras, J. J., & Nori, F. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00033 · Cited by 22
“Considerable interest was generated by: (1) the demonstration of quantum annealing in an 8-qubit register of the prototype processor [10]; (2) the sale of a 128-qubit quantum annealer “D-Wave One” to Lockheed Martin and its installation at the University of Southern California (2011), and its…”
BackgroundMethodTheory of open quantum dynamics with hybrid noise
Smirnov, A. Y., & Amin, M. H. S. (2018) · New Journal of Physics · doi:10.1088/1367-2630/aae79c · Cited by 27
“We are interested in dissipative evolution of a quantum annealer [6, 26, 27] treated as a system of N qubits coupled to a heat bath.”
Self-citationEndo, K., Matsuda, Y., Tanaka, S., & Muramatsu, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-14735-4 · Cited by 33
Advances in Quantum Computation and Quantum Technologies: A Design Automation Perspective
Micheli, G. D., Jiang, J.-H. R., Rand, R. W., Smith, K. N., & Soeken, M. (2022) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2022.3205174 · Cited by 27
“For quantum hardware, both general-purpose quantum processors, e.g., [8], and special-purpose quantum processors, e.g., [9], are under active development.”
BackgroundAugmenting QAOA Ansatz with Multiparameter Problem-Independent Layer
Chalupnik, M., Melo, H., Alexeev, Y., & Galda, A. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00028 · Cited by 41
“In the field of biochemistry alone, quantum annealers have been used to solve the protein-folding problem [1], [2], and gate-based quantum computers have been used to calculate the ground state energies of molecules [3]–[7].”
MethodScalable flux controllers using adiabatic superconductor logic for quantum processors
Takeuchi, N., Yamae, T., Luo, W., Hirayama, F., Yamamoto, T., & Yoshikawa, N. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013145 · Cited by 21
Dynamic optimization based on quantum computation-A comprehensive review
Kou, H., Zhang, Y., & Lee, H. P. (2023) · Computers & Structures · doi:10.1016/j.compstruc.2023.107255 · Cited by 22
Bae, J., Shim, C., & Kim, B. (2024) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc49657.2024.10454340 · Cited by 21
Computational quantum-classical boundary of noisy commuting quantum circuits
Fujii, K., & Tamate, S. (2016) · Scientific Reports · doi:10.1038/srep25598 · Cited by 37
“= − + − ‖ ‖ N /(1 ) (6/5) 5 2 2 1 (8) N L L N k k k L faulty 1 2 2 1 1/(2 1)”
Nonadiabatic quantum state engineering driven by fast quench dynamics
Herrera, M., Sarandy, M. S., Duzzioni, E. I., & Serra, R. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022323 · Cited by 22
Quantum rotations: a case study in static and dynamic machine-code generation for quantum computers
Kudrow, D., Bier, K., Deng, Z., Franklin, D. M., Tomita, Y., Brown, K. R., & Chong, F. T. (2013) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1145/2485922.2485937 · Cited by 25
“Recent announcements by commercial effort D-Wave of a 128-quantum-bit ( qubit ) adiabatic system [16], although controversial in terms of its quantum properties, illustrate the engineering progress that has been made.”
BackgroundTuning high-Q nonlinear dynamics in a disordered quantum magnet
Silevitch, D. M., Tang, C., Aeppli, G., & Rosenbaum, T. F. (2019) · Nature Communications · doi:10.1038/s41467-019-11985-1 · Cited by 24
Nested quantum annealing correction at finite temperature: p -spin models
Matsuura, S., Nishimori, H., Vinci, W., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.062307 · Cited by 22
Ising Models for Binary Clustering via Adiabatic Quantum Computing
Bauckhage, C., Brito, E., Cvejoski, K., Ojeda, C., Sifa, R., & Wróbel, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-78199-0_1 · Cited by 23
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].”
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.