PulseSyn: Learning to Co-optimize Reversible Logic Synthesis and Quantum Control Pulses
Abstract
Reversible Boolean-oracle synthesis is usually optimized with gate-level metrics, although the cost of a realization depends on downstream decomposition and control. We present \method, a verified common-control factorization framework that evaluates symbolic rewrites under a decomposition-aware objective. Starting from algebraic normal form (ANF), materializes repeated control products in clean ancillas, reuses them across compatible monomials, and uncomputes them after their final use. On ten MCNC/EPFL pilot circuits, full-evaluation greedy search reduces the two-qubit decomposition proxy by 35.69% and analytical control effort by 37.22% on average. In a circuit-family transfer test, a ranker trained on MCNC candidates reproduces the full-evaluation factorization on all three unseen EPFL circuits while avoiding 79.7% of exact candidate evaluations.
Then back it, or bet against it.
Related papers
Open the market on this paper to see 7 more related papers.