Shielded RL for Route-Charged Parity-Term Ordering in QEDA Phase Components
Source: Originally published on arXiv quant-ph on July 20, 2026.
arXiv:2607.15307v1 Announce Type: new Abstract: Commuting phase terms in quantum electronic design automation (QEDA) placement circuits are logically invariant under reordering, yet their routed cost varies substantially after hardware mapping, since term order affects CNOT cancellation, interaction locality, and routing pressure. We cast parity/support phase-term ordering within a QEDA phase component as a shielded reinforcement-learning problem: a feasibility shield restricts each step to unemitted terms, so every trajectory is a valid permutation by construction, and an elite (cross-entropy-method) policy is trained against a route-charged proxy combining support-transition size and heavy-hex topology-distance features. We validate by direct Qiskit routing of logically equivalent circui...
To read the full article, visit the original source page: