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 101–200 of 1,009
Grover Adaptive Search for Constrained Polynomial Binary Optimization
Gilliam, A., Woerner, S., & Gonciulea, C. (2021) · Quantum · doi:10.22331/q-2021-04-08-428 · Cited by 153
Origin and Reduction of 1/f Magnetic Flux Noise in Superconducting Devices
Kumar, P., Sendelbach, S., Beck, M. A., Freeland, J. W., Wang, Z., Wang, H., Yu, C. C., Wu, R. Q., Pappas, D. P., & McDermott, R. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.041001 · Cited by 151
“In the context of a quantum annealer [9,10], flux noise degrades performance by limiting the number of qubits that”
BackgroundQuantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149
“In fact, a quantum annealing chipset [14] is already commercially available from D-Wave1 [15], [16].”
MethodKing, A. D., Raymond, J., Lanting, T., Isakov, S. V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A. Y., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-20901-5 · Cited by 141
Self-citationKatzgraber, H. G., Hamze, F., & Andrist, R. S. (2014) · Physical Review X · doi:10.1103/physrevx.4.021008 · Cited by 140
Self-citationHybrid quantum-classical algorithms in the noisy intermediate-scale quantum era and beyond
Callison, A., & Chancellor, N. (2022) · Physical Review A · doi:10.1103/physreva.106.010101 · Cited by 206
Application of Ising Machines and a Software Development for Ising Machines
Tanahashi, K., Takayanagi, S., Motohashi, T., & Tanaka, S. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061010 · Cited by 142
Decoherence in adiabatic quantum computation
Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.062320 · Cited by 151
“We address this by considering a quantum Monte Carlo approach that explicitly accounts for a bosonic bath, and demonstrate its utility in interpolating between the quantum and classical regimes using a quantum annealing problem that has been studied in the context of quantumness tests of the D-Wave device.”
MethodInfluentialNonnegative/Binary matrix factorization with a D-Wave quantum annealer
O’Malley, D., Vesselinov, V. V., Alexandrov, B. S., & Alexandrov, L. B. (2018) · PLOS ONE · doi:10.1371/journal.pone.0206653 · Cited by 140
“This method takes a matrix as input and produces two low-rank matrices as output—one containing latent features in the data and another matrix describing how the features can be combined to approximately reproduce the input matrix.”
MethodApplication of Quantum Annealing to Nurse Scheduling Problem
Ikeda, K., Nakamura, Y., & Humble, T. S. (2019) · Scientific Reports · doi:10.1038/s41598-019-49172-3 · Cited by 139
“g(2, 6) 1 5 and = g(3, 5) 2 in (b) and = g(1, 6) 1, = .”
Prospects for quantum enhancement with diabatic quantum annealing
Crosson, E. J., & Lidar, D. A. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00313-6 · Cited by 134
The challenges of modern computing and new opportunities for optics
Li, C., Zhang, X., Li, J., Fang, T., & Dong, X. (2021) · PhotoniX · doi:10.1186/s43074-021-00042-0 · Cited by 152
“Various schemes of simulating Ising Hamiltonian have been proposed and experimentally demonstrated in different physical systems, such as superconducting circuits [126], trapped ions [127], electromechanical oscillators [128], CMOS devices [129], memristors [130], polaritons [131] and photons [132–152].”
BackgroundAhmed, I. H., Chiu, P.-W., Moy, W., & Kim, C. H. (2021) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2021.3062821 · Cited by 160
Consistency tests of classical and quantum models for a quantum annealer
Albash, T., Vinci, W., Mishra, A., Warburton, P. A., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042314 · Cited by 131
Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
Hegade, N. N., Paul, K., Ding, Y., Sanz, M., Albarrán-Arriagada, F., Solano, E., & Chen, X. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.024038 · Cited by 122
“[24] Mark W Johnson, Mohammad HS Amin, Suzanne Gildert, Trevor Lanting, Firas Hamze, Neil Dickson, Richard Harris, Andrew J Berkley, Jan Johansson, Paul Bunyk, et al.”
BackgroundQuantum Computing and Simulations for Energy Applications: Review and Perspective
Paudel, H. P., Syamlal, M., Crawford, S. E., Lee, Y., Shugayev, R., Lu, P., Ohodnicki, P. R., Mollot, D., & Duan, Y. (2022) · ACS Engineering Au · doi:10.1021/acsengineeringau.1c00033 · Cited by 191
Noisy intermediate-scale quantum computers
Cheng, B., Deng, X., Gu, X. Q., He, Y., Hu, G., Huang, P., Li, J., Lin, B., Lu, D., Lu, Y., et al. (2023) · Frontiers of Physics · doi:10.1007/s11467-022-1249-z · Cited by 182
Tan, K. Y., Partanen, M., Lake, R. E., Govenius, J., Masuda, S., & Möttönen, M. (2017) · Nature Communications · doi:10.1038/ncomms15189 · Cited by 163
Discrete optimization using quantum annealing on sparse Ising models
Bian, Z., Chudak, F., Israel, R., Lackey, B., Macready, W. G., & Roy, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00056 · Cited by 129
“D-Wave Systems manufactures a device [1–4] that uses quantum annealing (QA) to minimize the dimensionless energy of an Ising model”
BackgroundSolid-state qubits integrated with superconducting through-silicon vias
Yost, D. R. W., Schwartz, M. E., Mallek, J., Rosenberg, D., Stull, C., Yoder, J. L., Calusine, G., Cook, M., Das, R., Day, A. L., et al. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00289-8 · Cited by 128
Applications of near-term photonic quantum computers: software and algorithms
Bromley, T. R., Arrazola, J. M., Jahangiri, S., Izaac, J., Quesada, N., Gran, A. D., Schuld, M., Swinarton, J., Zabaneh, Z., & Killoran, N. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8504 · Cited by 128
Superconducting Circuit Companion—an Introduction with Worked Examples
Rasmussen, S. E., Christensen, K. S., Pedersen, S. P., Kristensen, L. B., Bækkegaard, T., Loft, N. J. S., & Zinner, N. T. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040204 · Cited by 186
“, by overlapping the circuits [149] or by letting them share the same wire or Josephson-junction inductor [150–153].”
BackgroundQuantum Computation and Quantum InformationPreprint
Wang, Y. (2016) · Cited by 128
Johnson, T. H., Clark, S. R., & Jaksch, D. (2014) · EPJ Quantum Technology · doi:10.1140/epjqt10 · Cited by 127
Superadiabatic Controlled Evolutions and Universal Quantum Computation
Santos, A. C., & Sarandy, M. S. (2015) · Scientific Reports · doi:10.1038/srep15775 · Cited by 125
“(20), we obtain that the counter-diabatic piecewise Hamiltonian ( ) ξ H s CD is given by Eq.”
BackgroundContinuous Phase Transition without Gap Closing in Non-Hermitian Quantum Many-Body Systems
Matsumoto, N., Kawabata, K., Ashida, Y., Furukawa, S., & Ueda, M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260601 · Cited by 149
Coherent and dissipative dynamics at quantum phase transitions
Rossini, D., & Vicari, E. (2021) · Physics Reports · doi:10.1016/j.physrep.2021.08.003 · Cited by 159
Okawachi, Y., Yu, M., Jang, J. K., Ji, X., Zhao, Y., Kim, B. Y., Lipson, M. F., & Gaeta, A. L. (2020) · Nature Communications · doi:10.1038/s41467-020-17919-6 · Cited by 144
“The key components for realizing a network of coupled DOPOs on-chip are, (1) power splitters for routing the pump fields to the microresonators, (2) nonlinear microresonators designed for DOPO generation, and (3) the N × N photonic coupling system between the different microresonators.”
Carapito, R., Li, R. Y., Helms, J., Carapito, C., Gujja, S., Rolli, V., Guimaraes, R., Malagon-Lopez, J., Spinnhirny, P., Lederle, A., et al. (2021) · Science Translational Medicine · doi:10.1126/scitranslmed.abj7521 · Cited by 133
Security intrusion detection using quantum machine learning techniques
Kalinin, M., & Krundyshev, V. (2022) · Journal of Computer Virology and Hacking Techniques · doi:10.1007/s11416-022-00435-0 · Cited by 118
“Hopfield-type networks [35].”
Modernizing quantum annealing using local searches
Chancellor, N. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa59c4 · Cited by 100
“One model which has been able to successfully predict experimental results [38, 39, 40, 42, 43] is to assume decoherence acts in the energy eigenbasis.”
MethodMaking hybrid [n]-rotaxanes as supramolecular arrays of molecular electron spin qubits
Fernández, A., Ferrando–Soria, J., Pineda, E. M., Tuna, F., Vitórica‐Yrezábal, Í. J., Knappke, C. E. I., Ujma, J., Muryn, C. A., Timco, G. A., Barran, P. E., et al. (2016) · Nature Communications · doi:10.1038/ncomms10240 · Cited by 120
“(2); (b) [4]-rotaxane (4); (c) [5]-rotaxane (7) and (d) [5]-rotaxane (8).”
BackgroundInfluentialQuantum neuromorphic computing
Marković, D., & Grollier, J. (2020) · Applied Physics Letters · doi:10.1063/5.0020014 · Cited by 158
Yamamoto, K., Kawamura, K., Ando, K., Mertig, N., Takemoto, T., Yamaoka, M., Teramoto, H., Sakai, A., Takamaeda-Yamazaki, S., & Motomura, M. (2020) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2020.3027702 · Cited by 142
“To address this problem, new hardware architectures [2]–[5], called annealers, have emerged in recent years.”
BackgroundBenchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Willsch, D., Willsch, M., Gonzalez Calaza, C. D., Jin, F., De Raedt, H., Svensson, M., & Michielsen, K. (2022) · Quantum Information Processing · doi:10.1007/s11128-022-03476-y · Cited by 114
Quantum Annealing for Constrained Optimization
Hen, I., & Spedalieri, F. M. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.5.034007 · Cited by 114
“With recent advances in quantum technology, which have led to the development and manufacturing of the first commercially available experimental programmable quantum annealing optimizers containing hundreds of quantum bits [12, 13], interest in quantum annealing has increased dramatically due to the exciting possibili…”
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2022) · IEEE Transactions on Computers · doi:10.1109/tc.2021.3063618 · Cited by 114
24.3 20k-spin Ising chip for combinational optimization problem with CMOS annealing
Yamaoka, M., Yoshimura, C., Hayashi, M., Okuyama, T., Aoki, H., & Mizuno, H. (2015) · Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference · doi:10.1109/isscc.2015.7063111 · Cited by 114
“The analog computer using superconductivity from D-Wave [1] is one of those computers.”
MethodQuantum Computation Based on Quantum Adiabatic Bifurcations of Kerr-Nonlinear Parametric Oscillators
Goto, H. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061015 · Cited by 134
PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form
Zaman, M., Tanahashi, K., & Tanaka, S. (2021) · arXiv · doi:10.48550/arxiv.2103.01708 · Cited by 114
“In 2011, the first commercial quantum annealing machine was presented [1].”
MethodSeeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
Katzgraber, H. G., Hamze, F., Zhu, Z., Ochoa, A. J., & Munoz-Bauza, H. (2015) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 88
“introduced the D-Wave Two (DW2) quantum annealing device [19].”
MethodSelf-citationAn electromechanical Ising Hamiltonian
Mahboob, I., Okamoto, H., & Yamaguchi, H. (2016) · Science Advances · doi:10.1126/sciadv.1600236 · Cited by 113
Mandrà, S., Zhu, Z., Wang, W., Perdomo-Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 111
Traffic signal optimization on a square lattice with quantum annealing
Inoue, D., Okada, A., MATSUMORI, T., Aihara, K., & Yoshida, H. (2021) · Scientific Reports · doi:10.1038/s41598-021-82740-0 · Cited by 144
Recent advances for quantum classifiers
Li, W., & Deng, D.-L. (2021) · Science China Physics Mechanics and Astronomy · doi:10.1007/s11433-021-1793-6 · Cited by 137
Lo, H., Moy, W., Yu, H., Sapatnekar, S. S., & Kim, C. H. (2023) · Nature Electronics · doi:10.1038/s41928-023-01021-y · Cited by 139
“D-Wave’s qbsolv 0.3.4 software shows how large QUBO problems can be solved using quantum annealers 9,10 when the problem spin count is larger than the solver spin count 11 .”
MethodInfluentialQuantum Annealing amid Local Ruggedness and Global Frustration
King, J., Yarkoni, S., Raymond, J., Ozfidan, I., King, A. D., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061007 · Cited by 84
Self-citationSolid-state qubits integrated with superconducting through-silicon vias
Yost, D., Schwartz, M. E., Mallek, J., Rosenberg, D., Stull, C., Yoder, J., Calusine, G., Cook, M., Das, R. N., Day, A., et al. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 105
Counterdiabaticity and the quantum approximate optimization algorithm
Wurtz, J., & Love, P. J. (2022) · Quantum · doi:10.22331/q-2022-01-27-635 · Cited by 165
Adiabatic Quantum Algorithm for Search Engine Ranking
Garnerone, S., Zanardi, P., & Lidar, D. A. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.230506 · Cited by 102
Topologically protected quantum state transfer in a chiral spin liquid
Yao, N. Y., Laumann, C. R., Gorshkov, A. V., Weimer, H., Jiang, L., Cirac, J. I., Zoller, P., & Lukin, M. D. (2013) · Nature Communications · doi:10.1038/ncomms2531 · Cited by 114
High-Performance Computing with Quantum Processing Units
Britt, K. A., & Humble, T. S. (2017) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3007651 · Cited by 131
Experimental Determination of Ramsey Numbers
Bian, Z., Chudak, F., Macready, W. G., Clark, L., & Gaitan, F. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.130505 · Cited by 96
Robust quantum optimizer with full connectivity
Nigg, S. E., Lörch, N., & Tiwari, R. P. (2017) · Science Advances · doi:10.1126/sciadv.1602273 · Cited by 112
Reinforcement learning using quantum Boltzmann machines
Crawford, D., Levit, A., Ghadermarzy, N., Oberoi, J. S., & Ronagh, P. (2018) · Quantum Information and Computation · doi:10.26421/qic18.1-2-3 · Cited by 72
“In view of recent advancements in the manufacturing of superconducting qubits [1, 2] and systems of qubits with second-order interactions, an important question for quantum computation is the existence of quantum supremacy (e.g., in [3]), that is, whether near-term quantum devices can outperform…”
BackgroundEnergy-efficient superparamagnetic Ising machine and its application to traveling salesman problems
Si, J., Yang, S., Cen, Y., Chen, J., Huang, Y., Yao, Z., Kim, D.-J., Cai, K., Yoo, J., Fong, X., et al. (2024) · Nature Communications · doi:10.1038/s41467-024-47818-z · Cited by 143
Electronic Structure Calculations and the Ising Hamiltonian
Xia, R., Bian, T., & Kais, S. (2018) · The Journal of Physical Chemistry B · doi:10.1021/acs.jpcb.7b10371 · Cited by 96
Quantum annealing correction for random Ising problems
Pudenz, K. L., Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.042302 · Cited by 101
Leveraging quantum annealing for large MIMO processing in centralized radio access networks
Kim, M., Venturelli, D., & Jamieson, K. (2019) · ACM Special Interest Group on Data Communication · doi:10.1145/3341302.3342072 · Cited by 128
“, the minimum of the optimization objective function) [24, 35].”
BackgroundSolving combinatorial optimisation problems using oscillator based Ising machines
Wang, T., Wu, L., Nobel, P., & Roychowdhury, J. (2021) · Natural Computing · doi:10.1007/s11047-021-09845-3 · Cited by 132
“…scheme known as the Coherent Ising Machine (Marandi et al. 2014; McMahon et al. 2016; Inagaki et al. 2016), (2) the D-WAVE quantum Ising machine (Johnson et al. 2011; Bian et al. 2014) and (3) CMOS hardware-accelerated simulated annealing chips for solving Ising problems (Yamaoka et al. 2016;…”
BackgroundMethodInfluentialYang, C., Su, Q.-P., Zheng, S., & Han, S. (2013) · Physical Review A · doi:10.1103/physreva.87.022320 · Cited by 98
Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02346-0 · Cited by 96
Nonstoquastic Hamiltonians and quantum annealing of an Ising spin glass
Hormozi, L., Brown, E. W., Carleo, G., & Troyer, M. (2017) · Physical Review B · doi:10.1103/physrevb.95.184416 · Cited by 97
Quantum annealing correction with minor embedding
Vinci, W., Albash, T., Paz-Silva, G., Hen, I., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042310 · Cited by 97
A single shot coherent Ising machine based on a network of injection-locked multicore fiber lasers
Babaeian, M., Nguyen, D. T., Demir, V., Akbulut, M., Blanche, P., Kaneda, Y., Guha, S., Neifeld, M. A., & Peyghambarian, N. N. (2019) · Nature Communications · doi:10.1038/s41467-019-11548-4 · Cited by 121
“Quantum annealing 49 – 51 and adiabatic quantum computation platforms 52 have been recently introduced in the effort of solving NP-hard problems.”
BackgroundImage segmentation on a quantum computer
Caraiman, S., & Manta, V. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-0932-1 · Cited by 104
Binary optimization by momentum annealing
Okuyama, T., Sonobe, T., Kawarabayashi, K., & Yamaoka, M. (2019) · Physical review. E · doi:10.1103/physreve.100.012111 · Cited by 118
Quantum simulation of transverse Ising models with Rydberg atoms
Schauß, P. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aa9c59 · Cited by 119
Universal Statistics of Topological Defects Formed in a Quantum Phase Transition
del Campo, A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.200601 · Cited by 115
Global optimization of quantum dynamics with AlphaZero deep exploration
Dalgaard, M., Motzoi, F., Sørensen, J. J., & Sherson, J. (2020) · npj Quantum Information · doi:10.1038/s41534-019-0241-0 · Cited by 85
“[2] Johnson, M.”
MethodImproving solutions by embedding larger subproblems in a D-Wave quantum annealer
Okada, S., Ohzeki, M., Terabe, M., & Taguchi, S. (2019) · Scientific Reports · doi:10.1038/s41598-018-38388-4 · Cited by 92
“lgorithm. The computational time T(1) conv and the number N(1) Dijkstra of shortest paths searched by Dijkstra’s algorithm in the initial stage are given by T(1) conv ∼O N(1) Dijkstra TDijkstra , (8) N(1) Dijkstra ∼O |Ep| , (9) and T(2) conv and N (2) Dijkstra in the last stage are given by T(2) conv ∼O N(2) Dijkstra…”
MethodBenchmarking Quantum Annealing Controls with Portfolio Optimization
Grant, E., Humble, T. S., & Stump, B. (2021) · Physical Review Applied · doi:10.1103/physrevapplied.15.014012 · Cited by 90
“When varying g = [0, 10], we found small improvements in p̃s between g = 0 and g = 2 where the exponential decay rate became −0.”
BackgroundMethodInfluentialDomain wall encoding of discrete variables for quantum annealing and QAOA
Chancellor, N. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab33c2 · Cited by 87
“In a flux qubit quantum annealer, the Ising spins are already formed from the two lowest energy states of an infinite ladder for each qubit, and modelling these additional states is sometimes important to fully understand the dynamics [46].”
BackgroundSupply chain logistics with quantum and classical annealing algorithms
Weinberg, S. J., Sanches, F., Ide, T., Kamiya, K., & Correll, R. (2023) · Scientific Reports · doi:10.1038/s41598-023-31765-8 · Cited by 134
“The intuition behind quantum annealing is that during the anneal quantum effects will allow the exploration of energy structure of the problem by tunneling through energy barriers [6, 7, 10, 18, 19].”
BackgroundRare Earth-Doped Crystals for Quantum Information Processing
Goldner, P., Ferrier, A., & Guillot-Noël, O. (2014) · Elsevier eBooks · doi:10.1016/b978-0-444-63260-9.00267-4 · Cited by 117
Blueprint for a High-Performance Fluxonium Quantum Processor
Nguyen, L. B., Koolstra, G., Kim, Y., Morvan, A., Chistolini, T., Singh, S., Nesterov, K., Jünger, C., Chen, L., Pedramrazi, Z., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.037001 · Cited by 124
Advances in Silicon Quantum Photonics
Adcock, J. C., Bao, J., Chi, Y., Chen, X., Bacco, D., Gong, Q., Oxenløwe, L. K., Wang, J., & Ding, Y. (2020) · IEEE Journal of Selected Topics in Quantum Electronics · doi:10.1109/jstqe.2020.3025737 · Cited by 105
Self-citationScaling out Ising machines using a multi-chip architecture for simulated bifurcation
Tatsumura, K., Yamasaki, M., & Goto, H. (2021) · Nature Electronics · doi:10.1038/s41928-021-00546-4 · Cited by 119
Ultrafast Ising Machines using spin torque nano-oscillators
Albertsson, D. I., Zahedinejad, M., Houshang, A., Khymyn, R., Åkerman, J. J., & Rusu, A. (2021) · Applied Physics Letters · doi:10.1063/5.0041575 · Cited by 102
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis
Bian, Z., Chudak, F., Israel, R. B., Lackey, B., Macready, W. G., & Roy, A. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00014 · Cited by 87
“]. 1 arXiv:1603.03111v1 [quant-ph] 10 Mar 2016 QA hardware relies on an equivalence between a physical quantum model and a useful computational problem. The low energy physics of the D-Wave QA device [2,10,20,22] is well captured by a time-dependent Hamiltonian of the form H(t) = A(t)H 0 + B(t)H P where H 0 = P i2V(G)…”
BackgroundComplexity Classification of Local Hamiltonian Problems
Cubitt, T. S., & Montanaro, A. (2016) · SIAM Journal on Computing · doi:10.1137/140998287 · Cited by 176
“Such Hamiltonians are of particular interest as they occur in a wide variety of physical systems, and also in the quantum adiabatic algorithm for SAT [13] and certain claimed implementations of quantum computation [14].”
BackgroundAyala, C. L., Tanaka, T., Saito, R., Nozoe, M., Takeuchi, N., & Yoshikawa, N. (2020) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2020.3041338 · Cited by 100
A 16-bit Coherent Ising Machine for One-Dimensional Ring and Cubic Graph Problems
Takata, K., Marandi, A., Hamerly, R., Haribara, Y., Maruo, D., Tamate, S., Hiromasa, S., Utsunomiya, S., & Yamamoto, Y. (2016) · Scientific Reports · doi:10.1038/srep34089 · Cited by 98
Adiabatic evolution on a spatial-photonic Ising machine
Pierangeli, D., Marcucci, G., & Conti, C. (2020) · Optica · doi:10.1364/optica.398000 · Cited by 104
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
FPGA-Based Simulated Bifurcation Machine
Tatsumura, K., Dixon, A. R., & Goto, H. (2019) · International Conference on Field Programmable Logic and Applications (FPL) · doi:10.1109/fpl.2019.00019 · Cited by 111
“While the Ising problem is known to be an NP-hard problem [12], a variety of Ising machines [13]–[19] that can solve the Ising problems faster than previously expected have been proposed and demonstrated, activating the related applied researches [1]–[9].”
BackgroundMethodMendoza-Arenas, J. J., Clark, S. R., Felicetti, S., Romero, G., Solano, E., Angelakis, D. G., & Jaksch, D. (2016) · Physical Review A · doi:10.1103/physreva.93.023821 · Cited by 96
Quantum Annealing of Vehicle Routing Problem with Time, State and Capacity
Irie, H., Wongpaisarnsin, G., Terabe, M., Miki, A., & Taguchi, S. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-14082-3_13 · Cited by 74
Reinforcement-learning-assisted quantum optimization
Wauters, M. M., Panizon, E., Mbeng, G. B., & Santoro, G. E. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033446 · Cited by 80
Two-step approach to scheduling quantum circuits
Guerreschi, G. G., & Park, J. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aacf0b · Cited by 57
Classical signature of quantum annealing
Smolin, J. A., & Smith, G. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00052 · Cited by 79
“[12], under highly diabatic conditions, evidence was shown that the D-Wave device exhibits quantum tunneling.”
BackgroundQuantum Computing Circuits and Devices
Humble, T. S., Thapliyal, H., Muñoz‐Coreas, E., Mohiyaddin, F. A., & Bennink, R. S. (2019) · IEEE Design and Test · doi:10.1109/mdat.2019.2907130 · Cited by 98
“Efforts to optimally approximate the value of the first register, known as quantum cloning [13], can be evaluated by measuring the fidelity defined as”
BackgroundA Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers
Potok, T. E., Schuman, C., Young, S., Patton, R., Spedalieri, F., Liu, J., Yao, K.-T., Rose, G., & Chakma, G. (2018) · ACM Journal on Emerging Technologies in Computing Systems · doi:10.1145/3178454 · Cited by 77
“Actual implementations of adiabatic quantum machines, such as the D-Wave, operate at a finite temperature [7].”
MethodSelf-citationA quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo-Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., & Smelyanskiy, V. N. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02347-y · Cited by 75
“The quantum hardware employed consists of 64 units of a recently characterized eight-qubit unit cell 27,28 .”
MethodNishi, H., Kosugi, T., & Matsushita, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00409-y · Cited by 112
Towards Adiabatic Quantum Computing Using Compressed Quantum Circuits
Keever, C. M., & Lubasch, M. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.020362 · Cited by 108
Recent Progress in Quantum Simulation Using Superconducting Circuits
Paraoanu, G. S. (2014) · Journal of Low Temperature Physics · doi:10.1007/s10909-014-1175-8 · Cited by 87
“The fact that annealing is realized by quantum-mechanical tunneling and not just thermal activation has been tested so far for 8 qubits [116], though in more recent D-wave devices, the number of qubits that stay quantum-coherent could be larger.”
BackgroundBenchmarking a quantum annealing processor with the time-to-target metric
King, J., Yarkoni, S., Nevisi, M. M., Hilton, J. P., & McGeoch, C. C. (2015) · arXiv · doi:10.48550/arxiv.1508.05087 · Cited by 77
“1 Introduction The commercial availability of D-Wave’s quantum annealers1 in recent years [1, 2, 3] has led to many interesting challenges in benchmarking, including the identification of suitable metrics for comparing performance against classical solution methods.”
BackgroundSelf-citationLarge-scale coherent Ising machine based on optoelectronic parametric oscillator
Cen, Q., Ding, H., Hao, T., Guan, S., Qin, Z., Lyu, J., Li, W., Zhu, N., Xu, K., Dai, Y., et al. (2022) · Light Science & Applications · doi:10.1038/s41377-022-01013-1 · Cited by 99
Towards a Quantum-Resilient Future: Strategies for Transitioning to Post-Quantum Cryptography
Aydeger, A., Zeydan, E., Yadav, A. K., Hemachandra, K. T., & Liyanage, M. (2024) · International Conference on the Network of the Future (NOF) · doi:10.1109/nof62948.2024.10741441 · Cited by 93
“The commercial potential of quantum computing became tangible in 2011 when D-Wave Systems unveiled what it claimed was the first commercially available quantum computer [3].”
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.