Skip to main content
Nature Portfolio logoLink to Nature Portfolio
. 2024 Nov 6;10(1):110. doi: 10.1038/s41534-024-00900-2

Classification of dynamical Lie algebras of 2-local spin systems on linear, circular and fully connected topologies

Roeland Wiersema 1,2,3,, Efekan Kökcü 4, Alexander F Kemper 4, Bojko N Bakalov 5
PMCID: PMC11540907  PMID: 39525947

Abstract

Much is understood about 1-dimensional spin chains in terms of entanglement properties, physical phases, and integrability. However, the Lie algebraic properties of the Hamiltonians describing these systems remain largely unexplored. In this work, we provide a classification of all Lie algebras generated by the terms of 2-local spin chain Hamiltonians, or so-called dynamical Lie algebras, on 1-dimensional linear and circular lattice structures. We find 17 unique dynamical Lie algebras. Our classification includes some well-known models such as the transverse-field Ising model and the Heisenberg chain, and we also find more exotic classes of Hamiltonians that appear new. In addition to the closed and open spin chains, we consider systems with a fully connected topology, which may be relevant for quantum machine learning approaches. We discuss the practical implications of our work in the context of variational quantum computing, quantum control and the spin chain literature.

Subject terms: Quantum mechanics, Qubits

Introduction

Mathematical classifications of the fundamental symmetries of physical systems date back to the work of Wigner, who proposed three symmetry classes of non-interacting fermionic Hamiltonians depending on their time-reversal and spin-rotation properties1. Three decades later, Dyson would mathematically solidify this theory and connect the spectral properties of these different types of Hamiltonians with random matrix theory2 (see ref.3 for a modern treatment). It would take another thirty years before Altland and Zinbauer extended these results to ten symmetry classes4, each of which correspond to a symmetric space in Cartan’s original classification of these spaces5,6. Further extensions of these results were made in recent years with regards to topological phases of matter79.

The above mathematical classifications in quantum physics rest on the powerful theory of Lie groups, which provides a framework for describing the continuous symmetries and transformations that characterize the behavior of quantum systems. The study of Lie groups, and by extension physical symmetries, can often be simplified by considering the corresponding Lie algebra of the group. The commutation relations of operators in the Lie algebra capture the essential features of the underlying symmetries and can be used to analyze the spectrum, eigenstates, and dynamics of quantum systems.

A Hamiltonian of a finite-dimensional system can be understood as (i times) an element of some Lie algebra gu(N). Here, u(N) is the vector space of all skew-Hermitian N × N matrices equipped with the standard commutator. Typically, a Hamiltonian is described by a linear combination of terms that correspond to a certain physical interaction. The algebra formed by taking all (finite) products and linear combinations of the terms in a Hamiltonian is called the bond algebra of the Hamiltonian1012. Bond algebras have been studied extensively to understand the symmetries and spectra of different classes of Hamiltonians. More recently, they have been used to study thermalization phenomena in quantum many-body systems13,14. Instead of studying the algebra formed by taking products of individual interactions in the Hamiltonian, we can study the Lie algebra generated by these terms under commutation. The result is called the Hamiltonian algebra or dynamical Lie algebra (DLA)1519, which is intricately linked to the unitary dynamics of a quantum system.

Since each DLA is a subalgebra of u(N), a classification of DLAs can be phrased as a classification of all subalgebras of u(N). Such a classification is intractable, except when specific constraints are placed on the subalgebras one considers. For example, in the original works of Killing and Cartan, all simple Lie algebras were classified20; similarly, Dynkin provided a classification of the maximal subalgebras of simple Lie algebras21,22. We follow a different approach: instead of adding algebraic constraints such as simplicity or maximality, we make use of the fact that any Lie algebra can be described by a set of generators, and we consider the Lie algebras that arise by using the terms of specific Hamiltonians as the generators. In contrast with the previously-mentioned classifications of1,2,4, this approach covers interacting quantum many-body systems.

Specifically, we consider the class of Hamiltonians that correspond to 1-dimensional 2-local spin chains, and provide a classification of the Lie algebras that are generated under commutation by the individual Pauli terms of the Hamiltonian. Much about these systems is well-understood, from their entanglement properties23, their phases24 and their integrability25,26. Additionally, they show up in the study of bond algebras10,14. However, to the best of our knowledge, the Lie algebraic properties of these Hamiltonians have not yet been explored in full. It is thus reasonable to ask, given our comprehensive knowledge of the physics governing these systems, what more can be learned from the Lie algebra? We provide an answer to this question by classifying all unique dynamical Lie algebras of linear, circular and permutation invariant spin systems generated by 2-local Pauli operators. We discuss how our classification has bearing on areas of quantum control, variational quantum computing, and quantum dynamics and thermodynamics.

For variational quantum computing, one is not interested in representing the whole unitary group, but in using a parameterized subgroup in order to generate a state that minimizes a given objective function. Understanding what subgroup a particular quantum circuit parameterizes can give insight into its representational power. For example, one can connect the dimension of the DLA to a phenomenon called overparameterization2730. Additionally, DLAs can be used to understand barren plateaus31 — flat areas in the cost landscape of a variational quantum algorithm that hinder optimization32,33. Finally, a recent work uses knowledge of the DLA to perform efficient classical simulations of several quantum algorithms34. We discuss these results by showing that barren plateau and overparmaeterization phenomena show for several examples found in our classification as expected, which highlights the usefulness of classifying sets of quantum circuits by their Lie algebraic properties.

In quantum control, the DLA of a dynamical quantum system can be related to the set of reachable states of that system. In particular, DLAs can be used to define a notion of controllability of a quantum system3537, which is highly relevant when it comes to designing unitary operations for quantum simulators and quantum computers. One is typically interested in Hamiltonians that can generate an arbitrary unitary operator, while the existence of symmetries can inhibit the control of a physical system38.

Finally, one can use the knowledge of the DLA to provide insights into the dynamics of physical systems. Here, it should be noted that the physical properties of models described by the Hamiltonian whose terms generate the DLA strongly depend on the coefficients of said terms. Our classification, which neglects the coefficients, is thus limited to the properties that belong to the entire class of models described by the same terms. While this is a coarse classification, we can nevertheless make quite general observations just from the study of the DLA. For example, one can construct constant-depth quantum circuits for the dynamical simulation of a specific quantum system3942, or state preparation via adiabatic state preparation40,42, or implement Hartree–Fock43. The dimension of the DLA is directly related to the quantum circuit depth needed to capture the full dynamics39. Additionally, non-Abelian commutants describe non-Abelian symmetries.

Results

Summary of the main results

Here, we give a brief summary of our main results, which include the classification of all DLAs generated by the Pauli terms of 2-local spin Hamiltonians of length n in one dimension. We emphasize that our method is not limited to one-dimensional topologies, but can be extend to other graphs, which we will explore in a follow-up work44.

Recall that a Lie algebra can be constructed by a set of generators so that it is closed under linear combinations and under the Lie bracket. In our case, the Lie bracket is the standard commutator [A, B] = ABBA. We now choose the generators of our Lie algebra to be (i times) the Pauli strings that appear as terms of a 2-local spin chain Hamiltonian. Since a Hamiltonian is always a Hermitian operator, we can understand it as (i times) an element of the Lie algebra u(2n). Therefore, we can limit ourselves to the study of DLAs that are subalgebras of u(2n), for which we have the following useful fact. Although this result is known (see e.g.38,45), for completeness, we provide its proof and review the necessary definitions in SM A II.

Proposition 1.1

Any DLA must be either Abelian, isomorphic to su(N), so(N), sp(N) (with N2n, N≤2n−1), an exceptional compact simple Lie algebra, or a direct sum of such Lie algebras. Indeed, any subalgebra of u(N) is either Abelian or a direct sum of compact simple Lie algebras and a center.

Note that all simple Lie algebras over the complex and real numbers have been classified by Killing and Cartan46. The above proposition forms the backbone of our classification, as we know that any DLA generated by our class of Hamiltonians must be of the described form.

To obtain our classification, we first calculate all DLAs that can be generated by Pauli strings of length 2. Then we identify the orbits under the symmetries of the Pauli group and the swap of the two sites, thus reducing the number of unique Lie algebras to 27. Next, we find several isomorphisms between some of the sets of generators, reducing the set of unique structures even further. Finally, we determine how these Lie algebras scale with system size as the number of spins grows beyond 2 sites. In this final step, we take the boundaries of the spin chain into account, since the Lie algebra will behave differently for open or periodic boundary conditions of the chain. The following is our main result.

Result 1.1

(Classification of spin chain DLAs). We provide a classification of all dynamical Lie algebras generated by the Pauli terms of 2-local spin Hamiltonians in one dimension. For both open and closed spin chains, there are 17 unique Lie algebras that can be generated by a spin chain Hamiltonian.

The formal statement of this result is presented in the main text with Theorems I.1 and I.2 along with a sketch of the proof.

The dimension of a DLA can be related to the trainability of variational quantum circuits, and may therefore be of high interest. Since we know the dimensions of all simple Lie algebras, a direct corollary of our result is the following.

Result 1.2

(Dimension scaling of DLAs). The dimension of any dynamical Lie algebra generated by the Pauli terms of a 2-local spin chain Hamiltonian of length n will scale as either O(4n), O(n2) or O(n).

To illustrate this, we plot the dimensions of the open DLAs in our classification in Fig. 1.

Fig. 1. Scaling of the DLAs of spin chains with open boundary conditions.

Fig. 1

The exponentially scaling DLAs are denoted in red, the quadratically scaling ones in blue, and the linearly scaling algebras are denoted in green. The full and dashed line denote the smallest and largest scaling Lie algebra in our classification, respectively.

Our proof technique also applies to the case of a complete graph, where each site is interacting with every other site via 2-local interactions; in other words, all-to-all connected. We therefore also include this topology in our classification.

Result 1.3

(Classification of permutation invariant DLAs). We provide a classification of all dynamical Lie algebras generated by the Pauli terms of 2-local permutation-invariant spin Hamiltonians. There are 8 unique Lie algebras that can be generated by such a spin chain Hamiltonian.

We present the formal statement of this result in Theorem I.3. Similarly to Result I.2, we find DLAs with linear, quadratic and exponentially scaling dimensions.

