Skip to content
Preprint

PauLie: Fast Classification of Pauli Dynamical Lie Algebras

Aug 2026 · 0 citations · 33 references
Physics

TL;DR

PauLie is introduced, an open-source framework that decides this isomorphism type for DLAs generated by arbitrary Pauli strings, building on the anticommutation-graph reduction of Aguilar et al.

Abstract

The dynamical Lie algebra (DLA) governs the controllability, expressibility, and simulation complexity of a quantum system. Explicitly computing it has been a major computational bottleneck: brute-force Lie closure scales exponentially in the number of qubits $n$. Many applications, however, consult only the isomorphism type of the DLA. We introduce PauLie, an open-source framework that decides this isomorphism type for DLAs generated by arbitrary Pauli strings, building on the anticommutation-graph reduction of Aguilar et al. PauLie runs in $O(n|\mathcal{G}|\max(n,|\mathcal{G}|))$ time, where $|\mathcal{G}|$ is the number of generators, turning DLA classification into a routine preprocessing step. We demonstrate its use as a structural oracle for routing Lie-algebraic simulation and Cartan decomposition, diagnosing barren plateaus in variational quantum algorithms, and engineering universal Pauli string generator sets with optimal generation rate.

View source

Similar papers

Preprint Aug 2026

Contextuality in the $n$-qubit Pauli group

The $n$-qubit Pauli group is an essential ingredient to most quantum applications, from computing and error correction to benchmarking and simulation. Despite comprising merely a discrete set of operators, it exhibits many quintessential features of quantum theory, including contextuality, which has been identified as...

Markus Frembs · 2 citations
Preprint Sep 2026

Algebraic Complexity and Black Hole Complementarity

We develop an operator algebraic generalization of the Yoshida-Kitaev information recovery protocol that applies to von Neumann algebras of arbitrary type. The construction is based on finite-index inclusions, with the Jones basic construction and canonical endomorphisms providing the central algebraic tools. Unlike th...

Aude Corbeel, Jing-Xin Tu, Pim van den Heuvel et al. · 0 citations
Preprint Sep 2026

Universal computation with magic Hamiltonians

In the conventional theory of quantum computation, universality is discussed in terms of properties of unitary gate sets. In many experimental setups, however, we instead have access to a parametrized set of Hamiltonians, which can be exponentiated for any desired time. Accordingly, we formulate a continuous analogue o...

M. Junge, Jason Pollack, Luke Visser · 0 citations
Preprint Sep 2026

Equivalence of states and bimodule quantum channels

We study the action of quantum channels on states on a von Neumann algebra $\mathcal{M}$ with conserved quantities encoded by a subalgebra $\mathcal{N}$. We define a phase as an equivalence class of normal states on $\mathcal{M}$ under the action of quantum channels preserving $\mathcal{N}$. First, we establish a relat...

Lin-Zhe Huang, Chun-Lan Jiang, Zheng-Wei Liu et al. · 0 citations
Preprint Sep 2026

Optimal low-rank compression of quantum dynamics

Local quantum interactions generate dynamics in an exponentially large Hilbert space, yet locality and entanglement restrict the information that can spread and accumulate. Bounds on propagation and entanglement growth, together with tensor networks, exploit these restrictions to discard information unnecessary for des...

H. Mackay, Donghoon Kim, Tan Van Vu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.