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 701–796 of 796
Caracterização da evolução adiabática em cadeias de spin
Grajales, J. A. V. (2018) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.76.2018.tde-05062018-151545
Solving Quantum Spin Glasses with Off-Diagonal Expansion Quantum Monte Carlo
Hen, I., & Albash, T. (2018) · Journal of Physics Conference Series · doi:10.1088/1742-6596/1136/1/012007
Adiabatic computing in the knowledge economy
Kozyrev, A. (2018) · Herald of CEMI · doi:10.33276/s0000069-8-1
“Здесь можно выделить встраивание математических задач в квантовые биты и их соединения [9, 10, 15], подавление ошибок из-за специфики аппарата [20, 22], масштабирование больших объемов данных для соответствия среде [20].”
Exact diagonalization studies of quantum simulators
Raventós, D. (2019) · UPCommons institutional repository (Universitat Politècnica de Catalunya) · doi:10.5821/dissertation-2117-132776
“The first commercially accessible quantum annealers are in the market [223, 244, 245].”
BackgroundClassical Control of Large-Scale Quantum ComputersPreprint
Devitt, S. J. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1405.4943
“…as Quantum Key Distribution (QKD) and Quantum random number generators and many non-physicists are aware of the D-Wave quantum computer, which while scientifically controversial is an attempt to build a analogue quantum computer capable of solving certain types of optimisation problems [9,10,11].”
BackgroundAn adiabatic quantum algorithm for the Frobenius problemPreprint
Ossorio-Castillo, J., & Tornero, J. M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.01789
Classical Machines, for Solving the Toughest Problems in Computer Science
Yablonovitch, E., Xiao, T. P., & Vadlamani, S. K. (2019) · Frontiers in Optics · doi:10.1364/fio.2019.jtu4a.114
$\textit{In Situ}$ Noise Characterization of the D-Wave Quantum AnnealerPreprint
Zaborniak, T., & de Sousa, R. (2020) · arXiv (Cornell University)
Simulated Quantum Annealing is Efficient on the Spike HamiltonianPreprint
Bergamaschi, T. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.15094 · Cited by 3
Fidelity-based Deep Adiabatic Scheduling
Ovits, E., & Wolf, L. (2021) · International Conference on Learning Representations
Towards a NISQ Algorithm to Simulate Hermitian Matrix ExponentiationPreprint
Li, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.13610
Benchmarks and Controls for Optimization with Quantum Annealing
Grant, E. (2020) · Cited by 2
Adiabatic Dynamics and Shortcuts to Adiabaticity: Fundamentals and ApplicationsPreprint
Santos, A. C. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2107.11798 · Cited by 1
Investigation of Eigenmode-Based Coupled Oscillator Solver Applied to Ising Spin Problems
Murakami, S., Ikeda, O., Hirukawa, Y., & Saiki, T. (2021) · Symmetry · doi:10.3390/sym13091745
“An example of an Ising machine is the quantum annealing machine from D-Wave Systems, which was implemented using superconducting qubits [22,23].”
MethodClassifying quantum circuits with qubit functional configurations.Preprint
Hu, Z., & Kais, S. (2021) · arXiv (Cornell University)
Park, S. W., & Jun, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2111.10084
“(1) The solution which minimizes the l(2)-norm of the equation ‖Ax− b‖(2) = xAAx − 2bAx+ bb (2) solves (1).”
BackgroundMethodEmpirical parameter tuning of task-based tiled QR factorization using quantum annealing
Suzuki, T. (2021) · International Symposium on Computing and Networking Workshops (CANDARW) · doi:10.1109/candarw53999.2021.00042
Understanding via Analogue Quantum Simulation
Hangleiter, D., Carolan, J., & Thébault, K. P. Y. (2022) · Springer eBooks · doi:10.1007/978-3-030-87216-8_6
Distinctions with a Difference
Hangleiter, D., Carolan, J., & Thébault, K. P. Y. (2022) · Springer eBooks · doi:10.1007/978-3-030-87216-8_2
Matsuzaki, Y., Imoto, T., & Susa, Y. (2022) · Research Square · doi:10.21203/rs.3.rs-1383320/v1 · Cited by 1
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0003
Quantum description of light–matter coupling
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0005
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0009
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0012 · Cited by 1
(2018) · SciPost Physics · doi:10.21468/scipost.report.542
Strong coupling: resonant effects
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0007
Does dimensionality distinguish difficult questions?
(2013) · Journal Club for Condensed Matter Physics · doi:10.36471/jccm_may_2013_01
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0011
(2017) · SciPost Physics · doi:10.21468/scipost.report.88
(2018) · SciPost Physics · doi:10.21468/scipost.report.537
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0010
Strong Coupling: Polariton Bose Condensation
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0008
(2018) · SciPost Physics · doi:10.21468/scipost.report.544
Classical Description of Light
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.003.0002
Quantum Computing and Quantum Communication
Pulkkis, G., & Grahn, K. J. (2017) · IGI Global eBooks · doi:10.4018/978-1-5225-2255-3.ch671
Is Research Sector Innovation in Quantum Computing Disruptive?Preprint
Juszczak, M. D. (2022) · SocArXiv (OSF Preprints) · doi:10.31235/osf.io/v6rs3
A NISQ Method to Simulate Hermitian Matrix Evolution
Li, K., & Gao, P. (2022) · Entropy · doi:10.3390/e24070899
Preface to The Revised Paperback Edition
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0006
Derivation of the Landau Criterion of Superfluidity and Landau Formula
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0002
Landau Quantisation and Renormalisation of Rabi Splitting
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0003
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0004
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0005
Scattering Rates of Polariton Relaxation
Kavokin, A. V., Baumberg, J. J., Malpuech, G., & Laussy, F. P. (2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.005.0001
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0012
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0009
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0007
(2017) · Oxford University Press eBooks · doi:10.1093/oso/9780198782995.002.0011
Implementation Issues and Future Developments
Sheremet, I. A. (2022) · Springer eBooks · doi:10.1007/978-3-031-13858-4_12
The need and promise of a qualitative description of large quantum coherent structures
Zagoskin, A. M. (2023) · Low Temperature Physics · doi:10.1063/10.0016480 · Cited by 1
Self-Adaptive Gate Control for Efficient Escape From Local Minimum Energy on Invertible Logic
Onizawa, N., Yano, K., Shin, S., Fujita, H., & Hanyu, T. (2023) · IEEE Access · doi:10.1109/access.2023.3272867
“Quantum annealing [2] and quantum computing [3] have recently been developed using quantum devices to surpass classical computing systems.”
BackgroundCurve fitting on a quantum annealer for an advanced navigation method
Isserstedt, P., Jaroszewski, D., Mergenthaler, W., Paul, F., & Harrach, B. (2026) · Advances in Computational Mathematics · doi:10.1007/s10444-026-10292-w
Experience with quantum annealing computation
(2024) · Frontiers research topics · doi:10.3389/978-2-8325-5436-4
Mezzini, M., Gómez, F. C., Paulet, J. J., Calvo, H. I. D. L. C., Pascual, V., & Pelayo, F. L. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00202-y · Cited by 2
Optimization of conveyance of quantum particles by moving potential well
Morita, S., Teranishi, Y., & Miyashita, S. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.043329
Hu, Z., & Kais, S. (2025) · Annalen der Physik · doi:10.1002/andp.202500176 · Cited by 1
Cakebread, J., Jackson, W. G., Karapetyan, D., Parkes, A. J., & Özcan, E. (2025) · Algorithms · doi:10.3390/a18080516
Xu, B., Song, J., Tang, X., Luo, H., Wu, Z., Wang, R., Bo, X., & Wang, Y. (2025) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2025.3623731
“Quantum and coherent Ising machines achieve high-quality solutions by leveraging quantum superposition and photonic interactions [27], [28], [29], [30], [31].”
Deleplanque, S., Durbec, A., & Yaagoubi, A. E. (2025) · Optimization and Engineering · doi:10.1007/s11081-025-10047-4
On Spin-inspired Realization of Quantum and Probabilistic Computing
Sutton, B. (2019) · Purdue e-Pubs (Purdue University System) · doi:10.25394/pgs.10058600
Additional file 1 of Quantum annealing-aided design of an ultrathin-metamaterial optical diode
Kim, S., Park, S.-J., Moon, S., Zhang, Q., Hwang, S., Kim, S.-K., Luo, T., & Lee, E. (2024) · Figshare · doi:10.6084/m9.figshare.25792797
Quantum Computing Algorithms for Graph Colouring Problem
Suvarchala, K., Sekhar, K. R., Rakesh, R., & Surya, S. M. (2025) · Information systems engineering and management · doi:10.1007/978-3-031-97709-1_29
Endo, S., Kawakatsu, S., Matsuyama, H., Suzuki, K., & Matsuzaki, Y. (2025) · Japanese Journal of Applied Physics · doi:10.35848/1347-4065/ae2cd3
A Quantum Ising Model for Solving Sudoku Puzzles
Wang, W.-L., Tang, M.-H., Hussain, S., & Wang, K. (2026) · Communications in computer and information science · doi:10.1007/978-3-032-08977-9_26
Readout of phase states in Josephson parametric oscillators using adiabatic quantum flux parametron
Shen, H., & Yoshikawa, N. (2026) · Superconductor Science and Technology · doi:10.1088/1361-6668/ae330d
“The D-wave quantum annealer has attracted significant attention for its capabilities in both quantum annealing and adiabatic quantum computing [1–3].”
Onizawa, N., Kubuta, T., Shin, D., & Hanyu, T. (2026) · IEEE Access · doi:10.1109/access.2026.3651741 · Cited by 1
Maruyama, N., Ohzeki, M., & Tanaka, K. (2026) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.95.034001 · Cited by 1
A Survey of Quantum Computing: Foundations, Challenges, and Emerging DirectionsPreprint
Hassan, M. R., Mahmoud, T. M., & Kaabouch, N. (2026) · doi:10.36227/techrxiv.177223090.01125198/v1
Quantum Optimization of Event-Driven Neuromorphic Systems
Dour, S. (2026) · Advances in computational intelligence and robotics book series · doi:10.4018/979-8-3373-7779-7.ch012
Ji, N., Zheng, G., Zhang, J., Krikidis, I., & Wong, K. (2026) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2026.3672548 · Cited by 1
“[47].”
Optimality and annealing path planning of dynamical analog solvers
Zhou, S. X., Wong, K. Y. M., Wang, J., Hui, D. S. W., Ebler, D., & Sun, J. (2026) · Physical Review Research · doi:10.1103/m13m-ys1l
Quantum optimization for the Physician Scheduling Problem
Mlaouhi, B., Ahabchane, C., & Benslimen, I. (2025) · International Conference on Embedded Systems and Artificial Intelligence (ESAI) · doi:10.1109/esai67033.2025.11438759
“While each method faces unique challenges—such as parameter optimization in QAOA or hardware connectivity in QA both represent viable and complementary strategies for solving high-dimensional combinatorial problems with current quantum technologies [16].”
Kong, Y., Lu, A., Liu, H., Garg, V., Wahabzada, R., Li, H., Young, I. A., & Yu, S. (2026) · npj Unconventional Computing · doi:10.1038/s44335-026-00060-w
Modeling of deformation twinning in BCC metals via quantum annealing
dos Santos, L. C. P., Dollmann, A., Greiner, C., Grüner, D., Bouar, Y. L., & Spatschek, R. (2026) · Discover Materials · doi:10.1007/s43939-026-00612-8
“This Hamiltonian is then changed adiabatically at cryogenic temperatures to the desired, final problem Hamiltonian, ideally staying in the ground state throughout this transformation [53, 54] and therefore enabling an efficient global energy minimization.”
An improved simulated bifurcation algorithm for hot rolling mill production scheduling
Shuang, F., Lu, Y., Gao, F., Wang, Y., & Lan, J. (2026) · International Journal of Production Research · doi:10.1080/00207543.2026.2649379
“Exact Belief Propagation is a message-passing algorithm that computes marginal probabilities over graphical structures and yields exact results when applied to tree-structured graphs (Boixo et al. 2014).”
Étude des performances des machines à recuit quantique pour la résolution de problèmes combinatoires
Vert, D. (2021) · theses.fr (ABES) · doi:10.70675/785ae50cz79e3z4923zb9a6zfd30be202ce4 · Cited by 1
Multi-tasking through quantum annealing
Artag, J., Awaya, K., Kanezashi, T., Tsukayama, D., Shimada, M., & Shirakashi, J. (2026) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-026-00504-z
“This model is specifically suited for solving problems formulated as quadratic unconstrained binary optimization (QUBO)[8].”
Performance evaluation and control improvements for solving optimization problems on NISQ platforms
Gilbert, V. (2024) · theses.fr (ABES) · doi:10.70675/81f9c638z5867z40e4zaed8ze9824ff5a163 · Cited by 1
Penalty-free quantum algorithm to find energy eigenstates
Ma, N., Dai, H., & Gong, J. (2026) · Physical Review A · doi:10.1103/25rr-mpyj
“For example, in low-temperature physics [7, 8], low-lying energy eigenstates dominate the physical behavior, whereas in quantum annealing [9, 10], the minimum energy gap between the ground state and the first excited state determines the adiabaticity of the annealing protocol.”
Adiabatic Quantum Computing and Quantum Annealing
Chopard, B., & Tomassini, M. (2026) · Natural computing series · doi:10.1007/978-981-95-6216-9_15
A Study on Dynamic Optimization Methods of Annealing Coefficients in Quantum Computing
Guixiang, J. I. N., Jin, Z., & MATSUKAWA, H. (2026) · Innovation and supply chain management · doi:10.14327/iscm.20.11
Compressed High-Order Ising Machines
Hutchinson, G. H., Bhattacharya, T., Kwon, D., Böhm, F., Pedretti, G., Vaerenbergh, T. V., Beausoleil, R. G., Heittmann, A., Strachan, J. P., & Strukov, D. B. (2026) · IEEE Journal on Emerging and Selected Topics in Circuits and Systems · doi:10.1109/jetcas.2026.3690185
“Various architectures and device technologies have been explored as hardware-accelerated combinatorial optimization solvers [11], including optical [30], quantum [31], analog [32], [33] and digital electronic [34] technologies.”
Role of overparametrization in quantum approximate optimization
Rabinovich, D., Kardashin, A., & Adhikary, S. (2026) · Physical Review A · doi:10.1103/m1d6-1v47 · Cited by 4
“With long enough circuits, QAOA is capable of approximating the adiabatic evolution, thus guaranteeing success [38–40].”
A Simple Introduction to Quantum Annealing in Antennas and Propagation
Migliore, M. D. (2026) · Electronics · doi:10.3390/electronics15112390
A Highly-Scalable and Full-Connected SOT P-Bit Ising Annealer for Combinatorial Optimization
Wang, H. M., Du, H., Di, Y., Ding, Z., Su, J., Zhang, J., Yu, M., Si, X., Liu, B., Cui, Y., et al. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11563030
“Ising model-based physical computing offers a promising path forward, with hardware implementations including quantum annealers [3] [4], coherent Ising machines [5] [6] [7], CMOS [8] [9] [10] [11], RRAM [12] [13], and MTJ [14] [15] [16] [17] [18] based approaches.”
FPGA-Based Dense-Sparse Adaptive Simulated Bifurcation Ising Machine for MAX-CUT Problems
Peng, Y., Wang, C., Zhao, Y., & Xiong, S. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562489
Network-based prediction of drug combinations with quantum annealing
Ramos, D., Coutinho, B. C., & Magano, D. (2026) · Quantum Machine Intelligence · doi:10.1007/s42484-026-00411-7 · Cited by 1
Quantum annealing: optimisation, sampling, and many-body dynamics
Abel, S. A., Constantin, A., & Nutricati, L. A. (2026) · Contemporary Physics · doi:10.1080/00107514.2026.2675146 · Cited by 1
“For this reason, metrics such as TTS are defined statistically and estimated by averaging over many repeated runs and many problem instances [23, 24].”
Sampei, H. (2026) · Institutional Repositories DataBase (IRDB) · doi:10.20556/0002008370
Quantum Communication Infrastructure Cost Optimization Using a Genetic Algorithm
Njanda, A. J. N., Souza, E. E. P. D., Júnior, R. C. D. A. A., Tomkelski, A. A., & Assis, K. D. R. (2026) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2026.3714062
Quantum Annealing Applications for Power Grid Modernization
Christeson, T. (2025) · Digital Commons - DU (University of Denver) · doi:10.56902/etdcrp.2025.223
Vij, P., Dash, S. S., & Mishra, A. (2022) · Bioinfo Chem · doi:10.25163/bioinformatics.4110727
Zhang, W., Luo, L., Zheng, Y., & Ruan, Z. (2026) · Laser & Photonics Review · doi:10.1002/lpor.71989
Dang, T., Lysenko, A., & Tsunoda, T. (2026) · SSRN Electronic Journal · doi:10.2139/ssrn.7597213
Device‐to‐System Perspectives on Scalable Ising Machines for Physics‐Driven Computing
Youn, S., Hwang, H., Lee, J., 서희수, & Kim, S. (2026) · Advanced Quantum Technologies · doi:10.1002/qute.70519
“Subsequent experimental investigations provided strong evidence supporting the quantum nature of the system, including observations of quantum effects in multi-qubit dynamics and quantum correlations [ 30, 31 ].”
Komputery kwantowe : osiągnięcia i problemy
Nowakowski, W. (2013) · Elektronika : konstrukcje, technologie, zastosowania
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.