- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper introduces CircuitPilot, which learns to choose symbolic procedures for circuit optimization. The policy first imitates actions found by short symbolic searches, followed by self-play in the quantum setting. The framework includes polynomial, Boolean, and quantum environments with circuit-equivalence checks. The experiments evaluate quantum and polynomial optimization, while the Boolean study tests input encoding.
Critical strengths
-
Learning which optimization procedures to apply and in what order is a reasonable and potentially useful idea.
-
Circuit equivalence is checked separately from the learned policy, helping ensure that optimization preserves the original computation.
-
The paper is clearly written and openly discusses the limitations of its results.
Critical weaknesses
-
The main learning contribution is not sufficiently established. The central idea is to learn better optimization schedules, but the experiments do not convincingly show what this learning adds to the underlying symbolic optimizer. In the quantum experiments, the contribution of the learned controller is not isolated, and there is no comparison showing whether self-play improves over imitation alone. The results therefore provide limited evidence of a meaningful advance in learned circuit optimization.
-
The reported improvements provide limited support for the approach. CircuitPilot is allowed 1,800 seconds per quantum circuit, while the tested Quasar configuration is limited to 60 seconds. For polynomial circuits, the gain over the best individual fixed schedule is only 0.25%, and the timed learned policies are slower. The tested portfolio of fixed schedules also achieves lower circuit cost than the portfolio containing a learned policy. These results leave the practical benefit of learned scheduling unclear.
-
The evaluation remains preliminary. Both optimization studies use development data, and the quantum results were used to revise the rewrite rules. It is therefore unclear whether the improvements would hold on untouched test circuits. The Boolean study evaluates no optimization policy, so it does not provide further evidence for the learning approach.
Questions for authors
-
How do fixed schedules, imitation alone, and imitation followed by self-play compare within the same symbolic environment?
-
Do the gains hold on untouched test circuits under comparable optimization budgets?
Author Response to Reviewer hgYT
We thank the reviewer for the careful evaluation and for recognizing the value of learning optimization procedures, independently verified circuit equivalence, and our discussion of limitations.
We particularly appreciate your emphasis on distinguishing the benefit of learning from that of the underlying symbolic optimizer. We agree that the original submission did not provide a sufficiently controlled comparison, and we have conducted new experiments specifically to address this issue.
Q1. What does self-play contribute beyond imitation and fixed optimization procedures?
Our new controlled ablation provides strong evidence that the second training stage produces substantial improvements over the original finite-horizon imitation procedure.
On 177 new development circuits, three imitation-only models obtain 670–695 CX. Continued imitation from a common checkpoint obtains 693 CX after 64 additional updates. In contrast, self-play from that checkpoint reaches 616 CX, reducing CX by 77 (95% CI [51, 106] saved) and total gates by 1,035 (27.6%). There are 32 CX improvements and no regressions.
The natural fixed schedule corresponding to the teacher's preferred sequence-resynthesis action obtains 655 CX, while self-play achieves 616. Together with the matched continued-imitation control, this comparison shows that the benefit of the second training stage is not explained merely by additional training updates or by following the teacher's preferred fixed procedure.
Thus, the controlled result establishes a substantial contribution of self-play beyond the original imitation teacher.
Q2. Do the improvements generalize, and are the computational comparisons fair?
We evaluated the final rewrite rules on 160 untouched circuits using a frozen protocol. They reduce total gate counts across three frozen schedules, with reductions of 55–66 gates and paired confidence intervals entirely below zero. This demonstrates transfer of the symbolic rule improvements beyond the development set.
We have also measured actual optimization times rather than relying on timeout caps. The 1,800-second limit reported originally is a maximum; actual deployment takes approximately 27 seconds per circuit in our controlled timing study. We additionally evaluate multiple Quasar configurations under explicit time budgets and report the resource conditions.
Under matched per-circuit wall-clock limits, CircuitPilot obtains 620 versus 737 CX against Quasar's default escalation configuration at 60 seconds and 616 versus 667 CX at 120 seconds on the new development panel. These results demonstrate competitive performance under constrained optimization budgets.
All reported outputs in the new 177-circuit learning ablation and 160-circuit rule-transfer evaluation passed exact circuit-equivalence checks.
These experiments clarify which gains arise from learning, which arise from symbolic optimization, and how the performance depends on resource budgets. We retain the polynomial result as a modest improvement over individual fixed schedules rather than a practical speed advantage, and explicitly distinguish Boolean encoding feasibility from learned optimization.
We believe the controlled learning ablation provides important evidence that was missing from the original submission, and we appreciate the reviewer's questions for motivating this more rigorous evaluation.