Depth analysis of the Quantum Approximate Optimization Algorithm with a Grover mixer

Abstract: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.

arXiv:2609.17835 [quant-ph]

(or arXiv:2609.17835v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2609.17835 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.