On Circuit Depth Scaling For Quantum Approximate Optimization
V. Akshay, H. Philathong, E. Campos, D. Rabinovich, I., Zacharov, Xiao-Ming Zhang, J. Biamonte

TL;DR
This paper investigates how the circuit depth needed for the quantum approximate optimization algorithm (QAOA) scales with problem density and size, proposing a predictive model validated through simulations on MAX-2-SAT instances.
Contribution
It introduces a logistic saturation-based model for critical depth scaling in QAOA, validated with simulated data up to 15 qubits, revealing fixed and problem size-dependent behaviors.
Findings
Critical depth saturates at 10 for densities beyond 4.
The predictive model fits simulation data within 3σ confidence.
A linear trend for critical depth with problem size is observed between 5 and 15 qubits.
Abstract
Variational quantum algorithms are the centerpiece of modern quantum programming. These algorithms involve training parameterized quantum circuits using a classical co-processor, an approach adapted partly from classical machine learning. An important subclass of these algorithms, designed for combinatorial optimization on currrent quantum hardware, is the quantum approximate optimization algorithm (QAOA). It is known that problem density - a problem constraint to variable ratio - induces under-parametrization in fixed depth QAOA. Density dependent performance has been reported in the literature, yet the circuit depth required to achieve fixed performance (henceforth called critical depth) remained unknown. Here, we propose a predictive model, based on a logistic saturation conjecture for critical depth scaling with respect to density. Focusing on random instances of MAX-2-SAT, we test…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