In addition to the classification of unique (up to isomorphism) Lie algebraic structures, we also provide an explicit list of examples of Hamiltonians that generate them in Table S.I. Some of the generators in our classification show up in well-known models such as the transverse-field Ising model or the Heisenberg model, whereas other Hamiltonians we find are perhaps not realizable in nature. However, some of these more exotic models may be of interest due to their properties. For instance, we find a class of Hamiltonians with globally non-commuting charges.

Glossary

We summarize the main choices of notation and nomenclature used throughout the paper in the following list.

a, g Lie algebras.
A, G Sets, usually generating sets for Lie algebras.
?G?Lie The Lie algebra generated by a set G.
ab a and b are isomorphic as Lie algebras.
AB A and B are equivalent under the symmetry group S3×Z2.
A=B A and B are equal as sets.
Pn The set of n-qubit Pauli strings {I, X, Y, Z}n.
Xj, Yj, Zj The action of the corresponding Pauli matrix on the j-th qubit in the spin chain.
spanR(A) The set of all linear combinations of elements of A with real coefficients.
span=ispanR A shortcut for taking the real span and multiplying by the imaginary unit i. Takes Hermitian matrices to skew-Hermitian.

Lie algebras

We assume knowledge of finite-dimensional Lie algebras (for a formal treatment, see e.g. refs. 6,46), but will review some essential concepts here. A Lie algebra g is a vector space equipped with a Lie bracket [,]:g×gg satisfying certain axioms (which are reviewed in SM A II). The Lie bracket defines the adjoint endomorphism ada:gg where ada(b) = [a, b]. For our purposes, the Lie bracket is the standard commutator of linear operators on a vector space: [a, b] = abba. When g is a compact simple Lie algebra (cf. SM A II and Proposition I.1), one can associate to it a compact Lie group G via the exponential map G=eg.

Consider a set of generators A={a1,a2,,aM} with akg. We first define the nested commutator,

adai1adair(aj)=[ai1,[ai2,[[air,aj]]]], 1

which is just aj in the special case r = 0. The linear span of all nested commutators

ALie:=spanR{adai1adair(aj)ai1,,air,ajA}

is then called a dynamical Lie algebra (DLA)15,45. This is the minimal (under inclusion) subalgebra of g that contains the set A. The depth r of the nested commutator is finite and will depend on the size of the DLA, which we typically do not know beforehand. In practice, the DLA of a given set of generators A can be obtained recursively with Algorithm 1.

Algorithm 1

Calculating the DLA

graphic file with name 41534_2024_900_Figa_HTML.jpg

Remark 1.1

In this paper, we are interested in the case where the generators A are Pauli strings. Then, since the commutator of two Pauli strings is up to a scalar again a Pauli string, Algorithm 1 can be simplified by replacing the condition akspan(A) with akA{0}. Moreover, as different Pauli strings are linearly independent, the final set A will be a basis for the DLA ALie.

2-local spin chains

Due to Proposition I.1, we know what form the subalgebras of u(N) must take. Our goal is to find which of these direct sums of simple or Abelian Lie algebras can be generated by a physically inspired set of generators.

In particular, we are interested in the subalgebras of u(2n) that are generated by the terms of 1-dimensional 2-local Hamiltonians. By this we mean that we consider operators that couple up to two neighboring sites and where the operator interactions between neighboring sites is the same, but the interaction strength may vary per interaction, and could potentially depend on time due to an external field allowing control over the system.

In more details, we consider a spin system with a complex Hilbert space (C2)n. On each copy of C2, representing a qubit, we have an action of the set of Pauli matrices P1:={I,X,Y,Z}, while the 2-qubit interactions will be determined by some subset AP2:=P12. We assume that A does not contain II, which corresponds to no interaction. A corresponding Hamiltonian that is built out of these interactions has the form

H=k=1n1aaAJk,a,a(t)akak+1, 2

where Jk,a,a are arbitrary real coefficients which are possibly time-dependent, and

akak+1:=I(k1)aaI(nk1). 3

In the parlance of quantum computing and physics, H is a 2-local Hamiltonian corresponding to a spin chain with open boundary conditions. Closed or periodic boundary conditions are also of interest; in this case the Hamiltonian has the form

H=k=1naaAJk,a,a(t)akak+1, 4

where the sites are viewed mod n so that an+1:=a1 and

anan+1:=aI(n2)a. 5

Note that physical models come with coefficients Jk,a,a(t) in front of each akak+1 term that determine the equilibrium and non-equilibrium physics of the model. Here, we are only concerned with the Lie algebraic properties of the Hamiltonian H and we will not consider any spectral properties of H. Additionally, we note that we are considering a directed interaction graph, since we allow terms like XY, which do not act symmetrically between neighboring qubits.

Continuing, we note that the Pauli matrices iP1\{iI} form a basis of su(2), and the tensor products iP2\{iI2} form a basis of su(4). Hence, span(A)su(4) (recall that span=ispanR). In the following, we will suppress the tensor product between Pauli operators and identities for clarity, and we denote aa=aa. We now give some examples to illustrate how several well-known spin chains can be written in this notation.

Example I.1

Random field Ising model. The Hamiltonian of the transverse-field Ising model (TFIM) in one dimension with open boundary conditions and random transverse field is given by

HTFIM=Ji=1n1ZiZi+1+i=1ngiXi,

where J,giR. Its generating set of Pauli strings is

ATFIM:={ZZ,XI,IX}.

Example I.2

XXZ chain. For the 1-dimensional XXZ chain with open boundary conditions, the Hamiltonian is given by

HXXZ=i=1n1(XiXi+1+YiYi+1+ΔZiZi+1),

which has generators

AXXZ:={XX,YY,ZZ}.

Example I.3

Spinless fermionic Gaussian state. A free fermion Hamiltonian chain in one dimension with periodic boundary conditions can be built from the generators on two sites:

c1c2,c1c1,c2c2,c1c2,c2c1,c1c2,

where c and c are fermionic raising and lowering operators, respectively. The corresponding Hamiltonian is

HFF=i=1n(cici+1+cici+1+cici+1+cici+1),

where cn+1c1 and cn+1:=c1. The fermionic raising and lowering operators may be translated to Pauli string form via a number of transformations. If we use the common Jordan–Wigner transformation, the resulting set of Pauli generators is

AFF:=XX,ZI,IZ,YY,XY,YX.

We can now state the central question of our work. We seek to classify all DLAs generated by the terms (3) (respectively, (3) and (5)) of a Hamiltonian (2) (respectively, (4)) of a spin chain with both open and periodic boundary conditions. We first determine (up to symmetry) all subalgebras of su(4) that are generated by all possible interaction sets AP2, and then we discuss how such subalgebras extend to n sites to give subalgebras of su(2n).

Growing the dynamical Lie algebras

On a 2-qubit system, the Pauli interaction terms AP2 generate a Lie algebra ALie=a, which is a subalgebra of su(4). We now investigate the structure of the DLA as we add terms that have been translated by one site. In the case of an open spin chain, we define the DLA a(n) as the subalgebra of su(2n) generated by the terms akak+1 for aaA, k = 1, …, n − 1 (see (3)). Equivalently, we note that a(n) is generated by the set

1kn1I(k1)aI(nk1).

In particular, a(2)=a. By construction, we have two Lie algebra embeddings a(n)a(n+1), given by appending I to the first or last qubit (see Fig. 2).

Fig. 2. Growing a Lie algebra by adding a site to the chain.

Fig. 2

Increasing the system size from 2 sites to 3 sites changes the DLA from a(2) to a(3) within su(4) and su(8), respectively. The goal of our classification is to describe the behavior for any n ≥ 3.

For a closed spin chain with periodic boundary conditions, the DLA is generated by the terms akak+1 for aaA, k = 1, …, n, where an+1:=a1 (see (3), (5)). We denote the resulting Lie algebra as a(n).

Example I.4

Consider the generating set A={XY} on 2 qubits. The DLA is given by

a=ALie=span{XY},

which is an Abelian Lie algebra isomorphic to u(1). Constructing the generators of a(3) according to the procedure above gives

a(3)=XYI,IXYLie=span{XYI,IXY,XZY}.

It is easy to confirm that a(3)so(3). We see that going from n = 2 to n = 3, the DLA changes from u(1) to so(3).

Example I.5

For the generating set A={XY} with a=span{XY}, the DLA of the 3-site closed spin chain is

a(3)=XYI,IXY,YIXLie=span{XYI,IXY,XZY,YIX,YXZ,ZYX}.

One can show that a(3)so(3)so(3).

The above examples illustrate that the algebraic structure of a DLA can change as we increase the system size, and moreover it depends on the boundary conditions.

Main theorem

We state the main theorem of our work below, and tabulate the generators of the Lie algebras of our classification in Table 1.

Table 1.

List of generators of the DLAs in Theorem I.1 and examples of conventional spin models that have the equivalent DLA

Label Generating set Example Model
a0 XX Ising model
a1 XY Kitaev chain
a2 XY, YX Massless free fermion + magnetic field
a3 XX, YZ Kitaev chain + Coulomb
a4 XX, YY XY-model
a5 XY, YZ
a6 XX, YZ, ZY Massless free fermion + magnetic field + Coulomb
a7 XX, YY, ZZ Heisenberg chain
a8 XX, XZ Ising model + transverse field
a9 XY, XZ Kitaev chain + longitudinal field
a10 XY, YZ, ZX Heisenberg
a11 XY, YX, YZ XY-model + longitudinal field
a12 XX, XY, YZ
a13 XX, YY, YZ XY-model + longitudinal field
a14 XX, YY, XY XY-model + transverse field
a15 XX, XY, XZ Ising model + arbitrary field
a16 XY, YX, YZ, ZY Kitaev chain + longitudinal field
a17 XX, XY, ZX Ising model + arbitrary field
a18 XX, XZ, YY, ZY XY-model + arbitrary field
a19 XX, XY, ZX, YZ
a20 XX, YY, ZZ, ZY Heisenberg chain + magnetic field
a21 XX, YY, XY, ZX XY-model + arbitrary field
a22 XX, XY, XZ, YX Ising model + arbitrary field
b0 XI, IX Uncoupled spins
b1 XX, XI, IX Ising model
b2 XY, XI, IX Kitaev chain + longitudinal field
b3 XI, YI, IX, IY Uncoupled spins
b4 XX, XY, XI, IX Ising model + arbitrary field

Considering our construction of DLAs, the example Hamiltonians can be generalized by making all coefficients of Pauli strings independent from each other.

