Skip to main content
Entropy logoLink to Entropy
. 2024 Dec 7;26(12):1065. doi: 10.3390/e26121065

Predictive Complexity of Quantum Subsystems

Curtis T Asplund 1,*, Elisa Panciu 2
Editor: Ángel S Sanz
PMCID: PMC11675421  PMID: 39766694

Abstract

We define predictive states and predictive complexity for quantum systems composed of distinct subsystems. This complexity is a generalization of entanglement entropy. It is inspired by the statistical or forecasting complexity of predictive state analysis of stochastic and complex systems theory but is intrinsically quantum. Predictive states of a subsystem are formed by equivalence classes of state vectors in the exterior Hilbert space that effectively predict the same future behavior of that subsystem for some time. As an illustrative example, we present calculations in the dynamics of an isotropic Heisenberg model spin chain and show that, in comparison to the entanglement entropy, the predictive complexity better signifies dynamically important events, such as magnon collisions. It can also serve as a local order parameter that can distinguish long and short range entanglement.

Keywords: entanglement entropy, predictive complexity, Heisenberg model, Lieb–Robinson bound, spin wave, local order parameter

1. Introduction

Quantum systems of many particles are capable of an astonishing variety of complicated behaviors. Characterizing these behaviors in a useful way can be challenging. Building on the foundation of entanglement entropy, and incorporating ideas from complex systems theory, we define new quantities for such systems: predictive states and predictive complexity. We then apply them to a prototypical example, a Heisenberg model spin chain, and find that they provide an improved measure of some dynamical processes and they can serve as promising new tools for analyzing general quantum dynamical systems.

We are primarily guided by two lines of research. On one hand, entanglement entropy of lattice systems and field theories has been a highly successful tool in recent times, from the celebrated area law [1] to many applications in quantum dynamics [2,3]. On the other hand, we have the statistical or forecasting complexity of stochastic and complex systems [4,5,6], which has developed into a sophisticated formalism that has been applied to numerous systems [7,8,9].

We distinguish our definition of predictive complexity from the quantum Hamiltonian complexity [10,11], which classifies systems according to complexity classes, and so does not determine a definite complexity value. It is also distinct from the quantum computational or gate complexity [12,13], which is the basis for most work in high-energy physics and gauge/gravity (AdS/CFT) duality [14,15]. In particular, our construction is information-theoretic and has no dependence on a choice of gates or reference state.

Our definitions can be seen as quantum extensions of predictive state analyses of classical spin systems [16,17,18,19], cellular automata [20], various spatio-temporal dynamical systems [21,22], and of optimal quantum models of stochastic systems [23,24,25,26,27,28]. It is similar in spirit to using the statistical complexity to analyze the distribution of measurement outcomes of a quantum system [29,30,31], but we do not involve measurement distributions of any particular observable.

Several other quantities called “complexity” have been applied to quantum and spin systems [32,33,34,35,36,37]. These are defined differently to the complexity we define here, but relations between these would be interesting to investigate further.

2. Methods and Definitions

2.1. Predictive Equivalence

Consider a quantum system composed of a subsystem A and its complement or exterior B. We have in mind a finite set of interacting particles, spins, or qubits, with A consisting of a subset. Accordingly, we write the finite-dimensional Hilbert space H of this system as

H=HAHB. (1)

For any density operator of such a system, one can form the reduced density operators using partial traces ρA=trBρ and ρB=trAρ. In the case of a pure state, ρ=|ψψ|, the von Neumann entropies are equal and give the entanglement entropy between A and B:

SA=trρAlogρA=trρBlogρB=SB. (2)

From information theory (coding theorems), this entropy may be interpreted as the amount of information needed to describe the state of A, on average, using a suitable encoding of a basis of HA. We may also interpret this as the amount of information about B, relevant to A, that has been lost due to tracing out B. This measures how much A is entangled with B and vice versa.

Grouping or coarse-graining outcomes of a stochastic process generally leads to a reduction in entropy since less precise information is needed to describe the outcomes. Suppose some states in HB were equivalent, in some sense, say, in terms of how they affect the evolution of ρA. Then, we would expect to need less information about what is going on in B to effectively predict the behavior in A. Below, we describe how to implement any such equivalence in terms of how it affects ρA and the entropy. We focus on an equivalence defined by identical evolution of a subsystem for some time, and the consequently reduced entropy is thus a measure of the average minimal information needed to sufficiently predict the state of A, or observables in A, for that time. This is the rough idea for what we call the predictive complexity.

We are following the ideas of causal or predictive state analysis, sometimes also called computational mechanics [4,5,6]. In the context of classical and stochastic dynamical systems, this type of analysis defines an equivalence relation between states that yield equivalent probabilistic predictions for the system.

In our quantum context, let us call two states |ϕ1,|ϕ2HB, equivalent if and only if they lead to the same dynamics in A. More precisely, for a given |ψHA, we can form the states |Ψ1=|ψ|ϕ1,|Ψ2=|ψ|ϕ2H and the corresponding density operators ρ1=|ψ|ϕ1ϕ1|ψ| and ρ2=|ψ|ϕ2ϕ2|ψ|. Let us write ρ1(t) and ρ2(t) for the time-evolved density operators, i.e., if U(t)=Ut=eiHt/ is the time-evolution operator for a time-independent, whole-system Hamiltonian H, ρ1(t)=U(t)ρ1U(t). Then, we can define |ϕ1 and |ϕ2 to be equivalent if and only if

trBρ1(t)=trBρ2(t), (3)

for all |ψHA and for some interval of time, which we call the time horizon th.

Reflexivity, symmetry, and transitivity of the relation follow quickly from Equation (3), so it is an equivalence relation. This also comes from it being defined by the equality of the images of a function on HB.

One can express Equation (3) in terms of relative entropy, or Kullback–Leibler divergence, defined for any two density operators ρ and σ to be S(ρσ)tr(ρlogρρlogσ). Since the relative entropy of two density operators is zero if and only if they are equal, Equation (3) becomes

StrBρ1(t)trBρ2(t)=0. (4)

Equivalently, one could express this by saying the distance between the two density operators is zero for a given interval of time, under any metric on the space of density operators, such as the trace distance. In fact, all one needs to have well-defined equivalence classes is a partition of HB, and this could come from a generalization of Equation (4), where the right-hand side is not strictly zero but just sufficiently close to zero so that it leads to sufficient clustering of states in HB to be partitioned (in a way that respects the linear and inner product structure, as we describe further below). We plan to investigate such generalizations in future work.

The relation clearly depends on the time horizon. In relativistic systems and in a case where A is taken to be a compact spatial region, this would translate into a spatial horizon distance rh=th/c. By relativistic causality, we expect all states of HB that only differ in their configurations at distances from A greater than rh to be equivalent to each other. We have similar expectations for quantum systems obeying a Lieb–Robinson bound since this similarly limits the speed of propagation of information [38]. In that case, though, exponentially small corrections are allowed. This is where small corrections to the right-hand side of Equation (4) could be important. We are interested in the states in HB that can be partitioned into equivalence classes in terms of their effect on the subsystem A. We will explicitly see how this works in the case of the Heisenberg model below.

