Pith. sign in

REVIEW 1 cited by

Warm-Started QAOA with Aligned Mixers Converges Slowly Near the Poles of the Bloch Sphere

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2410.00027 v1 pith:7KTHQSJJ submitted 2024-09-16 quant-ph

classification quant-ph
keywords qaoablochcircuitdepthinitialpolessolutionssphere
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

In order to boost the performance of the Quantum Approximate Optimization Algorithm (QAOA) to solve problems in combinatorial optimization, researchers have leveraged the solutions returned from classical algorithms in order to create a warm-started quantum initial state for QAOA that is biased towards "good" solutions. Cain et al. showed that if the classically-obtained solutions are mapped to the poles of the Bloch sphere, then vanilla QAOA with the standard mixer "gets stuck". If the classically-obtained solution is instead mapped to within some angle $\theta$ from the poles of the Bloch sphere, creating an initial product state, then QAOA with optimal variational parameters is known to converge to the optimal solution with increased circuit depth if the mixer is modified to be "aligned" with the warm-start initial state. Leveraging recent work of Benchasattabuse et al., we provide theoretical lower bounds on the circuit depth necessary for this form of warm-started QAOA to achieve a desired change $\Delta \lambda$ in approximation ratio; in particular, we show that for small $\theta$, the lower bound on the circuit depth roughly scales proportionally with $\Delta \lambda/\theta$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Systematic improvement of the quantum approximate optimisation ansatz for combinatorial optimisation using quantum subspace expansion

    quant-ph 2025-06 conditional novelty 6.0 of 10

    QAOA plus quantum subspace expansion systematically improves MIS solutions on small random graphs, with a fitted gate-count crossover extrapolated to about 75 nodes.

Pith tools