aiqbenchInformații despre AI & calcul cuantic

...

Română · beta. Traducerea a fost făcută automat și este încă în curs de revizuire. Citește pagina în engleză

perspectiva aiqbenchCalcul cuantic

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.

Sursă care acoperăarXiv

Ce este aceastaLectura unui model asupra articolului și a acoperirii conexe, scrisă pentru aiqbench. Nu sunt cuvintele publicației.

Refuting the QAOA fixed-angle conjecture

arXiv24 septembrie 20261 min de cititArticolul și perspectiva sunt în engleză.

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.

Text integral sub licența deschisă a publicației · 133 cuvinte

Citește pe arXiv ↗Întreabă despre acest articol