The DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Quantum Optimization of Fully Connected Spin Glasses
Open accessAbstract
Quantum computing promises to be more efficient and significantly faster than today's classical computing. Researchers compare the performance of a quantum annealer with that of classical algorithms for the first time on hard spin-glass problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Since the number of random couplings scales as M 2 it is necessary to rescale the coupling strength to ensure extensive energy (correct scaling behavior) 71 ; we rescale couplers as J ij → Jij √ M/4 for every i in A and j in B.”
From Beyond-classical computation in quantum simulation (2025) · cites this paper as [71]
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
Solvable Model of a Spin-Glass
Sherrington, D., & Kirkpatrick, S. (1975) · Physical Review Letters · doi:10.1103/physrevlett.35.1792 · Cited by 3,577
Collective Monte Carlo Updating for Spin Systems
Ulli Wolff, A. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.361 · Cited by 2,564
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
Exchange Monte Carlo Method and Application to Spin Glass Simulations
Hukushima, K., & Nemoto, K. (1995) · Journal of the Physical Society of Japan · doi:10.1143/jpsj.65.1604 · Cited by 2,223
Quantum 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
Exchange Monte Carlo method and application to spin glass simulationsPreprint
Hukushima, K., & Nemoto, K. (1996) · Cited by 1,645
Evidence for quantum annealing with more than one hundred qubits
Boixo, S., Rønnow, T. F., Isakov, S. V., Wang, Z., Wecker, D., Lidar, D. A., Martinis, J. M., & Troyer, M. (2014) · Nature Physics · doi:10.1038/nphys2900 · Cited by 810
Theory 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
Defining and detecting quantum speedup
Rønnow, T. F., Wang, Z., Job, J., Boixo, S., Isakov, S. V., Wecker, D., Martinis, J. M., Lidar, D. A., & Troyer, M. (2014) · Science · doi:10.1126/science.1252319 · Cited by 601 · cited 5×
“For these reasons groups around the world have started to experimentally benchmark the machine [9–11], nurturing a lively discussion on whether the device is making functional use of quantum mechanics for computation [12] and how to properly measure speedups between different computational/experimental algorithms [13,…”
BackgroundMethodInfluential
Flagged first, then by citations
Cited by
Sorted by citations
Perspectives of quantum annealing: methods and implementations
Hauke, P., Katzgraber, H. G., Lechner, W., Nishimori, H., & Oliver, W. D. (2020) · Reports on Progress in Physics · doi:10.1088/1361-6633/ab85b8 · Cited by 507
Traffic Flow Optimization Using a Quantum Annealer
Neukart, F., Compostella, G., Seidel, C., Dollen, D. V., Yarkoni, S., & Parney, B. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00029 · Cited by 470
Physics-Inspired Optimization for Quadratic Unconstrained Problems Using a Digital Annealer
Aramon, M., Rosenberg, G., Valiante, E., Miyazawa, T., Tamura, H., & Katzgraber, H. G. (2019) · Frontiers in Physics · doi:10.3389/fphy.2019.00048 · Cited by 442
What is the Computational Value of Finite-Range Tunneling?
Denchev, V. S., Boixo, S., Isakov, S. V., Ding, N., Babbush, R., Smelyanskiy, V., Martinis, J., & Neven, H. (2016) · Physical Review X · doi:10.1103/physrevx.6.031015 · Cited by 399
Self-citationQuantum annealing for industry applications: introduction and review
Yarkoni, S., Raponi, E., Bäck, T., & Schmitt, S. (2022) · Reports on Progress in Physics · doi:10.1088/1361-6633/ac8c54 · Cited by 341
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · Science Advances · doi:10.1126/sciadv.aau0823 · Cited by 366
Self-citationHamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2019) · CaltechAUTHORS (California Institute of Technology) · Cited by 257
Self-citationZhang, Z., & Zhuang, Q. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abd4c3 · Cited by 283
Computational multiqubit tunnelling in programmable quantum annealers
Boixo, S., Smelyanskiy, V., Shabani, A., Isakov, S. V., Dykman, M. I., Denchev, V. S., Amin, M. H. S., Smirnov, A. Y., Mohseni, M., & Neven, H. (2016) · Nature Communications · doi:10.1038/ncomms10327 · Cited by 232
Self-citationReverse quantum annealing approach to portfolio optimization problems
Venturelli, D., & Kondratyev, A. (2019) · Quantum Machine Intelligence · doi:10.1007/s42484-019-00001-w · Cited by 233
Self-citationA case study in programming a quantum annealer for hard operational planning problems
Rieffel, E. G., Venturelli, D., O’Gorman, B., Do, M. B., Prystay, E. M., & Smelyanskiy, V. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0892-x · Cited by 221
Self-citationLi, R. Y., Di Felice, R., Rohs, R., & Lidar, D. A. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0060-8 · Cited by 202
Ajagekar, A., Humble, T., & You, F. (2020) · Computers & Chemical Engineering · doi:10.1016/j.compchemeng.2019.106630 · Cited by 191
“The probability of recovering the global optimal solution is highly dependent on the embedding and annealing schedule [37, 38].”
BackgroundOpen source software in quantum computing
Fingerhuth, M., Babej, T., & Wittek, P. (2018) · PLoS ONE · doi:10.1371/journal.pone.0208561 · Cited by 188
Application of Quantum Annealing to Training of Deep Neural Networks
Adachi, S. H., & Henderson, M. P. (2015) · arXiv · doi:10.48550/arxiv.1510.06356 · Cited by 176
Quantum annealing: an overview
Rajak, A., Suzuki, S., Dutta, A., & Chakrabarti, B. K. (2022) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.2021.0417 · Cited by 182
Probing for quantum speedup in spin-glass problems with planted solutions
Hen, I., Job, J., Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042325 · Cited by 165
Fast clique minor generation in Chimera qubit connectivity graphs
Boothby, T., King, A. D., & Roy, A. (2015) · Quantum Information Processing · doi:10.1007/s11128-015-1150-6 · Cited by 171
Searching for quantum speedup in quasistatic quantum annealers
Amin, M. H. S. (2015) · Physical Review A · doi:10.1103/physreva.92.052323 · Cited by 154
Quantum-Assisted Learning of Hardware-Embedded Probabilistic Graphical Models
Benedetti, M., Realpe-Gómez, J., Biswas, R., & Perdomo‐Ortiz, A. (2017) · Physical Review X · doi:10.1103/physrevx.7.041052 · Cited by 172
Self-citationApplication 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
Prospects for quantum enhancement with diabatic quantum annealing
Crosson, E., & Lidar, D. A. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00313-6 · Cited by 153
Beyond-classical computation in quantum simulation
King, A. D., Nocera, A., Rams, M. M., Dziarmaga, J., Wiersema, R., Bernoudy, W., Raymond, J., Kaushal, N., Heinsdorf, N., Harris, R., et al. (2025) · Science · doi:10.1126/science.ado6285 · Cited by 138
Mandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 108
Self-citationQuantum 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 99
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 101
Exponential Enhancement of the Efficiency of Quantum Annealing by Non-Stoquastic Hamiltonians
Nishimori, H., & Takada, K. (2017) · Frontiers in ICT · doi:10.3389/fict.2017.00002 · Cited by 95
Quantum annealing correction with minor embedding
Vinci, W., Albash, T., Paz-Silva, G. A., Hen, I., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042310 · Cited by 96
A NASA perspective on quantum computing: Opportunities and challenges
Biswas, R., Zhang, J., Kechezhi, K., Knysh, S., Mandrà, S., O’Gorman, B., Perdomo‐Ortiz, A., Petukhov, A. G., Realpe-Gómez, J., Rieffel, E. G., et al. (2016) · Parallel Computing · doi:10.1016/j.parco.2016.11.002 · Cited by 102
Self-citationQuantum Annealing amid Local Ruggedness and Global Frustration
King, J., Yarkoni, S., Raymond, J., Ozfidan, I., King, A. D., Nevisi, M. M., Hilton, J., & McGeoch, C. C. (2019) · Journal of the Physical Society of Japan · doi:10.7566/jpsj.88.061007 · Cited by 114
Bayesian network structure learning using quantum annealing
O’Gorman, B., Babbush, R., Perdomo‐Ortiz, A., Aspuru‐Guzik, A., & Smelyanskiy, V. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02349-9 · Cited by 92
Self-citationA QUBO Model for the Traveling Salesman Problem with Time Windows
Papalitsas, C., Andronikos, T., Giannakis, K., Theocharopoulou, G., & Fanarioti, S. (2019) · Algorithms · doi:10.3390/a12110224 · Cited by 98
Mapping Constrained Optimization Problems to Quantum Annealing with Application to Fault Diagnosis
Bian, Z., Chudak, F. A., Israel, R. B., Lackey, B., Macready, W. G., & Roy, A. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00014 · Cited by 91
Seeking 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) · OakTrust (Texas A&M University Libraries) · Cited by 86
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
Self-citationEfficiently embedding QUBO problems on adiabatic quantum computers
Date, P., Patton, R. M., Schuman, C. D., & Potok, T. E. (2019) · Quantum Information Processing · doi:10.1007/s11128-019-2236-3 · Cited by 82
Scaling and Diabatic Effects in Quantum Annealing with a D-Wave Device
Weinberg, P., Tylutki, M., Rönkkö, J., Westerholm, J., Åström, J. A., Manninen, P., Törmä, P., & Sandvik, A. W. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090502 · Cited by 79
Benchmarking 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
Chancellor, N., Zohren, S., & Warburton, P. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0022-6 · Cited by 72
Multivariable optimization: Quantum annealing and computation
Mukherjee, S., & Chakrabarti, B. K. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02339-y · Cited by 77
Multiple query optimization on the D-Wave 2X adiabatic quantum computer
Trummer, I., & Koch, C. E. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/2947618.2947621 · Cited by 81
A quantum annealing approach for fault detection and diagnosis of graph-based systems
Perdomo‐Ortiz, A., Fluegemann, J., Narasimhan, S., Biswas, R., & Smelyanskiy, V. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02347-y · Cited by 84
Self-citationZhu, Z., Ochoa, A. J., Schnabel, S., Hamze, F., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.93.012317 · Cited by 74
Mandrà, S., Zhu, Z., & Katzgraber, H. G. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.070502 · Cited by 72
Self-citationDeploying a quantum annealing processor to detect tree cover in aerial imagery of California
Boyda, E., Basu, S., Ganguly, S., Michaelis, A., Mukhopadhyay, S., & Nemani, R. (2017) · PLoS ONE · doi:10.1371/journal.pone.0172505 · Cited by 63
Genome assembly using quantum and quantum-inspired annealing
Boev, A. S., Rakitko, A. S., Usmanov, S. R., Kobzeva, A. N., Popov, I. V., Ilinsky, V. V., Kiktenko, E. O., & Fedorov, A. K. (2021) · Scientific Reports · doi:10.1038/s41598-021-88321-5 · Cited by 63
Engineering Reflective Metasurfaces With Ising Hamiltonian and Quantum Annealing
Ross, C., Gradoni, G., Lim, Q. J., & Peng, Z. (2021) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2021.3137424 · Cited by 64
Towards practical applications in quantum computational biology
Fedorov, A. K., & Gelfand, M. S. (2021) · Nature Computational Science · doi:10.1038/s43588-021-00024-z · Cited by 62
Global Warming: Temperature Estimation in Annealers
Raymond, J., Yarkoni, S., & Andriyash, E. (2016) · Frontiers in ICT · doi:10.3389/fict.2016.00023 · Cited by 62
Dissipation in adiabatic quantum computers: lessons from an exactly solvable model
Keck, M., Montangero, S., Santoro, G. E., Fazio, R., & Rossini, D. (2017) · New Journal of Physics · doi:10.1088/1367-2630/aa8cef · Cited by 58
Nested quantum annealing correction
Vinci, W., Albash, T., & Lidar, D. A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2016.17 · Cited by 57
Reverse quantum annealing of the p -spin model with relaxation
Passarelli, G., Yip, K.-W., Lidar, D. A., Nishimori, H., & Lucignano, P. (2020) · Physical Review A · doi:10.1103/physreva.101.022331 · Cited by 55
Quantum machine learning and quantum biomimetics: A perspective
Lamata, L. (2020) · Machine Learning Science and Technology · doi:10.1088/2632-2153/ab9803 · Cited by 59
Short-depth QAOA circuits and quantum annealing on higher-order ising models
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00825-w · Cited by 49
Maximum-Entropy Inference with a Programmable Annealer
Chancellor, N., Szőke, S., Vinci, W., Aeppli, G., & Warburton, P. A. (2016) · Scientific Reports · doi:10.1038/srep22318 · Cited by 47
Uncertain fate of fair sampling in quantum annealing
Könz, M. S., Mazzola, G., Ochoa, A. J., Katzgraber, H. G., & Troyer, M. (2019) · Physical Review A · doi:10.1103/physreva.100.030303 · Cited by 49
Determination and correction of persistent biases in quantum annealers
Perdomo‐Ortiz, A., O’Gorman, B., Fluegemann, J., Biswas, R., & Smelyanskiy, V. (2016) · Scientific Reports · doi:10.1038/srep18628 · Cited by 45
Self-citationThermalization, Freeze-out, and Noise: Deciphering Experimental Quantum Annealers
Marshall, J., Rieffel, E. G., & Hen, I. (2017) · Physical Review Applied · doi:10.1103/physrevapplied.8.064025 · Cited by 44
Analog errors in Ising machines
Albash, T., Martín-Mayor, V., & Hen, I. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab13ea · Cited by 47
Enhancing quantum annealing performance for the molecular similarity problem
Hernandez, M., & Aramon, M. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1586-y · Cited by 42
Quantum-enhanced greedy combinatorial optimization solver
Dupont, M., Evert, B., Hodson, M. J., Sundar, B., Jeffrey, S., Yamaguchi, Y., Feng, D., Maciejewski, F. B., Hadfield, S., Alam, M. S., et al. (2023) · Science Advances · doi:10.1126/sciadv.adi0487 · Cited by 54
Self-citationCharged particle tracking with quantum annealing optimization
Zlokapa, A., Anand, A., Vlimant, J.-R., Duarte, J. M., Job, J., Lidar, D. A., & Spiropulu, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-021-00054-w · Cited by 42
Embedding Overhead Scaling of Optimization Problems in Quantum Annealing
Könz, M. S., Lechner, W., Katzgraber, H. G., & Troyer, M. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040322 · Cited by 43
Constructing SAT Filters with a Quantum Annealer
Douglass, A., King, A. D., & Raymond, J. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24318-4_9 · Cited by 41
Systematic and deterministic graph minor embedding for Cartesian products of graphs
Zaribafiyan, A., Marchand, D. J. J., & Rezaei, S. S. C. (2017) · Quantum Information Processing · doi:10.1007/s11128-017-1569-z · Cited by 39
Algorithm engineering for a quantum annealing platform
King, A. D., & McGeoch, C. C. (2014) · arXiv · doi:10.48550/arxiv.1410.2628 · Cited by 39
Mean Field Analysis of Quantum Annealing Correction
Matsuura, S., Nishimori, H., Albash, T., & Lidar, D. A. (2016) · Physical Review Letters · doi:10.1103/physrevlett.116.220501 · Cited by 38
Scaling Advantage in Approximate Optimization with Quantum Annealing
Munoz-Bauza, H., & Lidar, D. A. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.160601 · Cited by 46
Job, J., & Lidar, D. A. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aabd9b · Cited by 34
A Fully-Connected Ising Model Embedding Method and Its Evaluation for CMOS Annealing Machines
Oku, D., Terada, K., HAYASHI, M., Yamaoka, M., Tanaka, S., & Togawa, N. (2019) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2018edp7411 · Cited by 33
Practical engineering of hard spin-glass instances
Marshall, J., Martín-Mayor, V., & Hen, I. (2016) · Physical Review A · doi:10.1103/physreva.94.012320 · Cited by 31
Towards quantum belief propagation for LDPC decoding in wireless networks
Kasi, S., & Jamieson, K. (2020) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3372224.3419207 · Cited by 33
Solving the resource constrained project scheduling problem with quantum annealing
Armas, L. F. P., Creemers, S., & Deleplanque, S. (2024) · Scientific Reports · doi:10.1038/s41598-024-67168-6 · Cited by 39
Quantum-Enhanced Reinforcement Learning for Finite-Episode Games with Discrete State Spaces
Neukart, F., Dollen, D. V., Seidel, C., & Compostella, G. (2018) · Frontiers in Physics · doi:10.3389/fphy.2017.00071 · Cited by 31
Combinatorial Optimization on Gate Model Quantum Computers: A Survey
Zahedinejad, E., & Zaribafiyan, A. (2017) · arXiv · doi:10.48550/arxiv.1708.05294 · Cited by 29
The pitfalls of planar spin-glass benchmarks: raising the bar for quantum annealers (again)
Mandrà, S., Katzgraber, H. G., & Thomas, C. (2017) · Quantum Science and Technology · doi:10.1088/2058-9565/aa7877 · Cited by 35
Self-citationImproving the Solving of Optimization Problems: A Comprehensive Review of Quantum Approaches
Volpe, D., Orlandi, G., & Turvani, G. (2025) · Quantum Reports · doi:10.3390/quantum7010003 · Cited by 32
Pelofske, E. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/adb029 · Cited by 31
Degeneracy, degree, and heavy tails in quantum annealing
King, A. D., Hoskinson, E., Lanting, T. M., Andriyash, E., & Amin, M. H. S. (2016) · Physical Review A · doi:10.1103/physreva.93.052320 · Cited by 27
Direct comparison of quantum and simulated annealing on a fully connected Ising ferromagnet
Wauters, M. M., Fazio, R., Nishimori, H., & Santoro, G. E. (2017) · Physical Review A · doi:10.1103/physreva.96.022326 · Cited by 29
Simulated-quantum-annealing comparison between all-to-all connectivity schemes
Albash, T., Vinci, W., & Lidar, D. A. (2016) · Physical Review A · doi:10.1103/physreva.94.022327 · Cited by 27
Open-System Quantum Annealing in Mean-Field Models with Exponential Degeneracy
Kechedzhi, K., & Smelyanskiy, V. (2016) · Physical Review X · doi:10.1103/physrevx.6.021028 · Cited by 28
Self-citationOptimally Stopped Optimization
Vinci, W., & Lidar, D. A. (2016) · Physical Review Applied · doi:10.1103/physrevapplied.6.054016 · Cited by 27
Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis
Sandia National Laboratories (SNL), A., Parekh, O., Administration, U. A. S. F. H. R. A., Wendt, J., Shulenburger, L., Landahl, A. J., Moussa, J. E., & Aidun, J. B. (2015) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/1459086 · Cited by 30
Sugie, Y., Yoshida, Y., Mertig, N., Takemoto, T., Teramoto, H., Nakamura, A., Takigawa, I., Minato, S.-I., Yamaoka, M., & Komatsuzaki, T. (2021) · Soft Computing · doi:10.1007/s00500-020-05502-6 · Cited by 26
Parameter setting for quantum annealers
Pudenz, K. L. (2016) · IEEE High Performance Extreme Computing Conference · doi:10.1109/hpec.2016.7761619 · Cited by 25
Equation Planting: A Tool for Benchmarking Ising Machines
Hen, I. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.011003 · Cited by 25
A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum AnnealingPreprint
Abbott, A. A., Calude, C. S., Dinneen, M. J., & Hua, R. (2018) · ResearchSpace (University of Auckland) · doi:10.48550/arxiv.1803.04340 · Cited by 22
Quadratic Unconstrained Binary Optimization via Quantum-Inspired Annealing
Bowles, J., Dauphin, A., Huembeli, P., Martinez, J., & Acín, A. (2022) · Physical Review Applied · doi:10.1103/physrevapplied.18.034016 · Cited by 23
Advancing CMOS-Type Ising Arithmetic Unit into the Domain of Real-World Applications
Zhang, J., Chen, S., & Wang, Y. (2017) · IEEE Transactions on Computers · doi:10.1109/tc.2017.2775618 · Cited by 23
Jiang, D., Wang, X., Huang, Z., Yang, Y., & Yao, E. (2023) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2023.3263923 · Cited by 22
How to Reduce the Bit-Width of an Ising Model by Adding Auxiliary Spins
Oku, D., Tawada, M., Tanaka, S., & Togawa, N. (2020) · IEEE Transactions on Computers · doi:10.1109/tc.2020.3045112 · Cited by 24
Nested quantum annealing correction at finite temperature: p -spin models
Matsuura, S., Nishimori, H., Vinci, W., & Lidar, D. A. (2019) · Physical Review A · doi:10.1103/physreva.99.062307 · Cited by 21
Solving Set Cover with Pairs Problem using Quantum Annealing
Cao, Y., Jiang, S., Perouli, D., & Kais, S. (2016) · Scientific Reports · doi:10.1038/srep33957 · Cited by 21
Quantum adiabatic machine learning by zooming into a region of the energy surface
Zlokapa, A., Mott, A., Job, J., Vlimant, J.-R., Lidar, D. A., & Spiropulu, M. (2020) · Physical Review A · doi:10.1103/physreva.102.062405 · Cited by 27
Accelerating Scientific Computing in the Post-Moore’s Era
Hamilton, K. E., Schuman, C. D., Young, S. R., Bennink, R. S., Imam, N., & Humble, T. S. (2020) · ACM Transactions on Parallel Computing · doi:10.1145/3380940 · Cited by 24
Quantum-Assisted Cluster Analysis on a Quantum Annealing Device
Neukart, F., Dollen, D. V., & Seidel, C. (2018) · Frontiers in Physics · doi:10.3389/fphy.2018.00055 · Cited by 27
Benchmarking embedded chain breaking in quantum annealing *
Grant, E., & Humble, T. S. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac26d2 · Cited by 22
Perils of embedding for sampling problems
Marshall, J., Gioacchino, A. D., & Rieffel, E. G. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023020 · Cited by 18
Quantum annealing for vehicle routing problem with weighted segment
Tambunan, T. D., Suksmono, A. B., Edward, I. J. M., & Mulyawan, R. (2023) · AIP conference proceedings · doi:10.1063/5.0178362 · Cited by 22
Metadata
- Authors
- Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V.
- Affiliations
- Ames Research Center (US)
- Google (United States) (US)
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2015-09-18
- Volume
- 5
- Issue
- 3
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W1553502100
- Cited by
- 209
- References
- 35
- Citations by year
- 2026: 6 · 2025: 19 · 2024: 19 · 2023: 15 · 2022: 14 · 2021: 19 · 2020: 19 · 2019: 23 · 2018: 15 · 2017: 18 · 2016: 21 · 2015: 19
- FWCI
- 23.86
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- Physical Review X (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- arXiv (Cornell University)
- Funders
- National Aeronautics and Space Administration (NNX14AF62G, NNX12AK33A)
- Office of the Director of National Intelligence
- Intelligence Advanced Research Projects Activity
- AFRL Information Directorate (F4HBKC4162G001)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Condensed Matter Physics › Theoretical and Computational Physics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, spin glass, combinatorial optimization, quantum annealers, hard optimization problems
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