We separate the dynamical Lie algebras in our classification into two types. A DLA of a-type on an open spin chain of length n is a Lie algebra of the form a(n), where a=ALie for some generating set of 2-site Pauli strings A{X,Y,Z}2. Explicitly, a(n)=A(n)Lie where

A(n)={AiBi+1ABA,1in1}, 6

with AB denoting 2-site Pauli strings, A, B ∈ {X, Y, Z}.

A b-type DLA on an open spin chain of length n is a DLA that cannot be expressed as a-type and has the form b(n)=A(n)B(n)Lie for some A{X,Y,Z}2, a non-empty set of Paulis B{X,Y,Z}, and

B(n)={BiBB,1in}. 7

We have generated all DLAs ak(n), bk(n), ak(n) and bk(n) up to n = 8 with Algorithm 1 and Remark I.1. For n = 3, we present linear bases of all these Lie algebras in SM B V. Inspired by this list of Lie algebras, we construct formal proofs to determine them for all n ≥ 3.

Theorem 1.1

(Classification of Open DLAs). Every dynamical Lie algebra of type a or b on an open spin chain of length n ≥ 3 is isomorphic to one of the following:

a0(n)u(1)(n1),a1(n)so(n),a2(n)a4(n)so(n)so(n),a3(n)so(2n2)4,n0mod8,so(2n1),n±1mod8,su(2n2)2,n±2mod8,sp(2n2),n±3mod8,sp(2n3)4,n4mod8,a5(n)so(2n2)4,n0mod6,so(2n1),n±1mod6,su(2n2)2,n±2mod6,sp(2n2),n3mod6,a6(n)a7(n)a10(n)su(2n1),nodd,su(2n2)4,n4even,a8(n)so(2n1),a9(n)sp(2n2),a11(n)=a16(n)=so(2n),n4,ak(n)=su(2n),k=12,17,18,19,21,22,n4,a13(n)=a20(n)a15(n)su(2n1)2,a14(n)so(2n),b0(n)u(1)n,b1(n)u(1)(2n1),b2(n)sp(2n2)u(1),b3(n)su(2)n,b4(n)su(2n1)su(2n1)u(1).

We present a sketch of the proof of Theorem I.1 in the Methods section, and the full proof can be found in the Supplemental Material. The following corollary is an immediate consequence of Theorem I.1 and knowledge of the dimensions of the Lie algebras su, so and sp (see SM (A9)). As can be seen from Theorem I.2 below, it holds for both open and closed spin chains.

Corollary 1.1

(Dimension scaling of DLAs). The dimensions of all dynamical Lie algebras of 2-local spin chains of length n scale as either O(4n), O(n2) or O(n).

We thus see that the DLAs can be separated in three classes based on the scaling of their dimensions.

Periodic boundary conditions

In the periodic case, we define a DLA of a-type on a closed spin chain of length n as a Lie algebra of the form a(n)=A(n)Lie for some generating set of 2-site Pauli strings A{X,Y,Z}2, where

A(n)={AiBi+1,AnB1ABA,1in1}. 8

A b-type DLA on a closed spin chain of length n is one that cannot be expressed as a-type and has the form b(n)=A(n)B(n)Lie for some A{X,Y,Z}2, a non-empty set of Paulis B{X,Y,Z}, and B(n) given by (7).

Theorem 1.2

(Classification of Periodic DLAs). Every dynamical Lie algebra of type a or b on a closed spin chain of length n ≥ 3 is isomorphic to one of the following:

a0(n)u(1)n,a1(n)so(n)2,a2(n)so(n)4,a3(n)=a13(n),nodd,a3(n),n0mod4,a6(n),n2mod4,su(2n1)2,nodd,so(2n2)4,n0mod8,sp(2n3)4,n4mod8,su(2n2)4,n2mod4,a4(n)so(2n),nodd,so(n)4,neven,a5(n)=a16(n),n±1mod3,a5(n),n0mod3,so(2n),n±1mod3,so(2n2)4,n0mod6,sp(2n2),n3mod6,a6(n)=a13(n)su(2n1)2,nodd,a6(n)su(2n2)4,neven,ak(n)=ak(n),k=7,13,16,20,a8(n)so(2n)2,a9(n)so(2n),n4,a10(n)=su(2n),n±1mod3,a10(n),n0mod3,su(2n),n±1mod3,su(2n2)4,n0mod6,su(2n1),n3mod6,a11(n)=so(2n),n4,ak(n)=su(2n),k=12,15,17,18,19,21,22,a14(n)so(2n)2,b0(n)=b0(n)u(1)n,b1(n)u(1)2n,b2(n)so(2n),n4,b3(n)=b3(n)su(2)n,b4(n)=su(2n).

The proof of this theorem is given in SM C VIII. The proof strategy is different from that of Theorem I.1 because, unlike the open case, the periodic Lie algebras ak(n) are not generated inductively from ak(n1). Instead, we use that ak(n) is generated from ak(n) and its cyclic shifts, and we utilize the explicit description ak(n)=gk(n)θk (see SM C VI for more details).

Permutation-invariant subalgebras

The strategies employed for periodic boundary conditions can also be used to classify the DLAs in the case where the Hamiltonian is defined on a complete graph, so that each spin is connected to each other spin via 2-local interactions given by Pauli strings.

In more detail, we define a DLA of aπ-type as a Lie algebra of the form aπ(n)=Aπ(n)Lie for some generating set of 2-site Pauli strings A{X,Y,Z}2, where

Aπ(n)={AiBjABA,1ijn}. 9

A bπ-type DLA is one that cannot be expressed as aπ-type and has the form bπ(n)=Aπ(n)B(n)Lie for some A{X,Y,Z}2, a non-empty set of Paulis B{X,Y,Z}, and B(n) given by (7).

Theorem 1.3

(Classification of Permutation Invariant DLAs). For n ≥ 3, every dynamical Lie algebra of type aπ or bπ is isomorphic to one of the following:

akπ(n)=ak(n),k=7,16,20,22,a0π(n)u(1)n(n1)/2,a2π(n)=so(2n)ZZso(2n1)2,a4π(n)=a7(n)su(2n1),nodd,su(2n2)4,n4even,a6π(n)=a20(n)a14π(n)su(2n1)2,b0π(n)=b0(n)u(1)n,b1π(n)u(1)n(n+1)/2,b3π(n)=b3(n)su(2)n.

The proof of this theorem is given in SM C IX.

Discussion

In the previous section, we have classified the dynamical Lie algebras generated by the Pauli terms of 2-local spin chain Hamiltonians, both for open and closed boundary conditions and on complete graphs. To set some context for the reader, we present a few particular situations that come from variational quantum computing, quantum control, and physical systems, where dynamical Lie algebras arise and play an important role.

A quantum circuit can be described as a product of unitaries U = ∏kUk. Typically, the quantum circuit U acts on a multi-qubit state, whereas the gates Uk only act on single or two qubit subsystems, i.e., we can write Uk=eak where ak is a 1- or 2-local operator. For a set of generators A={ak} with a corresponding DLA g=ALie, we have the Lie group

eg={eak1t1eak2t2eakrtrtiR,akiA}. 10

In other words, any element in the Lie group eg generated by the DLA can be reached by a finite product of unitaries in that group (see45, Corollary 3.2.6). In quantum computing, if eg=SU(2n), then the gate set {eak} is called universal47. It is known that almost any combination of unitaries is universal48,49. However, we can make specific choices for the generators {ak} that correspond to a non-universal gate set, which instead will generate a proper subgroup of SU(2n). This is especially relevant for a class of quantum algorithms called variational quantum algorithms50,51.

If limited to 1-dimensional topology, the generators in our classification will produce a circuit that is an element of the Lie group eg. This notion can be used to construct specific quantum algorithms that always act within a subgroup of SU(2n). Here, one considers a circuit that consists of parameterized gates,

U(θ)=U1(θ1)U2(θ2)UK(θK),Uk(θk)=eθkak.

The gate parameters θ = (θ1, …, θK) are real parameters that are optimized with a classical optimization routine to minimize a scalar cost function. A widely used example of such an optimization is the Variational Quantum Eigensolver algorithm (VQE)52, which has a cost function given by

C(θ)=Tr[U(θ)ρ0U(θ)Hc], 11

where Hc is a Hermitian operator and ρ0=ψ0ψ0 is the initial state of the system. Crucial to the success of this algorithms is the choice of a circuit ansatz U(θ) and the properties of the cost function (11).

A large class of variational circuits consist of L repeating layers of unitary blocks39,5360, each with its own set of parameters:

U(θ)=l=1Lk=1KUk(θk(l)).

Below, we give some examples of these circuits and how our classification relates to them.

Example II.1

Hamiltonian Variational Ansatz. The Hamiltonian Variational Ansatz circuit is obtained by Trotterizing the exponential of a Hamiltonian55,56. Consider the Hamiltonian

HXY=i=1n1XiYi+1,

which has a1(n) as its DLA. Exponentiation of H and the application of the Trotter–Suziki formula then gives:

U(θ)=l=1Levenkeiθk(l)XkYk+1oddkeiθk(l)XkYk+1,

where we grouped the odd and even terms together due to the structure imposed by the 1- and 2-qubit gates available on the quantum computer. Due to (10) and the knowledge that a1(n)so(n), we know that the above circuit must be a parameterization of a unitary operator U(θ) ∈ SO(n).

Similarly, we can take the DLA a9(n) with generators {XY, XZ}, which gives a circuit within Sp(2n−2):

U(θ,ϕ)=l=1Levenkeiθk(l)XkYk+1oddkeiθk(l)XkYk+1×evenkeiϕk(l)XkZk+1oddkeiϕk(l)XkZk+1.

We illustrate these circuits schematically in Fig. 3.

Fig. 3. Examples of brick layer circuits that fall within our classification.

Fig. 3

a Variational ansatz circuit for the Hamiltonian HXY=i=1n1XiYi+1, which parameterizes an element of the group SO(n). b Variational ansatz that parameterizes a unitary in Sp(2n−2) via products of unitaries generated by terms in a9(n). We note that these types of brick-layer circuits often show up in the tensor network literature on quantum compilation111,112.

Example II.2

Adapt-VQE. In ADAPT-VQE, one dynamically grows the circuit using a predetermined operator pool, so that each gate lowers the cost function by the largest amount61. This class of dynamical circuit ansätze can be understood as a Riemannian gradient flow over a specific subgroup62. This heuristic is popular in quantum chemistry for circuit design, where specific operator pools are considered that are tailored to fermionic Hamiltonians6365. The operator pool can be seen as a set of generators, with a corresponding DLA (see Fig. 4). In the context of our classification, we can thus determine the resulting subgroup of the dynamically grown circuit ansatz based on the generators in the operator pool.

