A hybrid path-sum reduction plus weighted model counting method yields a complete equivalence checker for quantum circuits up to global phase.
Rewriting and completeness of sum-over-paths in dyadic frag- ments of quantum computing.Logical Methods in Computer Science, Volume 20, Issue 1, March 2024
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Equivalence Checking of Quantum Circuits via Path-Sum and Weighted Model Counting
A hybrid path-sum reduction plus weighted model counting method yields a complete equivalence checker for quantum circuits up to global phase.