The DOI matches its Crossref record; 42 of the 42 references it cites were found in a registry or an index.
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Open accessAbstract
In this paper, we eliminate the classical outer learning loop of the quantum approximate optimization algorithm (QAOA) and present a strategy to find good parameters for QAOA based on topological arguments of the problem graph and tensor network techniques. Starting from the observation of the concentration of control parameters of QAOA, we find a way to classically infer parameters which scales polynomially in the number of qubits and exponentially with the depth of the circuit. Using this strategy, the quantum processing unit (QPU) is only needed to sample from the final state of QAOA. This method paves the way for a variation-free version of QAOA and makes QAOA more practical for applications on NISQ devices. We investigate the performance of the proposed approach for the initial assumptions and its resilience with respect to situations where they are not fulfilled. Moreover, we investigate the applicability of our method beyond the scope of QAOA, in improving schedules for quantum annealing.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“Several other approaches have been identified where the ansatz adaptations happen as a secondary effect, e.g., References [36, 48, 82, 131, 153].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [131]
Experimental — accuracy not yet measuredThe cited source says what the claim attributes to it.
In the citing paper
“As repeated calls to the quantum computer for updating the parameters are considered a major bottleneck for VQAs in general, Streif and Leib [131] suggested a different approach to QAOA by introducing a technique that avoids the outer loop optimization and therefore repeated calls to get optimal parameters.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [131]
The cited source says what the claim attributes to it.
In the citing paper
“The proposed method is based on the features of the according problem graph and makes use of tensor network techniques.”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [131]
The cited source says what the claim attributes to it.
In the citing paper
“An adaptation to QAOA, which does not require exhaustive access to the quantum processing unit [131], has been used to solve the binary paint shop problem [132].”
From Quantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study (2024) · cites this paper as [131]
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
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. M. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 9,062
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
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
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 · cited 3×
“There exist many versions tailored for different fields of applications, such as the variational quantum eigensolver (VQE) [8] for finding the minimal energy state in quantum chemistry applications or quantum neural networks (QNNs) [9, 10] for quantum machine learning applications.”
BackgroundMethodIsing formulations of many NP problems
Lucas, A. (2014) · Frontiers in Physics · doi:10.3389/fphy.2014.00005 · Cited by 2,512
Orús, R. (2014) · Annals of Physics · doi:10.1016/j.aop.2014.06.013 · Cited by 2,255
QuTiP 2: A Python framework for the dynamics of open quantum systems
Johansson, J. R., Nation, P. D., & Nori, F. (2012) · Computer Physics Communications · doi:10.1016/j.cpc.2012.11.019 · Cited by 2,251
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Mitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639
On the computational complexity of Ising spin glass models
Barahona, F. (1982) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/15/10/028 · Cited by 1,303
Demonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L., Chow, J. M., Gambetta, J., Bishop, L. S., Johnson, B., Schuster, D., Majer, J., Blais, A., Frunzio, L., Girvin, S. M., et al. (2009) · Nature · doi:10.1038/nature08121 · Cited by 1,189
Classification with Quantum Neural Networks on Near Term Processors
Farhi, E., & Neven, H. (2020) · doi:10.37686/qrl.v1i2.80 · Cited by 1,176
14-Qubit Entanglement: Creation and Coherence
Monz, T., Schindler, P., Barreiro, J. T., Chwalla, M., Nigg, D., Coish, W. A., Harlander, M., Hänsel, W., Hennrich, M., & Blatt, R. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.130506 · Cited by 1,110
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
Demonstration of a Neutral Atom Controlled-NOT Quantum Gate
Isenhower, L., Urban, E., Zhang, X. L., Gill, A. T., Henage, T., Johnson, T. A., Walker, T. G., & Saffman, M. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.010503 · Cited by 848
Coherent Josephson Qubit Suitable for Scalable Quantum Integrated Circuits
Barends, R., Kelly, J., Megrant, A., Sank, D., Jeffrey, E., Chen, Y., Yin, Y., Chiaro, B., Mutus, J., Neill, C., et al. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.080502 · Cited by 779
Demonstration of a small programmable quantum computer with atomic qubits
Debnath, S., Linke, N. M., Figgatt, C., Landsman, K. A., Wright, K., & Monroe, C. (2016) · Nature · doi:10.1038/nature18648 · Cited by 777
Qubit Architecture with High Coherence and Fast Tunable Coupling
Chen, Y., Neill, C., Roushan, P., Leung, N., Fang, M., Barends, R., Kelly, J., Campbell, B., Chen, Z., Chiaro, B., et al. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.220502 · Cited by 591
Simulating Quantum Computation by Contracting Tensor Networks
Markov, I. L., & Shi, Y. (2008) · SIAM Journal on Computing · doi:10.1137/050644756 · Cited by 472
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
Layered architecture for quantum computing
Jones, N. C., Van Meter, R., Fowler, A. G., McMahon, P. L., Kim, J., Ladd, T. D., & Yamamoto, Y. (2012) · Physical Review X · doi:10.1103/physrevx.2.031007 · Cited by 332
Quantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Learning to learn with quantum neural networks via classical neural networksPreprint
Verdon, G., Broughton, M., McClean, J. R., Sung, K. J., Babbush, R., Zhang, J., Neven, H., & Mohseni, M. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1907.05415 · Cited by 250
Probing for quantum speedup in spin-glass problems with planted solutions
Hen, I., Job, J., Albash, T., Rønnow, T. F., Troyer, M., & Lidar, D. A. (2015) · Physical Review A · doi:10.1103/physreva.92.042325 · Cited by 165
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 145
Classical and quantum bounded depth approximation algorithms
Hastings, M. B. (2019) · Quantum Information and Computation · doi:10.26421/qic19.13-14-3 · Cited by 144
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
opt\_einsum - A Python package for optimizing contraction order for einsum-like expressions
Smith, D. G. A., & Gray, J. (2018) · The Journal of Open Source Software · doi:10.21105/joss.00753 · Cited by 122
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
Classical and Quantum Bounded Depth Approximation Algorithms
Hastings, M. B. (2019) · arXiv · doi:10.48550/arxiv.1905.07047 · Cited by 96
Brandao, F. G. S. L., Broughton, M., Farhi, E., Gutmann, S., & Neven, H. (2018) · arXiv · doi:10.48550/arxiv.1812.04170 · Cited by 88
A quantum algorithm to train neural networks using low-depth circuits
Verdon, G., Broughton, M., & Biamonte, J. (2017) · arXiv · doi:10.48550/arxiv.1712.05304 · Cited by 87
A deceptive step towards quantum speedup detection
Mandrà, S., & Katzgraber, H. G. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aac8b2 · Cited by 82
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
qTorch: The quantum tensor contraction handler
Fried, E., Sawaya, N. P. D., Cao, Y., Kivlichan, I., Romero, J., & Aspuru‐Guzik, A. (2018) · PLoS ONE · doi:10.1371/journal.pone.0208510 · Cited by 48
Making trotters sprint: A variational imaginary time ansatz for quantum many-body systems
Beach, M. J. S., Melko, R. G., Grover, T., & Hsieh, T. H. (2019) · Physical review. B./Physical review. B · doi:10.1103/physrevb.100.094434 · Cited by 39
Comparison of QAOA with Quantum and Simulated Annealing
Streif, M., & Leib, M. (2019) · arXiv · doi:10.48550/arxiv.1901.01903 · Cited by 35
Self-citationQuantum 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 35
Bang-bang control as a design principle for classical and quantum optimization algorithms
Bapat, A., & Jordan, S. P. (2019) · Quantum Information and Computation · doi:10.26421/qic19.5-6-4 · Cited by 28
Cited by
Sorted by citations
A review on Quantum Approximate Optimization Algorithm and its variants
Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., & Summer, A. (2024) · Physics Reports · doi:10.1016/j.physrep.2024.03.002 · Cited by 563
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
Self-citationDiagnosing Barren Plateaus with Tools from Quantum Optimal Control
Larocca, M., Czarnik, P., Sharma, K., Muraleedharan, G., Coles, P. J., & Cerezo, M. (2022) · Quantum · doi:10.22331/q-2022-09-29-824 · Cited by 272
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
Counterdiabaticity and the quantum approximate optimization algorithm
Wurtz, J., & Love, P. J. (2022) · Quantum · doi:10.22331/q-2022-01-27-635 · Cited by 124
Metadata
- Authors
- Streif, M., & Leib, M.
- Affiliations
- Volkswagen Group (Germany) (DE)
- Corresponding author
- Streif, Michael
- Leib, Martin
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2020-05-12
- Volume
- 5
- Issue
- 3
- Pages
- 034008
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2969876173
- Cited by
- 125
- References
- 41
- Citations by year
- 2026: 8 · 2025: 16 · 2024: 23 · 2023: 24 · 2022: 26 · 2021: 15 · 2020: 11
- FWCI
- 7.40
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- Quantum Science and Technology (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- European Unions Horizon 2020 (828826)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Keywords
- quantum approximate optimization algorithm, tensor networks, NISQ devices, variational quantum algorithms, hybrid quantum-classical 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
