Year: 2026
Type: preprint
Abstract: Many quantum computing workflows manipulate long lists of Pauli strings. A basic classical subroutine involves taking $m$ Pauli strings on $n$ qubits, each of weight bounded by a constant, to determine if they are pairwise commuting, identify any counterexamples, or calculate the exact number of anticommuting unordered pairs. The standard general-purpose route represents Pauli strings in binary symplectic form and checks pairs in $O(m^2)$ time. Here, we provide an $O(m)$ algorithm for the bounded locality regime. It maintains counts of all labeled subpatterns of previously inserted strings and answers each new string query by a subset zeta identity. Our algorithm is particularly useful for processing large collections of Pauli strings within the bounded locality regime.
Source: arXiv (Cornell University)
Authors: Cha, Hyunho, Lee, Jungwoo
Institution: Seoul National University
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W7160983076
Cites:
Cited by:
Related to: