arXiv:2610.08299 · v3

Pauli Decomposition by Character Theory: A Memory-Bounded Algorithm for Qubits and Qudits

首次提交 2026-10-06 21:03

版本更新 2026-11-07 20:54

雷达观测 2026-11-10 11:14

摘要

Pauli decomposition of an $n$-qubit operator is expensive if each of the $4^n$ Pauli strings is treated as an unstructured object. Labeling those strings by the configuration space $(\mathbb{Z}_2)^n$ makes them displacement operators $X^{\otimes x}Z^{\otimes z}$ on the computational space: shifts by~$x$ and multiplications by characters $Z^{\otimes z}$ in the computational basis. That labeling organizes the operator into $2^n$ fibers of length $2^n$, one per shift~$x$, each collecting the computational-basis amplitudes that hop by~$x$. Expanding each fiber function in the character basis of $(\mathbb{Z}_2)^n$ --- a length-$2^n$ Walsh--Hadamard transform --- recovers the Pauli coefficients at total cost $O(n\cdot4^n)$. The same fiber / shift--character picture extends to $(\mathbb{Z}_p)^n$ (Heisenberg--Weyl qudits). \texttt{paulikit} is a memory-bounded realization for qubits: for matrix-sparse inputs, peak memory need not densify to a full $2^n\times2^n$ operator. Performance is checked on a stated low-end GNU/Linux platform for a coupled-oscillator sweep beyond a billion Pauli terms.

作者备注：23 pages, 4 figures. Corrected oscillator Hamiltonian (paulikit 0.1.4); remesured tables. Zenodo 10.5281/zenodo.23972284 (software), 10.5281/zenodo.24030142 (measurements)