Classical State Preparation for Variational Quantum Algorithms via Reinforcement Learning

arXiv:2605.23138v1 Announce Type: cross
Abstract: Variational Quantum Algorithms (VQAs) potentially offer a pathway to practical quantum advantage, but their optimization is heavily hindered by barren plateaus and numerous local minima. While classically simulable Clifford circuits can warm-start VQAs to accelerate convergence, existing heuristic-based initialization methods struggle to scale within vast combinatorial search spaces. To overcome this bottleneck, we propose CRiSP (a Clifford Reinforcement Learning agent for State Preparation), a framework that formulates discrete prefix selection as a sequential decision-making problem. CRiSP utilizes Neural-Guided Monte Carlo Tree Search, driven by a Transformer-based policy trained via self-play, to insert learned Clifford gates before fixed parameterized rotations. This enables the construction of high-quality initial states entirely through polynomial-time classical stabilizer simulation without altering the underlying circuit architecture. By integrating a curriculum learning strategy that progressively expands the search horizon, the agent efficiently scales to deep circuits. Evaluated on QAOA benchmarks of up to $22$ qubits and $1,370$ parameters, CRiSP outperforms state-of-the-art Clifford initialization methods by a mean of $3.17times$ (max $45.02times$) in average energy accuracy and $2.44times$ (max $16.01times$) in best-achieved energy accuracy. Assessments on VQE tasks further demonstrate the framework’s robustness and generalizability.