An O(m) algorithm counts anticommuting unordered pairs of bounded-weight Pauli strings by maintaining labeled subpattern counts and applying a subset zeta identity on each insertion.
Quantum circuit compilation and hybrid computation using Pauli-based computation.Quantum, 7:1126
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Counting anticommuting Pauli pairs in linear time
An O(m) algorithm counts anticommuting unordered pairs of bounded-weight Pauli strings by maintaining labeled subpattern counts and applying a subset zeta identity on each insertion.