As we will see, the linear and inner product structure of H combined with the unitary evolution operator naturally gives rise to equivalence classes that can be thought of as parallel affine subspaces, akin to superselection sectors. They may also be interpreted as projective subspaces in projective Hilbert space, which can be a useful perspective since it quotients out un-normalized state vectors and we are ultimately interested in normalized states and density operators. (Projective Hilbert space, or ray space, is the space formed from a Hilbert space by taking the quotient by the relation |ψz|ψ, where z is any non-zero complex number. It can be thought of as the space of physically distinct states in H [39,40,41]).

The predictive equivalence defined by Equation (3) is natural from the point of view of reduced density operators, but to define an equivalence relation with the desired linearity properties on the Hilbert space HB, we need a further requirement on the dynamics of the equivalent states. To see this, let |ϕ1,|ϕ2HB be normalized, orthogonal state vectors satisfying Equation (3). Then, let |ϕ3=a1|ϕ1+a2|ϕ20 with |a1|2+|a2|2=1, i.e., an arbitrary normalized linear combination. We can use a Schmidt decomposition to write the evolution of the states |Ψ1=|ψ|ϕ1,|Ψ2=|ψ|ϕ2 (in the Schrödinger picture of time evolution) as

|Ψ1(t)=Ut|Ψ1=c1ij(t)|ψi|ϕj|Ψ2(t)=Ut|Ψ2=c2ij(t)|ψi|ϕj, (5)

where i and j are summed over bases for HA and HB, respectively. The evolution of |ψ|ϕ3 can then be written

Ut|ψ(a1|ϕ1+a2|ϕ2)=a1c1ij(t)|ψi|ϕj+a2c2ij(t)|ψi|ϕj. (6)

A short calculation shows that to ensure the property in Equation (3) holds for ρ3, we need, for all i and k,

jc1ij(t)c2kj*(t)=0. (7)

This can be understood as requiring that Ut maintain orthogonality between equivalent states in HB, and it can also be rewritten

trB|Ψ1(t)Ψ2(t)|=0. (8)

We have written this as a strict operator equation, but as with our discussion of Equation (3), all we need for our construction to work is for the operator OA:=trB|Ψ1(t)Ψ2(t)| to be sufficiently small, in the sense of whatever metric one is using. For example, with respect to trace distance, Equation (8) would be replaced with a requirement that the trace norm OA1=trOAOA is small compared with the trace distance between any reduced density operators generated by inequivalent states, for times within the time horizon. Below, we argue that this holds for many systems and we numerically verify it for our main example system of a Heisenberg spin chain.

It is straightforward to show that Equation (8) holds when A and B are decoupled since then we may write |Ψi(t)=|ψ(t)|ϕi(t). Thus,

trB|Ψ1(t)Ψ2(t)|=ϕi||ψ(t)|ϕ1(t)ψ(t)|ϕ2(t)||ϕi=ϕ2(t)||ϕiϕi||ϕ1(t)|ψ(t)ψ(t)|=ϕ2(t)|ϕ1(t)|ψ(t)ψ(t)|, (9)

which equals zero since |ϕ1 and |ϕ2 were assumed to be orthogonal, and this is preserved if the dynamics in A and B are decoupled.

To see what this means in terms of the system Hamiltonian H that describes local interactions in a spatially extended system, let us assume that it can be written in the form H=HA+HB+HAB, where all these terms are assumed to be time independent and where HA and HB are defined in terms of operators that only act on HA and HB, respectively. In particular, [HA,HB]=0 and HAB contains all terms that couple the subsystems A and B. In general, [HA,HAB]0 and [HB,HAB]0, but we expect these commutators to be relatively small since they only involve operators on the boundary between A and B. More precisely, in a d-dimensional lattice system with O(Nd) sites, we expect expectation values of HA and of HB to be O(Nd), while those of HAB and its commutators to be O(Nd1).

This is important as we analyze the criteria in Equations (7) and (8). We first note that orthogonality is preserved under the evolution generated by HB alone, i.e.,

ϕ1|ϕ2=ϕ1|eiHBteiHBt|ϕ2=0. (10)

Now, we write the full evolution operator as Ut=exp[i(HA+HB+HAB)t/]. By using the Zassenhaus formula (a relative of the Baker–Campbell–Hausdorff formula) twice, we can write

UteiHBt/eiHAt/eiHABt/× e12[HA,HAB](it/)2e12[HB,HAB](it/)2, (11)

where higher order factors involve nested commutators of HB and HAB, higher powers of it/, and increasingly small coefficients in the exponents, all of which generally tend to suppress their relative importance [42]. The factors leading to any violation of Equation (8) are thus systematically suppressed. This is in addition to the difference in scaling of HA, HB, and HAB already mentioned. An exact analysis of these factors will depend on the system.

For example, in this paper, we look in detail at the the Heisenberg spin chain model with N sites and periodic boundary conditions, which has Hamiltonian

H=Jn=1NSn·Sn+1, (12)

where Sn=(Snx,Sny,Snz) is the spin operator at site n. We take A to be a block of adjacent spins going from site 1 to NA, and in this case,

HAB=J(SN·S1+SNA·SNA+1). (13)

From this, we can see that [HA,HAB] and [HB,HAB] will involve terms of the form

[Sn1·Sn,Sn·Sn+1]=[Sn1iSni,SnjSn+1j]=Sn1iSn+1j[Sni,Snj]=Sn1iSn+1jiϵijkSnk=iϵijkSn1iSn+1jSnk=i(Sn1×Sn+1)·Sn, (14)

where we have used the fact that spin operators at different sites commute. Applying this, we have

[HB,HAB]/i=(SN1×S1)·SN(SNA×SNA+2)·SNA+1, (15)

and

[HA,HAB]/i=(SNA1×SNA+1)·SNA(SN×S2)·S1. (16)

We see from Equations (13), (15) and (16) that HAB and its commutators scale like the boundary of A, which in this one dimensional case, is just fixed to be two lattice points or O(N0) (while HA and HB will generally have O(N) terms). When inserted into the Zassenhaus expansion in Equation (11), these factors may lead to some violation of Equation (8), but this will be suppressed in the limit of a large lattice. This is consistent with the Lieb–Robinson bound, which allows for small corrections [38].

As part of this work, we generated numerical evidence that these corrections do indeed remain small in the system we consider. In particular, we considered a set operators like those appearing in Equation (8), constructed from 14 randomly chosen pairs of equivalent states in HB, and verified that their trace norm remained small, O(103) or less, up until the time horizon. We plot a sample of these data in Figure 1. In comparison, the trace distance between reduced density operators coming from inequivalent states is O(1).

Figure 1.

Figure 1

We show the evolution of the trace norm of operators OA(t)=trB|Ψ1(t)Ψ2(t)| formed from equivalent states, as defined in Equation (8), in the case of the Heisenberg model discussed in detail below. Here, A corresponds to a single spin at site 1 and the uppermost curve comes from a pair of equivalent states with two spin flips at sites (4,5) and (5,6), respectively. That is, right outside the horizon of A, which is defined by rh=2 and th2. This leads to its slightly larger value, compared to the other randomly chosen pairs of equivalent states, which all give smaller trace norms.

2.2. Predictive States

