Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.09584

Quantum Approximation Complexity of Classical Optimization Problems

Stuart Hadfield

quant-phcs.CCSubmitted Oct 7, 2026• Announced Oct 8, 2026• 0 citations
arXivHTMLPDF

Abstract

Classical approximation complexity asks what solution quality can be guaranteed with polynomial-time computation. The classes APX, PTAS, and FPTAS distinguish a fixed approximation ratio, approximation to any fixed accuracy, and approximation schemes whose running time is also polynomial in inverse accuracy. Their randomized counterparts are R-APX, R-PTAS, and R-FPTAS. We define bounded-error quantum counterparts BQ-APX, BQ-PTAS, and BQ-FPTAS. Membership requires a uniform quantum algorithm that, on every input, returns a feasible classical solution achieving at least the claimed approximation ratio with probability at least 2/3. Scores (objective values) must be efficiently classically computable. Running time includes parameter selection, preparation, measurement, decoding, and repetition. Many quantum optimization methods are used heuristically, and high benchmark scores alone do not establish these guarantees. We further establish a conditional hierarchy for logarithmic, polynomial, and exponential approximation factors. Assuming NP $\nsubseteq$ BQP, the quantum classes form a strict hierarchy. Problems based on prime factorization and discrete logarithms give conditional quantum-classical separations. Certified Maximum Order has an exact quantum algorithm, while any randomized polynomial-time algorithm guaranteeing at least an inverse-polynomial approximation ratio on every input would yield efficient factoring. Discrete-Logarithm Fitting has an exact quantum algorithm and a deterministic one-half approximation, but any fixed improvement over one half would give a randomized polynomial-time algorithm for the safe-prime discrete logarithm problem. Our results show, under explicit complexity assumptions, that quantum computation can improve worst-case approximation guarantees. A quantum-classical gap for common problems such as MaxCut or MaxSAT remains open.

AI Summary

The paper asks how to classify worst-case quantum approximation guarantees for classical optimization problems with efficiently checkable solutions and objective values. It defines $\mathsf{BQ\text{-}APX}$, $\mathsf{BQ\text{-}PTAS}$, and $\mathsf{BQ\text{-}FPTAS}$ using uniform quantum algorithms that return a feasible classical solution meeting the promised ratio with probability at least $2/3$. Runtime includes parameter selection, preparation, measurement, decoding, and repetition. Assuming $\mathsf{NP}\nsubseteq\mathsf{BQP}$, standard approximation gaps and integrality arguments establish strict inclusions between the three quantum classes, with further distinctions for logarithmic, polynomial, and exponential approximation factors. The main quantum–classical separation uses Certified Maximum Order: maximize a certified multiplicative order modulo $N$, whose optimum is the Carmichael function $\lambda(N)$. Factoring and component-group constructions give an exact quantum optimizer. Conversely, any randomized polynomial-time approximation within a polynomial factor yields efficient factoring: a certified order $r$ divides $\lambda(N)$, allowing enumeration of the polynomially many possible missing multipliers before exponent-based factoring. A second construction, Discrete-Logarithm Fitting, has a deterministic $1/2$ approximation and an exact quantum optimizer; any fixed improvement over $1/2$ would solve safe-prime discrete logarithm, by sample concentration over competing hypotheses. The paper also converts decoded expected-score guarantees into bounded-error outputs through an elementary tail bound and repetition. The separations are conditional and arise from exact quantum search on constructed arithmetic problems; the hierarchy witnesses adapt classical results. No quantum ratio advantage is established for unrestricted MaxCut or MaxSAT. Surrogate energies require a separate connection to decoded scores, and oracle-query or streaming-space advantages do not establish explicit-input polynomial-time separations.

Little sign of AI-generated textIncremental

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Polynomial Time Quantum Approximation Schemes for Constrained Optimisation

Chinonso Onah, Kristel Michielsen

