Quantum Constant Propagation
summary
Implements quantum constant propagation (QCP) to symbolically simulate entanglement groups up to a complexity bound and remove redundant controls and gates; maintains per-qubit union groups storing only nonzero basis coefficients and gives up an entanglement when the MMax threshold of basis states is exceeded. Evaluates against MQTBench (1,761 circuits), shows extra gate and control reductions when composed with existing optimizers, runs in polynomial time on QFT families (tested up to 129 qubits) and completes within practical time limits.
AI-written summary · about
chapters (14)
- 0:00Welcome
- 0:21Quantum computing notation
- 2:49Classical vs quantum states
- 5:21Simulating quantum circuits
- 6:01Motivation for constant propagation
- 7:29Toy example: constant propagation
- 9:14Why exponential hardness
- 9:57Limitations of optimizations
- 13:12Our approach: quantum constant propagation
- 15:19Simplifying control gates
- 18:30Evaluation on MQT benchmarks
- 21:45Performance on QFT circuits
- 23:33Summary and limitations
- 24:37Q&A
related talks
44mQuantum Meets Minimum Circuit Size Problem
18mAutomated distribution of quantum circuits via hypergraph partitioning
15mAssertion-Based Optimization of Quantum Programs
48mThe Quantum Games PCP: Results and Confessions
32mOptimal Quantum Programs
37mResource-Efficient Quantum Computing by Breaking Abstractions
01h 00mQuantum Physics for Software Developers
22mOptimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation