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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1059; p. 115571
Main Authors:	Tate, Reuben, Eidenbenz, Stephan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 04.01.2026
Subjects:	Combinatorial optimization Max-Cut Quantum approximate optimization algorithm Quantum computing Quantum computing Quantum approximate optimization algorithm Combinatorial optimization Max-Cut
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!