Fig. 4. ADAPT-VQE circuit growing heuristic.

Fig. 4

We consider a generator pool in our classification and dynamically grow the circuit.

Example II.3

Permutation-invariant circuits. Instead of a 1-dimensional topology, one can consider a Hamiltonian with a fully connected topology (see Fig. 5); for example,

H=1ijnXiYj.

This topology is common in ion trap quantum computers66 and also shows up in the context of quantum Boltzmann machines67,68, which are the quantum equivalent of the Sherrington–Kirkpatrick model with tunable parameters69. Closely related are the so-called permutation-equivariant circuits, which consist of parameterized blocks of unitaries that are permutation invariant70. These circuit ansätze were shown to be powerful quantum machine learning models for permutation-invariant data sets. Theorem I.3 provides a classification of DLAs for these types of ansätze.

Fig. 5. Permutation-invariant topology.

Fig. 5

Permuting sites leaves the Hamiltonian invariant.

A hurdle in minimizing a cost function of the form (11) are so-called barren plateaus32, which are flat areas in the cost landscape of a variational quantum algorithm. When barren plateaus are present, the variance of gradients with respect to the gate parameters will decay, on average, exponentially as a function of system size. Hence, obtaining accurate estimates quickly becomes intractable due to the large number of shots required. There is a variety of different setups in which barren plateaus occur30,32,33,7174. To mitigate this problem, several recent works are aimed at finding ways to avoid the regions where optimization is hard7581.

The relevance of our classification for barren plateaus stems from the conjecture of31, which states that the variance of the gradients of gate parameters is inversely proportional to the dimension of the DLA g of the circuit:

Var[kC(θ)]1dimg.

There are some subtleties involved in this conjecture, such as the locality of the cost function and the choice of initial state, which are discussed in refs. 31,82. In the common case where Hcig, an exact formula for the variance was obtained independently in refs. 82,83, which in particular refines and proves the above conjecture. This formula was interpreted in ref. 82 in terms of the g-purity84,85 of the initial state ρ0 and the observable Hc, underscoring again the crucial role of the DLA.

As an illustration, we compare the barren plateau behavior for two of our Lie algebras, a5(n) and a14(n), whose dimensions scale exponentially and polynomially with n, respectively. We consider the cost function (11) with Hc = Z1Z2 and ρ0=00n. The circuit ansatz U(θ) consists of unitaries generated by generators in our classification. To observe the barren plateau effect, we take the derivative of the cost function with respect to the first parameter in the first layer of the circuit, θ1(1).

In Fig. 6, we then observe the expected gradient decay as a function of the system size for an exponentially scaling DLA and a polynomially scaling DLA. In particular, in Fig. 6a we consider the circuit generated by H=i=1n1(XiYi+1+YiZi+1)+XnY1+YnZ1 with periodic boundary conditions, whose DLA a5(n) is isomorphic to so(2n), so(2n2)4 or sp(2n2) depending on n (see Theorem I.2). Since dima5(n)=O(4n), we expect the gradients to decay exponentially. Similarly, in Fig. 6b we consider the circuit generated by a14(n)so(2n), which is described by the Hamiltonian H=i=1n1(XiXi+1+YiYi+1+XiYi+1). Here, we have dima14(n)=O(n2); hence, we expect the decay of gradients to be polynomial with respect to the system size.

Fig. 6. Barren plateaus in variational quantum circuits.

Fig. 6

We calculate the variance of 1000 randomly initialized circuits with θ sampled uniformly in [0, π]. a The Lie algebra a5(n) is isomorphic to so(2n), so(2n2)4 or sp(2n2) depending on n; hence we expect exponentially decaying gradients for all n. This is confirmed in the figure above, since for a linear increase in n, we see an order of magnitude decrease in the gradient variances. b Since a14(n)so(2n), we find polynomially decaying gradients as a function of system size.

According to Corollary I.1, the only circuits free from barren plateaus generated by Hamiltonians in our classification, which are not composed of only 1-qubit gates, have to be composed of so-type, since these are the only polynomially scaling DLAs in our classification.

Modern neural networks used in deep learning tend to have many more parameters than available data points, but are both easy to optimize and generalize well to unseen data in practice86. This phenomenon is known as overparameterization. In variational quantum computing, a similar effect has been observed27,28,87, where deep variational quantum circuits tend to have favorable optimization properties. Recent works that have made progress in theoretically understanding this effect in quantum circuits can be connected to the DLA generated by the circuit ansätze used29,30. In particular, in30, the dimension of the DLA can be used to analyze the Hessian around the global minimum of a typical variational quantum eigensolver cost function52. Additionally, the authors find that the critical number of parameters needed to overparameterize a variational quantum circuit can be directly linked to the dimension of the associated DLA. In29, the authors study the optimization dynamics of overparameterized quantum circuit as perturbations of Riemannian gradient flows88. The size of the DLA (defined as the effective dimension in29) allows one to bound the number of parameters required to reach the overparameterization regime.

Corollary I.1 tells us that for quantum circuits constructed from the Pauli generators of spin chains, there are only DLAs whose dimension scales as O(n), O(n2) and O(4n). Consequently, the linearly and quadratically scaling DLAs are expected to overparameterize with a non-exponential number of parameters. Additionally, the quadratically scaling DLAs in our classification correspond to free fermion models, whose dynamics can be simulated efficiently if ρ0 is an eigenstate of Hc. However, choosing ρ0 to be an arbitrary quantum state will still be intractable to simulate classically.

As discussed in ref. 29, a requirement for overparameterzation is that the initial state has non-vanishing overlap with the ground state. Similarly, in ref. 89, it is shown that choosing the initial state in the right symmetry sector is crucial for the quality of the optimization. We highlight this importance in one of the numerical examples, where we choose an initial state that prevents overparameterization from occurring for an odd number of sites.

In Fig. 7, we illustrate the overparametrization phenomenon for three examples in our classification. In particular, in Fig. 7a, we consider the TFIM on a ring, which is given by the Hamiltonian Hc=i=1n(ZiZi+1+Xi) where Zn+1Z1. The corresponding DLA is given by a8(n)so(2n)2, whose dimension scales quadratically in n. We take the Hamiltonian Variational Ansatz of Hc on even and odd qubits as a circuit ansatz, and take the initial state to be ρ0=++n. We observe that the cost landscape quickly becomes favorable, resulting in almost guaranteed convergence to the lowest energy state.

Fig. 7. Overparameterization of variational quantum circuits.

Fig. 7

We plot the success probability of reaching a state with ∣E0C(θ)∣ < 5 × 10−4 as a function of the circuit depth L, where E0 is the lowest energy of the cost Hamiltonian Hc. These results were obtained by averaging 100 random instances for each L and N. The error bars indicate one standard deviation σ. A single random instance consists of 3000 optimization steps of the Adam optimizer113 with learning rate η = 10−2. A handful of instances converge to solutions that are further than 5σ from the mean and these outliers are therefore not included in the final plot. a The TFIM on a ring has DLA a8(n)so(2n)2, whose dimension scales quadratically. We see that for a moderate circuit depth, the probability of success goes to 1. b Since the DLA a11(n)so(2n), we expect that overparameterization occurs at depths that are exponential in the system size. Although this is not immediately clear in here, we see in (d) that the number of parameters indeed scales exponentially in n. c For the Heisenberg chain, which has an exponentially-scaling DLA a7(n), the choice of initial state ρ0=00n prevents overparameterization from occurring for odd n. d If we set the threshold for overparameterization to be a success probability of 0.99, we can plot the required number of parameters to reach this threshold. We see that a11(n) and a7(n) require an exponentially scaling number of parameters, whereas a8(n) only requires a polynomial number. The dashed line is a guiding line that indicates O(4n) scaling.

In Fig. 7b, we take the DLA a11(n)so(2n), and a Hamiltonian Hcso(2n) given by a random skew-symmetric 2n × 2n real matrix. The circuit consists of unitaries generated by the generators {XY, YX, YZ} of a11 placed on even and odd adjacent qubits, and we take ρ0=00n. It now takes much deeper circuits to reach the same success probabilities as in Fig. 7a, which is due to the exponential scaling of the DLA.

Finally, in Fig. 7c, we consider a7(n), which corresponds to the Heisenberg chain with Hc=i=1n1(XiXi+1+YiYi+1+ZiZi+1). The circuit is again the Hamiltonian Variational Ansatz of Hc, and ρ0=00n. This choice of an initial state only works for an odd number n of qubits, while it fails to produce the overparameterization phenomenon for even n, leading to a success probability of 0 (not plotted). Instead, for even n, the optimization of deep circuits gets stuck in a local minimum. We still observe the exponential scaling of the number of parameters, in accordance with the scaling of the dimension of a7(n), which is O(4n).

In quantum control, one is interested in performing a specific unitary evolution by controlling individual terms in a Hamiltonian acting on a small number of qubits. In order to create any unitary, one requires the system to be controllable, which corresponds to the DLA being equal to su(2n). The conditions for complete controllability are known35, and it is in principle easy to create a controllable system since any real simple Lie algebra can be generated from 2 elements90. If the DLA is a proper subalgebra of su(2n), we say that the system is uncontrollable. Note that this includes simple Lie algebras like so and sp36. Uncontrollable systems can arise when there are conserved quantities or symmetries in the physical system one is trying to control. Note that, due to Proposition I.1, the DLA must split into a direct sum of simple Lie algebras and a center. If this decomposition has the form su(N1)su(Nk) where N1 + ⋯ + Nk = 2n, then we say that the system is subspace controllable45, Sect. 4.3.3.

We can contextualize our classification in terms of these definitions. For example, we know that a12(n) will produce a controllable quantum system for n ≥ 4 since this DLA is equal to su(2n). Similarly, since a1(n)so(n), we know that it is uncontrollable. Finally, there are many examples of uncontrollable systems that consist of direct sums of su blocks and are subspace controllable. For instance, a3(n) for odd n produces a DLA of the form su(2n1)2. In addition to the notion of controllability of spin systems, we can ask what other types of systems we can simulate with our spin chains, e.g., fermionic or bosonic systems. This question was originally explored for Hamiltonians on cubic lattices with translation symmetry91,92. In particular, the dynamics of quadratic fermionic Hamiltonians is described by DLAs of the so(2n) or so(2n+1) type, which show up in our classification as a14(n) and a8(n). Similarly, the dynamics of a bosonic quadratic Hamiltonian with n modes is related to a symplectic DLA38, which we can identify with a5(n) for n ≡ 3 mod 6.