Any equivalence relation on HB can be seen as a map from it to a quotient space HB, which we will call the predictive state space. We will see below that the quotient map is a linear projection map and HB can be considered a Hilbert space itself. Here, we focus on how the quotient map affects the reduced density operator ρA and its entropy, and how to interpret the results information-theoretically.

Let us consider a Hilbert space HB of arbitrary dimension N3. Suppose {|φi} is an orthonormal basis for a linear subspace of equivalent states, of dimension N1. Let N2 be the dimension of the orthogonal complement of the subspace, so that N1+N2=N3. We define a linear projection operator P that maps all difference vectors |φi|φj to zero. This projects the subspace onto the span of the normalized vector |γ=(1/N1)i=1N1|φi and may be written as P=IdN2+|γγ|.

To have a probabilistic interpretation of the states after projection, they must be normalized. In line with the idea of grouping equivalent states, we require that the probability of the predictive state equal the sum of all the probabilities in the equivalence class. A general state |ΨH=HAHB may be written in a Schmidt decomposition as

|Ψ=i=1dimHAj=1N3aij|ψi|ϕj. (17)

The normalization of the equivalent states will have a non-trivial effect on terms of the form a1|ψi|φ1++aN1|ψi|φN1, i.e., terms that include equivalent states. In our prescription, these terms will be mapped to the following in the normalized state |Ψ:

j|aj|2jajjaj|ψi|γ, (18)

where the sums are from 1 to N1. The first factor, involving a square root, is the normalization necessary for a consistent probabilistic interpretation of the coefficients. The second factor is a unit complex number that comes from the projection by P. This normalizing of coefficients makes the overall map, from the normalized states in HB to the normalized states in HB, non-linear.

In the case of additional, distinct subspaces of equivalent states, the discussion above is iterated and more coefficients will be involved. The equivalent subspaces may be directly summed into an increasing sequence and so, in linear algebra terms, form a (partial) flag for HB. This is the same kind of structure that appears when decomposing a Hilbert space into superselection sectors [43]. The relevant projection operator P is then the identity on the subspace of inequivalent states plus a sum over projectors |γiγi| onto rays, one for each distinct subspace of equivalent states. We omit the explicit general expressions since we do not need them for our purposes here.

In the end, we are interested in a normalized state |Ψ in the predictive state space HB, and we have implicitly defined it to be P|Ψ after its coefficients are normalized accordingly (18). We may then define the predictive state density operator ρ=|ΨΨ| and its partial traces ρB=trAρ and ρA=trBρ. Here, trB means a partial trace over the the predictive state space HB. We work out explicit examples of these definitions in Section 2.4. The predictive states are used to define the predictive complexity, which we examine next.

2.3. Predictive Complexity

We define the predictive complexity CA of A to be the von Neumann entropy of the predictive state density operator defined above, ρA=trB|ΨΨ|,

CA=trρAlogρA, (19)

where |Ψ is the state formed by implementing predictive equivalence, as defined by Equation (3), and normalized according to Equation (18). We interpret CA as the entropy of A due to tracing over A’s environment B, modulo predictively equivalent states in B. One could similarly define other measures of predictive complexity from other information measures of ρA, such as the Renyi entropy, negativity, etc.

We conjecture that CASA=trρAlogρA, i.e., that the predictive complexity is bounded above by the standard entanglement entropy, with equality if no states in B are predictively equivalent. This is true in all cases we have examined. Similarly, in practice, one may only know that a certain subspace of states in HB is predictively equivalent for some interval of time. For example, states supported outside of some horizon around A. The true set of equivalencies may be greater, and we expect this would only decrease the resulting complexity. In that case, one computes an upper bound on the predictive complexity.

Many additional questions may be asked about the predictive complexity CA and its properties. We address some of these in the Discussion, but many are the subject of future research, and we turn now to an example calculation of this quantity in a model system.

2.4. Predictive States and Complexity in a Small System

We present a low-dimensional example where we can work out the definitions of predictive state and predictive complexity explicitly. Let us consider HAC2 and HBC3. Let {|1A,|2A} be an orthonormal basis for HA and {|1B,|2B,|3B} be one for HB, and suppose that |1B|2B, i.e., they are found to be equivalent under Equation (3). Form the normalized sum and difference vectors |α:=(1/2)(|1B|2B) and |β:=(1/2)(|1B+|2B). We form the projection operator P=|3B3|B+|ββ| on HB that projects along |α and onto its orthogonal complement, the image of P. Call that image HB, in this case, a two (complex)-dimensional subspace, spanned by |3B and |β.

Let us look first at a general state in the 12 subspace of HB, where we have P(a1|1B+a2|2B)=12(a1+a2)(|1B+|2B)=12(a1+a2)|β. If we normalized this state, we would end up with

a1+a2|a1+a2||β. (20)

We note that if a1+a2=0, the state is mapped to the zero vector and so lies in the kernel of P. Such states are effectively excluded from the final state space and are concomitant of having state vectors that are physically equivalent in some sense. The same phenomenon occurs in quantization of gauge theories, as in the BRST formalism, and we plan to elaborate on this connection in future work.

Next, take a general normalized state in H, given by

|ψ=a1|11+a2|12+a3|13+a4|21+a5|22+a6|23, (21)

where |ij=|iA|jB. Under P, this state is mapped to the unnormalized state

P|ψ=12(a1+a2)|1A|β+a3|1A|3B+12(a4+a5)|2A|β+a6|2A|3B. (22)

To normalize this state, we focus on the terms that have been affected by the projection. For example, the contribution of the first two terms in Equation (21) to the norm of |ψ was |a1|2+|a2|2. For a consistent probabilistic interpretation of the coefficients, we need that to be the contribution of the first term in the projected state. Thus, we define the normalized state

|ψ=|a1|2+|a2|2a1+a2|a1+a2||1A|β+a3|1A|3B+|a4|2+|a5|2a4+a5|a4+a5||2A|β+a6|2A|3B. (23)

We are interested in how this affects the reduced density operator ρA=trB|ψψ|, whose matrix elements are defined by ρA=ijρAij|iAj|A. Represented as a matrix in the given basis, the original reduced density operator is

ρA=|a1|2+|a2|2+|a3|2a1a4*+a2a5*+a3a6*a1*a4+a2*a5+a3*a6|a4|2+|a5|2+|a6|2. (24)

Under the action of the equivalence relation, we have a modified reduced density operator

ρA=trB|ψψ|=β|ψψ|β+3|ψψ|3. (25)

Represented as a matrix, the diagonal elements (and thus the trace) are unchanged, but the upper off-diagonal element is now

ρA12=a3a6*+(|a1|2+|a2|2)(|a4|2+|a5|2)(a1+a2)(a4*+a5*)|a1+a2||a4+a5|. (26)

The other off-diagonal element is the complex conjugate since ρA is Hermitian. The modification of the off-diagonals affects the eigenvalues and hence the von Neumann entropy of ρA, which we identify as the predictive complexity CA. The explicit expression for CA in terms of the ai is long and not illuminating, so we omit it.

To give a concrete example of how the predictive complexity will differ from the entanglement entropy, suppose that we have a state that is a Bell state involving entanglement between subsystem A and the states |1B and |2B:

|ψ=12(|11+|22). (27)

