- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper introduces PulseSyn, a framework for reversible Boolean-oracle synthesis that factors repeated ANF control products into clean ancillas and evaluates candidate rewrites using downstream decomposition-aware cost proxies. A learned ranker prioritizes promising factors to reduce exact candidate evaluations, while legality and improvement are verified exactly before acceptance. On ten MCNC/EPFL benchmark circuits, the method reports reductions in two-qubit and analytical control-effort proxies, while learned ranking avoids about 80% of exact candidate evaluations. The study additionally evaluates ancilla sensitivity and transfer to an ASAP7 technology-mapping backend.
Critical strengths
Well-motivated cross-layer optimization framework
Evaluating reversible-logic rewrites using downstream decomposition-aware costs rather than purely symbolic metrics is a sensible compiler-design principle. The proposal-verification structure is particularly appealing, as learning can accelerate search without entering the correctness boundary.
Clear theoretical correctness guarantees
The paper formally establishes that the compute-use-uncompute factorization preserves the Boolean oracle and restores clean ancillas, and that the learned search cannot accept an illegal or objective-worsening rewrite. These guarantees provide a solid theoretical foundation independent of the accuracy of the learned ranker.
Critical weaknesses
Missing motivation and limited positioning against prior work
The paper gives little context on where these Boolean oracles occur in quantum algorithms, why ANF-based synthesis is practically relevant, or why the chosen benchmarks represent meaningful quantum workloads. This makes the significance of the problem difficult to assess for a general ICLR audience. Moreover, several central ideas have close precedents. Backend-aware optimization of Boolean representations according to downstream fault-tolerant quantum costs has already been studied in [1], while ANF-based construction and resource optimization of quantum oracles under ancilla and gate-cost trade-offs is investigated in [2]. Together with existing work on common-factor synthesis and learning-guided logic optimization, this leaves the novelty of the proposed combination insufficiently differentiated from prior work.
The experimental validation is too limited to establish the practical or ML contribution
The reported synthesis improvements are primarily measured against DIRECT, a simple ANF realization, rather than competitive reversible/oracle synthesis methods, while the claimed “quantum control pulse” contribution is evaluated only through a hand-defined analytical proxy without pulse synthesis or a calibrated backend. The learning component is also weakly justified: the roughly 80% reduction in exact evaluations largely follows from evaluating a fixed top-20% shortlist, no wall-clock advantage is demonstrated, and a simple linear regressor substantially outperforms the MLP ranker in the appendix. This makes learning appear more like an added component than an experimentally established necessity. Moreover, only ten selected MCNC/EPFL circuits are evaluated without citing the benchmark suites or explaining the selection criteria; this is particularly relevant because the method explicitly enumerates truth-table entries and may therefore be restricted to small-input instances. Finally, the abstract overstates the reported evidence: the quoted 35.69%/37.22% reductions apply to six rather than all ten circuits, and the claim that learned ordering reproduces the full-evaluation factorization on all three held-out EPFL circuits conflicts with the reported different greedy trajectory.
[1] Yu, Mingfei, et al. "Back-end-aware Fault-tolerant Quantum Oracle Synthesis." Proceedings of the 30th Asia and South Pacific Design Automation Conference. 2025.
[2] Yu, Mingfei, Mathias Soeken, and Giovanni De Micheli. "A New Perspective of Constructing Resource-Efficient Data-Lookup Quantum Oracles." 2025 IEEE International Conference on Quantum Computing and Engineering (QCE). Vol. 1. IEEE, 2025.
Questions for authors
1. Motivation, benchmark selection, and scalability (clarification)
Could you better motivate where the considered Boolean oracles arise in relevant quantum algorithms and why ANF-based synthesis is an important compilation setting? Relatedly, what were the selection criteria for the ten MCNC/EPFL circuits, and why are these instances representative? Since the current procedure explicitly enumerates truth-table entries, it would be important to clarify the input sizes of the benchmarks and how this limits the scalability of the proposed approach. A single paragraph plus a tiny example like would make the paper dramatically easier to follow.
2. Novelty relative to prior oracle synthesis (clarification)
How does PulseSyn differ technically from recent backend-aware quantum-oracle synthesis [1], where Boolean representations are already optimized according to downstream fault-tolerant compilation costs, and ANF-based resource-aware oracle construction [2]? More generally, which part of the proposed framework should be regarded as the main novel contribution beyond combining common-factor synthesis, downstream-aware objectives, and learning-guided search?
3. Practical relevance of the optimization objective and synthesis results (additional evidence)
The reported improvements are primarily relative to DIRECT, while the "control effort" is a hand-defined analytical proxy rather than the result of pulse synthesis or a calibrated backend. Could you compare PulseSyn against a competitive reversible/oracle synthesis method under the same downstream cost model and, ideally, evaluate the resulting circuits using an actual decomposition or control backend? This would help establish whether the reported improvements translate beyond the chosen analytical proxy.
4. Benefit of learned ranking (additional evidence)
What advantage does the learned MLP ranker provide over simpler candidate-selection strategies? The appendix reports substantially better held-out ranking performance for linear regression than for the MLP, while the approximately 80% reduction in exact evaluations largely follows from evaluating a fixed top-20% shortlist. Could you compare random, SUPPORT/heuristic, linear, and MLP ranking end-to-end under the same shortlist budget, including retained optimization gain and wall-clock runtime? This would clarify whether learning, and specifically the proposed learned ranker, provides a meaningful practical benefit.