BQCP extends quantum constant propagation to dynamic circuits by tracking classical and quantum information across measurement-induced branches, enabling sound simplifications and larger reductions than QCP on benchmarks.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.
citing papers explorer
-
Branch-Aware Quantum Constant Propagation for Dynamic Quantum Circuits
BQCP extends quantum constant propagation to dynamic circuits by tracking classical and quantum information across measurement-induced branches, enabling sound simplifications and larger reductions than QCP on benchmarks.
-
Quantum circuit partition as a maze: emerging percolation transition via path finding
Quantum circuit partitioning is formalized as a maze path problem, revealing a percolation phase transition that separates partitionable from non-partitionable regimes when the CNOT-to-qubit ratio is near one.