The DOI matches its Crossref record; 245 of the 245 references it cites were found in a registry or an index.
A review on Quantum Approximate Optimization Algorithm and its variants
Open accessAbstract
The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve combinatorial optimization problems that are classically intractable. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios, its applicability across various problem instances, and considerations of hardware-specific challenges such as error susceptibility and noise resilience. Additionally, we conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm. We aim to provide insights into key questions about the algorithm, such as whether it can outperform classical algorithms and under what circumstances it should be used. Towards this goal, we offer specific practical points in a form of a short guide. Keywords: Quantum Approximate Optimization Algorithm (QAOA), Variational Quantum Algorithms (VQAs), Quantum Optimization, Combinatorial Optimization Problems, NISQ Algorithms
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.
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
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
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
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552
Goemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587
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
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Kandala, A., Mezzacapo, A., Temme, K., Takita, M., Brink, M., Chow, J. M., & Gambetta, J. M. (2017) · Nature · doi:10.1038/nature23879 · Cited by 2,982
Ising formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Barren plateaus in quantum neural network training landscapes
McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2018) · Nature Communications · doi:10.1038/s41467-018-07090-4 · Cited by 2,329
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
The theory of variational hybrid quantum-classical algorithms
McClean, J. R., Romero, J., Babbush, R., & Aspuru-Guzik, A. (2016) · New Journal of Physics · doi:10.1088/1367-2630/18/2/023023 · Cited by 2,227
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
Some optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Albash, T., & Lidar, D. A. (2018) · Reviews of Modern Physics · doi:10.1103/revmodphys.90.015002 · Cited by 1,546
Infinite Number of Order Parameters for Spin-Glasses
Parisi, G. (1979) · Physical Review Letters · doi:10.1103/physrevlett.43.1754 · Cited by 1,140
Shortcuts to adiabaticity: Concepts, methods, and applications
Guéry-Odelin, D., Ruschhaupt, A., Kiely, A., Torrontegui, E., Martínez-Garaot, S., & Muga, J. G. (2019) · Reviews of Modern Physics · doi:10.1103/revmodphys.91.045001 · Cited by 1,045
The Variational Quantum Eigensolver: A review of methods and best practices
Tilly, J., Chen, H., Cao, S., Picozzi, D., Setia, K., Li, Y., Grant, E., Wossnig, L., Rungger, I., Booth, G. H., et al. (2022) · Physics Reports · doi:10.1016/j.physrep.2022.08.003 · Cited by 1,031
Ausiello, G., Marchetti-Spaccamela, A., Crescenzi, P., Gambosi, G., Protasi, M., & Kann, V. (1999) · Springer eBooks · doi:10.1007/978-3-642-58412-1 · Cited by 979
Sim, S., Johnson, P. D., & Aspuru‐Guzik, A. (2019) · Advanced Quantum Technologies · doi:10.1002/qute.201900070 · Cited by 972
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913
Quantum Algorithms for Quantum Chemistry and Quantum Materials Science
Bauer, B., Bravyi, S., Motta, M., & Chan, G. K.-L. (2020) · Chemical Reviews · doi:10.1021/acs.chemrev.9b00829 · Cited by 848
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
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
Vazirani, V. V. (2003) · Springer eBooks · doi:10.1007/978-3-662-04565-7 · Cited by 716
Childs, A. M., Kothari, R., & Somma, R. D. (2017) · SIAM Journal on Computing · doi:10.1137/16m1087072 · Cited by 646
Self-verifying variational quantum simulation of lattice models
Kokail, C., Maier, C., van Bijnen, R., Brydges, T., Joshi, M. K., Jurcevic, P., Muschik, C. A., Silvi, P., Blatt, R., Roos, C. F., et al. (2019) · Nature · doi:10.1038/s41586-019-1177-4 · Cited by 594
Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
Khot, S., Kindler, G., Mossel, E., & O’Donnell, R. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447372 · Cited by 578
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
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 543
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019) · Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3313276.3316366 · Cited by 542
Quantum Computation by Adiabatic Evolution
Farhi, E., Goldstone, J., Gutmann, S., & Sipser, M. (2000) · arXiv · doi:10.48550/arxiv.quant-ph/0001106 · Cited by 536
An Interior-Point Algorithm for Nonconvex Nonlinear Programming
Vanderbei, R. J., & Shanno, D. F. (1999) · Computational Optimization and Applications · doi:10.1023/a:1008677427361 · Cited by 526
Multi-qubit entanglement and algorithms on a neutral-atom quantum computer
Graham, T. M., Song, Y., Scott, J., Poole, C., Phuttitarn, L., Jooya, K., Eichler, P., Jiang, X., Marra, A., Grinkemeyer, B., et al. (2022) · Nature · doi:10.1038/s41586-022-04603-6 · Cited by 518
Hybrid quantum-classical hierarchy for mitigation of decoherence and determination of excited states
McClean, J. R., Kimchi-Schwartz, M. E., Carter, J., & de Jong, W. A. (2017) · Physical Review A · doi:10.1103/physreva.95.042308 · Cited by 516
Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
Qiang, X., Zhou, X., Wang, J., Wilkes, C. M., Loke, T., O’Gara, S., Kling, L., Marshall, G. D., Santagati, R., Ralph, T. C., et al. (2018) · Nature Photonics · doi:10.1038/s41566-018-0236-y · Cited by 516
The unconstrained binary quadratic programming problem: a survey
Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., Lü, Z., Wang, H., & Wang, Y. (2014) · Journal of Combinatorial Optimization · doi:10.1007/s10878-014-9734-0 · Cited by 473
Quantum optimization of maximum independent set using Rydberg atom arrays
Ebadi, S., Keesling, A., Cain, M., Wang, T. T., Levine, H., Bluvstein, D., Semeghini, G., Omran, A., Liu, J.-G., Samajdar, R., et al. (2022) · Science · doi:10.1126/science.abo6587 · Cited by 430
Continuous-variable quantum neural networks
Killoran, N., Bromley, T. R., Arrazola, J. M., Schuld, M., Quesada, N., & Lloyd, S. (2019) · Physical Review Research · doi:10.1103/physrevresearch.1.033063 · Cited by 418
Continuous-variable quantum neural networks
Killoran, N., Bromley, T. R., Arrazola, J. M., Schuld, M., Quesada, N., & Lloyd, S. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 358
Quantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
Guerreschi, G. G., & Matsuura, A. Y. (2019) · Scientific Reports · doi:10.1038/s41598-019-43176-9 · Cited by 337
Layerwise learning for quantum neural networks
Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P., & Leib, M. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00036-4 · Cited by 324
General parameter-shift rules for quantum gradients
Wierichs, D., Izaac, J., Wang, C., & Lin, C. Y.-Y. (2022) · Quantum · doi:10.22331/q-2022-03-30-677 · Cited by 299
25th ACM/IEEE Design Automation Conference ®
(1986) · Computer · doi:10.1109/mc.1986.1663069 · Cited by 287
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2019) · arXiv · doi:10.48550/arxiv.1910.08980 · Cited by 279
Obstacles to Variational Quantum Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260505 · Cited by 278
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
Unsupervised Machine Learning on a Hybrid Quantum Computer
Otterbach, J. S., Manenti, R., Alidoust, N., Bestwick, A., Block, M., Bloom, B., Caldwell, S., Didier, N., Fried, E. S., Hong, S., et al. (2017) · arXiv · doi:10.48550/arxiv.1712.05771 · Cited by 263
Improving Variational Quantum Optimization using CVaR
Barkoutsos, P. K., Nannicini, G., Robert, A., Tavernelli, I., & Woerner, S. (2020) · Quantum · doi:10.22331/q-2020-04-20-256 · Cited by 263
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
Variational Quantum Linear Solver
Bravo-Prieto, C., LaRose, R., Cerezo, M., Subasi, Y., Cincio, L., & Coles, P. J. (2023) · Quantum · doi:10.22331/q-2023-11-22-1188 · Cited by 260
A quantum annealing architecture with all-to-all connectivity from local interactions
Lechner, W., Hauke, P., & Zoller, P. (2015) · Science Advances · doi:10.1126/sciadv.1500838 · Cited by 256
Low-cost error mitigation by symmetry verification
Bonet-Monroig, X., Sagastizabal, R., Singh, M., & O'Brien, T. E. (2018) · Physical Review A · doi:10.1103/physreva.98.062339 · Cited by 250
Error-Mitigated Digital Quantum Simulation
McArdle, S., Yuan, X., & Benjamin, S. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.180501 · Cited by 245
Limitations of optimization algorithms on noisy quantum devices
Stilck França, D., & García-Patrón, R. (2021) · Nature Physics · doi:10.1038/s41567-021-01356-3 · Cited by 232
Farhi, E., Goldstone, J., Gutmann, S., & Zhou, L. (2022) · Quantum · doi:10.22331/q-2022-07-07-759 · Cited by 227
VQE method: a short survey and recent developments
Fedorov, D. A., Peng, B., Govind, N., & Alexeev, Y. (2022) · Materials Theory · doi:10.1186/s41313-021-00032-6 · Cited by 224
A quantum computing view on unitary coupled cluster theory
Anand, A., Schleich, P., Alperin-Lea, S., Jensen, P. W. K., Sim, S., Díaz-Tinoco, M., Kottmann, J. S., Degroote, M., Izmaylov, A. F., & Aspuru-Guzik, A. (2022) · Chemical Society Reviews · doi:10.1039/d1cs00932j · Cited by 223
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Wilde, F., Meyer, J., Schuld, M., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Quantum · doi:10.22331/q-2020-08-31-314 · Cited by 219
Maciejewski, F. B., Zimborás, Z., & Oszmaniec, M. (2020) · Quantum · doi:10.22331/q-2020-04-24-257 · Cited by 219
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical CasePreprint
Farhi, E., Gamarnik, D., & Gutmann, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2004.09002 · Cited by 212
Grover, L. K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.150501 · Cited by 210
Floquet-Engineering Counterdiabatic Protocols in Quantum Many-Body Systems
Claeys, P. W., Pandey, M., Sels, D., & Polkovnikov, A. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.090602 · Cited by 210
Correlating Decoherence in Transmon Qubits: Low Frequency Noise by Single Fluctuators
Schlör, S., Lisenfeld, J., Müller, C., Bilmes, A., Schneider, A., Pappas, D. P., Ustinov, A. V., & Weides, M. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.190502 · Cited by 209
Virtual Distillation for Quantum Error Mitigation
Huggins, W. J., McArdle, S., O’Brien, T. E., Lee, J., Rubin, N. C., Boixo, S., Whaley, K. B., Babbush, R., & McClean, J. R. (2021) · Physical Review X · doi:10.1103/physrevx.11.041036 · Cited by 205
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab784c · Cited by 196
Stochastic gradient descent for hybrid quantum-classical optimization
Sweke, R., Sweke, R., Meyer, J. J., Meyer, J. J., Faehrmann, P. K., Meynard-Piganeau, B., & Eisert, J. (2020) · Refubium (Universitätsbibliothek der Freien Universität Berlin) · doi:10.17169/refubium-28427 · Cited by 194
XY mixers: Analytical and numerical results for the quantum alternating operator ansatz
Wang, Z., Rubin, N. C., Dominy, J. M., & Rieffel, E. G. (2020) · Physical Review A · doi:10.1103/physreva.101.012320 · Cited by 190
Noise resilience of variational quantum compiling
Sharma, K., Khatri, S., Cerezo, M., & Coles, P. J. (2020) · Civil War Book Review · Cited by 184
Maciejewski, F., Zimborás, Z., & Oszmaniec, M. (2020) · Repository of the Academy's Library (Library of the Hungarian Academy of Sciences) · Cited by 184
Quantum annealing initialization of the quantum approximate optimization algorithm
Sack, S. H., & Serbyn, M. (2021) · Quantum · doi:10.22331/q-2021-07-01-491 · Cited by 184
2007 IEEE/ACM International Conference on Computer-Aided Design
(2007) · doi:10.1109/iccad11984.2007 · Cited by 174
Optimization of the Sherrington-Kirkpatrick Hamiltonian
Andrea Montanari, A. (2019) · SIAM Journal on Computing · doi:10.1109/focs.2019.00087 · Cited by 172
Multi-angle quantum approximate optimization algorithm
Herrman, R., Lotshaw, P. C., Ostrowski, J., Humble, T. S., & Siopsis, G. (2022) · Scientific Reports · doi:10.1038/s41598-022-10555-8 · Cited by 167
Noisy intermediate-scale quantum (NISQ) algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2021) · arXiv · doi:10.48550/arxiv.2101.08448 · Cited by 166
QUBO formulations for training machine learning models
Date, P., Arthur, D., & Pusey-Nazzaro, L. (2021) · Scientific Reports · doi:10.1038/s41598-021-89461-4 · Cited by 163
Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
Crooks, G. E. (2018) · arXiv · doi:10.48550/arxiv.1811.08419 · Cited by 158
Near-optimal quantum circuit for Grover's unstructured search using a transverse field
Zhang, J., Rieffel, E. G., & Wang, Z. (2017) · Physical Review A · doi:10.1103/physreva.95.062317 · Cited by 155
Performance comparison of optimization methods on variational quantum algorithms
Bonet-Monroig, X., Wang, H., Vermetten, D., Senjean, B., Moussa, C., Bäck, T., Dunjko, V., & O’Brien, T. E. (2023) · Physical Review A · doi:10.1103/physreva.107.032407 · Cited by 154
Reachability Deficits in Quantum Approximate Optimization
Akshay, V., Philathong, H., Morales, M. E. S., & Biamonte, J. D. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.090504 · Cited by 151
Classical and quantum bounded depth approximation algorithms
Hastings, M. B. (2019) · Quantum Information and Computation · doi:10.26421/qic19.13-14-3 · Cited by 150
Solving Vehicle Routing Problem Using Quantum Approximate Optimization Algorithm
Azad, U., Behera, B. K., Ahmed, E. A., Panigrahi, P. K., & Farouk, A. (2023) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2022.3172241 · Cited by 149
Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
Exponential Error Suppression for Near-Term Quantum Devices
Koczor, B. (2021) · Physical Review X · doi:10.1103/physrevx.11.031057 · Cited by 147
Filtering variational quantum algorithms for combinatorial optimization
Amaro, D., Modica, C., Rosenkranz, M., Fiorentini, M., Benedetti, M., & Lubasch, M. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ac3e54 · Cited by 144
Optimal Protocols in Quantum Annealing and Quantum Approximate Optimization Algorithm Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2021) · Physical Review Letters · doi:10.1103/physrevlett.126.070505 · Cited by 138
MaxCut quantum approximate optimization algorithm performance guarantees for p>1
Wurtz, J., & Love, P. J. (2021) · Physical Review A · doi:10.1103/physreva.103.042612 · Cited by 138
A quantum-classical cloud platform optimized for variational hybrid algorithms
Karalekas, P. J., Tezak, N., Peterson, E. C., Ryan, C. A., Silva, M. P. D., & Smith, R. S. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab7559 · Cited by 137
The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: Worst Case ExamplesPreprint
Farhi, E., Gamarnik, D., & Gutmann, S. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2005.08747 · Cited by 136
Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
Sanders, Y. R., Berry, D. W., Costa, P. C. S., Tessler, L. W., Wiebe, N., Gidney, C., Neven, H., & Babbush, R. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020312 · Cited by 135
Implementation of XY entangling gates with a single calibrated pulse
Abrams, D. M., Didier, N., Johnson, B. R., Silva, M. P. D., & Ryan, C. A. (2020) · Nature Electronics · doi:10.1038/s41928-020-00498-1 · Cited by 132
A Quantum Approximate Optimization Algorithm Applied to a Bounded Occurrence Constraint Problem
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1412.6062 · Cited by 131
A unified modeling and solution framework for combinatorial optimization problems
Kochenberger, G. A., Glover, F., Alidaee, B., & Rego, C. (2004) · OR Spectrum · doi:10.1007/s00291-003-0153-3 · Cited by 129
What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
Dunning, I., Gupta, S., & Silberholz, J. (2018) · INFORMS Journal on Computing · doi:10.1287/ijoc.2017.0798 · Cited by 128
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., De Raedt, H., & Michielsen, K. (2020) · Quantum Information Processing · doi:10.1007/s11128-020-02692-8 · Cited by 128
Counterdiabaticity and the quantum approximate optimization algorithm
Wurtz, J., & Love, P. J. (2022) · Quantum · doi:10.22331/q-2022-01-27-635 · Cited by 127
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 127
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
A comparison of various classical optimizers for a variational quantum linear solver
Pellow-Jarman, A., Sinayskiy, I., Pillay, A. W., & Petruccione, F. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03140-x · Cited by 124
Digitized-counterdiabatic quantum approximate optimization algorithm
Chandarana, P., Hegade, N. N., Paul, K., Albarrán-Arriagada, F., Solano, E., del Campo, A., & Chen, X. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.013141 · Cited by 123
Grover Mixers for QAOA: Shifting Complexity from Mixer Design to State Preparation
Bartschi, A., & Eidenbenz, S. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00020 · Cited by 122
Hybrid quantum-classical algorithms for approximate graph coloring
Bravyi, S. B., Kliesch, A., König, R., & Tang, E. (2022) · Quantum · doi:10.22331/q-2022-03-30-678 · Cited by 118
Optimal Protocols in Quantum Annealing and QAOA Problems
Brady, L. T., Baldwin, C. L., Bapat, A., Kharkov, Y., & Gorshkov, A. V. (2020) · arXiv · doi:10.48550/arxiv.2003.08952 · Cited by 117
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y., & Balaprakash, P. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i03.5616 · Cited by 117
Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemesPreprint
Mbeng, G. B., Fazio, R., & Santoro, G. E. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.08948 · Cited by 113
Multistart Methods for Quantum Approximate optimization
Shaydulin, R., Safro, I., & Larson, J. (2019) · 2019 IEEE High Performance Extreme Computing Conference (HPEC) · doi:10.1109/hpec.2019.8916288 · Cited by 110
Benchmarking the quantum approximate optimization algorithm
Willsch, M., Willsch, D., Jin, F., Raedt, H. A. D., & Michielsen, K. F. L. (2020) · RWTH Publications (RWTH Aachen) · Cited by 109
Applying the Quantum Approximate Optimization Algorithm to the Tail-Assignment Problem
Vikstål, P., Grönkvist, M., Svensson, M., Andersson, M., Johansson, G., & Ferrini, G. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.034009 · Cited by 107
Limitations of Variational Quantum Algorithms: A Quantum Optimal Transport Approach
Palma, G. D., Marvian, M., Rouzé, C., & França, D. S. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.010309 · Cited by 107
Genetic algorithms as classical optimizer for the Quantum Approximate Optimization Algorithm
Acampora, G., Chiatto, A., & Vitiello, A. (2023) · Applied Soft Computing · doi:10.1016/j.asoc.2023.110296 · Cited by 107
Semidefinite programs on sparse random graphs and their application to community detection
Andrea Montanari, A., & Sen, S. (2016) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/2897518.2897548 · Cited by 106
Anschuetz, E., Olson, J., Aspuru-Guzik, A., & Cao, Y. (2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-14082-3_7 · Cited by 104
Optimization of mean-field spin glasses
Alaoui, A. E., Andrea Montanari, A., & Sellke, M. (2021) · The Annals of Probability · doi:10.1214/21-aop1519 · Cited by 104
Parameter concentrations in quantum approximate optimization
Akshay, V., Rabinovich, D., Campos, E., & Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.104.l010401 · Cited by 103
The overlap gap property: A topological barrier to optimizing over random structures
Gamarnik, D. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2108492118 · Cited by 103
Effects of Quantum Noise on Quantum Approximate Optimization Algorithm
Xue, C., Chen, Z.-Y., Wu, Y.-C., & Guo, G.-P. (2021) · Chinese Physics Letters · doi:10.1088/0256-307x/38/3/030302 · Cited by 100
Freedman, M. H., & Hastings, M. B. (2014) · Quantum Information and Computation · doi:10.26421/qic14.1-2-9 · Cited by 100
Evaluating the noise resilience of variational quantum algorithms
Fontana, E., Fitzpatrick, N., Ramo, D. M., Duncan, R., & Rungger, I. (2021) · Physical Review A · doi:10.1103/physreva.104.022403 · Cited by 100
IEEE Custom Integrated Circuits Conference
(2005) · IEEE Journal of Solid-State Circuits · doi:10.1109/jssc.2005.848189 · Cited by 99
Quantum optimization with a novel Gibbs objective function and ansatz architecture search
Li, L., Fan, M., Coram, M., Riley, P., & Leichenauer, S. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023074 · Cited by 98
Extremal cuts of sparse random graphs
Dembo, A., Andrea Montanari, A., & Sen, S. (2017) · The Annals of Probability · doi:10.1214/15-aop1084 · Cited by 96
Bengtsson, A., Vikstål, P., Warren, C., Svensson, M., Gu, X. Q., Kockum, A. F., Krantz, P., Križan, C., Shiri, D., Svensson, I.-M., et al. (2020) · Physical Review Applied · doi:10.1103/physrevapplied.14.034010 · Cited by 95
Using models to improve optimizers for variational quantum algorithms
Sung, K. J., Yao, J., Harrigan, M. P., Rubin, N. C., Jiang, Z., Lin, L., Babbush, R., & McClean, J. R. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abb6d9 · Cited by 93
The 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 92
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
Lacroix, N., Hellings, C., Andersen, C. K., Paolo, A. D., Remm, A., Lazar, S., Krinner, S., Norris, G. J., Gabureac, M. S., Heinsoo, J., et al. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.020304 · Cited by 90
Classical symmetries and the Quantum Approximate Optimization Algorithm
Shaydulin, R., Hadfield, S., Hogg, T., & Safro, I. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03298-4 · Cited by 90
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1812.04170 · Cited by 88
Improved Exact Solver for the Weighted MAX-SAT Problem
Kügel, A. (2018) · EPiC series in computing · doi:10.29007/38lm · Cited by 88
Efficiently 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 84
Constraint Preserving Mixers for the Quantum Approximate Optimization Algorithm
Fuchs, F. G., Lye, K. O., Nilsen, H. M., Stasik, A. J., & Sartor, G. (2022) · Algorithms · doi:10.3390/a15060202 · Cited by 83
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, R., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. G. (2021) · Quantum Machine Intelligence · doi:10.1007/s42484-020-00022-w · Cited by 79
Layer VQE: A Variational Approach for Combinatorial Optimization on Noisy Quantum Computers
Liu, X., Angone, A., Shaydulin, R., Safro, I., Alexeev, Y., & Cincio, L. (2022) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3140190 · Cited by 78
Digitized Counterdiabatic Quantum Algorithm for Protein Folding
Chandarana, P., Hegade, N. N., Montalban, I., Solano, E., & Chen, X. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.014024 · Cited by 76
Non-Markovian qubit dynamics in the presence of 1/f noise
Burkard, G. (2009) · Physical Review B · doi:10.1103/physrevb.79.125317 · Cited by 75
Limits of local algorithms over sparse random graphs
Gamarnik, D., & Sudan, M. (2017) · The Annals of Probability · doi:10.1214/16-aop1114 · Cited by 73
Transferability 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
How Good is the Goemans--Williamson MAX CUT Algorithm?
Karloff, H. J. (1999) · SIAM Journal on Computing · doi:10.1137/s0097539797321481 · Cited by 71
Empirical performance bounds for quantum approximate optimization
Lotshaw, P. C., Humble, T. S., Herrman, R., Ostrowski, J., & Siopsis, G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03342-3 · Cited by 71
Feedback-Based Quantum Optimization
Magann, A. B., Rudinger, K. M., Grace, M. D., & Sarovar, M. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.250502 · Cited by 67
Different Strategies for Optimization Using the Quantum Adiabatic AlgorithmPreprint
Crosson, E., Farhi, E., Lin, C. Y.-Y., Lin, H.-H., & Shor, P. W. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1401.7320 · Cited by 66
Portfolio optimization with digitized counterdiabatic quantum algorithms
Hegade, N. N., Chandarana, P., Paul, K., Chen, X., Albarrán-Arriagada, F., & Solano, E. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.043204 · Cited by 66
A transmon quantum annealer: decomposing many-body Ising constraints into pair interactions
Leib, M., Zoller, P., & Lechner, W. (2016) · Quantum Science and Technology · doi:10.1088/2058-9565/1/1/015008 · Cited by 65
Error mitigation for variational quantum algorithms through mid-circuit measurements
Botelho, L., Glos, A., Kundu, A., Miszczak, J. A., Salehi, Ö., & Zimborás, Z. (2022) · Physical Review A · doi:10.1103/physreva.105.022441 · Cited by 65
Quantum approximate optimization via learning-based adaptive optimization
Cheng, L., Chen, Y., Zhang, S., & Zhang, S. (2024) · Communications Physics · doi:10.1038/s42005-024-01577-x · Cited by 65
Suboptimality of local algorithms for a class of max-cut problems
Chen, W., Gamarnik, D., Panchenko, D., & Rahman, M. (2019) · The Annals of Probability · doi:10.1214/18-aop1291 · Cited by 64
Analyzing the performance of variational quantum factoring on a superconducting quantum processor
Karamlou, A. H., Simon, W., Katabarwa, A., Scholten, T. L., Peropadre, B., & Cao, Y. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00478-z · Cited by 63
Characterizing local noise in QAOA circuits
Marshall, J., Wudarski, F., Hadfield, S., & Hogg, T. (2020) · IOP SciNotes · doi:10.1088/2633-1357/abb0d7 · Cited by 61
Error Propagation in NISQ Devices for Solving Classical Optimization Problems
González-García, G., Trivedi, R., & Cirac, J. I. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.040326 · Cited by 60
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
Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
Lacroix, N., Hellings, C., Andersen, C. K., Paolo, A. D., Remm, A., Lazar, S., Krinner, S., Norris, G. J., Gabureac, M. S., Heinsoo, J., et al. (2020) · Repository for Publications and Research Data (ETH Zurich) · doi:10.3929/ethz-b-000464528 · Cited by 59
Effects 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 59
Solving Boolean Satisfiability Problems With The Quantum Approximate Optimization Algorithm
Boulebnane, S., & Montanaro, A. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.030348 · Cited by 57
Quantum Approximate Optimization With Parallelizable Gates
Lechner, W. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3034798 · Cited by 57
To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
Moussa, C., Calandra, H., & Dunjko, V. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/abb8e5 · Cited by 55
Local classical MAX-CUT algorithm outperforms p=2 QAOA on high-girth regular graphs
Marwaha, K. (2021) · Quantum · doi:10.22331/q-2021-04-20-437 · Cited by 55
Graph neural network initialisation of quantum approximate optimisation
Jain, N., Coyle, B., Kashefi, E., & Kumar, N. (2022) · Quantum · doi:10.22331/q-2022-11-17-861 · Cited by 55
Moussa, C., Wang, H., Bäck, T., & Dunjko, V. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00131-4 · Cited by 55
Mundada, P., Barbosa, A., Maity, S., Wang, Y., Merkh, T., Stace, T. M., Nielson, F. F., Carvalho, A. R. R., Hush, M., Biercuk, M. J., et al. (2023) · Physical Review Applied · doi:10.1103/physrevapplied.20.024034 · Cited by 55
Maciejewski, F. B., Baccari, F., Zimborás, Z., & Oszmaniec, M. (2021) · Quantum · doi:10.22331/q-2021-06-01-464 · Cited by 54
Boulebnane, S., & Montanaro, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2110.10685 · Cited by 54
Halperin, E., Livnat, D., & Zwick, U. (2004) · Journal of Algorithms · doi:10.1016/j.jalgor.2004.06.001 · Cited by 53
Crosstalk analysis for single-qubit and two-qubit gates in spin qubit arrays
Heinz, I., & Burkard, G. (2021) · Physical review. B./Physical review. B · doi:10.1103/physrevb.104.045420 · Cited by 53
Analyzing the Performance of Variational Quantum Factoring on a Superconducting Quantum Processor
Karamlou, A. H., Simon, W. A., Katabarwa, A., Scholten, T. L., Peropadre, B., & Cao, Y. (2020) · arXiv · doi:10.48550/arxiv.2012.07825 · Cited by 52
A study of the performance of classical minimizers in the Quantum Approximate Optimization Algorithm
Fernández-Pendás, M., Combarro, E. F., Vallecorsa, S., Ranilla, J., & Rúa, I. F. (2022) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113388 · Cited by 52
Quantum Optimization via Four-Body Rydberg Gates
Dlaska, C., Ender, K., Mbeng, G. B., Kruckenhauser, A., Lechner, W., & van Bijnen, R. (2022) · Physical Review Letters · doi:10.1103/physrevlett.128.120503 · Cited by 51
Low-Depth Mechanisms for Quantum Optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Zhang, J., Boixo, S., Smelyanskiy, V., Babbush, R., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.030312 · Cited by 51
Classically Optimal Variational Quantum Algorithms
Wurtz, J., & Love, P. J. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3122568 · Cited by 49
Performance of QAOA on Typical Instances of Constraint Satisfaction Problems with Bounded DegreePreprint
Lin, C. Y.-Y., & Zhu, E. Y. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1601.01744 · Cited by 48
Entanglement perspective on the quantum approximate optimization algorithm
Dupont, M., Didier, N., Hodson, M. J., Moore, J. E., & Reagor, M. J. (2022) · Physical Review A · doi:10.1103/physreva.106.022423 · Cited by 48
Variational quantum algorithm for molecular geometry optimization
Delgado, A., Arrazola, J. M., Jahangiri, S., Niu, Z., Izaac, J., Roberts, C., & Killoran, N. (2021) · Physical Review A · doi:10.1103/physreva.104.052402 · Cited by 47
Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection
Cui, J., Xiong, Y., Ng, S. X., & Hanzo, L. (2022) · IEEE Transactions on Communications · doi:10.1109/tcomm.2022.3185287 · Cited by 47
Lyapunov-control-inspired strategies for quantum combinatorial optimization
Magann, A. B., Rudinger, K., Grace, M., & Sarovar, M. (2022) · Physical Review A · doi:10.1103/physreva.106.062414 · Cited by 47
Optimized SWAP networks with equivalent circuit averaging for QAOA
Hashim, A., Rines, R., Omole, V., Naik, R., Kreikebaum, J. M., Santiago, D., Chong, F. T., Siddiqi, I. A., & Gokhale, P. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.033028 · Cited by 47
Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers
Pelofske, E., Bärtschi, A., & Eidenbenz, S. (2023) · Lecture Notes in Computer Science · doi:10.1007/978-3-031-32041-5_13 · Cited by 47
Lykov, D., Wurtz, J., Poole, C., Saffman, M. E., Noel, T., & Alexeev, Y. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00718-4 · Cited by 47
Noise-resilient variational hybrid quantum-classical optimization
Gentini, L., Cuccoli, A., Pirandola, S., Verrucchi, P., & Banchi, L. (2020) · Physical Review A · doi:10.1103/physreva.102.052414 · Cited by 46
Resource efficient gadgets for compiling adiabatic quantum optimization problems
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013) · Annalen der Physik · doi:10.1002/andp.201300120 · Cited by 46
Quantum Annealing with Longitudinal Bias Fields
Graß, T. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.120501 · Cited by 46
Training saturation in layerwise quantum approximate optimization
Campos, E., Rabinovich, D., Akshay, V., & Biamonte, J. (2021) · Physical Review A · doi:10.1103/physreva.104.l030401 · Cited by 46
Applying the quantum approximate optimization algorithm to the minimum vertex cover problem
Zhang, Y., Mu, X. D., Liu, X., Wang, X., Zhang, X., Li, K., Wu, T., Zhao, D., & Dong, C. (2022) · Applied Soft Computing · doi:10.1016/j.asoc.2022.108554 · Cited by 46
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 46
Low depth mechanisms for quantum optimization
McClean, J. R., Harrigan, M. P., Mohseni, M., Rubin, N. C., Jiang, Z., Boixo, S., Smelyanskiy, V. N., Babbush, R., & Neven, H. (2020) · arXiv · doi:10.48550/arxiv.2008.08615 · Cited by 45
Evaluation of QAOA based on the approximation ratio of individual samples
Larkin, J. M., Jonsson, M., Justice, D., & Guerreschi, G. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac6973 · Cited by 45
Quantum Approximation for Wireless Scheduling
Choi, J., Oh, S., & Kim, J. (2020) · Applied Sciences · doi:10.3390/app10207116 · Cited by 44
Impact of graph structures for QAOA on MaxCut
Herrman, R., Treffert, L., Ostrowski, J., Lotshaw, P. C., Humble, T. S., & Siopsis, G. (2021) · Quantum Information Processing · doi:10.1007/s11128-021-03232-8 · Cited by 44
Quantum Computing Techniques for Multi-knapsack Problems
Awasthi, A., Bär, F., Doetsch, J. A., Ehm, H., Erdmann, M., Hess, M., Klepsch, J., Limacher, P. A., Luckow, A., Niedermeier, C. A., et al. (2023) · Lecture notes in networks and systems · doi:10.1007/978-3-031-37963-5_19 · Cited by 44
Streif, M., Yarkoni, S., Skolik, A., Neukart, F., & Leib, M. (2021) · Physical Review A · doi:10.1103/physreva.104.012403 · Cited by 41
The overlap gap property and approximate message passing algorithms for $p$-spin models
Gamarnik, D., & Jagannath, A. (2021) · The Annals of Probability · doi:10.1214/20-aop1448 · Cited by 41
Quantum approximate optimization algorithm with adaptive bias fields
Yu, Y., Cao, C., Dewey, C., Wang, X., Shannon, N., & Joynt, R. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023249 · Cited by 41
Reinforcement learning assisted recursive QAOA
Patel, Y. J., Jerbi, S., Bäck, T., & Dunjko, V. (2024) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-023-00214-w · Cited by 41
Performance of Sequential Local Algorithms for the Random NAE-$K$-SAT Problem
Gamarnik, D., & Sudan, M. (2017) · SIAM Journal on Computing · doi:10.1137/140989728 · Cited by 40
Baker, J. S., & Radha, S. K. (2022) · RePEc: Research Papers in Economics · doi:10.48550/arxiv.2202.06782 · Cited by 40
Exploiting Symmetry Reduces the Cost of Training QAOA
Shaydulin, R., & Wild, S. M. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3066275 · Cited by 39
Analytical framework for quantum alternating operator ansätze
Hadfield, S., Hogg, T., & Rieffel, E. G. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/aca3ce · Cited by 39
Optimizing Ansatz Design in QAOA for Max-cutPreprint
Majumdar, R., Madan, D., Bhoumik, D., Vinayagamurthy, D., Raghunathan, S., & Sur‐Kolay, S. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2106.02812 · Cited by 39
Quantum approximate optimization for hard problems in linear algebra
Borle, A., Elfving, V. E., & Lomonaco, S. J. (2021) · SciPost Physics Core · doi:10.21468/scipostphyscore.4.4.031 · Cited by 39
Warm-Starting and Quantum Computing: A Systematic Mapping Study
Truger, F., Barzen, J., Bechtold, M., Beisel, M., Leymann, F., Mandl, A., & Yussupov, V. (2024) · ACM Computing Surveys · doi:10.1145/3652510 · Cited by 38
Quantum algorithms with local particle-number conservation: Noise effects and error correction
Streif, M., Leib, M., Wudarski, F., Rieffel, E. G., & Wang, Z. (2021) · Physical Review A · doi:10.1103/physreva.103.042412 · Cited by 36
Cited by
Improving Quantum Approximate Optimization by Noise-Directed Adaptive Remapping
Maciejewski, F. B., Biamonte, J., Hadfield, S., & Venturelli, D. (2025) · Quantum · doi:10.22331/q-2025-11-06-1906 · Cited by 10
Introduction to quantum error correction with stabilizer codes
Bradshaw, Z. P., Dale, J. J., & Evans, E. N. (2026) · Annals of Physics · doi:10.1016/j.aop.2026.170353 · Cited by 4
Metadata
- Authors
- Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A.
- Venue
- Physics Reports
- Publisher
- Elsevier BV
- Published
- 2024-06
- Volume
- 1068
- Pages
- 1-66
- ISSN
- 0370-1573 (ISSN-L)
- OpenAlex
- W4392877631
- Cited by
- 408
- References
- 245
- FWCI
- 60.12
- Type
- journal article
- Language
- en
- Open access
- green
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.