When does a noisy quantum sampler yield an end-to-end polynomial-time optimization algorithm with performance guarantees? Building on finite-depth and finite-shot guarantees for Constraint-Enhanced QAOA, we show that inverse-polynomial ideal probability on the optimal set, together with independent sampling, polynomial-time feasibility repair, and scoring, produces an exact-hit fully polynomial randomized approximation scheme, which we call an FPRASq. This guarantee survives device noise within an instance-dependent window. For effective circuit depth linear in the product of layer count and problem size, preserving an inverse-depth fraction of the ideal optimal mass increases the required shot complexity by one power of the problem size. Beyond this window, deterministic repair guarantees feasibility and provides an instance-dependent approximation guarantee whenever the induced objective inflation is controlled. The resulting NP-HQ algorithm fits the Chen-Cotler-Huang-Li oracle model. On any NP-hard kernel-admissible promise family, reproducing its inverse-polynomial optimal overlap with a polynomial-time classical sampler would imply that NP is contained in BPP, even with identical repair and perfect access to the constraint structure. Thus, the separation lies in generating the sampling distribution. We further introduce Heavy-Hitter QAOA, which preserves these conditional guarantees while reducing the retained candidate set and classical post-processing cost by one power of the problem size. Hardware experiments on IBM Eagle r3 processors cover instances with up to one hundred logical variables and match or improve every tested QOptlib reference tour.

quant-pharXiv:2608.01121•Aug 4, 2026•2 citations

Complexity Barriers to State Preparation in Quantum Approximate Optimization

Stuart Hadfield

For many important optimization problems we are restricted to approximate solutions in practice due to computational complexity. Distinct from the exact optimization setting, approximate optimization admits performance measures beyond whether the optimum is found, with different tradeoffs and complexity. For MaxCut, a near-unity (ordinary) approximation ratio can coexist with near-zero improvement (gain) over a random cut. For the standard encoding, the unconditional classical MaxCut-Gain hardness gap implies that \emph{any uniformly efficient quantum or hybrid procedure recovering a fixed positive fraction of the optimal classical gain on every input, with at least inverse-polynomial success probability, would place} NP \emph{in} BQP. Such a procedure is therefore believed impossible under standard assumptions. We broadly address where our worst-case barriers do or do not apply across the quantum algorithm landscape. We prove that the barrier survives quantum random access optimization (QRAO) compression and applies between the classical and relaxed optimal values. For every input, a product state attains the classical optimum. Thus the barrier to reaching the classical threshold does not arise from a need for entanglement. For $d\in\{2,3\}$ variables per qubit, the known decoder transfers encoded energy gain to decoded mean gain by the exact factor $1/d^2$. Combining this identity with MaxCut-Gain hardness gives an operational preparation barrier for QRAO. We also construct hard $n$-qubit families with relative quantum relaxation excess $Θ(1/n)$, while the maximally mixed state has energy approximation ratio $1-Θ(1/n)$, zero encoded energy gain, and hence zero decoded mean gain. Our results separate the effects of relaxation tightness and energy approximation from operational accessibility, motivating more comprehensive accounting in benchmarking and performance assessment.

quant-pharXiv:2609.31520•Sep 28, 2026•2 citations

Lower bounds on the number of rounds of the quantum approximate optimization algorithm required for guaranteed approximation ratios

Naphan Benchasattabuse, Andreas Bärtschi, Luis Pedro García-Pintos +3 more

The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) leverage a connection between quantum annealing times and the angles of the QAOA to derive a lower bound on the number of rounds of the QAOA with respect to the guaranteed approximation ratio. We apply and calculate this bound with Grover-style mixing unitaries and (ii) show that this type of QAOA requires at least a polynomial number of rounds to guarantee any constant approximation ratios for most problems. We also (iii) show that the bound depends only on the statistical values of the objective functions and, when the problem can be modeled as a $k$-local Hamiltonian, can be easily estimated from the coefficients of the Hamiltonians. For the conventional transverse-field mixer, (iv) our framework gives a trivial lower bound to all bounded-occurrence local cost problems and for all strictly $k$-local cost Hamiltonians matching known results that constant approximation ratio is obtainable with a constant-round QAOA for a few optimization problems from these classes. Using our proof framework, (v) we recover the Grover lower bound for unstructured search and, with small modification, show that our bound applies to any QAOA-style search protocol that starts in the ground state of the mixing unitaries.