Our classification of Lie algebras arising in spin chains has bearing on other areas of physics and quantum simulation. The most direct connection is that we have established sets of equivalent models, some of which are traditional spin models93,94 studied in physics, while others are new (cf. Table S.II). The integrability24,25,95, dynamical Lie algebra, and symmetry of 1-dimensional spin systems remains an active area of research, and our result provides a database of models where desired properties can be selected or different hypotheses tested.

The various properties of physical systems typically arise from the exact Hamiltonian. As a straightforward example, we can consider the transverse-field Ising model; whether this model is in the paramagnetic or ferromagnetic phase depends on the relative strengths of the nearest neighbor coupling and applied magnetic field. In this work, we have neglected these parameters in the Hamiltonian and solely focused on the presence (or absence) of terms in the Hamiltonian. This coarsening of the problem hides much of the critical detail. However, there is still a remarkable amount of information that can be gleaned from this admittedly coarse view.

One example of this is the observation that Hamiltonians with polynomially-scaling dynamical Lie algebras belong to a special class of integrable models, which can be simulated efficiently with Lie algebra-based algorithms85,96. Additionally, the dynamics of such models can be simulated in less time than the duration of the desired evolution through a process called fast-forwarding97. These algorithms have recently been rediscovered for the purposes of simulating specific classes of quantum circuits34,83. Interestingly, the number of polynomially-scaling algebras in our classification is relatively small (a1,a2,a4,a8,a14,a1,a2,a4,a8,a14), and they are all of the so-type. For example, the TFIM model, which is known to be integrable, arises in our classification as a8(n)so(2n1), which is polynomial in size.

The polynomially scaling algebras in principle come with a “maximal set of independent commuting quantum operators”98, which enables the integration in the first place. Unfortunately, our method does not capture these because the conserved quantities are not single Pauli strings. However, global symmetries are preserved for some of the models; these include Z2 (spin flip), SU(2) (global spin rotation) and U(1) (global phase rotation).

One particular property of note is the presence of non-commuting charges which describe non-Abelian symmetries—that is, elements of the stabilizer of the DLA that do not commute with each other. These are found in a8(n),a9(n) for all n, and in a2(n)a7(n),a10(n) for odd n only (see SM C IV for a list of stabilizers and their centers). We emphasize that the non-commuting charges we find are intensive, as opposed to extensive. The latter consist of a sum of terms that grows with the system size, which can be related to a wide range of quantum effects in thermodynamics (see ref. 99 for a review). Extensive non-commuting charges have been studied in the context of bond algebras to understand thermalization and quantum many body scars14,100,101, hence our classification could potentially be used in this context. Notably, the presence of non-commuting charges complicates questions regarding thermalization. Depending on the context, they either help thermalization (e.g. by increasing entanglement entropy102) or hinder it (e.g. by invalidating the Eigenstate Thermalization Hypothesis103). Perhaps more interestingly within the context of quantum computing, non-commuting charges couple the dynamics between different irreducible representations of the charges, severely limiting the unitaries that can be implemented104. The DLA can also be used in the path integral formulation of quantum mechanics to study many-body systems105.

A final point is the appearance of symplectic Lie algebras, which are not as common as the orthogonal or unitary types. Here they appear from an AIII Cartan decomposition of a larger Lie algebra; in applications, they come up in the preparation of bosonic quantum states92, photonics106 and Clifford circuits/error correction107.

In conclusion, we have provided a classification of the dynamical Lie algebras (DLAs) generated by the Pauli terms of 2-local spin systems on a linear, circular or permutation invariant topology, and have discussed the relevance of this result in a variety of contexts. We have discovered several new examples beyond the standard Ising and Heisenberg models; thus increasing dramatically the number of explicit Hamiltonians available for theoretical investigations. It would be interesting to study in more detail the thermodynamic properties of these new Hamiltonians, and in particular to determine all of their symmetries, including the extensive non-commuting charges. This would require taking the coefficients of the Hamiltonian into account to refine the classification from the general form we consider here to a specific physical system. We hope that our classification can be used to inspire new quantum algorithms and allow researchers to identify the circuits that they use in practice with the Lie algebras in our classification to asses their optimization properties. Moreover, the methods that we have developed can be used to identify the DLA even in cases that fall outside of our classification.

In fact, we have been able to extend the classification presented in this work from 2-local 1-dimensional topologies to arbitrary interaction graphs44. The basis of these new results are the present results on complete graphs, which serve as an upper bound for the DLA of an arbitrary graph. Further extensions to 3-local Hamiltonians may be possible, but the size of the power set (263 − 1) would have to be reduced beforehand to make a full enumeration tractable. Additionally, we would like to investigate how the coefficients of the Hamiltonian affect the DLA, which would require extending our method to the case where the generators are linear combinations of Pauli strings.

Another future direction would be to consider other types of systems. For example, instead of spin systems, we could consider fermionic or bosonic Hamiltonians. Such a classification already exists for nearest-neighbor, quadratic Hamiltonians on cubic lattices92,108, so this question would have to be explored in the context of non-cubic graphs.

Methods

The power sets

We consider all possible interaction sets AP2 not containing II and want to determine the Lie algebras ALie generated by them. The case where A{X,Y,Z}2 contains only proper 2-qubit interactions without I acting on any qubit will be called of a-type. There are 9 Pauli strings in {X, Y, Z}⊗2; hence, we have 29 − 1 = 511 non-empty subsets A of a-type.

The remaining cases, in which some elements of A contain I acting on one qubit, will be called of b and c-types. Note that if aIA for some a ∈ {X, Y, Z}, then the Hamiltonian (2) contains terms ak for k = 1, …, n − 1. Similarly, if IaA for some a ∈ {X, Y, Z}, then (2) contains terms ak for k = 2, …, n. As we want the 1-qubit Pauli operators to act on all sites, we will assume that if our interaction set A contains aI, then it also contains Ia and vice versa. Such sets will be called of b-type, and everything else that is not of a or b-type will be of c-type. Note that in the case of periodic boundary conditions every c-type generating set can be replaced by an equivalent b-type set, while for open boundary conditions c-type differs from b-type only on the first or last site in the chain (see Fig. 8).

Fig. 8. The three types of Lie algebras in the classification.

Fig. 8

The a-type Lie algebras can be generated only by nearest neighbor 2-Pauli interactions. The b-type Lie algebras are generated by nearest neighbor 2-Pauli interactions and 1-Pauli operators acting on every qubit; for c-type Lie algebras the 1-Pauli operators act differently on the boundary.

In total, there are 215 − 1 = 32767 non-empty subsets A of P2\{II}. We proceed by going through all of them and using Algorithm 1 (in the simplified form from Remark I.1) to perform the nested commutators in (1) in order to determine the Lie algebra ALie. This procedure can be performed numerically with ease, and we provide the code to reproduce it at109. We store only the unique (up to equality as sets) subalgebras ALie, and we obtain only 127 and 19 subalgebras of su(4) of a-type and b-type, respectively. For completeness, these are listed explicitly in SM B II, together with 56 subalgebras of c-type.

Example III.1

Consider the generating sets:

A1={XY,XZ},A2={IX,XY}.

Note that as generating sets, A1 is of a-type and A2 is of c-type. After running Algorithm 1, we find:

A1Lie=span{XY,XZ,IX},A2Lie=span{IX,XY,XZ}.

We see that A1 and A2 generate the same Lie algebra; hence, this Lie algebra is counted among the a-type Lie algebras.

Example III.2

The set of b-type

A={XY,XI,IX}

generates the Lie algebra

ALie=span{XY,XZ,XI,IX}.

If we try to generate it from the a-type subset {XY, XZ}, we find the strictly smaller subalgebra

XY,XZLie=span{XY,XZ,IX}.

Hence, ALie is indeed of b-type and not of a-type. This DLA is strictly larger that the DLA from Example III.1 in the case of open boundary conditions. However, for periodic boundary conditions, X will be placed on every site, and the DLA will become equal to the DLA generated by the set A2={IX,XY}.

Example III.3

Consider the generating sets of a-type:

A1={XX,YY},A2={XX,YX}.

After running Algorithm 1, we find:

A1Lie=span{XX,YY},A2Lie=span{XX,YX,ZI}.

Hence, A1 and A2 generate distinct Lie algebras, both of a-type.

Symmetries of the power sets

There are certain symmetries that can be exploited to reduce the number of subalgebras of su(4) in the above power sets. To start, we note that the Pauli matrices satisfy the following algebraic relations:

[σα,σβ]=2iγ=13ϵαβγσγ,

where ϵαβγ is the Levi-Civita tensor and α, β, γ ∈ {1, 2, 3}, respectively (see SM A I for more details). We will ignore the factor 2i, since we only care about the linear span of nested commutators. Note that the above relation is independent of how we assign X, Y, Z to σα. In other words, we can relabel the Paulis and retain the algebraic structure of the subalgebras, which together with ignoring the prefactors formally corresponds to an S3 permutation symmetry.

In addition to relabelling, we consider the exchange of location of the two Pauli terms, since the order of such terms is an arbitrary choice that does not impact the structure of the resulting Lie algebras. This location exchange corresponds to a Z2 symmetry. Hence, the symmetry group of the Pauli algebra for n = 2 is S3×Z2. Subalgebras of su(4) that are in the same orbit of this symmetry group will be considered equivalent, which allows us to reduce the number of subalgebras significantly.

Example III.4

We have that {XX, YZ} ≡ {YY, ZX} are equivalent under relabeling XYZX. On the other hand, {XX, YZ} and {XX, YY} are not equivalent.

In order to determine the orbits of the symmetry group S3×Z2 on the set of subalgebras of su(4) listed in SM B II, we introduce their invariants s, p, e, d, defined as follows. These enumerate the number of single Paulis (such as XI) in the basis of the Lie algebra, the number of single Pauli pairs (such as XI, IX), the number of double equal Paulis (such as XX) and the number of double different Paulis (such as XY), respectively. Since all these quantities are invariant under the action of the symmetry group, two subalgebras are not equivalent if they have different invariants.

Example III.5

Consider the following bases of subalgebras and their invariants:

