We study the Quantum Approximate Optimization Algorithm with a Grover mixer and independently sampled cost and mixing angles. Under a lattice condition on the cost values carried by the initial state, we prove a depth-independent lower bound for the variance of the loss at every depth, together with the same bound for the derivative with respect to the final mixing angle. The estimate is instance-dependent and, for fixed locality, is inverse polynomial in the number of qubits for integer-valued local objective functions with uniformly bounded local terms, in particular for MaxCut. We also establish Grover-type reachability bounds showing that the depth required to approximate a prescribed carried eigenspace is bounded below by a constant multiple of the inverse square root of its initial probability.
We study the Quantum Approximate Optimization Algorithm with a Grover mixer and independently sampled cost and mixing angles. Under a lattice condition on the cost values carried by the initial state, we prove a depth-independent lower bound for the variance of the loss at every depth, together with the same bound for the derivative with respect to the final mixing angle. The estimate is instance-dependent and, for fixed locality, is inverse polynomial in the number of qubits for integer-valued local objective functions with uniformly bounded local terms, in particular for MaxCut. We also establish Grover-type reachability bounds showing that the depth required to approximate a prescribed carried eigenspace is bounded below by a constant multiple of the inverse square root of its initial probability.
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.
The quantum approximate optimization algorithm (QAOA) is a near-term quantum algorithm aimed at solving combinatorial optimization problems. Since its introduction, various generalizations have emerged, spanning modifications to the initial state, phase unitaries, and mixer unitaries. In this work, we present an analytical study of broad families of QAOA variants. We begin by examining a family of QAOA with product mixers, which includes single-body mixers parametrized by multiple variational angles, and derive exact analytical expressions for the cost expectation on weighted problem graphs in the single-layer ansatz setting. We then analyze a family of QAOA that employs many-body Grover-type mixers, deriving analogous analytical expressions for weighted problem hypergraphs in the setting of arbitrarily many circuit ansatz layers. For both families, we allow individual phase angles for each node and edge (hyperedge) in the problem graph (hypergraph). Our results reveal that, in contrast to product mixers, the Grover mixer is sensitive to contributions from cycles of all lengths in the problem graph, exhibiting a form of non-locality. Our study advances the understanding of QAOA's behavior in general scenarios, providing a foundation for further theoretical exploration.
The quantum alternating operator ansatz (QAOA) represents a branch of quantum algorithms for solving combinatorial optimization problems. A specific variant, the Grover-mixer (GM) QAOA, ensures uniform amplitude across states that share equivalent objective values. This property makes the algorithm independent of the problem structure, focusing instead on the distribution of objective values within the problem. In this work we provide an alternative proof for the upper bound on the probability of measuring a computational basis state from a GM QAOA circuit with a given depth, which is a critical factor in QAOA cost. Using this, we derive the upper bounds for the probability of sampling an optimal solution and for the approximation ratio of maximum optimization problems, both dependent on the objective value distribution. Through numerical analysis, we link the distribution to the problem size and build the regression models that relate the problem size, QAOA depth, and performance upper bound. Our results suggest that the GM QAOA provides a quadratic enhancement in sampling probability and requires circuit depth that scales exponentially with problem size to maintain consistent performance.
The Grover mixer operator is a variational version of Grover's diffusion operator, introduced as a mixing operator for the quantum alternating operator ansatz (QAOA) and used in a variant known as Grover mixer QAOA (GM-QAOA). An important property of the QAOA with Grover mixer is that its expectation value is invariant over any permutation of states. As a consequence, the algorithm is independent of the structure of the problem. If, on the one hand, this characteristic raises serious doubts about the capacity of the algorithm to overcome the bound of the unstructured search problem, on the other hand, it can pave the way to its analytical study. In this sense, a prior work introduced a statistical approach to analyze GM-QAOA that results in an analytical expression for the expectation value depending on the probability distribution associated with the problem Hamiltonian spectrum. Although the method provides surprising simplifications in calculations, the expression depends exponentially on the number of layers, which makes direct analytical treatment unfeasible. In this work, we extend the analysis to the more simple context of Grover mixer threshold QAOA, a variant that replaces the phase separation operator of GM-QAOA to encode a threshold function. As a result, we obtain an expression for the expectation value independent of the number of layers and, with it, we provide bounds for different performance metrics. Furthermore, we extend the analysis to a more general context of QAOA with Grover mixer, which we called Grover-based QAOA. In that framework, which allows the phase separation operator to encode any compilation of the cost function, we generalize all the bounds by using an argument by contradiction with the optimality of Grover's algorithm on the unstructured search problem. As a result, we get the main contribution of this work, an asymptotic lower bound on the quantile achieved by the expectation value that formalizes the notion that the Grover mixer, at most, reflects a quadratic Grover-style speed-up over classical brute force. We apply that bound on the max-cut problem to the particular class of complete bipartite graphs and argue that the number of rounds required to achieve guarantees for any approximation ratio must grow exponentially with the number of vertices or edges, a severe limitation on the performance of the algorithm.
The quantum approximate optimization algorithm (QAOA) requires that circuit parameters are determined that allow one to sample from high-quality solutions to combinatorial optimization problems. Such parameters can be obtained using either costly outer-loop optimization procedures and repeated calls to a quantum computer or, alternatively, via analytical means. In this work, we consider a context in which one knows a probability density function describing how the objective function of a combinatorial optimization problem is distributed. We show that, if one knows this distribution, then the expected value of strings, sampled by measuring a Grover-driven, QAOA-prepared state, can be calculated independently of the size of the problem in question. By optimizing this quantity, optimal circuit parameters for average-case problems can be obtained on a classical computer. Such calculations can help deliver insights into the performance of and predictability of angles in QAOA in the limit of large problem sizes, in particular, for the number partitioning problem.
Barren plateaus in variational quantum algorithms are typically described by gradient concentration at random initialization. In contrast, rigorous results for the Hessian, even at the level of entry-wise variance, remain limited. In this work, we analyze the scaling of Hessian-entry variances at initialization. Using exact second-order parameter-shift identities, we write Hjk as a constant-size linear combination of shifted cost evaluations, which reduces Varρ(Hjk) to a finite-dimensional covariance--quadratic form. For global objectives, under an exponential concentration condition on the cost at initialization, Varρ(Hjk) decays exponentially with the number of qubits n. For local averaged objectives in bounded-depth circuits, Varρ(Hjk) admits polynomial bounds controlled by the growth of the backward lightcone on the interaction graph. As a consequence, the number of measurement shots required to estimate Hjk to fixed accuracy inherits the same exponential (global) or polynomial (local) scaling. Extensive numerical experiments over system size, circuit depth, and interaction graphs validate the predicted variance scaling. Overall, the paper quantifies when Hessian entries can be resolved at initialization under finite sampling, providing a mathematically grounded basis for second-order information in variational optimization.