arXiv:2308.15442•Physical Review A•Jun 9, 2025•22 citations

Global Optimization for Parametrized Quantum Circuits

Iosif Sakos, Antonios Varvitsiotis, Georgios Korpas +1 more

In the absence of error correction, noisy intermediate-scale quantum devices are operated by training parametrized quantum circuits (PQCs) so as to minimize a suitable loss function. Finding the optimal parameters of those circuits is a hard optimization problem, where global guarantees are known only for highly structured cases of limited practical relevance, and first-order methods can fail to find even local minima due to the presence of barren plateaus. In this work, we study the training of practical classes of PQCs, namely polynomial-depth circuits with a constant number of trainable parameters. This captures widely used PQC families, including fixed-depth QAOA, hardware-efficient ansätze, and Fixed Parameter Count QAOA. Our main technical result is a fully polynomial randomized approximation scheme (FPRAS), which, for every $ε>0$, returns an $ε$-approximate solution to the problem's global optimum with high probability, and has runtime and query complexity polynomial in $1/ε$ and the number of qubits. Unlike the standard hybrid quantum-classical training loop in variational algorithms, where the quantum device is queried repeatedly throughout the training, our approach separates the computation into two distinct stages: (1) an initial quantum data-acquisition phase, followed by (2) a classical global-optimization phase based on the trigonometric moment/sum-of-squares hierarchies. Under a standard flat-extension condition, which can be checked numerically, the method also supports the extraction of optimal circuit parameters. The existence of an FPRAS implies that the promise problem associated with the optimization of poly-depth constant-parameter PQC is in BQP. This imposes a limitation on the expressive power of the class, namely, it cannot encode combinatorial optimization problems whose objective values are separated by an inverse-polynomial gap.

quant-pharXiv:2603.21757•Mar 24, 2026•2 citations

On constant-time quantum annealing and guaranteed approximations for graph optimization problems

Arthur Braida, Simon Martiel, Ioan Todinca

Abstract Quantum annealing (QA) is a computational framework where a quantum system’s continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for optimization problems, including NP-hard ones if we allow an exponentially large running time. While QA is widely studied from a heuristic point of view, little is known about theoretical guarantees on the quality of the solutions obtained in polynomial time. In this paper, we use a technique borrowed from theoretical physics, the Lieb–Robinson (LR) bound, and develop new tools proving that short, constant-time QA guarantees constant factor approximations ratios for some optimization problems when restricted to bounded degree graphs. Informally, on bounded degree graphs the LR bound allows us to retrieve a (relaxed) locality argument, through which the approximation ratio can be deduced by studying subgraphs of bounded radius. We illustrate our tools on problems MaxCut and maximum independent set for cubic graphs, providing explicit approximation ratios and the runtimes needed to obtain them. Our results are of similar flavor to the well-known ones obtained in the different but related QAOA (quantum optimization algorithms) framework.

arXiv:2202.01636•Quantum Science and Technology•Sep 1, 2022•5 citations

MaxCut quantum approximate optimization algorithm performance guarantees for p>1

Jonathan Wurtz, Peter J. Love

We obtain worst-case performance guarantees for $p=2$ and 3 QAOA for MaxCut on uniform 3-regular graphs. Previous work by Farhi et al. obtained a lower bound on the approximation ratio of 0.692 for $p=1$. We find a lower bound of 0.7559 for $p=2$, where worst-case graphs are those with no cycles $\ensuremath{\le}5$. This bound holds for any 3-regular graph evaluated at particular fixed parameters. We conjecture a hierarchy for all $p$, where worst-case graphs have with no cycles $\ensuremath{\le}2p+1$. Under this conjecture, the approximation ratio is at least 0.7924 for all 3-regular graphs and $p=3$. In addition, using an indistinguishable argument we find an upper bound on the worst-case approximation ratio for all $p$, which indicates classes of graphs for which there can be no quantum advantage for at least $p<6$.