A1={ZZ,YX,XY}(0,0,1,2),A2={XX,YZ,ZY}(0,0,1,2),A3={YY,ZX,XZ}(0,0,1,2).

We see that A1A2 under Z X. Similarly, A2A3 under X Y and A3A1 under Y Z.

Example III.6

Consider the following bases of subalgebras and their invariants:

A1={XX,XZ,IY}(1,0,1,1),A2={XY,XZ,IX}(1,0,0,2).

We see that A1A2, since they have different invariants.

Example III.7

Even though the two bases

A1={XY,YX}(0,0,0,2),A2={XY,YZ}(0,0,0,2)

have the same invariants, they are not equivalent under the symmetry group S3×Z2.

Carrying out this procedure exhaustively for the 127 and 19 subalgebras of a-type and b-type gives us 23 and 5 inequivalent Lie algebras, respectively. We denote these subalgebras by ak(0k22) and bl(0l4). For the full list of invariants, see Table S.I in the Supplemental Materials. In particular, it turns out that the only case in which the invariants (s, p, e, d) cannot distinguish inequivalent subalgebras is that presented in Example III.7.

By Proposition I.1, we can identify these subalgebras by inspection with direct sums of simple Lie algebras plus a center.

Example III.8

The set

A={XX,YY,ZZ,ZY}

generates the Lie algebra

a20:=ALie=span{XX,YY,ZZ,YZ,ZY,XI,IX}=span{YY+ZZ,YZ+ZY,XI+IX}span{YYZZ,YZZY,XIIX}span{XX}su(2)su(2)u(1).

At this point, we have reduced the number of possible DLAs significantly by taking into account the symmetries of the Pauli group. After that, we grow the DLA from 2 to n sites, as explained in Section “Growing the dynamical Lie algebras”.

Sketch of the proof of Theorem I.1

The complete proof of Theorem I.1 is presented in the Supplemental Materials. Here is a brief sketch of the proof; we refer to SM C I for a more detailed outline. We divide the set of Lie algebras ak(n), bl(n) into three classes: linear, quadratic, and exponential, according to the anticipated growth of their dimension. The linear class consists of a0(n) and bl(n) with l = 0, 1, 3, and their treatment is obvious. The quadratic class contains ak(n) with k = 1, 2, 4, 8, 14. These Lie algebras are determined by using the frustration graphs of their generators in SM C III. For the exponential class, we first observe that b2(n)=a9(n)span{X1} and b4(n)=a15(n)span{X1}. Next, we identify the cases when ak(n)=su(2n); see SM B IV for details. We also find isomorphisms that are obtained by relabeling of the Pauli matrices among some of the algebras (SM C II).

The strategy in the remaining exponential cases is as follows.

  1. For each of our Lie subalgebras s=ak(n)su(2n), we find its stabilizer St(s), which is defined as the set of all Pauli strings Pn that commute with every element of s. This can be done explicitly, because the stabilizer is determined only from the generators of s (see Proposition C.3).

  2. By definition, s commutes with all elements of its stabilizer St(s); hence, it is contained in the centralizer of St(s) in su(2n), which we denote su(2n)St(s). We can reduce the Lie subalgebra su(2n)St(s) further by factoring all elements of the center of St(s), which will become central in it, because we have shown that s has a trivial center (Lemma C.12). This results in a Lie algebra denoted gk(n) when s=ak(n).

  3. By the above construction, we have ak(n)gk(n). In the case of associative algebras, we would get equality due to (a finite-dimensional version of) von Neumann’s Double Commutant Theorem (see e.g.110, Theorem 6.2.5). However, in the Lie case, we might have a strict inclusion. We improve the upper bounds for ak(n) by finding involutions θk of gk(n) such that all elements of ak(n) are fixed under θk. The last condition can be checked only on the generators of ak(n) (see SM C V).

  4. We prove by induction on n that the upper bound is exact, that is ak(n)=gk(n)θk (see SM C VI). First we note that both ak(n) and gk(n)θk are linearly spanned by the Pauli strings contained in them. We start with an arbitrary Pauli string aiPngk(n)θk and want to show that it is in ak(n). The main idea is to use suitable commutators of a with elements of ak(n) to produce a Pauli string biPngk(n)θk with I in one of its positions. Erasing the I in b gives an element of gk(n1)θk, which by induction is in ak(n1).

  5. Finally, we identify the Lie algebras gk(n)θk with those from Theorem I.1 (see SM C VII). This is accomplished by applying in each case a suitable unitary transformation that brings the stabilizer St(s) to a more convenient form (cf. SM A III).

Example: a9(n)

Consider the example of a9=XY,XZLie, which produces the subalgebra a9(n)su(2n) generated by:

X1Y2,X1Z2,X2Y3,X2Z3,,Xn1Yn,Xn1Zn. 12

Let us sketch the above steps in the strategy of the proof of Theorem I.1 in the case s=a9(n).

  1. The stabilizer St(s) is the set of all Pauli strings PPn such that [a, P] = 0 for every as. It is enough to check this for all a in the list of generators (12), which means that the substring of P in positions j, j + 1 commutes with XY and XZ for all 1 ≤ jn − 1. By inspection, we find St(XY, XZ) = {II, XI, YX, ZX}, so these are the only possible such substrings of P. This gives St(s)={In,X1,Y1X2,Z1X2}.

  2. The centralizer su(2n)St(s) is the set of all asu(2n) such that [a, P] = 0 for every PSt(s); hence it contains s. As the center of St(s) is trivial, we have g9(n)=su(2n)St(s). To illustrate this last step, we mention that St(a15(n))={In,X1}. In this case, X1su(2n)X1 is central and we have to quotient by it to obtain g15(n)=su(2n)X1/span{X1}.

  3. We saw above that sg9(n). Now we find an involution θ9 of g9(n) such that sg9(n)θ9, the set of fixed points under θ9. Since θ9 respects the Lie brackets, it is enough to check θ9(a) = a only for the generators (12). Explicitly, we let θ9(a) = −Q9aTQ9 where Q9 = IYZZZ.

  4. We prove by induction on n that a9(n)=g9(n)θ9. To show that any aiPng9(n)θ9 with n ≥ 4 is in a9(n), we first take suitable commutators of a with the generators (12) to produce biPngk(n)θk that has I in some position j ≥ 3. Erasing the I gives an element cg9(n1)θ9, which by induction is in a9(n1). Inserting I back in j-th place in c gives that ba9(n).

  5. As St(s){In,X1,Y1,Z1}, we can simplify g9(n)θ9 by applying a unitary transformation aUaU that takes St(s) to {In, X1, Y1, Z1}. Explicitly, we take U=eiπ4X1X2. Then g9(n)su(2n){X1,Y1,Z1}=Isu(2n1)su(2n1). The involution θ9(a) = −Q9aTQ9 gets transformed to Q~9aTQ~9, where Q~9=UQ9UT in this case happens to be = Q9. Restricted to su(2n1), this gives the involution −QaTQ with Q = YZZZ, whose fixed points are sp(2n2) because QT = −Q.

We conclude that a9(n)sp(2n2).

Supplementary information

Supplemental Material (619.2KB, pdf)

Acknowledgements

We acknowledge helpful discussions with Marco Cerezo, Ray Laflamme, Martín Larocca, Carlos Ortiz Marrero, and Michael Ragone. We are grateful to the referees for carefully reading the manuscript and for their constructive comments and questions. BNB was supported in part by a Simons Foundation grant No. 584741. RW acknowledges the resources provided by the Vector Institute through its company sponsors www.vectorinstitute.ai/#partners and discussions with Juan Carrasquilla, Shayan Majidy, Roger Melko and Schuyler Moss. EK and AFK acknowledge financial support from the National Science Foundation under award No. 1818914: PFCQC: STAQ: Software-Tailored Architecture for Quantum co-design and No. 2325080: PIF: Software-Tailored Architecture for Quantum Co-Design (STAQ II).

Author contributions

The project was conceived by R.W. and B.N.B. Computer calculations and numerical simulations were performed by R.W., with some assistance from A.F.K. Mathematical theorems were derived by B.N.B. with the assistance of E.K. The main part of the manuscript was written mostly by RW, while the Supplemental Materials were written by BNB. The figures were made by R.W., and the tables by A.F.K. and E.K. (except Table S.I by B.N.B.). All authors contributed to reviewing and editing the manuscript.

Code availability

Data generated and analyzed during the current study can be reproduced from the code which is available at ref. 109.

Competing interests

The authors declare no competing interests.

Footnotes

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

The online version contains supplementary material available at 10.1038/s41534-024-00900-2.

