A dynamic grouping plus ZX-calculus lookahead framework reduces two-qubit gate counts in quantum circuits by 18% on average across 25 benchmarks.
Algorithms for quantum computation: Discrete logarithms and factoring
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count
A dynamic grouping plus ZX-calculus lookahead framework reduces two-qubit gate counts in quantum circuits by 18% on average across 25 benchmarks.