Metraipolis › archive › dc_0ce063f9cfd2

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08299
License (as archived)
CC0-1.0
Archived
2026-10-07T15:29:05.438Z
SHA-256 of the archived text
e2a81da4180dfcb94e68dfaa3d29a83d909250c9d4100df69397012c7b86f521
Stable URL of this page
https://metraipolis.com/documento/dc_0ce063f9cfd2

How to cite

Pauli Decomposition by Character Theory: A Memory-Bounded Algorithm for Qubits and Qudits — arXiv:2610.08299 — arXiv (en), https://arxiv.org/abs/2610.08299 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0ce063f9cfd2 (Metraipolis archive dc_0ce063f9cfd2, sha256 e2a81da4180dfcb94e68dfaa3d29a83d909250c9d4100df69397012c7b86f521)
BibTeX
@misc{dc0ce063f9cfd2,
  title = {Pauli Decomposition by Character Theory: A Memory-Bounded Algorithm for Qubits and Qudits — arXiv:2610.08299},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08299},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0ce063f9cfd2; sha256 e2a81da4180dfcb94e68dfaa3d29a83d909250c9d4100df69397012c7b86f521},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08299. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Pauli decomposition underpins Trotterization, phase estimation, sparse-Hamiltonian simulation, and variational observables, at exponential naive cost. From the character theory of $(\mathbb{Z}_2)^n$, characters $\chi_z(v)=(-1)^{\langle v,z\rangle}$ are the diagonal Pauli strings, so any diagonal operator is already Pauli-decomposed. A general operator still needs the shifts: each $X^{\otimes x}$ couples to a character $\chi_z=Z^{\otimes z}$, and the products $X^{\otimes x}Z^{\otimes z}$ -- up to phases in $\{\pm 1,\pm i\}$ -- form the Pauli group, the central extension of $(\mathbb{Z}_2)^n\times(\mathbb{Z}_2)^n$ by that phase group fixed by the symplectic pairing. A section of that extension remains a choice: the bare products $X^{\otimes x}Z^{\otimes z}$, or the genuine operators that insert $Y=iXZ$ at every qubit where $x$ and $z$ overlap. As Fourier analysis on an abelian shift-character lattice (a natural DFT), this formulation is not qubit-bound: $(\mathbb{Z}_p)^n$ recovers Heisenberg-Weyl qudits. The fast algorithm is the FFT for the group at hand; on $(\mathbb{Z}_2)^n$ that FFT is Walsh-Hadamard, at cost $O(n\cdot 4^n)$. paulikit is a memory-bounded realization of that qubit transform: peak usage need not materialize the dense $2^n\times 2^n$ operator, unlike prior codes whose $O(1)$ extra sits on that buffer, checked beyond a billion oscillator terms against Work-Span and bandwidth ceilings.

Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno).
Categorie arXiv: Quantum Physics (quant-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.08299 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T15:00:59.432Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).