This corresponds to a1=a5=1/2 with the rest of the ai equal to zero. The reduced density operator, Equation (24), is diagonal, and the entanglement entropy is clearly SA=log2. Under the equivalence relation, |1B and |2B are in the same predictive state, and according to Equation (26), the reduced density operator ρA picks up off-diagonal elements equal to a1a5*=1/2. This changes the eigenvalues to be 1 and 0, and so we obtain CA=0. This is consistent with the idea that in the case |1B|2B, the state |ψ=(1/2)(|1A|β+|2|β) factorizes and the entanglement disappears.

We have worked this out in a low-dimensional case, but the extension to an arbitrary finite-dimensional Hilbert space is relatively straightforward. In particular, in the following section, we will apply it to the N=32 site Heisenberg model.

3. Results: Predictive Complexity of the Heisenberg Model

3.1. The Heisenberg Model

It is interesting to apply these concepts to a quantum system with highly non-trivial spacetime dynamics, but that is nonetheless exactly solvable. We consider a standard spin chain from condensed matter theory, the 1D isotropic (XXX) Heisenberg model on N=32 sites, with ferromagnetic, nearest neighbor interactions and periodic boundary conditions. The Hamiltonian was given above in Equation (12). The value of J does not affect our analysis, so we set J=1 (equivalently, we choose time t to be in units of /J). Analyzing the Hilbert space of this model is greatly facilitated by the Bethe ansatz for the energy eigenstates, and we will largely follow the very helpful review article [44]. Within the two-magnon sector, we have calculated the complete time-dependent wavefunction and so can compute the entanglement entropies and predictive complexities exactly. This could also be accomplished by direct diagonalization, but we found the Bethe ansatz helpful for distinguishing contributions from scattering states and bound states.

The full Hilbert space has the dimension 232 and has an orthogonal basis of position states |σ1σN and a position basis, with σn= or ↓ representing spin up or down, respectively, in the z direction at site n. These position states are generally not eigenstates of the Hamiltonian, and hence evolve non-trivially with time. We will restrict our attention to the two-magnon sector, a subspace of dimension 322=496, with an orthonormal positional basis consisting of states of the form

|n1,n2=|,n1n2 (28)

where 1n1<n232.

3.2. Single Site Entropy and Complexity

The entanglement entropy of subsystems of various Heisenberg models and spin chains in various states has been studied by many authors, e.g., [45,46,47], and for a review, see [48]. Here, we compare the entropy to the complexity for a subsystem A consisting of a single spin, in a two-magnon state with an initial condition consisting of a largely ferromagnetic state but with two spins flipped. These states evolve in time and generate entanglement that spreads to all sites, as shown in the plot of the single site entanglement entropy in Figure 2a.

The predictive complexity for a given site j may be defined for any choice of horizon radius, rh. That is, the exterior region B is defined to be all sites except site j, and we apply an equivalence relation on states in B that only differ outside the horizon. This equivalence is straightforward to implement in the position basis. Effectively, we focus on the local environment of spin j, sites from jrh to j+rh (modulo periodic boundary conditions). This is all that you need to predict the future of that spin for some duration of time due to the Lieb–Robinson bound on the speed of propagation in this system [38,49,50]. This bound is associated with light-cone-like dynamics, which can be seen in Figure 2b.

In more detail, we consider the case where A consists of a single spin at some arbitrary site j and the initial condition consists of two spins flipped. States whose only excitations (spin flips) are outside the horizon of A are taken to be equivalent. The horizon is determined by the horizon radius rh, which is a free (discrete) parameter. Because the dynamics of the Heisenberg model are local and obey a Lieb–Robinson bound, the horizon distance is proportional to the predictive (time) horizon (we do not need the value of the Lieb–Robinson velocity for our purposes here, but calculating such values is an active area of research [50,51]).

Figure 2.

Figure 2

Spacetime plots of the Heisenberg spin chain after two initial spin flips at sites 10 and 25. (a) shows the single-site entanglement entropy, while (b) shows the single-site predictive complexity, with a horizon radius of two sites. The color scale indicates the value in bits (color map choice informed by [52]). Note the magnon beams and collisions appear with greater contrast in the complexity plot. We quantify this below. Calculations are performed with a time step of dt=0.2.

The Bethe ansatz basis for the two-magnon sector is composed of states of the form

|k1,k2=n1<n2ak1k2(n1,n2)|n1,n2 (29)
=Ak1k2n1<n2(ei(k1n1+k2n2+12θ)+ei(k1n2+k2n112θ))|n1,n2, (30)

where Ak1k2 is a constant ensuring normalization:

k1,k2k1,k2=n1<n2|ak1k2(n1,n2)|2=1. (31)

Here, k1 and k2 are lattice momenta and are related to the energy E by

Ek1k2E0=J(2cosk1cosk2), (32)

where E0 is the energy of the state with no spin flips. The (scattering) phase θ is related to the momenta by 2cot(θ/2)=cot(k1/2)cot(k2/2). Translation invariance of the wave function imposes further conditions. With care and some numerical effort, a complete set of solutions may be calculated; see, e.g., [44]. The spectrum includes a large class of states that may be interpreted as two-magnon scattering states, as well as bound states with complex momenta.

As mentioned above, because of the locality of Hamiltonian, Equation (12), and the Lieb–Robinson bound, if you want to predict the evolution of some segment of the spin chain for some amount of time, you only need information about the state of the system within a horizon region around A. Let us take A to be the spin σj at some arbitrary site j. For definiteness, take the horizon radius rh=2. We can depict these various regions on the spin chain as:

σj3outsideσj2σj1σjAσj+1σj+2insideσj+3outside. (33)

Recall that B is defined to be the complement of A, i.e., all sites except j.

We are restricting to the two-magnon sector, so for a given value of j, all states |n1,n2 in HB can be put into three types:

  • (I)

    n1 and n2 are outside the horizon.

  • (II)

    Either n1 or n2 is inside the horizon but not both.

  • (III)

    Both n1 and n2 are inside the horizon.

These criteria can be phrased numerically, e.g., n1 is inside the horizon if |jn1modN|rh, etc. All states of type I are equivalent to each other. Thus, there are NI=N(2rh+1)2=272=351 states in this equivalence class in this case. States in class II will be equivalent according to whether their inside spin flip is the same. So, there are 2rh=4 equivalence classes, with NII=N(2rh+1)=27 states in each class. Finally, each of the 2rh2=6 states of type III are inequivalent to any other state.

As described above, we can associate these equivalence relations with a map from the original Hilbert space to the space of (normalized) predictive states; see Equation (18). In this case, we are interested in applying this equivalence relation (and ultimately calculating density operators and entanglement entropies) to dynamical, excited states, |Ψ(t). In this work, we focus on states whose initial conditions are two individual spin flips. That is, states of the form:

|Ψ(t)=eiHt|n1,n2. (34)

The evolution of these two-magnon states can be expanded in terms of the Bethe ansatz states, which form a complete basis of Hamiltonian eigenstates within the two-magnon sector:

|Ψ(t)=k1,k2eiEk1k2t|k1,k2k1,k2|n1,n2=k1,k2eiEk1k2tak1,k2*(n1,n2)|k1,k2 (35)

where the energies Ek1k2 are given by Equation (32). It will be useful to expand the energy eigenstates |k1,k2 in the position basis:

