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.
Improved simulation of stabilizer circuits.Physical Review A, 70(5):052328
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
The paper proposes a real Clifford algebra structure for quantum information where a stabilizer mapping and Peirce decomposition yield a compatibility law between algebraic multiplication and quantum unitary operations.
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.
-
The State-Operator Clifford Compatibility: A Real Algebraic Framework for Quantum Information
The paper proposes a real Clifford algebra structure for quantum information where a stabilizer mapping and Peirce decomposition yield a compatibility law between algebraic multiplication and quantum unitary operations.