Theoretical approximation ratios for Warm-Started QAOA on 3-regular max-cut instances at depth p=1

We generalize Farhi et al.’s 0.6924-approximation result technique of the Max-Cut Quantum Approximate Optimization Algorithm (QAOA) on 3-regular graphs to obtain provable lower bounds on the approximation ratio for warm-started QAOA. Given a tilt angle θ, we consider warm-starts where the initial st...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1059; s. 115571
Hlavní autori:	Tate, Reuben, Eidenbenz, Stephan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 04.01.2026
Predmet:	Combinatorial optimization Max-Cut Quantum approximate optimization algorithm Quantum computing Quantum computing Quantum approximate optimization algorithm Combinatorial optimization Max-Cut
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!