|Ψ(t)=k1,k2[eiEk1k2tak1,k2*(n1,n2)×n1<n2ak1,k2(n1,n2)|n1,n2], (36)

and to define the time-dependent matrix elements

b(n1,n2,t)=n1,n2|Ψ(t)=k1,k2[eiEk1k2tak1,k2*(n1,n2)×n1<n2ak1,k2(n1,n2)], (37)

To map the state in Equation (36) to its corresponding predictive state, apply the classification into types I, II, and III, above, to the sum over n1<n2, then apply the formula in Equation (18). The result can be summarized as

|Ψ(t)=k1,k2[eiEk1k2tak1,k2*(n1,n2)×((n1,n2out|ak1,k2(n1,n2)|2)1/2eiθI|γI+n1in(n2out|ak1,k2(n1,n2)|2)1/2eiθn1|γn1+n1,n2inak1,k2(n1,n2)|n1,n2)]. (38)

Here, the gamma states are those used to define the linear projection, specifically |γI=(1/NI)n1,n2out|n1,n2 and |γn1=(1/NII)n2out|n1,n2. The phase factors are normalized sums of the amplitudes, e.g.,

eiθI=n1,n2outak1,k2(n1,n2)n1,n2outak1,k2(n1,n2) (39)

The last three lines of (38) correspond to the classes I, II, and III, respectively.

To compute entropies, one needs the matrix elements of the density operator and reduced density operator. These are determined fairly straightforwardly from the coefficients in (38). For example, in the main part of the paper, we examined the single site entanglement entropy and predictive complexity, where the subsystem A consisted of a single spin, and we set the horizon radius rh=2. The usual reduced density operator is then formed by tracing over the Hilbert spaces for all the sites except A. Similarly, the predictive complexity is computed from the modified reduced density operator ρA, which is obtained by tracing over the predictive state space in the complement, HB. It works out that the diagonal elements of ρA and ρA are the same (as in the 5D Hilbert space example considered above), so let us turn to the off-diagonal elements.

We note, first, that the off-diagonal elements of the unmodified ρA are zero, essentially because we are working within the two-magnon sector, which is preserved by time evolution. To see this, note that

j|ρA|j=j|TrB(|ΨΨ|)|j, (40)

and recall that |Ψ is the time evolution of the two-magnon state |n1,n2 (see Equation (34)). For the off-diagonal element in Equation (40) to be non-zero, one would need a term in BϕB|Ψ (where the sum is over all |ϕBHB) that simultaneously had a non-zero matrix element with j and with j. Such a term would need to come from a state |ϕB that is simultaneously in the one- and two-magnon sector of HB, which does not exist.

However, for ρA, it is possible for the off-diagonal elements to be non-zero because one- and two-magnon states can be lumped together in the same equivalence class. This allows the argument given above to be evaded. Indeed, for this particular calculation, this is the reason that the predictive complexity is different from the standard entanglement entropy at all. The off-diagonal elements can be worked out along the lines of Equation (26). Applying this, we can calculate the off-diagonal elements in terms of the wave function elements defined in Equation (37):

j|ρA|j=((n1,n2out|b(n1,n2,t)|2)×(n2out|b(j,n2,t)|2))1/2×n1,n2outb(n1,n2,t)|n1,n2outb(n1,n2,t)|×n2outb(j,n2,t)|n2outb(j,n2,t)|. (41)

These non-zero off-diagonal elements affect the eigenvalues of ρA and, thus, also affect its von Neumann entropy. We identify the latter as the predictive complexity of the subsytem A. We present numerical calculations and analysis of this quantity for the 32-site Heisenberg model, which we obtained using the above formulas, implemented in Mathematica ver. 13.1 (code available upon reasonable request). We note that the phase factors in lines three and four of Equation (41) do not affect the eigenvalues of the two-by-two density matrix ρA, so they do not need to be calculated to just obtain the predictive complexity. This significantly speeds up the calculation.

The single-site entanglement entropies and predictive complexities are shown in spacetime diagrams in Figure 2. We can see that the complexity appears to be more localized on the magnon beams and magnon collisions, while the entanglement entropy appears to show greater fluctuations throughout the spin chain. In particular, we can verify that the predictive complexity gives greater relative contrast to magnon collisions, in the sense that the local maxima associated with the collisions have a greater relative strength (compared to equilibrium) than appears with the entanglement entropy. This can be see in Figure 3, which plots the values for site 17 (midway between the initial spin flips), where the first magnon collision occurs at t9.0 (in units of /J). Quantitatively, the ratio of the first peak in the entanglement entropy to the equilibrium value is SA(t=9.0)/SA2.08. The corresponding ratio for the complexity, taking a horizon radius of one site (rh=1), is CA(t=9.0)/CA4.13 or an increase of relative significance by a factor of almost two. Subsequent collisions are similar, though the increase is by a smaller factor.

Figure 3.

Figure 3

We show the evolution of the single-site entanglement entropy and predictive complexity for site 17, which sits in the middle of the two initial excited sites 10 and 25. The dashed horizontal lines indicate the equilibrium values. We note that the large local maxima in the three curves correspond to magnon collisions, and these peaks are more significant (relative to equilibrium) for the complexities than they are for the entanglement entropy. Calculations were performed using a time step of dt=0.2.

The increased significance of the peaks, which we are interpreting as magnon collisions, can be understood from the fact that the single-site entanglement entropy is subject to contributions from entanglement between that single site and all other sites in the spin chain. The predictive complexity, on the other hand, discriminates between local and long-range entanglement. Since collisions are an inherently local phenomenon, it makes sense that the complexity would pick this up. The same reasoning can explain why fluctuations of the complexity are suppressed, compared with the entropy, as one can see in Figure 3. The standard deviation of SA(t) is approximately twice that of CA(t) (with rh=1) at late times, after the system has thermalized. These same effects are present, to a lesser extent, for larger values of the horizon radius.

4. Discussion

We have presented a generalization of the reduced density operator, based on the equivalence classes that we called predictive states, and defined its entropy to be the predictive complexity. When applied to the dynamics of the Heisenberg model, this complexity highlighted dynamically significant events like magnon propagation and, especially, collisions, with an improved effective signal-to-noise ratio. This indicates that it may be an improved local order parameter for some processes, and may have applications in magnon transport [53] or quantum magnonics [54], and even more directly in recent experimental realizations of Heisenberg models [55,56].

The results presented here offer a proof of concept and should be straightforward, in principle, to generalize to other spin chains. We acknowledge that more elaborate and realistic examples would be desirable, including systems in higher dimensions, with infinite dimensional Hilbert spaces, and those described by quantum field theories. While a thorough analysis is a subject for future work, we make some initial comments here. A promising first example to consider could be the harmonic systems studied in [57,58]. Like a spin chain, such systems of locally coupled oscillators should have space and time horizons and non-trivial predictive equivalencies.

