Dynamical Lie algebras, i.e. Lie subalgebras of $\mathfrak{su}(2^n)$, generated by Pauli strings have recently been studied intensively. They are also called Pauli Lie algebras or Hamiltonian Lie algebras.
In this paper we provide a uniform mathematical approach to various recent results on Pauli Lie algebras. Moreover, we present an algorithm that on input of a set of Pauli strings determines the isomorphism type of the dynamical Lie algebra generated by these Pauli's in time $\mathcal{O}(\max(n,m)^3)$ where $m$ is the size of the generating set.
Dynamical Lie algebras generated by Pauli strings and quadratic spaces over F2
Dynamical Lie algebras, i.e. Lie subalgebras of su(2n), generated by Pauli strings have recently been studied intensively. They are also called Pauli Lie algebras or Hamiltonian Lie algebras.
In this paper we provide a uniform mathematical approach to various recent results on Pauli Lie algebras. Moreover, we present an algorithm that on input of a set of Pauli strings determines the isomorphism type of the dynamical Lie algebra generated by these Pauli's in time O(max(n,m)3) where m is the size of the generating set.
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∣G∣max(n,∣G∣)) time, where ∣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.
Understanding the dynamical properties of quantum systems is an essential task in quantum computing, quantum control, and many-body physics. Tools such as representation theory and Lie theory provide crucial information on reachability and computational power. However, this information can be difficult to access exactly or compute efficiently for arbitrary generating sets. Here we focus on the setting of Pauli strings, which satisfy numerous exceptional properties that simplify the problem. We find deep connections between Pauli Lie algebras and certain subgroups of the Clifford group generated by transvections, through the symplectic properties of the Pauli strings. This allows us to give an invariant-based perspective on these objects and their reachability, in the language of Pauli orbits, symmetries, and invariant subspaces. The invariant-based approach provides efficient algorithms for identifying Lie algebras and orbits, as well as a simple framework for analyzing structured Pauli generating sets. We also show in an elementary way that Clifford subgroups generated by transvections provide 3-designs for the corresponding Pauli Lie groups. We illustrate the framework through structured examples from variational quantum algorithms, restricted quantum computation, many-body systems, and random circuits.
Lie groups, and therefore Lie algebras, are fundamental structures in quantum physics that determine the space of possible trajectories of evolving systems. However, classification and characterization methods for these structures are often impractical for larger systems. In this work, we provide a comprehensive classification of Lie algebras generated by an arbitrary set of Pauli operators, from which an efficient method to characterize them follows. By mapping the problem to a graph setting, we identify a reduced set of equivalence classes: the free-fermionic Lie algebra, the set of all anti-symmetric Paulis on n qubits, the Lie algebra of symplectic Paulis on n qubits, and the space of all Pauli operators on n qubits, as well as controlled versions thereof. Moreover, out of these, we distinguish 6 Clifford inequivalent cases and find a simple set of canonical operators for each, which allow us to give a physical interpretation of the dynamics of each class. Our findings reveal a no-go result for the existence of small Lie algebras beyond the free-fermionic case in the Pauli setting and offer efficiently computable criteria for universality and extendibility of gate sets. These results bear significant impact in ideas in a number of fields like quantum control, quantum machine learning, or classical simulation of quantum circuits.
Determining the unitary dynamics accessible from finite Hamiltonian resources is a central problem in Hamiltonian engineering and quantum control. Dynamical Lie algebras (DLAs) connect available control Hamiltonians with the reachable dynamics, but their use as a design tool for modifying Hamiltonian generator sets remains less developed. In this work, we develop a finite-dimensional DLA framework for three generator-set operations: composition, invariance, and reduction. For composition, we construct direct sums of component DLAs using spectral projectors on an auxiliary register. For invariance, we analyze when modifications of Pauli-string generating sets preserve the generated Lie algebra, and introduce algebraic diagnostics for added generators. For reduction, we consider compact reductive DLAs and show how projection onto selected simple ideals gives reduced generating sets whose Lie closures are the corresponding ideal sums. We illustrate these results with finite-dimensional examples and numerical checks, including direct-sum dimension addition, central-spin invariance diagnostics, and DLA-based ansatz reduction for block-local Hamiltonians. The results show how DLA structure can be used to diagnose controllability and guide Hamiltonian generator design under explicit algebraic assumptions.
We study, classify, and explore the mathematical properties of finite-dimensional Lie algebras occurring in the quantum dynamics of single-mode and self-interacting bosonic systems. These Lie algebras are contained in the real skew-hermitian Weyl algebra A^1, defined as the real subalgebra of the Weyl algebra A1 consisting of all skew-hermitian polynomials. A central aspect of our analysis is the choice of basis for A^1, which is composed of skew-symmetric combinations of two elements of the Weyl algebra called monomials, namely strings of creation and annihilation operators combined with their hermitian conjugate. Motivated by the quest for analytical solutions in quantum optimal control and dynamics, we aim at answering the following three fundamental questions: (i) What are the finite-dimensional Lie subalgebras in A^1 generated by monomials alone? (ii)~What are the finite-dimensional Lie subalgebras in A^1 that contain the free Hamiltonian? (iii) What are the non-abelian and finite-dimensional Lie subalgebras that can be faithfully realized in A^1? We answer the first question by providing all possible realizations of all finite-dimensional non-abelian Lie algebras that are generated by monomials alone. We answer the second question by proving that any non-abelian and finite-dimensional subalgebra of A^1 that contains a free Hamiltonian term must be a subalgebra of the Schrödinger algebra. We partially answer the third question by classifying all nilpotent and non-solvable Lie algebras that can be realized in A^1, and comment on the remaining cases. Finally, we also discuss the implications of our results for quantum control theory. Our work constitutes an important stepping stone to understanding quantum dynamics of bosonic systems in full generality.
Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al., npj Quantum Inf. 10, 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. In this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.