References

  • 1.Wigner, E. P. 10.1016/b978-0-12-750550-3.x5001-0Group Theory - And its Application to the Quantum Mechanics of Atomic Spectra (Elsevier, 1959).
  • 2.Dyson, F. J. The threefold way. algebraic structure of symmetry groups and ensembles in quantum mechanics. J. Math. Phys.3, 1199 (1962). [Google Scholar]
  • 3.Edelman, A. & Jeong, S. On the Cartan decomposition for classical random matrix ensembles. J. Mathematical Phys.63, 10.1063/5.0087010 (2022).
  • 4.Altland, A. & Zirnbauer, M. R. Nonstandard symmetry classes in mesoscopic normal-superconducting hybrid structures. Phys. Rev. B55, 1142 (1997). [Google Scholar]
  • 5.Cartan, É. Sur une classe remarquable d’espaces de riemann. Bull. de. la Soci.été math.ématique de. Fr.54, 214 (1926). [Google Scholar]
  • 6.Helgason, S. 10.1090/gsm/034Differential geometry, Lie groups, and symmetric spaces (Academic press, 1979).
  • 7.Schnyder, A. P., Ryu, S., Furusaki, A. & Ludwig, A. W. W. Classification of topological insulators and superconductors in three spatial dimensions. Phys. Rev. B78, 195125 (2008). [Google Scholar]
  • 8.Ryu, S., Schnyder, A. P., Furusaki, A. & Ludwig, A. W. Topological insulators and superconductors: tenfold way and dimensional hierarchy. N. J. Phys.12, 065010 (2010). [Google Scholar]
  • 9.Barkeshli, M., Jian, C.-M. & Qi, X.-L. Classification of topological defects in abelian topological states. Phys. Rev. B88, 241103 (2013). [Google Scholar]
  • 10.Nussinov, Z. & Ortiz, G. Bond algebras and exact solvability of Hamiltonians: Spin Inline graphic multilayer systems. Phys. Rev. B79, 214440 (2009). [Google Scholar]
  • 11.Cobanera, E., Ortiz, G. & Nussinov, Z. Unified approach to quantum and classical dualities. Phys. Rev. Lett.104, 020402 (2010). [DOI] [PubMed] [Google Scholar]
  • 12.Emilio Cobanera, G. O. & Nussinov, Z. The bond-algebraic approach to dualities. Adv. Phys.60, 679 (2011). [Google Scholar]
  • 13.Moudgalya, S. & Motrunich, O. I. Hilbert space fragmentation and commutant algebras. Phys. Rev. X12, 011050 (2022). [Google Scholar]
  • 14.Moudgalya, S. & Motrunich, O. I. From symmetries to commutant algebras in standard Hamiltonians. Ann. Phys.455, 169384 (2023). [Google Scholar]
  • 15.Albertini, F. & D’Alessandro, D. Notions of controllability for quantum mechanical systems, in 10.1109/CDC.2001.981126Proceedings of the 40th IEEE Conference on Decision and Control (Cat. No.01CH37228), Vol. 2 pp. 1589–1594 vol.2 (2001).
  • 16.Albertini, F. & D’Alessandro, D. Subspace controllability of multi-partite spin networks. Syst. Control Lett.151, 104913 (2021). [Google Scholar]
  • 17.Chen, J., Zhou, H., Duan, C. & Peng, X. Preparing greenberger-horne-zeilinger and w states on a long-range ising spin model by global controls. Phys. Rev. A95, 032340 (2017). [Google Scholar]
  • 18.Wang, X., Burgarth, D. & Schirmer, S. Subspace controllability of spin-1 2 chains with symmetries. Phys. Rev. A94, 052319 (2016). [Google Scholar]
  • 19.D’Alessandro, Domenico and Hartwig, Jonas T Dynamical decomposition of bilinear control systems subject to symmetries. J. Dynamical Control Syst.27, 1 (2021). [Google Scholar]
  • 20.Cartan, É. Les groupes réels simples, finis et continus. Ann. Sci. Éc. Norm. Supér.31, 263 (1914). [Google Scholar]
  • 21.Dynkin, E. B. Maximal subgroups of classical groups. Uspekhi Matematicheskikh Nauk7, 226 (1952). [Google Scholar]
  • 22.Tits, J. Sous–algèbres des algèbres de Lie semi–simples (d’après V. Morozov, A. Malcev, E. Dynkin et F. Karpelevitch), in 10.1007/978-3-540-33977-9Séminaire Bourbaki, 2 (Secrétariat mathématique, 1959) pp. 1–18
  • 23.Hastings, M. B. An area law for one-dimensional quantum systems. J. Stat. Mech.: Theory Exp.2007, P08024 (2007). [Google Scholar]
  • 24.Chen, X., Gu, Z.-C. & Wen, X.-G. Classification of gapped symmetric phases in one-dimensional spin systems. Phys. Rev. b83, 035107 (2011). [Google Scholar]
  • 25.De Leeuw, M., Pribytok, A. & Ryan, P. Classifying integrable spin-1/2 chains with nearest neighbour interactions. J. Phys. A: Math. Theor.52, 505201 (2019). [Google Scholar]
  • 26.Jones, N. G. and Linden, N. Integrable spin chains and the Clifford group, J. Math. Phys.63, 10.1063/5.0095870 (2022).
  • 27.Kiani, B. T., Lloyd, S. & Maity, R. Learning unitaries by gradient descent, arXiv preprint arXiv:2001.11897. 10.48550/arXiv.2001.11897 (2020).
  • 28.Wiersema, R. et al. Exploring entanglement and optimization within the Hamiltonian variational ansatz. PRX Quantum1, 020319 (2020). [Google Scholar]
  • 29.You, X., Chakrabarti, S. & Wu, X. A convergence theory for over-parameterized variational quantum eigensolvers, arXiv preprint arXiv:2205.12481. 10.48550/arXiv.2205.12481 (2022).
  • 30.Larocca, M., Ju, N., García-Martín, D., Coles, P. J. & Cerezo, M. Theory of overparametrization in quantum neural networks. Nat. Comput. Sci.3, 542 (2023). [DOI] [PubMed] [Google Scholar]
  • 31.Larocca, M. et al. Diagnosing Barren Plateaus with Tools from Quantum Optimal Control. Quantum6, 824 (2022). [Google Scholar]
  • 32.McClean, J. R., Boixo, S., Smelyanskiy, V. N., Babbush, R. & Neven, H. Barren plateaus in quantum neural network training landscapes. Nat. Commun.9, 4812 (2018). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 33.Cerezo, M., Sone, A., Volkoff, T., Cincio, L. & Coles, P. J. Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nat. Commun.12, 1791 (2021). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 34.Goh, M. L., Larocca, M., Cincio, L., Cerezo, M. & Sauvage, F. Lie-algebraic classical simulations for variational quantum computing, arXiv preprint arXiv:2308.01432. 10.48550/arXiv.2308.01432 (2023).
  • 35.Schirmer, S. G., Fu, H. & Solomon, A. I. Complete controllability of quantum systems. Phys. Rev. A63, 063410 (2001). [Google Scholar]
  • 36.Schirmer, S., Pullen, I. & Solomon, A. Identification of dynamical Lie algebras for finite-level quantum control systems. J. Phys. A: Math. Gen.35, 2327 (2002). [Google Scholar]
  • 37.Wang, X., Pemberton-Ross, P. & Schirmer, S. G. Symmetry and subspace controllability for spin networks with a single-node control. IEEE Trans. Autom. control57, 1945 (2012). [Google Scholar]
  • 38.Zeier, R. & Schulte-Herbrüggen, T. Symmetry principles in quantum systems theory. J. Math. Phys.52, 113510 (2011). [Google Scholar]
  • 39.Kökcü, E. et al. Fixed depth Hamiltonian simulation via Cartan decomposition. Phys. Rev. Lett.129, 070501 (2022). [DOI] [PubMed] [Google Scholar]
  • 40.Kökcü, E. et al. Algebraic compression of quantum circuits for Hamiltonian evolution. Phys. Rev. A105, 032420 (2022). [Google Scholar]
  • 41.Camps, D. et al. An algebraic quantum circuit compression algorithm for Hamiltonian simulation. SIAM J. Matrix Anal. Appl.43, 1084 (2022). [Google Scholar]
  • 42.Kökcü, E. et al. Algebraic compression of free fermionic quantum circuits: Particle creation, arbitrary lattices and controlled evolution, arXiv preprint arXiv:2303.09538 10.48550/arXiv.2303.09538 (2023).
  • 43.Quantum, G. A. et al. Hartree-Fock on a superconducting qubit quantum computer. Science369, 1084 (2020). [DOI] [PubMed] [Google Scholar]
  • 44.Kökcü, E., Wiersema, R., Kemper, A. F. & Bakalov, B. N. Classification of dynamical Lie algebras generated by spin interactions on undirected graphs, arXiv preprint arXiv:2409.19797 10.48550/arXiv.2409.19797 (2024).
  • 45.d’Alessandro, D. 10.1201/9781003051268. Introduction to quantum control and dynamics, 2nd ed. (Chapman and hall/CRC, 2021).
  • 46.Hall, B. C. Lie Groups, Lie Algebras, and Representations: An Elementary Introduction, Vol. 222 (Springer, 2015).
  • 47.Lloyd, S. Universal quantum simulators. Science273, 1073 (1996). [DOI] [PubMed] [Google Scholar]
  • 48.Lloyd, S. Almost any quantum logic gate is universal. Phys. Rev. Lett.75, 346 (1995). [DOI] [PubMed] [Google Scholar]
  • 49.Deutsch, D. E., Barenco, A. & Ekert, A. Universality in quantum computation. Proc. R. Soc. Lond. Ser. A: Math. Phys. Sci.449, 669 (1995). [Google Scholar]
  • 50.Cerezo, M. et al. Variational quantum algorithms. Nat. Rev. Phys.3, 625 (2021). [Google Scholar]
  • 51.Tilly, J. et al. The variational quantum eigensolver: a review of methods and best practices. Phys. Rep.986, 1 (2022). [Google Scholar]
  • 52.Peruzzo, A. et al. A variational eigenvalue solver on a photonic quantum processor. Nat. Commun.5, 4213 (2014). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 53.Kandala, A. et al. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. nature549, 242 (2017). [DOI] [PubMed] [Google Scholar]
  • 54.Farhi, E., Goldstone, J. & Gutmann, S. A quantum approximate optimization algorithm, arXiv preprint arXiv:1411.4028.10.48550/arXiv.1411.4028 (2014).
  • 55.Wecker, D., Hastings, M. B. & Troyer, M. Progress towards practical quantum variational algorithms. Phys. Rev. A92, 042303 (2015). [Google Scholar]
  • 56.Ho, W. W. & Hsieh, T. H. Efficient variational simulation of non-trivial quantum states. SciPost Phys.6, 029 (2019). [Google Scholar]
  • 57.Choquette, A. et al. Quantum-optimal-control-inspired ansatz for variational quantum algorithms. Phys. Rev. Res.3, 023092 (2021). [Google Scholar]
  • 58.Matos, G., Self, C. N., Papić, Z., Meichanetzidis, K. & Dreyer, H. Characterization of variational quantum algorithms using free fermions. Quantum7, 966 (2023). [Google Scholar]
  • 59.Dallaire-Demers, P.-L., Romero, J., Veis, L., Sim, S. & Aspuru-Guzik, A. Low-depth circuit ansatz for preparing correlated fermionic states on a quantum computer. Quantum Sci. Technol.4, 045005 (2019). [Google Scholar]
  • 60.Anand, A. et al. A quantum computing view on unitary coupled cluster theory. Chem. Soc. Rev.51, 1659 (2022). [DOI] [PubMed] [Google Scholar]
  • 61.Grimsley, H. R., Economou, S. E., Barnes, E. & Mayhall, N. J. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nat. Commun.10, 3007 (2019). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 62.Wiersema, R. & Killoran, N. Optimizing quantum circuits with riemannian gradient flow. Phys. Rev. A107, 062421 (2023). [Google Scholar]
  • 63.Van Dyke, J. S., Barron, G. S., Mayhall, N. J., Barnes, E. & Economou, S. E. Scaling adaptive quantum simulation algorithms via operator pool tiling, arXiv preprint arXiv:2206.14215.10.48550/arXiv.2206.14215 (2022).
  • 64.Yordanov, Y. S., Armaos, V., Barnes, C. H. & Arvidsson-Shukur, D. R. Qubit-excitation-based adaptive variational quantum eigensolver. Commun. Phys.4, 228 (2021). [Google Scholar]
  • 65.Tang, H. L. et al. Qubit-adapt-vqe: An adaptive algorithm for constructing hardware-efficient ansätze on a quantum processor. PRX Quantum2, 020310 (2021). [Google Scholar]
  • 66.Wright, K. et al. Benchmarking an 11-qubit quantum computer. Nat. Commun.10, 5464 (2019). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 67.Amin, M. H., Andriyash, E., Rolfe, J., Kulchytskyy, B. & Melko, R. Quantum boltzmann machine. Phys. Rev. X8, 021050 (2018). [Google Scholar]
  • 68.Kappen, H. J. Learning quantum models from quantum or classical data. J. Phys. A: Math. Theor.53, 214001 (2020). [Google Scholar]
  • 69.Sherrington, D. & Kirkpatrick, S. Solvable model of a spin-glass. Phys. Rev. Lett.35, 1792 (1975). [Google Scholar]
  • 70.Schatzki, L., Larocca, M., Sauvage, F. & Cerezo, M. Theoretical guarantees for permutation-equivariant quantum neural networks. npj Quantum Inf.10, 12 (2024). [Google Scholar]
  • 71.Ortiz Marrero, C., Kieferová, M. & Wiebe, N. Entanglement-Induced Barren Plateaus. PRX Quantum2, 040316 (2021). [Google Scholar]
  • 72.Wang, S. et al. Noise-induced barren plateaus in variational quantum algorithms. Nat. Commun.12, 6961 (2021). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 73.Holmes, Z., Sharma, K., Cerezo, M. & Coles, P. J. Connecting Ansatz Expressibility to Gradient Magnitudes and Barren Plateaus. PRX Quantum3, 010313 (2022). [Google Scholar]
  • 74.Dankert, C., Cleve, R., Emerson, J. & Livine, E. Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A80, 012304 (2009). [Google Scholar]
  • 75.Patti, T. L., Najafi, K., Gao, X. & Yelin, S. F. Entanglement devised barren plateau mitigation. Phys. Rev. Res.3, 033090 (2021). [Google Scholar]
  • 76.Volkoff, T. & Coles, P. J. Large gradients via correlation in random parameterized quantum circuits. Quantum Sci. Technol.6, 025008 (2021). [Google Scholar]
  • 77.Grant, E., Wossnig, L., Ostaszewski, M. & Benedetti, M. An initialization strategy for addressing barren plateaus in parametrized quantum circuits. Quantum3, 214 (2019). [Google Scholar]
  • 78.Zhou, L., Wang, S.-T., Choi, S., Pichler, H. & Lukin, M. D. Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices. Phys. Rev. X10, 021067 (2020). [Google Scholar]
  • 79.Skolik, A., McClean, J. R., Mohseni, M., van der Smagt, P. & Leib, M. Layerwise learning for quantum neural networks. Quantum Mach. Intell.3, 5 (2021). [Google Scholar]
  • 80.Pesah, A. et al. Absence of Barren Plateaus in Quantum Convolutional Neural Networks. Phys. Rev. X11, 041011 (2021). [Google Scholar]
  • 81.Wiersema, R., Zhou, C., Carrasquilla, J. F. & Kim, Y. B. Measurement-induced entanglement phase transitions in variational quantum circuits. SciPost Phys.14, 147 (2023). [Google Scholar]
  • 82.Ragone, M. et al. A lie algebraic theory of barren plateaus for deep parameterized quantum circuits. Nat. Commun.15, 7172 (2024). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 83.Fontana, E. et al. Characterizing barren plateaus in quantum ansätze with the adjoint representation. Nat. Commun.15, 7171 (2024). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 84.Somma, R., Ortiz, G., Barnum, H., Knill, E. & Viola, L. Nature and measure of entanglement in quantum phase transitions. Phys. Rev. A70, 042311 (2004). [Google Scholar]
  • 85.Somma, R. D. Quantum computation, complexity, and many-body physics, https://arxiv.org/abs/quant-ph/0512209arXiv preprint quant-ph/0512209 (2005).
  • 86.Allen-Zhu, Z., Li, Y. & Song, Z. A convergence theory for deep learning via over-parameterization, in https://proceedings.mlr.press/v97/allen-zhu19a.htmlProceedings of the 36th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 97, edited by Chaudhuri, K. and Salakhutdinov, R. (PMLR, 2019) pp. 242–252
  • 87.Kim, J., Kim, J. & Rosa, D. Universal effectiveness of high-depth circuits in variational eigenproblems. Phys. Rev. Res.3, 023203 (2021). [Google Scholar]
  • 88.Schulte-Herbrüggen, T., Glaser, S. J., Dirr, G. & Helmke, U. Gradient Flows for Optimization in Quantum Information and Quantum Dynamics: Foundations and Applications. Rev. Math. Phys.22, 597 (2010). [Google Scholar]
  • 89.Mele, A. A., Mbeng, G. B., Santoro, G. E., Collura, M. & Torta, P. Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz. Phys. Rev. A106, L060401 (2022). [Google Scholar]
  • 90.Ionescu, T. On the generators of semisimple Lie algebras. Linear Algebra Its Appl.15, 271 (1976). [Google Scholar]
  • 91.Schuch, N., Cirac, J. I. & Wolf, M. M. Quantum states on harmonic lattices. Commun. Math. Phys.267, 65 (2006). [Google Scholar]
  • 92.Kraus, C. V., Wolf, M. M. & Cirac, J. I. Quantum simulations under translational symmetry. Phys. Rev. A75, 022303 (2007). [Google Scholar]
  • 93.Rios, P. d. M. & Straume, E. 10.1007/978-3-319-08198-4Symbol Correspondences for Spin Systems (Springer, 2014).
  • 94.Parkinson, J. B. & Farnell, D. J. 10.1007/978-3-642-13290-2An introduction to quantum spin systems, Vol. 816 (Springer, 2010).
  • 95.Franchini, F. et al. 10.1007/978-3-319-48487-7An introduction to integrable techniques for one-dimensional quantum systems, Vol. 940 (Springer, 2017).
  • 96.Somma, R., Barnum, H., Ortiz, G. & Knill, E. Efficient solvability of Hamiltonians and limits on the power of some quantum computational models. Phys. Rev. Lett.97, 190501 (2006). [DOI] [PubMed] [Google Scholar]
  • 97.Gu, S., Somma, R. D. & Şahinoğlu, B. Fast-forwarding quantum evolution. Quantum5, 577 (2021). [Google Scholar]
  • 98.Caux, J.-S. & Mossel, J. Remarks on the notion of quantum integrability. J. Stat. Mech.: Theory Exp.2011, P02023 (2011). [Google Scholar]
  • 99.Majidy, S. et al. Noncommuting conserved charges in quantum thermodynamics and beyond. Nat. Rev. Phys.5, 689–698 (2023). [Google Scholar]
  • 100.Buča, B., Tindall, J. & Jaksch, D. Non-stationary coherent quantum many-body dynamics through dissipation. Nat. Commun.10, 1730 (2019). [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 101.Moudgalya, S. & Motrunich, O. I. Exhaustive characterization of quantum many-body scars using commutant algebras, arXiv preprint arXiv:2209.03377 (2022).
  • 102.Majidy, S., Lasek, A., Huse, D. A. & Yunger Halpern, N. Non-abelian symmetry can increase entanglement entropy. Phys. Rev. B107, 045102 (2023). [Google Scholar]
  • 103.Murthy, C., Babakhani, A., Iniguez, F., Srednicki, M. & Yunger Halpern, N. Non-abelian eigenstate thermalization hypothesis. Phys. Rev. Lett.130, 140402 (2023). [DOI] [PubMed] [Google Scholar]
  • 104.Marvian, I. (non-) universality in symmetric quantum circuits: Why abelian symmetries are special, arXiv preprint arXiv:2302.1246610.48550/arXiv.2302.12466 (2023).
  • 105.Galitski, V. Quantum-to-classical correspondence and Hubbard-Stratonovich dynamical systems: A Lie-algebraic approach. Phys. Rev. A84, 012118 (2011). [Google Scholar]
  • 106.Yao, Y., Miatto, F., & Quesada, N. Riemannian optimization of photonic quantum circuits in phase and Fock space. SciPost Physics17, 82 (2024).
  • 107.Rengaswamy, N., Calderbank, R., Pfister, H. D. & Kadhe, S. Synthesis of logical clifford operators via symplectic geometry, in 10.1109/isit.2018.84376522018 IEEE International Symposium on Information Theory (ISIT) (IEEE, 2018) pp. 791–795
  • 108.Zimborás, Z., Zeier, R., Keyl, M. & Schulte-Herbrüggen, T. A dynamic systems approach to fermions and their relation to spins. EPJ Quantum Technol.1, 11 (2014). [Google Scholar]
  • 109.Wiersema, R. Classification of dynamical Lie algebras for translation-invariant 2-local spin systems in one dimension https://github.com/therooler/lie_classification (2023).
  • 110.Procesi, C. 10.1007/978-0-387-28929-8. Lie groups: an approach through invariants and representations, Vol. 115 (Springer, 2007).
  • 111.Lin, S.-H., Dilip, R., Green, A. G., Smith, A. & Pollmann, F. Real- and imaginary-time evolution with compressed quantum circuits. PRX Quantum2, 010342 (2021). [Google Scholar]
  • 112.Mc Keever, C. & Lubasch, M. Classically optimized Hamiltonian simulation. Phys. Rev. Res.5, 023146 (2023). [Google Scholar]
  • 113.Kingma, D. P. & Ba, J. Adam: A method for stochastic optimization, in http://arxiv.org/abs/1412.69803rd International Conference on Learning Representations, ICLR 2015, San Diego, CA, USA, May 7-9, 2015, Conference Track Proceedings, edited by Bengio, Y. & LeCun, Y. (2015).

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Supplementary Materials

Supplemental Material (619.2KB, pdf)

Data Availability Statement

Data generated and analyzed during the current study can be reproduced from the code which is available at ref. 109.


Articles from Npj Quantum Information are provided here courtesy of Nature Publishing Group

RESOURCES