Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Open accessThe 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 number of two-qubit gates is ≈10^3 at N = 18, putting our experiments among the largest quantum optimization demonstrations on quantum hardware to date.
“We remark that the number of two-qubit gates is ≈103 at N = 18, putting our experiments among the largest quantum optimization demonstrations on quantum hardware to date (36–38).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [37]
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
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 · see citing works
Matplotlib: a 2D graphics environment
Hunter, J. D. (2007) · Computing in Science & Engineering · doi:10.1109/mcse.2007.55 · Cited by 39,249 · see citing works
Variational quantum algorithms
Cerezo, M., Arrasmith, A., Babbush, R., Benjamin, S. C., Endo, S., Fujii, K., McClean, J. R., Mitarai, K., Yuan, X., Cincio, L., et al. (2021) · Nature Reviews Physics · doi:10.1038/s42254-021-00348-9 · Cited by 3,385 · cited 1× · see citing works
“Variational quantum algorithms, such as QAOA, have been a subject of large amount of attention, in large part because of the problem domains that variational algorithms can address (such as combinatorial optimization) [35].”
BackgroundQuantum 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
Dynamical Decoupling of Open Quantum Systems
Viola, L., Knill, E., & Lloyd, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2417 · Cited by 1,808 · see citing works
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789 · 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
Noise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773 · see citing works
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772 · 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 approximate optimization of non-planar graph problems on a planar superconducting processor
Harrigan, M. P., Sung, K. J., Neeley, M., Satzinger, K. J., Arute, F., Arya, K., Atalaya, J., Bardin, J. C., Barends, R., Boixo, S., et al. (2021) · Nature Physics · doi:10.1038/s41567-020-01105-y · Cited by 564 · 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
Mathematical foundation of quantum annealing
Morita, S., & Nishimori, H. (2008) · Journal of Mathematical Physics · doi:10.1063/1.2995837 · Cited by 381 · see citing works
Colloquium: Protecting quantum information against environmental noise
Suter, D., & Álvarez, G. A. (2016) · Reviews of Modern Physics · doi:10.1103/revmodphys.88.041001 · Cited by 350 · see citing works
Quantum 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 · see citing works
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331 · see citing works
Entanglement in a Quantum Annealing Processor
Lanting, T., Przybysz, A. J., Smirnov, A. Y., Spedalieri, F. M., Amin, M. H., Berkley, A. J., Harris, R., Altomare, F., Boixo, S., Bunyk, P., et al. (2014) · Physical Review X · doi:10.1103/physrevx.4.021041 · Cited by 303 · see citing works
Quantum approximate optimization of the long-range Ising model with a trapped-ion quantum simulator
Pagano, G., Bapat, A., Becker, P., Collins, K. S., De, A., Hess, P. W., Kaplan, H. B., Kyprianidis, A., Tan, W. L., Baldwin, C., et al. (2020) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2006373117 · Cited by 262 · see citing works
Demonstration of a Scaling Advantage for a Quantum Annealer over Simulated Annealing
Albash, T., & Lidar, D. A. (2018) · Physical Review X · doi:10.1103/physrevx.8.031016 · Cited by 238 · cited 1× · see citing works
“Simulated annealing is a standard high accuracy and general purpose classical heuristic algorithm [57], and has been used as a reasonable comparison against quantum algorithms [13].”
MethodTopological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223 · see citing works
Coherent quantum annealing in a programmable 2,000 qubit Ising chain
King, A. D., Suzuki, S., Raymond, J., Zucca, A., Lanting, T., Altomare, F., Berkley, A. J., Ejtemaee, S., Hoskinson, E., Huang, S., et al. (2022) · Nature Physics · doi:10.1038/s41567-022-01741-6 · Cited by 213 · see citing works
Demonstration of Fidelity Improvement Using Dynamical Decoupling with Superconducting Qubits
Pokharel, B., Anand, N., Fortman, B., & Lidar, D. A. (2018) · Physical Review Letters · doi:10.1103/physrevlett.121.220502 · Cited by 209 · see citing works
Scalable error mitigation for noisy quantum circuits produces competitive expectation values
Kim, Y., Wood, C. J., Yoder, T. J., Merkel, S., Gambetta, J., Temme, K., & Kandala, A. (2023) · Nature Physics · doi:10.1038/s41567-022-01914-3 · Cited by 196 · see citing works
Wang, Z., Rubin, N. C., Dominy, J. M., & Rieffel, E. G. (2020) · Physical Review A · doi:10.1103/physreva.101.012320 · Cited by 190 · see citing works
Quantum Annealing for Prime Factorization
Jiang, S., Britt, K. A., McCaskey, A., Humble, T. S., & Kais, S. (2018) · Scientific Reports · doi:10.1038/s41598-018-36058-z · Cited by 179 · see citing works
King, A. D., Raymond, J., Lanting, T., Isakov, S. V., Mohseni, M., Poulin-Lamarre, G., Ejtemaee, S., Bernoudy, W., Ozfidan, I., Smirnov, A. Y., et al. (2021) · Nature Communications · doi:10.1038/s41467-021-20901-5 · Cited by 148 · see citing works
Transformation of General Binary MRF Minimization to the First-Order Case
Ishikawa, H. (2011) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2010.91 · Cited by 144 · see citing works
Mitiq: A software package for error mitigation on noisy quantum computers
LaRose, R., Mari, A., Kaiser, S., Karalekas, P. J., Alves, A. A., Czarnik, P., Mandouh, M. E., Gordon, M. H., Hindy, Y., Robertson, A., et al. (2022) · Quantum · doi:10.22331/q-2022-08-11-774 · Cited by 132 · see citing works
Quantum simulation of a three-body-interaction Hamiltonian on an NMR quantum computer
Tseng, C.-H., Somaroo, S. S., Sharf, Y., Knill, E. H., Laflamme, R., Havel, T. F., & Cory, D. G. (1999) · Physical Review A · doi:10.1103/physreva.61.012302 · Cited by 130 · see citing works
Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
Marshall, J., Venturelli, D., Hen, I., & Rieffel, E. G. (2019) · Physical Review Applied · doi:10.1103/physrevapplied.11.044083 · Cited by 119 · see citing works
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 · see citing works
Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
Weidenfeller, J., Valor, L. C., Gacon, J., Tornow, C., Bello, L., Woerner, S., & Egger, D. J. (2022) · Quantum · doi:10.22331/q-2022-12-07-870 · Cited by 97 · see citing works
Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies
Zbinden, S., Bärtschi, A., Djidjev, H., & Eidenbenz, S. (2020) · ISC High Performance · doi:10.1007/978-3-030-50743-5_10 · Cited by 86 · see citing works
Self-citationThe Quantum Alternating Operator Ansatz on Maximum k-Vertex Cover
Cook, J., Eidenbenz, S., & Bärtschi, A. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00021 · Cited by 74 · see citing works
Self-citationChancellor, N., Zohren, S., & Warburton, P. A. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0022-6 · Cited by 72 · see citing works
Robustness of dynamical decoupling sequences
Ahmed, M. A. A., Álvarez, G. A., & Suter, D. (2013) · Physical Review A · doi:10.1103/physreva.87.042309 · Cited by 66 · see citing works
Optimization Applications as Quantum Performance Benchmarks
Lubinski, T., Coffrin, C., McGeoch, C., Sathe, P., Apanavicius, J., & Neira, D. E. B. (2023) · arXiv · doi:10.48550/arxiv.2302.02278 · Cited by 62 · see citing works
Constrained quantum optimization for extractive summarization on a trapped-ion quantum computer
Niroula, P., Shaydulin, R., Yalovetzky, R., Minssen, P., Herman, D., Hu, S., & Pistoia, M. (2022) · Scientific Reports · doi:10.1038/s41598-022-20853-w · Cited by 59 · see citing works
Multilevel Combinatorial Optimization across Quantum Architectures
Ushijima-Mwesigwa, H., Shaydulin, R., Negre, C. F. A., Mniszewski, S. M., Alexeev, Y., & Safro, I. (2021) · ACM Transactions on Quantum Computing · doi:10.1145/3425607 · Cited by 57 · see citing works
Pegasus: The second connectivity graph for large-scale quantum annealing hardwarePreprint
Dattani, N., Szalay, S., & Chancellor, N. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1901.07636 · Cited by 57 · see citing works
Pelofske, E., Hahn, G., & Djidjev, H. N. (2022) · Scientific Reports · doi:10.1038/s41598-022-08394-8 · Cited by 55 · see citing works
Self-citationEffects of Dynamical Decoupling and Pulse-Level Optimizations on IBM Quantum Computers
Niu, S., & Todri‐Sanial, A. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2022.3203153 · Cited by 51 · see citing works
Scaling quantum approximate optimization on near-term hardware
Lotshaw, P. C., Nguyen, T., Santana, A., McCaskey, A., Herrman, R., Ostrowski, J., Siopsis, G., & Humble, T. S. (2022) · Scientific Reports · doi:10.1038/s41598-022-14767-w · Cited by 37 · 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
Sampling on NISQ Devices: "Who’s the Fairest One of All?"
Pelofske, E., Golden, J. K., Bärtschi, A., O’Malley, D., & Eidenbenz, S. (2021) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00038 · Cited by 26 · see citing works
Self-citationCampbell, C., & Dahl, E. D. (2022) · IEEE International Conference on Software Architecture Companion (ICSA-C) · doi:10.1109/icsa-c54293.2022.00035 · Cited by 21 · see citing works
Computational overhead of locality reduction in binary optimization problems
Valiante, E., Hernandez, M., Barzegar, A., & Katzgraber, H. G. (2021) · Computer Physics Communications · doi:10.1016/j.cpc.2021.108102 · Cited by 19 · see citing works
Quantum annealing algorithms for Boolean tensor networks
Pelofske, E., Hahn, G., O’Malley, D., Djidjev, H. N., & Alexandrov, B. S. (2022) · Scientific Reports · doi:10.1038/s41598-022-12611-9 · Cited by 19 · see citing works
Self-citationOn the Emerging Potential of Quantum Annealing Hardware for Combinatorial OptimizationPreprint
Tasseff, B., Albash, T., Morrell, Z., et al. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2210.04291 · Cited by 17 · see citing works
Multi-round QAOA and advanced mixers on a trapped-ion quantum computer
Zhu, Y., Zhang, Z., Sundar, B., Green, A., Alderete, C. H., Nguyen, N. H., Hazzard, K. R. A., & Linke, N. M. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac91ef · Cited by 16 · see citing works
Qiskit/qiskit-terra: Qiskit Terra 0.20.1
Treinish, M., Gambetta, J., Rodríguez, D. M., et al. (2022) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2583252 · Cited by 15 · see citing works
Flagged first, then by citations
Research works printed but not linked: 5
- Elijah Pelofske, Andreas Bärtschi, and Stephan Eidenbenz. Quantum Annealing vs. QAOA: 127 Qubit Higher- Order Ising Problems on NISQ Computers. 2023. doi: 10.48550/ARXIV.2301.00520. url: https://arxiv. org/abs/2301.00520. · DOI
- Dylan Herman et al. Portfolio Optimization via Quantum Zeno Dynamics on a Quantum Processor. 2022. doi: 10.48550/ARXIV.2209.15024. url: https://arxiv.org/abs/2209.15024. · DOI
- John Golden et al. Evidence for Super-Polynomial Advantage of QAOA over Unstructured Search. 2022. doi: 10.48550/ARXIV.2202.00648. url: https://arxiv.org/abs/2202.00648. · DOI
- Nic Ezzell et al. Dynamical decoupling for superconducting qubits: a performance survey. 2022. doi: 10 . 48550/ARXIV.2207.03670. url: https://arxiv.org/abs/2207.03670. · DOI
- Andrew W. Cross et al. Open Quantum Assembly Language. 2017. doi: 10.48550/ARXIV.1707.03429. url: https://arxiv.org/abs/1707.03429. · DOI · Paper page
Cited by
Sorted by citations
Shaydulin, R., Li, C., Chakrabarti, S., DeCross, M., Herman, D., Kumar, N., Larson, J., Lykov, D., Minssen, P., Sun, Y., et al. (2024) · Science Advances · doi:10.1126/sciadv.adm6761 · Cited by 120 · see citing works
Bias-field digitized counterdiabatic quantum algorithm for higher-order binary optimization
Romero, S. V., Visuri, A.-M., Cadavid, A. G., Simen, A., Solano, E., & Hegade, N. N. (2025) · Communications Physics · doi:10.1038/s42005-025-02270-3 · Cited by 18 · see citing works
“While a number of experiments have recently demonstrated higher-order unconstrained binary optimization (HUBO) implementations on quantum hardware [41–44], there are hardware limitations that complicate the e ff ective implementation of these protocols on large-and even intermediate-scale problems.”
High-Round QAOA for MAX $k$-SAT on Trapped Ion NISQ Devices
Pelofske, E., Bärtschi, A., Golden, J., & Eidenbenz, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00064 · Cited by 15 · see citing works
Self-citation
- Authors
- Pelofske, E., Bärtschi, A., & Eidenbenz, S.
- Affiliations
- Los Alamos National Laboratory (US)
- Corresponding author
- Pelofske, Elijah
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Nature Switzerland
- Published
- 2023
- Pages
- 240-258
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W4376455908
- Cited by
- 47
- References
- 51
- Citations by year
- 2026: 4 · 2025: 13 · 2024: 21 · 2023: 9
- FWCI
- 8.33
- Type
- conference paper
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Lecture notes in computer science (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) (submittedVersion)
- arXiv (Cornell University)
- Funders
- U.S. Department of Energy (#89233218CNA000001)
- National Nuclear Security Administration (89233218C-NA000001, No. 89233218CNA000001)
- Los Alamos National Laboratory (89233218CNA 000001, 20220656ER)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum annealing, Quantum Alternating Operator Ansatz, combinatorial optimization, D-Wave Advantage, simulated annealing, NISQ devices, transmon qubits, flux qubits, annealing schedule
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