We also look forward to defining predictive complexity for quantum field theories, though this will involve some new subtleties. We aim to make contact with many powerful results, such as for entanglement entropy, Rényi entropy, and entanglement negativity in conformal field theories, particularly in dynamical situations [59]. In particular, the entanglement of two or more disjoint intervals with an environment has been extensively studied [60,61], and the notion of predictive complexity should be extendable to such cases since one can define horizons and causal diamonds for disjoint sets. One of the central tools in this domain are twist operators, which allow one to calculate powers of reduced density operators and various kinds of partial traces with relative ease. These should still be important for a calculation of predictive states and complexity in conformal field theory since they still involve partial traces outside of a given subsystem. Predictive states, though, also require the imposition of an equivalence relation outside a horizon. BRST symmetries and operators may be helpful in formulating this equivalence in field theories [62]. Predictive states may perhaps also be formulated as special kinds of boundary states in boundary conformal field theory [63]. We also note recent studies of symmetry-resolved entanglement entropy [64] and other generalized entanglement entropies [65], which would be interesting to incorporate with the concept of predictive equivalence.

We emphasize that while we have paid special attention to the scalar quantity of predictive complexity, predictive states contain far more information than this single quantity (a point also made, in a non-quantum context, in [22]). We have offered a systematic way to construct a local effective theory, in the sense of a massively reduced effective Hilbert space, HB, for the environment of a given subsystem A, that is nonetheless sufficient for arbitrarily good predictions up to a given time horizon. In this regard, it is similar in spirit to density matrix renormalization [66], density matrix embedding [67,68], and quantum flow [69]. These methods differ from ours in that they integrally involve variational or optimization problems, and they do not involve predictive equivalence or information theoretic quantities in the same way. In any case though, it would be illuminating to identify the conceptual and computational connections between these approaches and ours.

We emphasize one way in which the predictive complexity clearly contains information distinct from the Rényi entropy, entanglement entropy, or any other quantity that does not include a horizon scale. Namely, a horizon means the predictive complexity CA is inherently sensitive to short-range entanglement. Furthermore, since we expect CASA, the quantity SACA may be a useful new measure of long-range entanglement. Relatedly, since CA depends on at least two length scales, the length scale of A and the horizon radius rh, we expect it to obey a variation of the usual area law for the entanglement entropy. Like the two-interval entanglement entropy (or mutual information) in conformal field theory [60], it may be sensitive to non-universal information about the spectrum of states in the theory. This and other properties of predictive states and complexity are subjects for future work.

Acknowledgments

C.A. thanks Kassahun Betre for helpful discussions and feedback at various stages of the project, and Hilary Hurst, Ehsan Khatami, Eduardo Ibarra Garcia Padilla, and Nicholas Parrilla for discussions and/or comments on drafts. We thank Sandra Chilson and Ileane Ho for their work on early ideas related to this project. We acknowledge the support of the Hackman Scholarship program of Franklin & Marshall College, which supported E.P. during the summer when the initial ideas for this work were formulated.

Author Contributions

Conceptualization and methodology, C.T.A. and E.P.; validation, formal analysis, investigation, data curation, visualization, and writing—original draft preparation, C.T.A.; writing—review and editing, C.T.A. and E.P.; project administration and funding acquisition, C.T.A. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the corresponding author upon reasonable request.

Conflicts of Interest

The authors declare no conflicts of interest. The funders had no role in the design of the study; in the collection, analyses, or interpretation of data; in the writing of the manuscript; or in the decision to publish the results.

Funding Statement

This research is supported by the U.S. Department of Energy, Office of Science, Office of High Energy Physics RENEW-HEP program under Award Number DE-SC0024518.

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

