aiqbench takeQuantum Computing

This study refutes the fixed-angle conjecture for depth-2 Quantum Approximate Optimization Algorithm (QAOA) on 9-regular graphs, establishing critical boundaries for parameter optimization in quantum heuristics. The findings confirm the conjecture holds only for depth-1 or 2-regular graphs, offering essential theoretical corrections for researchers designing QAOA circuits for complex graph problems.

Source coveringarXiv

What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Refuting the QAOA fixed-angle conjecture

arXivSeptember 24, 20261 min read

arXiv:2609.27703v1 Announce Type: new Abstract: The fixed-angle conjecture for the quantum approximate optimisation algorithm (QAOA) is shown to be false for depth-2 QAOA on 9-regular graphs, and proven to be correct for depth-1 on any regular graph, as well, as for any depth on all 2-regular graphs.

Abstract:The fixed-angle conjecture for the quantum approximate optimisation algorithm (QAOA) is shown to be false for depth-2 QAOA on 9-regular graphs, and proven to be correct for depth-1 on any regular graph, as well, as for any depth on all 2-regular graphs.

arXiv:2609.27703 [quant-ph]

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

https://doi.org/10.48550/arXiv.2609.27703 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.

Full text under the publisher's open licence · 133 words

Read at arXiv ↗Ask about this article