Evidence for quantum annealing with more than one hundred qubits
Open accessThe DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Abstract
Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators may be built with capabilities exceeding classical computers. A quantum annealer, in particular, solves optimization problems by evolving a known initial configuration at non-zero temperature towards the ground state of a Hamiltonian encoding a given problem. Here, we present results from tests on a 108 qubit D-Wave One device based on superconducting flux qubits. By studying correlations we find that the device performance is inconsistent with classical annealing or that it is governed by classical spin dynamics. In contrast, we find that the device correlates well with simulated quantum annealing. We find further evidence for quantum annealing in the form of small-gap avoided level crossings characterizing the hard problems. To assess the computational power of the device we compare it against optimized classical algorithms. Quantum annealing is expected to solve certain optimization problems more efficiently, but there are still open questions regarding the functioning of devices such as D-Wave One. A numerical and experimental investigation of its performance shows evidence for quantum annealing with 108 qubits.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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?
The check wasn’t confident either way, so it gives no verdict — never disputed.
In the citing paper
“For example, the achievable rate for the transmission of classical information over a noisy quantum channel is given by the Holevo-Schumacher-Westmorel (HSW) coding theorem [136], which generalizes the Shannon's theorem in quantum settings.”
From Quantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future (2019) · cites this paper as [136]
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134 · cited 1×
“Mimicking this process in computer simulations is the idea behind simulated annealing as an optimisation method [8], which views the cost function of an optimisation problem as the energy of a physical system.”
MethodEquation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
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 · cited 3×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
BackgroundMethodQuantum simulations with ultracold quantum gases
Bloch, I., Dalibard, J., & Nascimbène, S. (2012) · Nature Physics · doi:10.1038/nphys2259 · Cited by 2,339 · cited 1×
“At a time when quantum effects start to pose limits to further miniaturisation of devices and the exponential performance increase due to Moore’s law, quantum technology is maturing to the point where quantum devices, such as quantum communication systems [1], quantum random number generators [2] and quantum simulator…”
BackgroundA 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 · cited 1×
“Unlike adiabatic quantum computing [16], which has a similar schedule but assumes fully coherent adiabatic ground state evolution at zero temperature, quantum annealing [4–6, 10] is a positive temperature method involving an open quantum system coupled to a thermal bath.”
MethodQuantum annealing with manufactured spins
Johnson, M. W., Amin, M. H. S., Gildert, S., Lanting, T., Hamze, F., Dickson, N., Harris, R., Berkley, A. J., Johansson, J., Bunyk, P., et al. (2011) · Nature · doi:10.1038/nature10012 · Cited by 1,891 · cited 3×
“In this work we report on computer simulations and experimental tests on a D-Wave One device [13] in order to address central open questions about quantum annealers: is the device actually a quantum annealer, i.”
BackgroundMethodInfluentialEquation of state calculations by fast computing machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · doi:10.2172/4390578 · Cited by 1,701
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 1×
“This problem is nondeterministic polynomially (NP) hard [15], meaning that it is at least as hard as the hardest problems in NP, a class which includes notoriously difficult problems such as traveling salesman, satisfiablity of logical formulas, and ar X iv :1 30 4.”
BackgroundTheory of Quantum Annealing of an Ising Spin Glass
Santoro, G. E., Martoňák, R., Tosatti, E., & Car, R. (2002) · Science · doi:10.1126/science.1068774 · Cited by 734 · cited 3×
“[11], we also observe that the simulated quantum annealer here scales slightly worse than the simulated classical annealer.”
BackgroundMethodInfluential
Research works printed but not linked: 1
- McGeoch, C. C. & Wang, C. Proc. 2013 ACM Conf. Comput. Frontiers (ACM, 2013).
Cited by
Items 501–600 of 796
In Situ Noise Characterization of the D-Wave Quantum Annealer
Zaborniak, T., & de Sousa, R. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00057 · Cited by 8
Quantum optics with artificial atoms
Kockum, A. F. (2018) · Physics Subject Headings (PhySH) · doi:10.29172/5ba9ba41-67e3-4588-86b5-6cc8052e0847 · Cited by 7
Homid, A. H., Abdel‐Aty, A., Abdel‐Aty, M., Badawi, A., & Obada, A. ‐. F. (2021) · Journal of the Optical Society of America B · doi:10.1364/josab.419687 · Cited by 7
Quantum Emulation of Molecular Force Fields: A Blueprint for a Superconducting Architecture
Olivares, D. G., Peropadre, B., Huh, J., & García-Ripoll, J. J. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064008 · Cited by 6
Lagrangian duality in quantum optimization: Overcoming QUBO limitations for constrained problems
Gabbassov, E., Rosenberg, G., & Scherer, A. (2025) · Physical Review Research · doi:10.1103/53gd-2374 · Cited by 12
“For example, devices such as D-Wave’s quantum annealer [21], NTT’s coherent Ising machine [22], Fujitsu’s digital an-nealer [23] and Toshiba’s simulated quantum bifurcation machine [24], are all designed to solve QUBO problems.”
MethodImplementation of a Multiple Target Tracking Filter on an Adiabatic Quantum Computer
McCormick, T. M., Osborn, B. R., Angle, R. B., & Streit, R. L. (2022) · IEEE Aerospace Conference (AERO) · doi:10.1109/aero53065.2022.9843451 · Cited by 6
A Study of Spanning Trees on a D-Wave Quantum Computer
Hall, J. S., Novotny, M. A., Neuhaus, T., & Michielsen, K. F. L. (2015) · Physics Procedia · doi:10.1016/j.phpro.2015.07.109 · Cited by 6
Numeric Experiments on the Commercial Quantum Computer
Warren, R. H. (2013) · Notices of the American Mathematical Society · doi:10.1090/noti1059 · Cited by 6
“Boixo and his colleagues report some evidence that they are [3], [4].”
BackgroundPath-integral quantum Monte Carlo simulation with open-boundary conditions
Zhang, J., Smelyanskiy, V., Boixo, S., & Neven, H. (2017) · Physical Review A · doi:10.1103/physreva.96.042330 · Cited by 7
“Path-integral quantum Monte Carl (QMC) is a classical Markov chain Monte Carlo algorithm to calculate thermodynamic properties of quantum systems; it is the most efficient algorithm to compute exponentially small gaps at first order phase transitions [5, 14, 15] and is often used to simulate QA in spin glasses [4, 5,…”
Self-citationQuantum arithmetics via computation with minimized external control: The half-adder
Eloie, L., Banchi, L., & Bose, S. (2018) · Physical Review A · doi:10.1103/physreva.97.062321 · Cited by 7
Quantum Annealing Machines Based on Semiconductor Nanostructures
Tanamoto, T., Nishi, Y., & Deguchi, J. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061013 · Cited by 6
Computational Properties of Ising Spin Model on Spin Connection Parameters
Miki, T., Ito, M., Hirata, Y., Kushitani, Y., Shimada, M., & Shirakashi, J. (2019) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano46743.2019.8993915 · Cited by 6
“These approaches have been implemented in hardware with superconducting circuits [26-28], digital circuits such as field-programmable gate array (FPGA) [25,29-32], and laser pulses [33-38].”
MethodQuantum brachistochrone for multiple qubits
Wang, D., Shi, H., & Lan, Y. (2021) · New Journal of Physics · doi:10.1088/1367-2630/ac1df5 · Cited by 6
“Ever since people realized that quantum computers are much more powerful than their classical counterparts [1, 2], researchers have been working hard to bring it to life for years, which is making considerable progress and leads to a dramatic increase in the complexity of controllable quantum systems, from prototyped…”
BackgroundHan, K., Huang, T., & Yin, L. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2022.109982 · Cited by 6
Separability gap and large-deviation entanglement criterion
Czartowski, J., Szymański, K., Gardas, B., Fyodorov, Y. V., & Życzkowski, K. (2019) · Physical Review A · doi:10.1103/physreva.100.042326 · Cited by 7
“In such cases of practical importance one applies various methods based on quantum annealing [4, 5] and can depend on an increasing number of dedicated physical annealing systems [6–9].”
MethodQuantum Computing and Quantum Communication
Pulkkis, G., & Grahn, K. J. (2018) · Advances in computer and electrical engineering book series · doi:10.4018/978-1-5225-7598-6.ch121 · Cited by 6
Dynamic Programming on a Quantum Annealer: Solving the RBC ModelPreprint
Fernández‐Villaverde, J., & Hull, I. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4477988 · Cited by 11
Physics informed quantum computing: A decade scientometric analysis
Sood, V., & Chauhan, R. P. (2024) · Journal of Computational Science · doi:10.1016/j.jocs.2024.102382 · Cited by 7
Park, J., Xu, Z., Park, G.-M., Luo, T., & Lee, E. (2025) · Scientific Reports · doi:10.1038/s41598-025-99570-z · Cited by 5
Lins, I. D., Araújo, L. M. M., Maior, C. B. S., Teixeira, E. S., Bezerra, P. T. L., Moura, M. J. D. C., & Droguett, E. L. (2025) · Reliability Engineering & System Safety · doi:10.1016/j.ress.2025.111153 · Cited by 5
Optical Ising spin-glass simulator with tunable short-range couplings
Delloye, L., Jacucci, G., Pandya, R., Pierangeli, D., Conti, C., & Gigan, S. (2025) · Physical Review A · doi:10.1103/mwx5-32rj · Cited by 5
Fighting Exponentially Small Gaps by Counterdiabatic Driving
Grabarits, A., Balducci, F., & del Campo, A. (2025) · PRX Quantum · doi:10.1103/tgzt-dy3h · Cited by 17
“A similar situation takes place in the Majorana representation.”
Propagation of fluctuations in the quantum Ising model
Navez, P., Tsironis, G. P., & Zagoskin, A. M. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.95.064304 · Cited by 5
Duffus, S. N. A., Bjergstrom, K. N., Dwyer, V. M., Samson, J. H., Spiller, T. P., Zagoskin, A. M., Munro, W. J., Nemoto, K., & Everitt, M. J. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.94.064518 · Cited by 9
Finding a Hadamard Matrix by Simulated Quantum Annealing
Suksmono, A. B. (2018) · Entropy · doi:10.3390/e20020141 · Cited by 5
Deep learning nonlocal and scalable energy functionals for quantum Ising models
Costa, E., Fazio, R., & Pilati, S. (2023) · Physical review. B./Physical review. B · doi:10.1103/physrevb.108.125113 · Cited by 5
QUBO formulation using inequalities for problems with complex constraints
Komiyama, T., & Suzuki, T. (2024) · International Conference on High Performance Computing in Asia-Pacific Region (HPC Asia) · doi:10.1145/3635035.3635042 · Cited by 5
“Not only have QA machines using superconducting integrated circuits[4, 8] been recently developed, but companies are beginning to offer quantum-inspired annealing (QIA) machines that can handle larger problems.”
BackgroundExploring the topological sector optimization on quantum computers
Ding, Y.-M., Wang, Y.-C., Zhang, S., & Zheng, Y. Q. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.034031 · Cited by 6
“…theorem [8–10], the quantum annealing (QA) method, or adiabatic quantum computation, has turned out to be a promising approach to these problems [3–7 Following technological advancements in manufacturing coupled qubit systems recently, QA can be implemented with superconducting flux qubits [17–19].”
MethodInfluentialPerformance of quantum annealing for 2-satisfiability problems with multiple satisfying assignments
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/n7r5-s63q · Cited by 5
Counterdiabatic Hamiltonians for multistate Landau-Zener problem
Nishimura, K., & Takahashi, K. (2018) · SciPost Physics · doi:10.21468/scipostphys.5.3.029 · Cited by 8
“The same type of the Hamiltonian is used in the method of quantum annealing [13–17].”
Impact of global and local interaction on quantum spatial search on chimera graph
Glos, A., & Januszek, T. (2019) · International Journal of Quantum Information · doi:10.1142/s0219749919500400 · Cited by 5
“To do so we choose the chimera graph which represents the topology used on D-Wave quantum computer [9].”
MethodAdiabatic speedup in cutting a spin chain by pulse control in a laboratory frame
Wang, R., Ren, F.-H., Gu, Y., & Wang, Z.-M. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02779-2 · Cited by 5
Self-citationHybridization of Spin Decision Logics for Ising Machine with Logic Circuits
Miki, T., Yoshida, A., Shimada, M., & Shirakashi, J. (2021) · IEEE International Conference on Nanotechnology (IEEE-NANO) · doi:10.1109/nano51122.2021.9514319 · Cited by 5
Matsuzaki, Y., Imoto, T., & Susa, Y. (2022) · Scientific Reports · doi:10.1038/s41598-022-17621-1 · Cited by 8
“(b) We plot eigenenergies against the time with the unit of milliseconds where we adopt the Hamiltonian in the Eq.(9), which is derived by using a rotating wave approximation.”
MethodInfluentialCritical behavior of the three-state random-field Potts model in three dimensions
Kumar, M., Banerjee, V., Puri, S., & Weigel, M. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.l042041 · Cited by 8
“Understanding the effect of quenched disorder on phase transitions is crucial for many experiments, such as magnetic systems with impurities, and technological application areas, such as quantum computers [1].”
BackgroundAnalysis of the shortest vector problems with quantum annealing to search the excited states
Ura, K., Imoto, T., Nikuni, T., Kawabata, S., & Matsuzaki, Y. (2023) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/acba21 · Cited by 5
A classification technique for condensed matter phases using a combination of PCA and SVM
Badawi, W. K., Osman, Z. M., Sharkas, M., & Tamazin, M. E. (2017) · Photonics & Electromagnetics Research Symposium - Spring (PIERS-Spring) · doi:10.1109/piers.2017.8261759 · Cited by 5
2000 Qubit D-Wave Quantum Computer Replacing MCMC for RBM Image Reconstruction and Classification
Koshka, Y., & Novotny, M. A. (2018) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2018.8489746 · Cited by 5
“, the global minimum) of systems with complex energy landscapes (complex Hamiltonians of a many-qubit system) [3-5].”
BackgroundThe Quantum Illumination Story : (Invited Paper)
Shapiro, J. H. (2019) · IEEE International Conference on Microwaves, Communications, Antennas and Electronic Systems (COMCAS) · doi:10.1109/comcas44984.2019.8958368 · Cited by 12
“Quantum computers, if realized at sufficiently large scale, will vastly outstrip the capability of classical machines for a variety of problems in simulation [3], optimization [4], and machine”
BackgroundBifurcation-Based Quantum Annealing with Nested Spins
Takahashi, K. (2022) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.91.044003 · Cited by 5
“In the present implementation of the QA [6, 7], the scale of the Hamiltonian is of the order of GHz, and the annealing time is of the order of μs.”
MethodEntanglement of thermal state of quantum annealing processor
Abdel‐Aty, A., Khedr, A. N., Youssef, A., & Saddeek, Y. B. (2020) · Thermal Science · doi:10.2298/tsci20325a · Cited by 5
Constant Depth Code Deformations in the Parity Architecture
Messinger, A., Fellner, M., & Lechner, W. (2023) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00022 · Cited by 9
Image processing via simulated quantum dynamics
Sowa, A. (2017) · Random Operators and Stochastic Equations · doi:10.1515/rose-2017-0003 · Cited by 6
“with the availability of D-Wave Two quantum annealer [3] – a quantum-vantage point at IP will soon become a matter of necessity.”
BackgroundQuantum Annealing and Computation: A Brief Documentary NotePreprint
Ghosh, A. K., & Mukherjee, S. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1310.1339 · Cited by 8
Dynamic Programming in Economics on a Quantum Annealer
Fernández‐Villaverde, J., & Hull, I. (2023) · National Bureau of Economic Research · doi:10.3386/w31326 · Cited by 8
Understanding the physics of D-Wave annealers: From Schrödinger to Lindblad to Markovian dynamics
Mehta, V., Raedt, H. A. D., Michielsen, K. F. L., & Jin, F. (2025) · Physical Review A · doi:10.1103/3yk8-qn64 · Cited by 8
Topology-enhanced superconducting qubit networks for in-sensor quantum information processing
Settino, J., Luciano, G. G., Bartolomeo, A. D., Silvestrini, P., Lisitskiy, M., Ruggiero, B., & Romeo, F. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/ae2201 · Cited by 4
“A central challenge is the realization of large-scale qubit networks [21, 22] without incurring pro-hibitive levels of decoherence [23], which would severely degrade the functionality of quantum devices.”
Posiform planting: generating QUBO instances for benchmarking
Hahn, G., Pelofske, E., & Djidjev, H. N. (2023) · Frontiers in Computer Science · doi:10.3389/fcomp.2023.1275948 · Cited by 4
Model-Driven Engineering for Quantum Programming: A Case Study on Ground State Energy Calculation
Polat, F., Tuncer, H., Moin, A., & Challenger, M. (2024) · IEEE Annual International Computer Software and Applications Conference (COMPSAC) · doi:10.1109/compsac61105.2024.00378 · Cited by 5
“This makes it a valuable tool in scenarios where speed is prioritized over absolute precision in finding the lowest possible energy state [18], [19].”
MethodLiu, D., Yang, W., Wang, H., Du, Y., Wang, Y., Lü, Z., & Hao, J. (2025) · Computers & Operations Research · doi:10.1016/j.cor.2025.107137 · Cited by 5
Cost of emulating a small quantum annealing problem in the circuit model
Gonzalez-Conde, J., Morrell, Z., Vuffray, M., Albash, T., & Coffrin, C. (2025) · Physical Review A · doi:10.1103/physreva.111.062606 · Cited by 6
Benchmarking D-Wave quantum annealing systems: some challenges
McGeoch, C. C. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2197731 · Cited by 4
“These systems have been shown to exhibit quantum properties including superposition, entanglement, and tunneling [9], [10], [11], [14], [24], [32].”
BackgroundMachine Learning applied to Programming Quantum Computers
Steck, J. E., & Behrman, E. (2019) · AIAA SciTech Forum · doi:10.2514/6.2019-0956 · Cited by 4
Quantum Annealing via Path-Integral Monte Carlo With Data Augmentation
Hu, J., & Wang, Y. (2020) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.2020.1814787 · Cited by 4
“See Boixo et al. (2014) and Wang, Wu, and Zou (2016) for more details.”
BackgroundMethodResultInfluentialMiki, T., Shimada, M., & Shirakashi, J. (2020) · IEEE International Conference on Design & Test of Integrated Micro & Nano-Systems (DTS) · doi:10.1109/dts48731.2020.9196051 · Cited by 4
“These computing methods are implemented with digital circuits such as field-programmable gate array (FPGA) [28,30-33], superconducting circuits [34-36], and laser pulses [37-42].”
Methodde Lima, E. F., Fernandes, M. E. F., & Castelano, L. K. (2022) · Physical Review A · doi:10.1103/physreva.105.032454 · Cited by 4
Building an adiabatic quantum computer simulation in the classroom
Rodríguez-Laguna, J., & Santalla, S. N. (2018) · American Journal of Physics · doi:10.1119/1.5021360 · Cited by 5
Phase transitions in quantum annealing of an NP-hard problem detected by fidelity susceptibility
Takahashi, J., & Hukushima, K. (2019) · Journal of Statistical Mechanics Theory and Experiment · doi:10.1088/1742-5468/ab0819 · Cited by 5
Discriminating nonisomorphic graphs with an experimental quantum annealer
Izquierdo, Z. G., Zhou, R., Markström, K., & Hen, I. (2020) · Physical Review A · doi:10.1103/physreva.102.032622 · Cited by 4
Suksmono, A. B., & Minato, Y. (2022) · Scientific Reports · doi:10.1038/s41598-021-03586-0 · Cited by 10
“The processor performs quantum annealing by introducing a transverse field given by which is evolved over time according to the following equation where t ∈ [ 0, τ ] denotes time 22,26 .”
MethodHu, Z., & Kais, S. (2022) · Advanced Quantum Technologies · doi:10.1002/qute.202100158 · Cited by 4
“Introduction Quantum computation has achieved enormous progress in the last 20 years [1-7] with state-of-theart technologies emerging one after another [8-13].”
BackgroundLiang, R. N., Anacleto, E. A. J., & Meneses, C. N. (2022) · Journal of Heuristics · doi:10.1007/s10732-022-09498-0 · Cited by 5
“In recent years, D-Wave quantum annealers (Bian et al. 2014; Boixo et al. 2014; Cruz-Santos et al. 2018; Pastorello and Blanzieri 2019) have been developed to solve instances of the QUBO problem.”
BackgroundCorrelations dynamics of two-spin XYZ Heisenberg model via negativity and skew information
Khedr, A. N., Tammam, M., & Abdel‐Aty, M. (2022) · International Journal of Quantum Information · doi:10.1142/s0219749922500265 · Cited by 5
Performance of quantum annealing hardware
Steiger, D. S., Heim, B., Rønnow, T. F., & Troyer, M. (2015) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2202661 · Cited by 6
“Furthermore we find that hardness depends on a property of the quantum model (the lowest energy gap), and the fact that the DW device is sensitive to that lets us conclude that it is indeed a quantum annealer.(12) A later paper found for the same problems a mean-field description, assuming individually coherent qubits…”
BackgroundSelf-citationDimensionality reduction for adiabatic quantum optimizers: Beyond symmetry exploitationPreprint
Mandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2014) · arXiv (Cornell University) · Cited by 4
Revolutionizing Computing: A Comprehensive Introduction to Quantum ComputingPreprint
Jerbi, D. (2023) · doi:10.36227/techrxiv.22710361.v1 · Cited by 5
Kim, J. P., Kim, H. W., Jeong, J., Park, J., Kuk, S., Kim, J., Woo, J., & Kim, S. (2024) · Small · doi:10.1002/smll.202406822 · Cited by 3
Huang, K.-P., Nien, C.-F., Zhang, Y.-T., Lee, C.-K., & Wang, Y.-C. (2024) · IEEE Asia Pacific Conference on Circuits and Systems (APCCAS) · doi:10.1109/apccas62602.2024.10808341 · Cited by 3
“TTS has been widely used in optimization research [18]– [20], which is defined as follows: where P a ( t a ) represents the probability of obtaining a near-optimal solution within computing time t a .”
Improving the efficiency of quantum annealing with controlled diagonal catalysts
Hattori, T., & Tanaka, S. (2026) · Physical Review A · doi:10.1103/vff6-cf7c · Cited by 4
Entanglement-assisted variational algorithm for discrete optimization problems
Fioroni, L., & Savona, V. (2025) · Communications Physics · doi:10.1038/s42005-025-02338-0 · Cited by 4
“Yet, the general agreement is that the potential advantage offered by quantum annealing is intrinsically linked to the formation of entanglement during the evolution according to the time-dependent Hamiltonian [43, 50–52].”
Xu, Y., Li, Z., Han, X., & Luo, R. (2025) · International Journal of Electrical Power & Energy Systems · doi:10.1016/j.ijepes.2025.111115 · Cited by 4
Diabatic quantum and classical annealing of the Sherrington-Kirkpatrick model
Rakcheev, A., & Läuchli, A. M. (2023) · Physical Review A · doi:10.1103/physreva.107.062602 · Cited by 3
Inaba, K., Yamada, Y., & Takesue, H. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.044074 · Cited by 5
Reforming Quantum Microgrid Formation
Lin, C., Zhang, P., Bragin, M. A., & Shamash, Y. (2025) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2025.3527817 · Cited by 3
“The optimal QUBO solution corresponds to the minimum energy state of the following Ising model [5]: where H is the Hamiltonian function; z j is the spin variable taking values ± 1 ; J jk and h j are the coefficients.”
Mapping state transition susceptibility in quantum annealing
Pelofske, E. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.013224 · Cited by 7
Scheduling Quantum Annealing for Active User Detection in a NOMA Network
Piron, R., & Goursaud, C. (2024) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce60285.2024.00057 · Cited by 4
“A further improvement would be to use Quantum Monte Carlo methods as done by [22] to extract quantum gaps involved in the mean gap estimator in order to compute it for N ≥ 9 .”
The success and failure of quantum computing start-ups
Sanders, B. C. (2025) · Nature Electronics · doi:10.1038/s41928-025-01337-x · Cited by 3
Quantum-annealing-inspired algorithms for multijet clustering
Okawa, H., Tao, X.-Z., Zeng, Q., & Yung, M. (2025) · Physics Letters B · doi:10.1016/j.physletb.2025.139393 · Cited by 3
Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer
Chandra, R., Jacobson, N. T., Moussa, J. E., Frankel, S. H., & Kais, S. (2014) · Physical Review A · doi:10.1103/physreva.90.012308 · Cited by 3
Quantum teleporation of thermofields
Prudêncio, T., Filho, T. M. R., & de Santana, A. E. (2019) · Physica Scripta · doi:10.1088/1402-4896/ab03b1 · Cited by 6
Some Mathematical Problems of Control of Quantum Systems
Pechen, A. N. (2019) · Journal of Mathematical Sciences · doi:10.1007/s10958-019-04416-5 · Cited by 3
Quantum annealing for semi-supervised learning
Zheng, Y.-L., Zhang, W., Zhou, C., & Geng, W. (2021) · Chinese Physics B · doi:10.1088/1674-1056/abe298 · Cited by 3
Analogue In-Memory Computing with Resistive Switching Memories
Pedretti, G., & Ielmini, D. (2022) · Springer eBooks · doi:10.1007/978-3-031-03841-9_4 · Cited by 3
qualign: solving sequence alignment based on quadratic unconstrained binary optimisation
Matsumoto, Y., & Nakamura, S. (2023) · EMBnet journal · doi:10.14806/ej.28.0.1020 · Cited by 3
Gene Expression Programming for Quantum Computing
Álvarez, G., Bennink, R. S., Irle, S., & Jakowski, J. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3617691 · Cited by 4
Elastic energy driven multivariant selection in martensites via quantum annealing
dos Santos, L. C. P., Hang, T., Sandt, R., Finsterbusch, M., Bouar, Y. L., & Spatschek, R. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.023076 · Cited by 4
“This Hamiltonian is then changed adiabat-ically under the operation at cryogenic temperatures to the desired, final Hamiltonian, what allows the conversion of the ground state to the final Hamiltonian [16, 17] and therefore enables efficient global energy minimiza-tions.”
BackgroundDetermination of optimal chain coupling made by embedding in D-wave quantum annealer
Park, H., & Lee, H. (2024) · AVS Quantum Science · doi:10.1116/5.0205511 · Cited by 4
“…requiring annealing process for the possible lowest energy and for the research of Ising model, which exhibits the phase transition between unconventional phases at zero temperature, but also used as programmable quantum simulator for exploring dynamic behaviors shown in real materials 7–18 .”
MethodA Quantum Access Points Selection Algorithm for Large-Scale Localization
Shokry, A., & Youssef, M. A. (2024) · Conference on Local Computer Networks · doi:10.1109/lcn60385.2024.10639748 · Cited by 5
On a Quantum Algorithm for the Resolution of Systems of Linear Equations
Sellier, J. M., & Dimov, I. (2015) · Studies in computational intelligence · doi:10.1007/978-3-319-21133-6_3 · Cited by 3
“As a matter of fact, on may 2011 the D-Wave company announced the first commercial quantum computer [9], based on an implementation of the quantum annealing algorithm [10–13] and empowering 128 flux qubits, and a second generation machine, with 512 flux qubits, is already being benchmarked by Google, NASAand a consort…”
BackgroundFlux qubit in a dc SQUID with the 4 π period Josephson effect
Huang, W., Liang, Q., Yao, D., & Wang, Z. (2015) · Europhysics Letters (EPL) · doi:10.1209/0295-5075/110/37010 · Cited by 3
Self-citationHierarchy of correlations for the Ising model in the Majorana representation
Gómez-León, Á. (2017) · Physical review. B./Physical review. B · doi:10.1103/physrevb.96.064426 · Cited by 3
Pechukas-Yukawa approach to the evolution of the quantum state of a parametrically perturbed system
Qureshi, M. A., Zhong, J. Q., Qureshi, Z., Mason, P., Betouras, J. J., & Zagoskin, A. M. (2018) · Physical Review A · doi:10.1103/physreva.97.032117 · Cited by 3
Quantum engineering of superconducting structures: Principles, promise and problems
Zagoskin, A. M. (2017) · Low Temperature Physics · doi:10.1063/1.4995621 · Cited by 4
Basics and Applications of Quantum Annealing
Tanaka, S., TANAHASHI, K., Motohashi, T., & Takayanagi, S. (2018) · TEION KOGAKU (Journal of Cryogenics and Superconductivity Society of Japan) · doi:10.2221/jcsj.53.287 · Cited by 3
The unitary dependence theory for characterizing quantum circuits and states
Hu, Z., & Kais, S. (2023) · Communications Physics · doi:10.1038/s42005-023-01188-y · Cited by 6
“(10).”
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.273.1 · Cited by 3
Vitale, V., Filippis, G. D., CANDIA, A. D., Tagliacozzo, A., Cataudella, V., & Lucignano, P. (2019) · Scientific Reports · doi:10.1038/s41598-019-50081-8 · Cited by 4
Sinha, A. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0413 · Cited by 3
“Category A (QISG) Category B (QA) paper id year citation reference paper id year citation reference A1 2002 641 [7] B1 1998 1570 [5] A2 2015 316 [8] B2 2011 1431 [6] A3 1991 256 [4] B3 2014 711 [9] A4 1982 213 [10] B4 2002 641 [7] A5 1989 207 [3] B5 1994 630 [11] A6 2011 199 [12] B6 2008 594 [13] A7 2015 196 [14] B7 1…”
Towards quantum simulation of spin systems using continuous variable quantum devicesPreprint
Annabestani, R., Gupt, B., & Bardhan, B. R. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.09455 · Cited by 4
“In this work, we discuss the simulation of Ising spin model on a continuous variable (CV) quantum processor (for simulations using qubit based quantum computers and quantum annealers see [23–30] and references therein.”
MethodQuantum Computing in Green Energy ProductionPreprint
Sharabiani, M. T. A., Jakobsen, V. B., Jeppesen, M., & Mahani, A. S. (2021) · arXiv (Cornell University) · Cited by 3
Metadata
- Authors
- Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M.
- Affiliations
- University of Southern California (US)
- ETH Zurich (CH)
- Microsoft (United States) (US)
- University of California, Santa Barbara (US)
- Corresponding author
- Troyer, Matthias
- Venue
- Nature Physics
- Published
- 2014-02-28
- Volume
- 10
- Issue
- 3
- Pages
- 218-224
- ISSN
- 1745-2473 (ISSN-L)
- 1745-2481
- OpenAlex
- W2117762142
- Cited by
- 810
- References
- 49
- Citations by year
- 2026: 35 · 2025: 49 · 2024: 49 · 2023: 51 · 2022: 68 · 2021: 71 · 2020: 67 · 2019: 71 · 2018: 66 · 2017: 97 · 2016: 67 · 2015: 68 · 2014: 41
- FWCI
- 90.73
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Nature Physics (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- 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 › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, superconducting flux qubit, avoided crossings, spin correlations, optimization problems, ground state, simulated quantum annealing
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.