arXiv:2010.11209•Physical Review A•Apr 27, 2021•138 citations
Classical approximation complexity asks what solution quality can be guaranteed with polynomial-time computation. The classes APX, PTAS, and FPTAS distinguish a fixed approximation ratio, approximation to any fixed accuracy, and approximation schemes whose running time is also polynomial in inverse accuracy. Their randomized counterparts are R-APX, R-PTAS, and R-FPTAS. We define bounded-error quantum counterparts BQ-APX, BQ-PTAS, and BQ-FPTAS. Membership requires a uniform quantum algorithm that, on every input, returns a feasible classical solution achieving at least the claimed approximation ratio with probability at least 2/3. Scores (objective values) must be efficiently classically computable. Running time includes parameter selection, preparation, measurement, decoding, and repetition. Many quantum optimization methods are used heuristically, and high benchmark scores alone do not establish these guarantees. We further establish a conditional hierarchy for logarithmic, polynomial, and exponential approximation factors.
Assuming NP ⊈\nsubseteq⊈ BQP, the quantum classes form a strict hierarchy. Problems based on prime factorization and discrete logarithms give conditional quantum-classical separations. Certified Maximum Order has an exact quantum algorithm, while any randomized polynomial-time algorithm guaranteeing at least an inverse-polynomial approximation ratio on every input would yield efficient factoring. Discrete-Logarithm Fitting has an exact quantum algorithm and a deterministic one-half approximation, but any fixed improvement over one half would give a randomized polynomial-time algorithm for the safe-prime discrete logarithm problem. Our results show, under explicit complexity assumptions, that quantum computation can improve worst-case approximation guarantees. A quantum-classical gap for common problems such as MaxCut or MaxSAT remains open.
The paper asks how to classify worst-case quantum approximation guarantees for classical optimization problems with efficiently checkable solutions and objective values. It defines BQ-APX\mathsf{BQ\text{-}APX}BQ-APX, BQ-PTAS\mathsf{BQ\text{-}PTAS}BQ-PTAS, and BQ-FPTAS\mathsf{BQ\text{-}FPTAS}BQ-FPTAS using uniform quantum algorithms that return a feasible classical solution meeting the promised ratio with probability at least 2/32/32/3. Runtime includes parameter selection, preparation, measurement, decoding, and repetition.
Assuming NP⊈BQP\mathsf{NP}\nsubseteq\mathsf{BQP}NP⊈BQP, standard approximation gaps and integrality arguments establish strict inclusions between the three quantum classes, with further distinctions for logarithmic, polynomial, and exponential approximation factors. The main quantum–classical separation uses Certified Maximum Order: maximize a certified multiplicative order modulo NNN, whose optimum is the Carmichael function λ(N)\lambda(N)λ(N). Factoring and component-group constructions give an exact quantum optimizer. Conversely, any randomized polynomial-time approximation within a polynomial factor yields efficient factoring: a certified order rrr divides λ(N)\lambda(N)λ(N), allowing enumeration of the polynomially many possible missing multipliers before exponent-based factoring. A second construction, Discrete-Logarithm Fitting, has a deterministic 1/21/21/2 approximation and an exact quantum optimizer; any fixed improvement over 1/21/21/2 would solve safe-prime discrete logarithm, by sample concentration over competing hypotheses.
The paper also converts decoded expected-score guarantees into bounded-error outputs through an elementary tail bound and repetition. The separations are conditional and arise from exact quantum search on constructed arithmetic problems; the hierarchy witnesses adapt classical results. No quantum ratio advantage is established for unrestricted MaxCut or MaxSAT. Surrogate energies require a separate connection to decoded scores, and oracle-query or streaming-space advantages do not establish explicit-input polynomial-time separations.
When does a noisy quantum sampler yield an end-to-end polynomial-time optimization algorithm with performance guarantees? Building on finite-depth and finite-shot guarantees for Constraint-Enhanced QAOA, we show that inverse-polynomial ideal probability on the optimal set, together with independent sampling, polynomial-time feasibility repair, and scoring, produces an exact-hit fully polynomial randomized approximation scheme, which we call an FPRASq. This guarantee survives device noise within an instance-dependent window. For effective circuit depth linear in the product of layer count and problem size, preserving an inverse-depth fraction of the ideal optimal mass increases the required shot complexity by one power of the problem size. Beyond this window, deterministic repair guarantees feasibility and provides an instance-dependent approximation guarantee whenever the induced objective inflation is controlled. The resulting NP-HQ algorithm fits the Chen-Cotler-Huang-Li oracle model. On any NP-hard kernel-admissible promise family, reproducing its inverse-polynomial optimal overlap with a polynomial-time classical sampler would imply that NP is contained in BPP, even with identical repair and perfect access to the constraint structure. Thus, the separation lies in generating the sampling distribution. We further introduce Heavy-Hitter QAOA, which preserves these conditional guarantees while reducing the retained candidate set and classical post-processing cost by one power of the problem size. Hardware experiments on IBM Eagle r3 processors cover instances with up to one hundred logical variables and match or improve every tested QOptlib reference tour.
For many important optimization problems we are restricted to approximate solutions in practice due to computational complexity. Distinct from the exact optimization setting, approximate optimization admits performance measures beyond whether the optimum is found, with different tradeoffs and complexity. For MaxCut, a near-unity (ordinary) approximation ratio can coexist with near-zero improvement (gain) over a random cut. For the standard encoding, the unconditional classical MaxCut-Gain hardness gap implies that \emph{any uniformly efficient quantum or hybrid procedure recovering a fixed positive fraction of the optimal classical gain on every input, with at least inverse-polynomial success probability, would place} NP \emph{in} BQP. Such a procedure is therefore believed impossible under standard assumptions. We broadly address where our worst-case barriers do or do not apply across the quantum algorithm landscape. We prove that the barrier survives quantum random access optimization (QRAO) compression and applies between the classical and relaxed optimal values. For every input, a product state attains the classical optimum. Thus the barrier to reaching the classical threshold does not arise from a need for entanglement. For d∈{2,3}d\in\{2,3\}d∈{2,3} variables per qubit, the known decoder transfers encoded energy gain to decoded mean gain by the exact factor 1/d21/d^21/d2. Combining this identity with MaxCut-Gain hardness gives an operational preparation barrier for QRAO. We also construct hard nnn-qubit families with relative quantum relaxation excess Θ(1/n)Θ(1/n)Θ(1/n), while the maximally mixed state has energy approximation ratio 1−Θ(1/n)1-Θ(1/n)1−Θ(1/n), zero encoded energy gain, and hence zero decoded mean gain. Our results separate the effects of relaxation tightness and energy approximation from operational accessibility, motivating more comprehensive accounting in benchmarking and performance assessment.
The quantum approximate optimization algorithm, also known in its generalization as the quantum alternating operator ansatz, (QAOA) is a heuristic hybrid quantum-classical algorithm for finding high-quality approximate solutions to combinatorial optimization problems, such as maximum satisfiability. While the QAOA is well studied, theoretical results as to its runtime or approximation ratio guarantees are still relatively sparse. We provide some of the first lower bounds for the number of rounds (the dominant component of QAOA runtimes) required for the QAOA. For our main result, we (i) leverage a connection between quantum annealing times and the angles of the QAOA to derive a lower bound on the number of rounds of the QAOA with respect to the guaranteed approximation ratio. We apply and calculate this bound with Grover-style mixing unitaries and (ii) show that this type of QAOA requires at least a polynomial number of rounds to guarantee any constant approximation ratios for most problems. We also (iii) show that the bound depends only on the statistical values of the objective functions and, when the problem can be modeled as a kkk-local Hamiltonian, can be easily estimated from the coefficients of the Hamiltonians. For the conventional transverse-field mixer, (iv) our framework gives a trivial lower bound to all bounded-occurrence local cost problems and for all strictly kkk-local cost Hamiltonians matching known results that constant approximation ratio is obtainable with a constant-round QAOA for a few optimization problems from these classes. Using our proof framework, (v) we recover the Grover lower bound for unstructured search and, with small modification, show that our bound applies to any QAOA-style search protocol that starts in the ground state of the mixing unitaries.
In the absence of error correction, noisy intermediate-scale quantum devices are operated by training parametrized quantum circuits (PQCs) so as to minimize a suitable loss function. Finding the optimal parameters of those circuits is a hard optimization problem, where global guarantees are known only for highly structured cases of limited practical relevance, and first-order methods can fail to find even local minima due to the presence of barren plateaus. In this work, we study the training of practical classes of PQCs, namely polynomial-depth circuits with a constant number of trainable parameters. This captures widely used PQC families, including fixed-depth QAOA, hardware-efficient ansätze, and Fixed Parameter Count QAOA. Our main technical result is a fully polynomial randomized approximation scheme (FPRAS), which, for every ε>0ε>0ε>0, returns an εεε-approximate solution to the problem's global optimum with high probability, and has runtime and query complexity polynomial in 1/ε1/ε1/ε and the number of qubits. Unlike the standard hybrid quantum-classical training loop in variational algorithms, where the quantum device is queried repeatedly throughout the training, our approach separates the computation into two distinct stages: (1) an initial quantum data-acquisition phase, followed by (2) a classical global-optimization phase based on the trigonometric moment/sum-of-squares hierarchies. Under a standard flat-extension condition, which can be checked numerically, the method also supports the extraction of optimal circuit parameters. The existence of an FPRAS implies that the promise problem associated with the optimization of poly-depth constant-parameter PQC is in BQP. This imposes a limitation on the expressive power of the class, namely, it cannot encode combinatorial optimization problems whose objective values are separated by an inverse-polynomial gap.
Abstract Quantum annealing (QA) is a computational framework where a quantum system’s continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for optimization problems, including NP-hard ones if we allow an exponentially large running time. While QA is widely studied from a heuristic point of view, little is known about theoretical guarantees on the quality of the solutions obtained in polynomial time. In this paper, we use a technique borrowed from theoretical physics, the Lieb–Robinson (LR) bound, and develop new tools proving that short, constant-time QA guarantees constant factor approximations ratios for some optimization problems when restricted to bounded degree graphs. Informally, on bounded degree graphs the LR bound allows us to retrieve a (relaxed) locality argument, through which the approximation ratio can be deduced by studying subgraphs of bounded radius. We illustrate our tools on problems MaxCut and maximum independent set for cubic graphs, providing explicit approximation ratios and the runtimes needed to obtain them. Our results are of similar flavor to the well-known ones obtained in the different but related QAOA (quantum optimization algorithms) framework.
We obtain worst-case performance guarantees for p=2p=2p=2 and 3 QAOA for MaxCut on uniform 3-regular graphs. Previous work by Farhi et al. obtained a lower bound on the approximation ratio of 0.692 for p=1p=1p=1. We find a lower bound of 0.7559 for p=2p=2p=2, where worst-case graphs are those with no cycles $\ensuremath{\le}5$. This bound holds for any 3-regular graph evaluated at particular fixed parameters. We conjecture a hierarchy for all ppp, where worst-case graphs have with no cycles $\ensuremath{\le}2p+1$. Under this conjecture, the approximation ratio is at least 0.7924 for all 3-regular graphs and p=3p=3p=3. In addition, using an indistinguishable argument we find an upper bound on the worst-case approximation ratio for all ppp, which indicates classes of graphs for which there can be no quantum advantage for at least p<6p<6p<6.