- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper investigates joint initial qubit mapping and routing for quantum circuit compilation and proposes MARSA. Specifically, an autoregressive policy generates an initial mapping and a complete routing trace, with a route-state automaton enforcing admissible actions. Curriculum learning and verifier-guided reinforcement learning improve the policy beyond expert demonstrations. Theoretical analysis establishes feasibility of accepted traces under the stated routing model. Experiments on two hardware topologies and held-out algorithm circuits report reduced SWAP counts.
Critical strengths
- Proposition 1 and separate route replay connect generated traces to dependency-consistent, hardware-adjacent circuit execution. The appendices distinguish accepted-route soundness from rollout completion, and justify eager execution and removal of redundant SWAP cycles within the stated objective.
- Greedy decoding reports a 7.01% aggregate Q20 SWAP reduction over paired valid cases relative to QMSI; gains therefore do not arise solely from best-of-16 selection. Improvements on two topologies and held-out algorithm circuits broaden the evidence. Exact-match, contiguous-subcircuit, and cross-split duplicate exclusions also address direct overlap concerns.
Critical weaknesses
- The central novelty is insufficiently differentiated and experimentally unisolated. Previous works [1, 2] have already explored learned quantum routing and masked allocation sequences, respectively. The baseline panel omits direct comparisons with AlphaRouter, QAP-Router, CO-MAP, or a matched separately trained mapper/router. Substituting QMSI mappings into the existing learned router changes its conditioning distribution. The degradation shows a benefit from MARSA-generated mappings with this router, without isolating the superiority of joint training. Moreover, the already cited AlphaRouter [1] explicitly proposed using initial virtual SWAPs to learn mapping and routing with the same model. The missing reference [2] already generates complete allocation sequences with dynamic feasibility masks, albeit for modular architectures. Neither source implements MARSA's exact mapping-prefix/full-operation trace; that narrower residual contribution needs attribution and a controlled demonstration of its benefit.
- The principal teacher-relative gains are not fully auditable. Appendix D.1 omits QMSI's search budget, restarts, and stopping rule. The previous work [3] defers important expert details to an unpublished manuscript; it cannot substitute for an exact teacher specification. Aggregate reductions use paired valid cases without reporting the corresponding completion counts and paired-valid denominators, although total test-set sizes are given. Failures do count as losses in win/tie/loss statistics, so inflation is not established. Unspecified expert effort and potentially differing subsets leave uncertainty about the comparison. Report settings, coverage, and common-subset or fallback-inclusive comparisons. Runtime would additionally establish practical cost.
References
[1] AlphaRouter: Quantum Circuit Routing with Reinforcement Learning and Tree Search
[2] Attention-Based Deep Reinforcement Learning for Qubit Allocation in Modular Quantum Architectures
[3] Leveraging Machine Learning for Quantum Compilation Optimization
Questions for authors
- Clarification: What QMSI settings, generation limits, candidate-completion rates, and paired-valid circuit counts underlie each comparison?
- Requested analysis: If any circuits fail to complete, do reductions persist on one common subset, with failures reported separately?
- Requested control: Does the advantage remain against a router trained on the supplied mappings and comparable learned systems under matched evaluation conditions?
- Scope clarification: Which workload statistics defined the synthetic training mixture, and when were they frozen relative to evaluation selection?
- Related-work clarification: Please situate route-state legality against the previous work [1], which already uses evolving qubit locations, gate dependencies and feasible-action masks for distributed compilation. Its different architecture/objective and future-only initial-mapping extension do not anticipate MARSA's full joint trace.
References
[1] Compiler for Distributed Quantum Computing: a Reinforcement Learning Approach
3 comments
Response to Reviewer fdZo (Part 2)
4. QMSI settings, completion rates, and common-subset analysis (W2 & Q1–Q2)
QMSI settings. We clarify the teacher configurations:
- Q20: Depth-3 SWAP search, initial mapping search widths
(8, 4, 2, 1, 1, ...). - Grid: Depth-2 SWAP search, initial mapping search widths
(16, 4, 2, 1, 1, ...). The depth is smaller than Q20 because the topology is significantly larger so depth-3 search times out.
Both topologies use bidirectional mapping refinement and a 120-second per-call limit with one failure-only retry. There's no multiple search restart mechanism similar to LightSABRE in QMSI.
Completion rates and paired-valid comparisons. QMSI successfully generates valid references for all 1,822 Q20 and 2,738 grid evaluation circuits. MARSA generates candidates with a 4,096-token limit without fallback.
Table 6: QMSI and MARSA completion rates and win/tie/loss/failure counts.
| Topology | Total circuits | QMSI completed | MARSA completed | W / T / L / F | MARSA failure rate |
|---|---|---|---|---|---|
| Q20 | 1,822 | 1,822 | 1,822 | 1,478 / 292 / 52 / 0 | 0.000% |
| Grid | 2,738 | 2,738 | 2,717 | 2,159 / 320 / 238 / 21 | 0.767% |
MARSA achieves a very low circuit-level failure rate: 0% on Q20 and only 0.77% on the grid. All 21 grid failures are due to the generation length limit, not invalid completed routes. As the reviewer acknowledges, failures are counted as losses in the win/tie/loss statistics in the paper; there is no inflation of win rates.
Crucially, since QMSI completes every circuit, the reported SWAP reductions already use the exact common-valid subset. The paired results and denominators are:
Table 7: Aggregate SWAP counts and reductions on paired-valid evaluation circuits.
| Topology | Common-valid circuits | QMSI SWAPs | MARSA SWAPs | SWAP reduction |
|---|---|---|---|---|
| Q20 | 1,822 | 83,862 | 70,109 | 16.40% |
| Grid | 2,717 | 407,270 | 364,213 | 10.57% |
The 21 incomplete grid cases are excluded from both SWAP sums and counted as losses. Thus, the reported gains are not inflated by differing QMSI and MARSA completion subsets. We have added the clarifications in the corresponding sections of the paper and presented this table as Table 4 in the revision. We refer runtime experiments including compilation-time scaling and matched-budget comparisons in our Response 1 to Reviewer LNzk.
5. Synthetic training distribution (Q4)
Our synthetic generator uses aggregate statistics including: (1) CNOT count band (2) qubit count band (3) pair repeat gap (4) interaction graph density (5) general circuit patterns such as star, path, brick-like structures, etc. The benchmark was fixed before generator development, and the synthetic training mixture and generator were frozen before model training and evaluation. Therefore model performance is not used to modify the workload statistics. Exact benchmark matches, 64-CNOT contiguous overlaps, and cross-split duplicates were excluded.
Dear Reviewer fdZo,
Thank you again for your valuable feedback and suggestions. We have provided additional experiments and clarifications in our rebuttal, and we hope these additions help address your concerns.
We would be grateful for any further feedback and would be happy to clarify any remaining questions or concerns.
Thank you very much for your time and consideration!
Response to Reviewer fdZo (Part 1)
We thank the reviewer for the questions on novelty and comparisons. We clarify them as follows.
1. Novelty relative to previous work (W1 & Q5)
2. Comparison with AlphaRouter and other baselines (W1)
We examined AlphaRouter, QAP-Router, and CO-MAP, but could not find publicly released repos for faithful reproduction. The papers identify benchmark sources or families, but do not provide the exact instances for their reported metrics. We therefore cannot fairly compare MARSA's results against aggregate numbers obtained on potentially different circuit subsets.
They also address different learned decisions: AlphaRouter and QAP-Router focus on routing with initial mapping given, whereas CO-MAP focuses on initial mapping only. None demonstrates MARSA's learned full mapping and routing generation. Our reported experiments instead compare on identical circuits against reproducible QMSI, LightSABRE, ML-SABRE, and AIRouting configurations.
3. Comparison against a router trained on the supplied mappings (W1 & Q3)
To further strengthen the evidence for joint training of mapping and routing, we trained a new routing-only policy from scratch on QMSI-supplied mappings. We refer the details to our Response 1 to Reviewer PMFf (Table 1). The routing-only model achieves only 6.61% SWAP reduction over QMSI, compared with 16.40% for joint MARSA on Q20. It uses 11.71% more SWAPs than MARSA. This controlled comparison addresses the distribution shift concern and provides stronger evidence for the value of jointly learning the initial mapping and routing.