- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The authors introduce CRiSP, a classical warm start framework for VQAs that casts Clifford initialization as a sequential decision problem. Under this process, a discrete Clifford gate is add to the front to each rotation of a fixed ansatz. With all continuous parameters set to zero, the circuit is Clifford, so its energy can be computed exactly with a stabilizer simulator. The prefixes are chosen by an AlphaZero-style neural guided MCTS agent with a Transformer policy value network, replay and best-game buffers, and an incremental horizon curriculum. The resulting Clifford state serves as the starting point for downstream continuous optimization, and the search itself needs no quantum evaluations. The authors frame the motivation around two problems of existing Clifford initializers (1) the Clifford search space grows exponentially with the number of circuit parameters, so Bayesian and genetic algorithm heuristics struggle on challenging landscapes. (2) VQA optimization from arbitrary starting points is unreliable because of local minima and barren plateaus, and every quantum evaluation is costly, so a good classical initialization is valuable. The method is evaluated on QAOA tasks with up to 22 qubits and 1370 parameters against SPIQ, and on a preliminary VQE study with 10-qubit Ising and XXZ chains against a GA variant of CAFQA.
Critical strengths
-
The paper is quite well written and content is easy to follow. The motivation of the paper classically i.e simulable Clifford warm starts for VQAs, is quote straightforward. The appendix gives further hyperparameters and implementation details.
-
The overview figure of the framework conveys the key idea quickly and makes the method accessible to readers.
-
The evaluation is broad. It covers 14 QAOA instances across 3 problem families up to 22 qubits. In addition a VQE study on Ising and XXZ models is provided.
Critical weaknesses
-
The work reads more of an incremental contribution. Clifford-based classical initialization is already established through CAFQA, Clapton, SPIQ which the author refer in the paper. I believe that the proposed method combines standard components such as AlphaZero-style neural guided (NG) MCTS, a Transformer policy-value network, replay and best-game buffers as in AlphaTensor, and a horizon curriculum. The contribution is effectively just replacing a genetic algorithm search with NG-MCTS inside a known pipeline, and the closest RL-based prior work such as MCTS-QAOA is distinguished only briefly.
-
Although the tasks are diverse which I also meantioned in the strengths, QAOA is compared only against one method SPIQ which is a genetic algorithm and VQE only against a GA variant of CAFQA. There is no comparison against other Clifford initializers e.g., Clapton, other RL approaches such as [Kremer, David, et al. "Practical and efficient quantum circuit synthesis and transpiling with reinforcement learning." arXiv preprint arXiv:2405.13196 (2024).], or nonClifford state-of-the-art warm starts (kindly see the next weakness), so I think the claim of state-of-the-art performance rests on one baseline per setting.
-
Following the above point, the VQE evaluation is limited in scope and in strength of evidence. The study covers only two 10-qubit 1D spin models and the method provides a geometric-mean gain of about 1.1 in average accuracy and 1.11 in best-achieved accuracy, which is a small improvement. Moreover, tensor-network-based initialization e.g., Rudolph et al., which the appendix cites, and warm-started RL for circuit discovery e.g., TensorRL-QAS, NeurIPS 2025 are not benchmarked. This matters because 1D chains at this size are precisely the regime where tensor-network methods are near-exact, so it remains unclear whether a Clifford warm start offers any advantage over cheap classical alternatives. To assess the method's real capability, I encourage the authors to include benchmarks where tensor networks are not trivially sufficient, such as molecular Hamiltonians or 2D models.
-
All results come from noiseless stabilizer simulation. The paper does not test whether Clifford-based initializations remain better under hardware noise, although noise-aware Clifford methods exist and downstream optimization is run on noisy devices in practice.
-
The paper states that CRiSP "exhibits strong scalability," yet it trains a Transformer policy value network with MCTS separately for each instance, taking 10-80 hours on an A100 GPU with 32 CPU cores. The authors acknowledge that training cost grows with system size and that the search space remains exponential, and accuracy on MaxCut drops with size. The time-matched comparison is only against a GA baseline, so it is unclear whether simpler alternatives, such as spending the same compute on additional restarts of the downstream optimizer, would give a similar benefit. A full accounting of classical training cost per instance versus the quantum evaluations saved, and a scaling study against parameter count, are needed.
-
Three seeds per task is thin for a stochastic search method, and the paper reports wider variance on sparse tasks, where CRiSP sometimes underperforms the baseline on average. Significance tests and more seeds would strengthen the claims.
Questions for authors
- Beyond just replacing the genetic algorithm with NG-MCTS and using a Transformer policy value network in the Clifford space, what is the concrete algorithmic novelty relative to MCTS-QAOA and other warm-started RL approaches?
- How does CRiSP compare against Clapton and other RL approaches such e.g., Kremer et al. (see weakness 2) under equal wall clock time and equal circuit evaluation budgets?
- (a) Can the authors report CRiSP against MPS/DMRG-based initialization (Rudolph et.al) and TensorRL-QAS on the same VQE instances? (b) Can you comment how CRiSP would perform where tensor networks are not near exact such chemical Hamiltonian or 2D models?
- Can the authors evaluate CRiSP under noise, on hardware if available, or otherwise in simulation with (i) depolarizing noise, (ii) dephasing noise, and (iii) finite-shot sampling and report the initial energy and the final energy after downstream optimization on the same QAOA and VQE instances?
- What is the total classical training cost which includes GPU hours + network evaluations per instance as the number of parameters grows, and what does a simple baseline, such as extra downstream restarts, achieve at the same cost?
- Do the improvements remain statistically significant with more seeds, especially on the sparse tasks where CRiSP sometimes underperforms on average?