References

  • 1.Eisert J., Cramer M., Plenio M.B. Colloquium: Area laws for the entanglement entropy. Rev. Mod. Phys. 2010;82:277–306. doi: 10.1103/RevModPhys.82.277. [DOI] [Google Scholar]
  • 2.DeChiara G., Montangero S., Calabrese P., Fazio R. Entanglement entropy dynamics of Heisenberg chains. J. Stat. Mech. Theory Exp. 2006;2006:03001. doi: 10.1088/1742-5468/2006/03/P03001. [DOI] [Google Scholar]
  • 3.Essler F.H.L., Fagotti M. Quench dynamics and relaxation in isolated integrable quantum spin chains. J. Stat. Mech. Theory Exp. 2016;6:064002. doi: 10.1088/1742-5468/2016/06/064002. [DOI] [Google Scholar]
  • 4.Grassberger P. Toward a Quantitative Theory of Self-Generated Complexity. Int. J. Theor. Phys. 1986;25:907–938. doi: 10.1007/BF00668821. [DOI] [Google Scholar]
  • 5.Crutchfield J.P., Young K. Inferring statistical complexity. Phys. Rev. Lett. 1989;63:105–108. doi: 10.1103/PhysRevLett.63.105. [DOI] [PubMed] [Google Scholar]
  • 6.Shalizi C.R., Crutchfield J.P. Computational Mechanics: Pattern and Prediction, Structure and Simplicity. J. Stat. Phys. 2001;104:817–879. doi: 10.1023/A:1010388907793. [DOI] [Google Scholar]
  • 7.Brodu N., Crutchfield J.P. Discovering causal structure with reproducing-kernel Hilbert space epsilon-machines. Chaos. 2022;32:023103. doi: 10.1063/5.0062829. [DOI] [PubMed] [Google Scholar]
  • 8.Jurgens A.M., Crutchfield J.P. Divergent predictive states: The statistical complexity dimension of stationary, ergodic hidden Markov processes. Chaos. 2021;31:083114. doi: 10.1063/5.0050460. [DOI] [PubMed] [Google Scholar]
  • 9.Crutchfield J.P. Between order and chaos. Nat. Phys. 2012;8:17–24. doi: 10.1038/nphys2190. [DOI] [Google Scholar]
  • 10.Osborne T.J. Hamiltonian complexity. Rep. Prog. Phys. 2012;75:022001. doi: 10.1088/0034-4885/75/2/022001. [DOI] [PubMed] [Google Scholar]
  • 11.Gharibian S., Huang Y., Landau Z., Shin S.W. Quantum Hamiltonian Complexity. Found. Trends Theor. Comput. Sci. 2015;10:159–282. doi: 10.1561/0400000066. [DOI] [Google Scholar]
  • 12.Aharonov D., Gottesman D., Irani S., Kempe J. The Power of Quantum Systems on a Line. Commun. Math. Phys. 2009;287:41–65. doi: 10.1007/s00220-008-0710-3. [DOI] [Google Scholar]
  • 13.Bausch J., Cubitt T., Ozols M. The Complexity of Translationally Invariant Spin Chains with Low Local Dimension. Ann. Henri Poincaré. 2017;18:3449–3513. doi: 10.1007/s00023-017-0609-7. [DOI] [Google Scholar]
  • 14.Chapman S., Policastro G. Quantum computational complexity from quantum information to black holes and back. Eur. Phys. J. C. 2022;82:128. doi: 10.1140/epjc/s10052-022-10037-1. [DOI] [Google Scholar]
  • 15.Caceres E., Chapman S., Couch J.D., Hernandez J.P., Myers R.C., Ruan S.M. Complexity of Mixed States in QFT and Holography. J. High Energy Phys. 2020;03:012. doi: 10.1007/JHEP03(2020)012. [DOI] [Google Scholar]
  • 16.Crutchfield J.P., Feldman D.P. Statistical complexity of simple one-dimensional spin systems. Phys. Rev. E. 1997;55:R1239–R1242. doi: 10.1103/PhysRevE.55.R1239. [DOI] [Google Scholar]
  • 17.Feldman D.P., Crutchfield J.P. Structural information in two-dimensional patterns: Entropy convergence and excess entropy. Phys. Rev. E. 2003;67:051104. doi: 10.1103/PhysRevE.67.051104. [DOI] [PubMed] [Google Scholar]
  • 18.Vijayaraghavan V.S., James R.G., Crutchfield J.P. Anatomy of a Spin: The Information-Theoretic Structure of Classical Spin Systems. Entropy. 2017;19:214. doi: 10.3390/e19050214. [DOI] [Google Scholar]
  • 19.Feldman D.P., Crutchfield J.P. Discovering Noncritical Organization: Statistical Mechanical, Information Theoretic, and Computational Views of Patterns in One-Dimensional Spin Systems. Entropy. 2022;24:1282. doi: 10.3390/e24091282. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 20.Shalizi C.R., Shalizi K.L., Haslinger R. Quantifying Self-Organization with Optimal Predictors. Phys. Rev. Lett. 2004;93:118701. doi: 10.1103/PhysRevLett.93.118701. [DOI] [PubMed] [Google Scholar]
  • 21.Goerg G.M., Rohilla Shalizi C. Mixed LICORS: A Nonparametric Algorithm for Predictive State Reconstruction. arXiv. 2012stat.ME/1211.3760 [PMC free article] [PubMed] [Google Scholar]
  • 22.Rupe A., Kumar N., Epifanov V., Kashinath K., Pavlyk O., Schlimbach F., Patwary M., Maidanov S., Lee V., Prabhat M., et al. DisCo: Physics-based unsupervised discovery of coherent structures in spatiotemporal systems; Proceedings of the 2019 IEEE/ACM Workshop on Machine Learning in High Performance Computing Environments (MLHPC); Denver, CO, USA. 18 November 2019; pp. 75–87. [Google Scholar]
  • 23.Gu M., Wiesner K., Rieper E., Vedral V. Quantum mechanics can reduce the complexity of classical models. Nat. Commun. 2012;3:762. doi: 10.1038/ncomms1761. [DOI] [PubMed] [Google Scholar]
  • 24.Binder F.C., Thompson J., Gu M. Practical Unitary Simulator for Non-Markovian Complex Processes. Phys. Rev. Lett. 2018;120:240502. doi: 10.1103/PhysRevLett.120.240502. [DOI] [PubMed] [Google Scholar]
  • 25.Aghamohammadi C., Loomis S.P., Mahoney J.R., Crutchfield J.P. Extreme Quantum Memory Advantage for Rare-Event Sampling. Phys. Rev. X. 2018;8:011025. doi: 10.1103/PhysRevX.8.011025. [DOI] [Google Scholar]
  • 26.Loomis S.P., Crutchfield J.P. Thermal Efficiency of Quantum Memory Compression. Phys. Rev. Lett. 2020;125:020601. doi: 10.1103/PhysRevLett.125.020601. [DOI] [PubMed] [Google Scholar]
  • 27.Elliott T.J., Yang C., Binder F.C., Garner A.J.P., Thompson J., Gu M. Extreme Dimensionality Reduction with Quantum Modeling. Phys. Rev. Lett. 2020;125:260501. doi: 10.1103/PhysRevLett.125.260501. [DOI] [PubMed] [Google Scholar]
  • 28.Liu Q., Elliott T.J., Binder F.C., Di Franco C., Gu M. Optimal stochastic modeling with unitary quantum dynamics. Phys. Rev. A. 2019;99:062110. doi: 10.1103/PhysRevA.99.062110. [DOI] [Google Scholar]
  • 29.Suen W.Y., Elliott T.J., Thompson J., Garner A.J.P., Mahoney J.R., Vedral V., Gu M. Surveying Structural Complexity in Quantum Many-Body Systems. J. Stat. Phys. 2022;187:4. doi: 10.1007/s10955-022-02895-6. [DOI] [Google Scholar]
  • 30.Venegas-Li A., Crutchfield J.P. Optimality and Complexity in Measured Quantum-State Stochastic Processes. J. Stat. Phys. 2023;190:106. doi: 10.1007/s10955-023-03112-8. [DOI] [Google Scholar]
  • 31.Gier D., Crutchfield J.P. Intrinsic and Measured Information in Separable Quantum Processes. arXiv. 2023 doi: 10.48550/arXiv.2303.00162.2303.00162 [DOI] [Google Scholar]
  • 32.Cesário A.T., Ferreira D.L.B., Debarba T., Iemini F., Maciel T.O., Vianna R.O. Quantum Statistical Complexity Measure as a Signaling of Correlation Transitions. Entropy. 2022;24:1161. doi: 10.3390/e24081161. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 33.López-Ruiz R., Nagy Á., Romera E., Sañudo J. A generalized statistical complexity measure: Applications to quantum systems. J. Math. Phys. 2009;50:123528. doi: 10.1063/1.3274387. [DOI] [Google Scholar]
  • 34.Bu K., Koh D.E., Li L., Luo Q., Zhang Y. Statistical complexity of quantum circuits. Phys. Rev. A. 2022;105:062431. doi: 10.1103/PhysRevA.105.062431. [DOI] [Google Scholar]
  • 35.Bagrov A.A., Iakovlev I.A., Iliasov A.A., Katsnelson M.I., Mazurenko V.V. Multiscale structural complexity of natural patterns. Proc. Natl. Acad. Sci. USA. 2020;117:30241–30251. doi: 10.1073/pnas.2004976117. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 36.Sotnikov O.M., Iakovlev I.A., Iliasov A.A., Katsnelson M.I., Bagrov A.A., Mazurenko V.V. Certification of quantum states with hidden structure of their bitstrings. npj Quantum Inf. 2022;8:41. doi: 10.1038/s41534-022-00559-7. [DOI] [Google Scholar]
  • 37.Ma K.K.W., Yang K. Kolmogorov complexity as intrinsic entropy of a pure state: Perspective from entanglement in free fermion systems. Phys. Rev. B. 2022;106:035143. doi: 10.1103/PhysRevB.106.035143. [DOI] [Google Scholar]
  • 38.Lieb E.H., Robinson D.W. The finite group velocity of quantum spin systems. Commun. Math. Phys. 1972;28:251–257. doi: 10.1007/BF01645779. [DOI] [Google Scholar]
  • 39.Ashtekar A., Schilling T.A. Geometrical formulation of quantum mechanics. arXiv. 1997gr-qc/9706069 [Google Scholar]
  • 40.Anza F., Crutchfield J.P. Beyond density matrices: Geometric quantum states. Phys. Rev. A. 2021;103:062218. doi: 10.1103/PhysRevA.103.062218. [DOI] [Google Scholar]
  • 41.Anza F., Crutchfield J.P. Maximum Geometric Quantum Entropy. Entropy. 2024;26:225. doi: 10.3390/e26030225. [DOI] [PMC free article] [PubMed] [Google Scholar]
  • 42.Casas F., Murua A., Nadinic M. Efficient computation of the Zassenhaus formula. Comput. Phys. Commun. 2012;183:2386–2391. doi: 10.1016/j.cpc.2012.06.006. [DOI] [Google Scholar]
  • 43.Bartlett S.D., Rudolph T., Spekkens R.W. Reference frames, superselection rules, and quantum information. Rev. Mod. Phys. 2007;79:555–609. doi: 10.1103/RevModPhys.79.555. [DOI] [Google Scholar]
  • 44.Karabach M., Müller G. Introduction to the Bethe Ansatz I. Comput. Phys. 1997;11:36–43. doi: 10.1063/1.4822511. [DOI] [Google Scholar]
  • 45.Mölter J., Barthel T., Schollwöck U., Alba V. Bound states and entanglement in the excited states of quantum spin chains. J. Stat. Mech. Theory Exp. 2014;2014:10029. doi: 10.1088/1742-5468/2014/10/P10029. [DOI] [Google Scholar]
  • 46.Zhang J., Rajabpour M.A. Entanglement of magnon excitations in spin chains. J. High Energy Phys. 2022;2022:72. doi: 10.1007/JHEP02(2022)072. [DOI] [Google Scholar]
  • 47.Eisler V. Entanglement spreading after local and extended excitations in a free-fermion chain. J. Phys. Math. Gen. 2021;54:424002. doi: 10.1088/1751-8121/ac21e4. [DOI] [Google Scholar]
  • 48.Laflorencie N. Quantum entanglement in condensed matter systems. Phys. Rep. 2016;646:1–59. doi: 10.1016/j.physrep.2016.06.008. [DOI] [Google Scholar]
  • 49.Hastings M.B. Locality in Quantum and Markov Dynamics on Lattices and Networks. Phys. Rev. Lett. 2004;93:140402. doi: 10.1103/PhysRevLett.93.140402. [DOI] [PubMed] [Google Scholar]
  • 50.Chen C.F., Lucas A., Yin C. Speed limits and locality in many-body quantum dynamics. arXiv. 2023 doi: 10.1088/1361-6633/acfaae.quant-ph/2303.07386 [DOI] [PubMed] [Google Scholar]
  • 51.Wang Z., Hazzard K.R.A. Tightening the Lieb-Robinson Bound in Locally Interacting Systems. PRX Quantum. 2020;1:010303. doi: 10.1103/PRXQuantum.1.010303. [DOI] [Google Scholar]
  • 52.Moreland K. Advances in Visual Computing. Springer; Berlin/Heidelberg, Germany: 2009. Diverging color maps for scientific visualization; pp. 92–103. [Google Scholar]
  • 53.de Wal D.K., Iwens A., Liu T., Tang P., Bauer G.E.W., van Wees B.J. Long-distance magnon transport in the van der Waals antiferromagnet CrPS4. Phys. Rev. B. 2023;107:L180403. doi: 10.1103/PhysRevB.107.L180403. [DOI] [Google Scholar]
  • 54.Yuan H.Y., Cao Y., Kamra A., Duine R.A., Yan P. Quantum magnonics: When magnon spintronics meets quantum information science. Phys. Rep. 2022;965:1–74. doi: 10.1016/j.physrep.2022.03.002. [DOI] [Google Scholar]
  • 55.Jepsen P.N., Amato-Grill J., Dimitrova I., Ho W.W., Demler E., Ketterle W. Spin transport in a tunable Heisenberg model realized with ultracold atoms. Nature. 2020;588:403–407. doi: 10.1038/s41586-020-3033-y. [DOI] [PubMed] [Google Scholar]
  • 56.Pereira D., Mueller E.J. Dynamics of spin helices in the one-dimensional X X model. Phys. Rev. A. 2022;106:043306. doi: 10.1103/PhysRevA.106.043306. [DOI] [Google Scholar]
  • 57.Audenaert K., Eisert J., Plenio M.B., Werner R.F. Entanglement properties of the harmonic chain. Phys. Rev. A. 2002;66:042327. doi: 10.1103/PhysRevA.66.042327. [DOI] [Google Scholar]
  • 58.Plenio M.B., Eisert J., Dreißig J., Cramer M. Entropy, Entanglement, and Area: Analytical Results for Harmonic Lattice Systems. Phys. Rev. Lett. 2005;94:060503. doi: 10.1103/PhysRevLett.94.060503. [DOI] [PubMed] [Google Scholar]
  • 59.Hoogeveen M., Doyon B. Entanglement negativity and entropy in non-equilibrium conformal field theory. Nucl. Phys. B. 2015;898:78–112. doi: 10.1016/j.nuclphysb.2015.06.021. [DOI] [Google Scholar]
  • 60.Calabrese P., Cardy J., Tonni E. Entanglement entropy of two disjoint intervals in conformal field theory. J. Stat. Mech. 2009;0911:P11001. doi: 10.1088/1742-5468/2009/11/P11001. [DOI] [Google Scholar]
  • 61.Calabrese P., Cardy J., Tonni E. Entanglement negativity in extended systems: A field theoretical approach. J. Stat. Mech. Theory Exp. 2013;2013:02008. doi: 10.1088/1742-5468/2013/02/P02008. [DOI] [Google Scholar]
  • 62.Henneaux M., Teitelboim C. Quantization of Gauge Systems. Princeton University Press; Princeton, NJ, USA: 1992. [Google Scholar]
  • 63.Andrei N., Bissi A., Buican M., Cardy J., Dorey P., Drukker N., Erdmenger J., Friedan D., Fursaev D., Konechny A., et al. Boundary and defect CFT: Open problems and applications. J. Phys. Math. Gen. 2020;53:453002. doi: 10.1088/1751-8121/abb0fe. [DOI] [Google Scholar]
  • 64.Bonsignori R., Ruggiero P., Calabrese P. Symmetry resolved entanglement in free fermionic systems. J. Phys. Math. Gen. 2019;52:475302. doi: 10.1088/1751-8121/ab4b77. [DOI] [Google Scholar]
  • 65.Murciano S., Calabrese P., Konik R.M. Generalized entanglement entropies in two-dimensional conformal field theory. J. High Energy Phys. 2022;2022:152. doi: 10.1007/JHEP05(2022)152. [DOI] [Google Scholar]
  • 66.Verstraete F., Nishino T., Schollwöck U., Bañuls M.C., Chan G.K., Stoudenmire M.E. Density matrix renormalization group, 30 years on. Nat. Rev. Phys. 2023;5:273–276. doi: 10.1038/s42254-023-00572-5. [DOI] [Google Scholar]
  • 67.Knizia G., Chan G.K.L. Density Matrix Embedding: A Simple Alternative to Dynamical Mean-Field Theory. Phys. Rev. Lett. 2012;109:186404. doi: 10.1103/PhysRevLett.109.186404. [DOI] [PubMed] [Google Scholar]
  • 68.Cao C., Sun J., Yuan X., Hu H.S., Pham H.Q., Lv D. Ab initio quantum simulation of strongly correlated materials with quantum embedding. npj Comput. Math. 2023;9:78. doi: 10.1038/s41524-023-01045-0. [DOI] [Google Scholar]
  • 69.Kowalski K., Bauman N.P. Quantum Flow Algorithms for Simulating Many-Body Systems on Quantum Computers. Phys. Rev. Lett. 2023;131:200601. doi: 10.1103/PhysRevLett.131.200601. [DOI] [PubMed] [Google Scholar]

Associated Data

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

Data Availability Statement

The raw data supporting the conclusions of this article will be made available by the corresponding author upon reasonable request.


Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES