Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

SGIR-QAOA improves upon Linear Ramp QAOA by integrating spectral gap data to optimize parameter schedules, resulting in higher solution probabilities at constant depth and reduced circuit depths for practical problems like Maximum Independent Set. The method demonstrates scalability through extrapolated gap information and maintains performance advantages even under mild depolarizing noise. This advancement addresses a core challenge in variational algorithms: the difficulty of selecting effective parameters without incurring NP-hard computational costs.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

Spectral Gap Informed Ramp QAOA

arXiv3 min read

arXiv:2604.24580v2 Announce Type: replace Abstract: A challenge with the Quantum Approximate Optimisation Algorithm (QAOA), and variational algorithms in general, is finding good variational parameters, a task which in itself can be NP-hard. Recent work has sought to de-variationalise QAOA by picking well-informed guesses for the variational parameters. The Linear Ramp QAOA (LR-QAOA) achieves this by using parameter schedules inspired by the quantum adiabatic algorithm. In this work, we propose Spectral Gap Informed Ramp QAOA (SGIR-QAOA), a new QAOA variant that incorporates spectral gap information from an adiabatic Hamiltonian, with the QAOA mixer Hamiltonian as the initial Hamiltonian, to construct smooth parameter schedules. SGIR-QAOA performs slow evolution where the spectral gap of the adiabatic Hamiltonian is small. We show that SGIR-QAOA has performance improvements over the LR-QAOA on Grover's problem at constant depth and that SGIR-QAOA requires shorter depths to achieve the same optimal solution probability. We then show that these performance benefits extend to a problem with potential practical applications - the Maximum Independent Set (MIS) problem. Finally, we demonstrate the scalability of the SGIR-QAOA method using extrapolated spectral gap information for scales that the spectral gap cannot be exactly evaluated, and show that the advantage appears to persist under mild depolarising noise.

Abstract:A challenge with the Quantum Approximate Optimisation Algorithm (QAOA), and variational algorithms in general, is finding good variational parameters, a task which in itself can be NP-hard. Recent work has sought to de-variationalise QAOA by picking well-informed guesses for the variational parameters. The Linear Ramp QAOA (LR-QAOA) achieves this by using parameter schedules inspired by the quantum adiabatic algorithm. In this work, we propose Spectral Gap Informed Ramp QAOA (SGIR-QAOA), a new QAOA variant that incorporates spectral gap information from an adiabatic Hamiltonian, with the QAOA mixer Hamiltonian as the initial Hamiltonian, to construct smooth parameter schedules. SGIR-QAOA performs slow evolution where the spectral gap of the adiabatic Hamiltonian is small. We show that SGIR-QAOA has performance improvements over the LR-QAOA on Grover's problem at constant depth and that SGIR-QAOA requires shorter depths to achieve the same optimal solution probability. We then show that these performance benefits extend to a problem with potential practical applications - the Maximum Independent Set (MIS) problem. Finally, we demonstrate the scalability of the SGIR-QAOA method using extrapolated spectral gap information for scales that the spectral gap cannot be exactly evaluated, and show that the advantage appears to persist under mild depolarising noise.

arXiv:2604.24580 [quant-ph]

(or arXiv:2604.24580v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2604.24580 Focus to learn more arXiv-issued DOI via DataCite

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 · 287 words

Related coverage