Quantum optimization
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
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?
QAOA is a leading candidate algorithm for solving optimization problems on quantum computers.
“A leading candidate for demonstrating a heuristic speedup in quantum optimization is the quantum approximate optimization algorithm (QAOA) (9, 10).”
From Evidence of scaling advantage for the quantum approximate optimization algorithm on a classically intractable problem (2024) · cites this paper as [9]
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
(1979) · Cited by 43,841 · see citing works
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,035 · see citing works
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2× · see citing works
“Thus each of the m clauses is selected, with replacement, uniformly from among the 2 k possible clauses.”
BackgroundMethodDiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Lau, H. T. (1986) · Lecture notes in economics and mathematical systems · doi:10.1007/978-3-642-61649-5_4 · Cited by 801 · see citing works
Partial constraint satisfaction
Freuder, E. C., & Wallace, R. J. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90004-h · Cited by 616 · see citing works
Critical Behavior in the Satisfiability of Random Boolean Expressions
Kirkpatrick, S., & Selman, B. (1994) · Science · doi:10.1126/science.264.5163.1297 · Cited by 582 · see citing works
Combinatorial Algorithms: For Computers and Calculators
Nijenhuis, A., & Will, H. S. (2014) · Cited by 351 · see citing works
Brassard, G., Høyer, P., & Tapp, A. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055105 · Cited by 322 · see citing works
Phase transitions and the search problem
Hogg, T., Huberman, B. A., & Williams, C. P. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00044-5 · Cited by 253 · see citing works
Self-citationA Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
Karp, R. M. (1979) · SIAM Journal on Computing · doi:10.1137/0208045 · Cited by 175 · see citing works
Exact Solution of Large Asymmetric Traveling Salesman Problems
Miller, D. L., & Pekny, J. F. (1991) · Science · doi:10.1126/science.251.4995.754 · Cited by 171 · see citing works
Finding a better-than-classical quantum AND/OR algorithm using genetic programming
Spector, L. C., Barnum, H., Bernstein, H. J., & Swamy, N. (2003) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.1999.785553 · Cited by 116 · see citing works
A study of complexity transitions on the asymmetric traveling salesman problem
Zhang, W., & Korf, R. E. (1996) · Artificial Intelligence · doi:10.1016/0004-3702(95)00054-2 · Cited by 76 · see citing works
Hogg, T. (2000) · Physical Review A · doi:10.1103/physreva.61.052311 · Cited by 70 · see citing works
Self-citationHighly Structured Searches with Quantum Computers
Hogg, T. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2473 · Cited by 58 · see citing works
Self-citationQuantum computers and intractable (NP-complete) computing problems
Černý, V. (1993) · Physical Review A · doi:10.1103/physreva.48.116 · Cited by 37 · see citing works
Quantum Search on Structured Problems
Grover, L. K. (1999) · Chaos Solitons & Fractals · doi:10.1016/s0960-0779(98)00217-3 · Cited by 28 · see citing works
Hogg, T., MOCHON, C., Polak, W., & Rieffel, E. G. (1999) · International Journal of Modern Physics C · doi:10.1142/s0129183199001108 · Cited by 27 · see citing works
Self-citationHogg, T., MOCHON, C., Polak, W., & RIEFFEL, E. (1999) · RePEc: Research Papers in Economics · Cited by 20 · see citing works
Self-citation
Flagged first, then by citations
Cited by
Sorted by citations
Quantum Search Algorithms for Wireless Communications
Botsinis, P., Alanis, D., Babar, Z., Nguyen, H. V., Chandra, D., Ng, S. X., & Hanzo, L. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2882385 · Cited by 149 · see citing works
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
“A leading candidate for demonstrating a heuristic speedup in quantum optimization is the quantum approximate optimization algorithm (QAOA) (9, 10).”
BackgroundMethodTransferability of optimal QAOA parameters between random graphs
Galda, A., Liu, X., Lykov, D., Alexeev, Y., & Safro, I. (2021) · 2021 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce52317.2021.00034 · Cited by 72 · 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
Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Sureshbabu, S. H., Herman, D., Shaydulin, R., Basso, J., Chakrabarti, S., Sun, Y., & Pistoia, M. (2024) · Quantum · doi:10.22331/q-2024-01-18-1231 · Cited by 41 · see citing works
QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
Shaydulin, R., Marwaha, K., Wurtz, J., & Lotshaw, P. C. (2021) · 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) · doi:10.1109/qcs54837.2021.00011 · Cited by 31 · see citing works
Quantum computing and supervised machine learning
Oneto, L., Ridella, S., & Anguita, D. (2017) · Quantum Inspired Computational Intelligence · doi:10.1016/b978-0-12-804409-4.00002-4 · Cited by 11 · see citing works
Threshold for Fault-tolerant Quantum Advantage with the Quantum Approximate Optimization Algorithm
Omanakuttan, S., He, Z., Zhang, Z., Hao, T., Babakhani, A., Boulebnane, S., Chakrabarti, S., Herman, D., Sullivan, J., Perlin, M. A., et al. (2025) · arXiv · doi:10.48550/arxiv.2504.01897 · Cited by 3 · see citing works
“The quantum approximate optimization algorithm (QAOA) [22–24] is a quantum heuristic for optimization that has recently been shown to provide a polynomial speedup over classical state-of-the-art for the Low Auto-correlation Binary Sequences [25] and random 8-SAT [1] problems.”
- Authors
- Hogg, T., & Portnov, D.
- Affiliations
- Palo Alto Research Center (US)
- University of Washington (US)
- Corresponding author
- Hogg, Tad
- ORCID
- Hogg, Tad
- Venue
- Information Sciences
- Publisher
- Elsevier BV
- Published
- 2000-10
- Volume
- 128
- Issue
- 3-4
- Pages
- 181-197
- ISSN
- 0020-0255 (ISSN-L)
- OpenAlex
- W2913329048
- Cited by
- 111
- References
- 22
- Citations by year
- 2026: 3 · 2025: 9 · 2024: 17 · 2023: 13 · 2022: 12 · 2021: 4 · 2020: 5 · 2019: 2 · 2018: 2 · 2017: 3 · 2016: 4 · 2015: 5 · 2014: 2 · 2013: 2 · 2012: 4
- FWCI
- 1.25
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Information Sciences (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Keywords
- quantum optimization, combinatorial optimization, quantum algorithms, amplitude amplification, asymmetric traveling salesman problem, cost structure, heuristic comparison
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
