Compile-Time Simplification of Classically Controlled Operations in Dynamic Circuits

arXiv:2605.28439 · quant-ph, cs.ET · Submitted 2026-05-27 · Read on arXiv

quant-ph, cs.ET

Submitted: 2026-05-27

Updated: 2026-05-27

Comments: Accepted at ISC High Performance 2026; to appear in the IEEE Xplore proceedings

DOI: 10.23919/ISC.2026.11520473

Code: https://github.com/i2-tum/pcm-ccop-dc-pass

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Terminology

• Entanglement — 15× in this paper · explained in 3 episodes
• Probabilistic Circuit Model — 7× in this paper
• Quantum Circuits — 7× in this paper · explained in 2 episodes
• Quantum Constant Propagation — 4× in this paper
• Benchmark — 3× in this paper · explained in 2 episodes
• Core — 3× in this paper · explained in 2 episodes
• Classical Constant Propagation — 2× in this paper
• Abstraction — 1× in this paper · explained in 1 episode
• International Conference on Quantum Computing and Engineering — 1× in this paper
• Pragmatics — 1× in this paper · explained in 2 episodes

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• A quasiparticle-protected superconducting qubit
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians