A deceptive step towards quantum speedup detection
Open accessAbstract
There have been multiple attempts to design synthetic benchmark problems with the goal of detecting quantum speedup in current quantum annealing (QA) machines. To date, classical heuristics have consistently outperformed quantum annealing based approaches. Here we introduce a class of problems based on frustrated cluster loops—deceptive cluster loops—for which all currently known state of-the-art classical heuristics are outperformed by the DW2000Q QA machine. While there is a sizable constant speedup over all known classical heuristics, a noticeable improvement in the scaling remains elusive. These results represent the first steps towards a detection of potential quantum speedup, albeit without a scaling improvement and for synthetic benchmark problems.
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
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 performance of PT-ICM can be problem-dependent.
“However, the performance of PT-ICM can be problem-dependent 30 .”
From Quantum annealing for combinatorial optimization: a benchmarking study (2025) · cites this paper as [30]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
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 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
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 · see citing works
<i>Colloquium</i> : Quantum annealing and analog quantum computation
Das, A., & Chakrabarti, B. K. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1061 · Cited by 700 · see citing works
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 698 · see citing works
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 2× · see citing works
“There have been multiple attempts to define quantum speedup [7, 8], as well as quantify any “quantumness” and problem-solving efficacy of current commercially-available quantum annealers [7, 9–22].”
BackgroundBlossom V: a new implementation of a minimum cost perfect matching algorithm
Kolmogorov, V. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0002-8 · Cited by 416 · see citing works
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 · cited 1× · see citing works
“Unfortunately, however, in all planted problems [15, 18, 21] used to date, as well as problems that use gadgets [20], the underlying logical”
BackgroundMathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381 · see citing works
Architectural Considerations in the Design of a Superconducting Quantum Annealing Processor
Bunyk, P. I., Hoskinson, E., Johnson, M. W., Tolkacheva, E., Altomare, F., Berkley, A. J., Harris, R., Hilton, J. P., Lanting, T., Przybysz, A. J., et al. (2014) · IEEE Transactions on Applied Superconductivity · doi:10.1109/tasc.2014.2318294 · Cited by 356 · see citing works
Optimization using quantum mechanics: quantum annealing through adiabatic evolution
Santoro, G. E., & Tosatti, E. (2006) · Journal of Physics A: Mathematical and General · doi:10.1088/0305-4470/39/36/r01 · Cited by 354 · see citing works
Thermally assisted quantum annealing of a 16-qubit problem
Dickson, N. G., Johnson, M. W., Amin, M. H. S., Harris, R., Altomare, F., Berkley, A. J., Bunyk, P., Cai, J., Chapple, E. M., Chavez, P., et al. (2013) · Nature Communications · doi:10.1038/ncomms2920 · Cited by 224 · see citing works
Quantum versus classical annealing of Ising spin glasses
Heim, B., Rønnow, T. F., Isakov, S. V., & Troyer, M. (2015) · Science · doi:10.1126/science.aaa4170 · Cited by 215 · see citing works
Quantum Optimization of Fully Connected Spin Glasses
Venturelli, D., Mandrà, S., Knysh, S., O’Gorman, B., Biswas, R., & Smelyanskiy, V. (2015) · Physical Review X · doi:10.1103/physrevx.5.031040 · Cited by 209 · see citing works
Self-citationProbing 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 · see citing works
Katzgraber, H. G., Hamze, F., & Andrist, R. S. (2014) · Physical Review X · doi:10.1103/physrevx.4.021008 · Cited by 145 · see citing works
Self-citationDecoherence in adiabatic quantum computation
Albash, T., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.91.062320 · Cited by 142 · see citing works
Quantum annealing by the path-integral Monte Carlo method: The two-dimensional random Ising model
Martoňák, R., Santoro, G. E., & Tosatti, E. (2002) · Physical review. B, Condensed matter · doi:10.1103/physrevb.66.094203 · Cited by 140 · see citing works
Efficient Cluster Algorithm for Spin Glasses in Any Space Dimension.
Zhu, Z., Ochoa, A., & Katzgraber, H. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.077201 · Cited by 126 · see citing works
Self-citationA case study and critical assessment in calculating power usage effectiveness for a data centre
Brady, G. A., Kapur, N., Summers, J. L., & Thompson, H. M. (2013) · Energy Conversion and Management · doi:10.1016/j.enconman.2013.07.035 · Cited by 116 · see citing works
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) · Physical Review X · doi:10.1103/physrevx.5.031026 · Cited by 112 · see citing works
Self-citationMandrà, S., Zhu, Z., Wang, W., Perdomo‐Ortiz, A., & Katzgraber, H. G. (2016) · Physical Review A · doi:10.1103/physreva.94.022337 · Cited by 108 · see citing works
Self-citationAlbash, 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 · see citing works
Decoherence in adiabatic quantum computation
Amin, M. H. S., Averin, D. V., & Nesteroff, J. A. (2009) · Physical Review A · doi:10.1103/physreva.79.022107 · Cited by 88 · see citing works
Unraveling Quantum Annealers using Classical Hardness
Martin-Mayor, V., & Hen, I. (2015) · Scientific Reports · doi:10.1038/srep15324 · Cited by 71 · see citing works
Thermalization, 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 · see citing works
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 · see citing works
Self-citationPractical 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 · see citing works
Performance of a quantum annealer on range-limited constraint satisfaction problemsPreprint
King, A. D., Lanting, T., & Harris, R. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.02098 · Cited by 28 · see citing works
Bond chaos in spin glasses revealed through thermal boundary conditions
Wang, W., Machta, J., & Katzgraber, H. G. (2016) · Physical review. B./Physical review. B · doi:10.1103/physrevb.93.224414 · Cited by 21 · see citing works
Self-citationMandrà, S., Guerreschi, G. G., & Aspuru‐Guzik, A. (2015) · Physical Review A · doi:10.1103/physreva.92.062320 · Cited by 17 · see citing works
Self-citationNishimura, K., Nishimori, H., Ochoa, A. J., & Katzgraber, H. G. (2016) · Physical review. E · doi:10.1103/physreve.94.032105 · Cited by 17 · see citing works
Self-citation
Flagged first, then by citations
Research works printed but not linked: 4
- [21]21. King J, Yarkoni S, Raymond J, Ozfidan I, King A D, Nevisi M M, Hilton J P and McGeoch C C 2017 Quantum annealing amid local ruggedness and global frustration arXiv:quant-phys/1701.04579
- [22]22. Albash T and Lidar D A 2017 Evidence for a limited quantum speedup on a quantum annealer arXiv:quant-phys/1705.07452
- [24]24. Hamze F and de Freitas N 2004 Proc. 20th Conf. on Uncertainty in Artificial Intelligence, UAI '04 (AUAI Press: Arlington, Virginia) p 243
- [25]25. Selby A 2014 Efficient subgraph-based sampling of Ising-type models with frustration arXiv:cond-mat/1409.3934
Cited by
Sorted by citations
Ising machines as hardware solvers of combinatorial optimization problems
Mohseni, N., McMahon, P. L., & Byrnes, T. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00440-8 · Cited by 558 · see citing works
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 · see citing works
Self-citationPhysics-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 · see citing works
Self-citationCai, F., Kumar, S., Vaerenbergh, T. V., Sheng, X., Liu, R., Li, C., Liu, Z., Foltín, M., Yu, S., Xia, Q., et al. (2020) · Nature Electronics · doi:10.1038/s41928-020-0436-6 · Cited by 390 · see citing works
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 · see citing works
Hamerly, 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 · see citing works
Reverse 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 · see citing works
Combinatorial optimization with physics-inspired graph neural networks
Schuetz, M. J. A., Brubaker, J. K., & Katzgraber, H. G. (2022) · Nature Machine Intelligence · doi:10.1038/s42256-022-00468-6 · Cited by 207 · see citing works
Self-citationBando, Y., Susa, Y., Oshiyama, H., Shibata, N., Ohzeki, M., Gómez-Ruiz, F. J., Lidar, D. A., Suzuki, S., del Campo, A., & Nishimori, H. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.033369 · Cited by 147 · see citing works
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 137 · see citing works
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125 · see citing works
Quantum 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 104 · see citing works
Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0210-7 · Cited by 74 · see citing works
Quantum computing for chemical and biomolecular product design
Andersson, M. P., Jones, M. N., Mikkelsen, K. V., You, F., & Mansouri, S. S. (2022) · Current Opinion in Chemical Engineering · doi:10.1016/j.coche.2021.100754 · Cited by 66 · see citing works
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C. C., Sathe, P., Apanavicius, J., Bernal, D. E., & Quantum Economic Development Consortium Collaboration (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3678184 · Cited by 66 · see citing works
Boundaries of quantum supremacy via random circuit sampling
Zlokapa, A., Villalonga, B., Boixo, S., & Lidar, D. A. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00703-x · Cited by 54 · see citing works
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 · see citing works
Self-citationQuantum annealing for combinatorial optimization: a benchmarking study
Kim, S., Ahn, S.-W., Suh, I.-S., Dowling, A. W., Lee, E., & Luo, T. (2025) · npj Quantum Information · doi:10.1038/s41534-025-01020-1 · Cited by 46 · see citing works
“However, the performance of PT-ICM can be problem-dependent 30 .”
Adame, J. I., & McMahon, P. L. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab935a · Cited by 46 · see citing works
Why and When Pausing is Beneficial in Quantum Annealing
Chen, H., & Lidar, D. A. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.014100 · Cited by 41 · see citing works
On the emerging potential of quantum annealing hardware for combinatorial optimization
Tasseff, B., Albash, T., Morrell, Z., Vuffray, M., Lokhov, A. Y., Misra, S., & Coffrin, C. (2024) · Journal of Heuristics · doi:10.1007/s10732-024-09530-5 · Cited by 42 · see citing works
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 · see citing works
Self-citationSolving Large Maximum Clique Problems on a Quantum Annealer
Pelofske, E., Hahn, G., & Djidjev, H. (2019) · QTOP@NetSys · doi:10.1007/978-3-030-14082-3_11 · Cited by 51 · see citing works
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 · see citing works
Comparison of QAOA with Quantum and Simulated Annealing
Streif, M., & Leib, M. (2019) · arXiv · doi:10.48550/arxiv.1901.01903 · Cited by 35 · see citing works
Quantum annealing for systems of polynomial equations
Chang, C. C., Gambhir, A. S., Humble, T. S., & Sota, S. (2019) · Scientific Reports · doi:10.1038/s41598-019-46729-0 · Cited by 36 · see citing works
Exploring Potential Applications of Quantum Computing in Transportation Modelling
Cooper, C. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2021.3132161 · Cited by 34 · see citing works
Wishart planted ensemble: A tunably rugged pairwise Ising model with a first-order phase transition
Hamze, F., Raymond, J., Pattison, C. A., Biswas, K., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.052102 · Cited by 30 · see citing works
Self-citationPhysics-inspired heuristics for soft MIMO detection in 5G new radio and beyond
Kim, M., Mandrà, S., Venturelli, D., & Jamieson, K. (2021) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/3447993.3448619 · Cited by 28 · see citing works
Self-citationCoarse-grained lattice protein folding on a quantum annealerPreprint
Babej, T., Ing, C. E., & Fingerhuth, M. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.00713 · Cited by 47 · see citing works
Scalable On-Chip Optoelectronic Ising Machine Utilizing Thin-Film Lithium Niobate Photonics
Li, Z., Gan, R., Chen, Z., Deng, Z., Gao, R., Chen, K., Guo, C., Zhang, Y., Liu, L., Yu, S., et al. (2024) · ACS Photonics · doi:10.1021/acsphotonics.4c00003 · Cited by 24 · see citing works
Equation Planting: A Tool for Benchmarking Ising Machines
Hen, I. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.12.011003 · Cited by 25 · see citing works
Harnessing Intrinsic Noise in Memristor Hopfield Neural Networks for Combinatorial OptimizationPreprint
Cai, F., Kumar, S., Vaerenbergh, T. V., Liu, R., Li, C., Yu, S., Xia, Q., Yang, J. J., Beausoleil, R. G., Lu, W. D., et al. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1903.11194 · Cited by 31 · see citing works
Ising Model Optimization Problems on a FPGA Accelerated Restricted Boltzmann MachinePreprint
Patel, S., Chen, L., Canoza, P., & Salahuddin, S. (2020) · Research Square · doi:10.21203/rs.3.rs-122016/v1 · Cited by 23 · see citing works
Computational hardness of spin-glass problems with tile-planted solutions
Perera, D., Hamze, F., Raymond, J., Weigel, M., & Katzgraber, H. G. (2020) · Physical review. E · doi:10.1103/physreve.101.023316 · Cited by 22 · see citing works
Self-citationQuantum Computing for Artificial Intelligence Based Mobile Network Optimization
Ahmed, F., & Mähönen, P. (2021) · IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC) · doi:10.1109/pimrc50174.2021.9569339 · Cited by 21 · see citing works
Approximate optimization, sampling, and spin-glass droplet discovery with tensor networks
Rams, M. M., Mohseni, M., Eppens, D., Jałowiecki, K., & Gardas, B. (2021) · Physical review. E · doi:10.1103/physreve.104.025308 · Cited by 20 · see citing works
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 · see citing works
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 22 · see citing works
Assessing and advancing the potential of quantum computing: A NASA case study
Rieffel, E. G., Asanjan, A. A., Alam, M. S., Anand, N., Bernal, D. E., Block, S., Brady, L. T., Cotton, S., Izquierdo, Z. G., Grabbe, S. R., et al. (2024) · Future Generation Computer Systems · doi:10.1016/j.future.2024.06.012 · Cited by 20 · see citing works
Self-citationGyöngyösi, L., & Imre, S. (2025) · Quantum Information and Computation · doi:10.2478/qic-2025-0006 · Cited by 18 · see citing works
Fair sampling of ground-state configurations of binary optimization problems
Zhu, Z., Ochoa, A. J., & Katzgraber, H. G. (2019) · Physical Review E · doi:10.1103/physreve.99.063314 · Cited by 17 · see citing works
Self-citationCombinatorial Clustering Based on an Externally-Defined One-Hot Constraint
Kumagai, M., Komatsu, K., Takano, F., Araki, T., Sato, M., & Kobayashi, H. (2020) · International Symposium on Computing and Networking · doi:10.1109/candar51075.2020.00015 · Cited by 17 · see citing works
Hamerly, R., Inagaki, T., McMahon, P. L., Venturelli, D., Marandi, A., Onodera, T., Ng, E., Langrock, C., Inaba, K., Honjo, T., et al. (2018) · arXiv (Cornell University) · Cited by 14 · see citing works
A molecular computing approach to solving optimization problems via programmable microdroplet arrays
Guo, S. Y., Friederich, P., Cao, Y., Wu, T., Forman, C. J., Mendoza, D., Degroote, M., Cavell, A. C., Krasecki, V. K., Hickman, R. J., et al. (2021) · Matter · doi:10.1016/j.matt.2021.03.002 · Cited by 15 · see citing works
Standard quantum annealing outperforms adiabatic reverse annealing with decoherence
Passarelli, G., Yip, K.-W., Lidar, D. A., & Lucignano, P. (2022) · Physical Review A · doi:10.1103/physreva.105.032431 · Cited by 14 · see citing works
Counterdiabatic reverse annealing
Passarelli, G., & Lucignano, P. (2023) · Physical Review A · doi:10.1103/physreva.107.022607 · Cited by 15 · see citing works
Unfolding measurement distributions via quantum annealing
Cormier, K. J. R., Sipio, R. D., & Wittek, P. (2019) · Journal of High Energy Physics · doi:10.1007/jhep11(2019)128 · Cited by 13 · see citing works
Brute-forcing spin-glass problems with CUDA
Jałowiecki, K., Rams, M. M., & Gardas, B. (2020) · Computer Physics Communications · doi:10.1016/j.cpc.2020.107728 · Cited by 12 · see citing works
From Ansätze to Z-Gates: A NASA View of Quantum Computing
Rieffel, E. G., Hadfield, S., Hogg, T., Mandrà, S., Marshall, J., Mossi, G., O’Gorman, B., Plamadeala, E., Tubman, N. M., Venturelli, D., et al. (2019) · Advances in parallel computing · doi:10.3233/apc190010 · Cited by 13 · see citing works
Self-citationDeep learning optimal quantum annealing schedules for random Ising models
Hegde, P. R., Passarelli, G., Cantele, G., & Lucignano, P. (2023) · New Journal of Physics · doi:10.1088/1367-2630/ace547 · Cited by 13 · see citing works
Principles and Guidelines for Quantum Performance Analysis
McGeoch, C. C. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_4 · Cited by 12 · see citing works
Chook -- A comprehensive suite for generating binary optimization problems with planted solutionsPreprint
Perera, D., Akpabio, I., Hamze, F., Mandrà, S., Rose, N., Aramon, M., & Katzgraber, H. G. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.14344 · Cited by 11 · see citing works
Self-citationQuantum Algorithms for the Physical Layer: Potential Applications to Physical Layer Security
Matsumine, T., Ochiai, H., & Shikata, J. (2025) · IEEE Access · doi:10.1109/access.2025.3528443 · Cited by 8 · see citing works
Bernal, D. E., Brown, R., Sathe, P., Wudarski, F., Pavone, M., Rieffel, E. G., & Venturelli, D. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-025-00311-2 · Cited by 8 · see citing works
QUBO.jl : a Julia ecosystem for quadratic unconstrained binary optimization
Xavier, P. M., Ripper, P., Andrade, T., Garcia, J. D., Maculan, N., & Bernal, D. E. (2026) · Optimization methods & software · doi:10.1080/10556788.2026.2702926 · Cited by 8 · see citing works
Efficient quantum algorithm for lattice protein folding
Wang, Y., & Zhou, X. (2024) · Quantum Science and Technology · doi:10.1088/2058-9565/ada08e · Cited by 8 · see citing works
Verifying the output of quantum optimizers with ground-state energy lower bounds
Baccari, F., Gogolin, C., Wittek, P., & Acín, A. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.043163 · Cited by 8 · see citing works
Generating hard Ising instances with planted solutions using post-quantum cryptographic protocols
Mandrà, S., Munoz-Bauza, H., Mossi, G., & Rieffel, E. G. (2025) · Future Generation Computer Systems · doi:10.1016/j.future.2025.107721 · Cited by 7 · see citing works
Self-citationVerifying the output of quantum optimizers with ground-state energy lower bounds
Baccari, F., Gogolin, C., Wittek, P., & Acin, A. (2020) · MPG.PuRe (Max Planck Society) · Cited by 7 · see citing works
Locally suppressed transverse-field protocol for diabatic quantum annealing
Fry-Bouriaux, L., O'Connor, D., Feinstein, N., & Warburton, P. (2021) · Physical Review A · doi:10.1103/physreva.104.052616 · Cited by 8 · see citing works
Streif, M., & Leib, M. (2020) · Physical Review A · doi:10.1103/physreva.102.042416 · Cited by 7 · see citing works
Milestones on the Quantum Utility Highway: Quantum Annealing Case Study
McGeoch, C. C., & Farré, P. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3625307 · Cited by 6 · see citing works
The travelling salesperson problem and the challenges of near-term quantum advantage
Smith‐Miles, K., Hoos, H. H., Wang, H., Bäck, T., & Osborne, T. J. (2025) · Quantum Science and Technology · doi:10.1088/2058-9565/add61d · Cited by 6 · see citing works
Output statistics of quantum annealers with disorder
Brugger, J., Seidel, C., Streif, M., Wudarski, F., Dittel, C., & Buchleitner, A. (2022) · Physical Review A · doi:10.1103/physreva.105.042605 · Cited by 7 · see citing works
Applications of Quantum Annealing to Music Theory
Arya, A., Botelho, L., Cañete, F., Kapadia, D., & Salehi, Ö. (2022) · Springer eBooks · doi:10.1007/978-3-031-13909-3_15 · Cited by 9 · see citing works
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 · see citing works
Entanglement-assisted variational algorithm for discrete optimization problems
Fioroni, L., & Savona, V. (2025) · Communications Physics · doi:10.1038/s42005-025-02338-0 · Cited by 3 · see citing works
Quantum Computing in the Biomedical Sciences; A Brief Introduction into Concepts and Applications
van der Kerk, C., Csala, A., & Zwinderman, A. H. (2019) · Computer and Information Science · doi:10.5539/cis.v12n3p104 · Cited by 3 · see citing works
Tucker-1 Boolean Tensor Factorization with Quantum Annealers
O’Malley, D., Djidjev, H. N., & Alexandrov, B. S. (2020) · IEEE International Conference on Rebooting Computing (ICRC) · doi:10.1109/icrc2020.2020.00002 · Cited by 3 · see citing works
Path Integral Quantum Annealing Optimizations Validated on 0-1 Multidimensional Knapsack Problem
Forno, E., Pignari, R., Fra, V., Macii, E., & Urgese, G. (2025) · IEEE Transactions on Emerging Topics in Computing · doi:10.1109/tetc.2025.3583224 · Cited by 2 · see citing works
Parallel Ising annealer via gradient-based Hamiltonian Monte Carlo
Wang, H., Liu, Z., Xie, Z., Li, L., Miao, Z., Cui, W., & Pan, Y. (2025) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00231-7 · Cited by 2 · see citing works
Scaling advantage in approximate optimization with quantum annealingPreprint
Lidar, D. A., & Munoz-Bauza, H. (2024) · Research Square · doi:10.21203/rs.3.rs-3860892/v1 · Cited by 2 · see citing works
Noise effects on diabatic quantum annealing protocols
Salatino, G., Matzler, M., Scocco, A., Lucignano, P., & Passarelli, G. (2025) · Physical Review A · doi:10.1103/x9hw-xhvj · Cited by 2 · see citing works
Singkanipa, P., Xia, Z., & Lidar, D. A. (2025) · Quantum · doi:10.22331/q-2025-08-05-1821 · Cited by 1 · see citing works
Absence of small-world effects at the quantum level and stability of the quantum critical point
Ostilli, M. (2020) · Physical review. E · doi:10.1103/physreve.102.052126 · Cited by 1 · see citing works
Optimization and benchmarking of the thermal cycling algorithm
Barzegar, A., Kankani, A., Mandrà, S., & Katzgraber, H. G. (2021) · Physical review. E · doi:10.1103/physreve.104.035302 · Cited by 1 · see citing works
Self-citationPerturbed ferromagnetic chain: Tunable test of hardness in the transverse-field Ising model
O'Connor, D. T., Fry-Bouriaux, L., & Warburton, P. A. (2022) · Physical Review A · doi:10.1103/physreva.105.022410 · Cited by 1 · see citing works
Applying Multi-qubit Correction to Frustrated Cluster Loops on an Adiabatic Quantum Computer
Dorband, J. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1902.05827 · Cited by 1 · see citing works
Author Correction: Analog errors in quantum annealing: doom and hope
Pearson, A., Mishra, A., Hen, I., & Lidar, D. A. (2020) · npj Quantum Information · doi:10.1038/s41534-020-00297-8 · Cited by 1 · see citing works
Kinematics variables of Higgs and background data
Zlokapa, A. (2020) · CaltechDATA · doi:10.22002/d1.1335 · Cited by 1 · see citing works
Certification of many-body systems
Baccari, F. (2019) · doi:10.5821/dissertation-2117-134619
Wang, A., Cai, D., Zhang, Y., Huang, Y., Feng, X., & Zhang, Z. (2025) · Physical Review Research · doi:10.1103/knt1-yd9s
- Authors
- Mandrà, S., & Katzgraber, H. G.
- Affiliations
- Ames Research Center (US)
- Santa Fe Institute (US)
- Corresponding author
- Mandrà, Salvatore
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2018-07-02
- Volume
- 3
- Issue
- 4
- Pages
- 04LT01
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2767868108
- Semantic Scholar
- 8b7aff5c157ff667044d530b87a17ca4ffe17e40
- Cited by
- 82
- References
- 33
- Citations by year
- 2026: 1 · 2025: 13 · 2024: 6 · 2023: 4 · 2022: 6 · 2021: 10 · 2020: 20 · 2019: 20 · 2018: 2
- FWCI
- 7.47
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Quantum Science and Technology (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Bulletin of the American Physical Society
- Funders
- National Science Foundation (DMR-1151387)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, combinatorial optimization
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
