Paper The following article is Open access

Inaccessible entanglement in symmetry protected topological phases

, , and

Published 30 July 2020 © 2020 The Author(s). Published by IOP Publishing Ltd
, , Citation Caroline de Groot et al 2020 J. Phys. A: Math. Theor. 53 335302 DOI 10.1088/1751-8121/ab98c7

1751-8121/53/33/335302

Abstract

We study the entanglement structure of symmetry-protected topological (SPT) phases from an operational point of view by considering entanglement distillation in the presence of symmetries. We demonstrate that non-trivial SPT phases in one-dimension necessarily contain some entanglement which is inaccessible if the symmetry is enforced. More precisely, we consider the setting of local operations and classical communication (LOCC) where the local operations commute with a global onsite symmetry group G, which we call G-LOCC, and we define the inaccessible entanglement Einacc as the entanglement that cannot be used for distillation under G-LOCC. We derive a tight bound on Einacc which demonstrates a direct relation between inaccessible entanglement and the SPT phase, namely $\mathrm{log}\left({D}_{\omega }^{2}\right){\leqslant}{E}_{\mathrm{i}\mathrm{n}\mathrm{a}\mathrm{c}\mathrm{c}}{\leqslant}\mathrm{log}\left(\vert G\vert \right)$, where Dω is the topologically protected edge mode degeneracy of the SPT phase ω with symmetry G. For particular phases such as the Haldane phase, ${D}_{\omega }=\sqrt{\vert G\vert }$ so the bound becomes an equality. We numerically investigate the distribution of states throughout the bound, and show that typically the region near the upper bound is highly populated, and also determine the nature of those states lying on the upper and lower bounds. We then discuss the relation of Einacc to string order parameters, and also the extent to which it can be used to distinguish different SPT phases of matter.

Export citation and abstract BibTeX RIS

Original content from this work may be used under the terms of the Creative Commons Attribution 4.0 licence. Any further distribution of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.

1. Introduction

Entanglement is the essential resource which allows for tasks beyond the restrictions of local operations and classical communication (LOCC), that are impossible to implement classically, such as quantum teleportation, dense coding and secure cryptography [13]. Under LOCC, the quantification of entanglement leads to the von Neumann entropy as the determining quantity governing state conversion [4]. By imposing additional restrictions to LOCC, the non-local resources that emerge, as well as the tasks they allow, are reshaped. In a seminal work, Wiseman and Vaccaro found that the entanglement of indistinguishable particles subject to a super-selection rule (SSR) fixing the total particle number is reduced to the average of the von Neumann entropy of spatial modes over all particle number sectors for a mode [5]. This pioneering observation has now led to a plethora of interdisciplinary works in the study of SSR in the quantum information community [511]. SSR refers to phenomena where particular state transitions are forbidden in the Hilbert space due to some physical rule, such as disallowing a superposition across different electronic charge sectors, which would violate the inherent parity symmetry of fermions [12], or restrictions due to particle number conservation [13]. However, the interplay between entanglement and SSR in physical systems has yet to be fully explored. Bridging this gap firstly necessitates modifying the rules of LOCC to include the SSR which enforce further structure on the partial order of states due to a redefinition of the majorisation criterion [13]. SSR were shown to even produce additional non-local resources, e.g. to permit perfect quantum data hiding protocols [14]. This motivated exploring the entanglement under restricted settings in various contexts, such as the symmetry-resolved entanglement [9, 1518], as well as conservation laws in fermionic systems with parity symmetry and ultracold atoms with particle number conservation, for both critical and gapped systems [1921]. In the context of lattice gauge theories, which impose a local gauge symmetry, it was shown that entanglement distillation must be adjusted to account for additional restrictions [2224]. Here we are concerned with the impact of enforcing a global symmetry, leading us to consider symmetry protected topological (SPT) phases [2531].

The motivation of this work is to apply insights about entanglement under SSR from the quantum information perspective to SPT phases. This as yet unexplored connection is natural to make, as topological phases describe order beyond the Landau description of symmetry breaking and local order parameters, and are instead determined by global patterns of entanglement [3234]. In particular, topological phases are classified through non-local order. The many-body entanglement picture of topological order sorts phases into two classes; topological phases have long range entanglement (i.e. have topological order), while others have short range entanglement (i.e. have SPT order). We are concerned with the latter, which only host topological properties in the presence of symmetry, such as topological insulators and the Haldane chain [26, 27, 32]. The development of quantities which detect SPT order is of particular interest in improving intuitions about these phases [35, 36], such as the string order parameter and SPT-entanglement which characterise the phase in terms of the global entanglement structure [3741].

In this work, we study the entanglement of SPT ordered systems under local operations commuting with a global onsite symmetry G, which we call G-LOCC. This setting is naturally suggestive of SPT phases which are only defined with respect to the symmetry group G protecting the order. This classification breaks down when considering scenarios with no symmetry. In G-LOCC, the amount of accessible entanglement is naturally reduced as compared to LOCC. We therefore show that, in the presence of non-trivial SPT order under G, there is always some entanglement that is inaccessible under G-LOCC. We give this quantity operational meaning by showing that it is consistent with entanglement distillation under G-LOCC. In more detail, we study the inaccessible entanglement Einacc of SPT phases in one-dimension (1D), which leads to the following bound

Equation (1)

where Dω is the topologically protected part of the edge mode degeneracy and the dimension of the projective irreducible representation defining the SPT phase ω. We show that maximally non-commutative (MNC) phases, such as the Haldane or cluster phase for the symmetry ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$, saturate the upper bound on inaccessible entanglement. This is connected to the fact that MNC phases maximise the number of topologically protected degenerate edge modes. Importantly, trivial SPT phases always have zero as the lower bound, while non-trivial phases have a non-zero lower bound.

In order to obtain a better understanding of the typical behaviour of the inaccessible entanglement, we numerically study particular random distributions of states, using matrix product states (MPS). We demonstrate that the bound is tight by interpolating through a path of states from the lower bound to the upper bound. Intriguingly, we find that both trivial and non-trivial SPT systems typically have near maximal inaccessible entanglement. However, the irrep probabilities, which are the weights of the state on the individual symmetry sectors, have different structure, and can thus be used to distinguish these phases. We study the implication of effective reduced symmetries in a non-trivial SPT system, where we interpolate a state with a symmetry G to effectively a lower symmetry HG. The interpolation causes the inaccessible entanglement and the irrep probabilities to lose the structure due to G and the final state displays only structure due to H. On the other hand, we also study the effect of reduced G-LOCC, so that the local operations commute with some HG where G is still the symmetry protecting the SPT phase, as opposed to the effective reduced symmetry scheme. We argue that the accessible entanglement depends on the dimension of the subspace of the MPS which transforms trivially under the symmetry, previously termed the junk subspace [42]. We can increase the dimension of the junk subspace for a given bond dimension by giving an uneven irrep structure to the projective representation, which causes a greater spread in the distribution of inaccessible entanglement. Finally, we discuss how our results apply to two-dimensional subsystem SPT phases [43, 44], and also how they relate to the characterisation of states as resources for measurement-based quantum computation [45].

The manuscript is structured as follows. In section 2 we provide the necessary background on SPT order and the description with tensor networks. In section 3, we formalise the definition of inaccessible entanglement via entanglement distillation with G-LOCC. Then, in section 4, we present our proofs of the bound on inaccessible entanglement for all SPT phases under finite abelian symmetry groups, and the connection to string order parameters. Next, in section 5 we confirm that the bound is tight, and examine properties of SPT phases living in particular regions of the bound by performing interpolations in the MPS tensor. In section 6 we discuss the implications on computational power, subsystem SPT order, and restricting operations to a subgroup of G. Finally, in section 7 we conclude and suggest future directions enabled by this work.

2. Introduction to SPT phases with tensor networks

In this section we review the necessary frameworks to discuss SPT phases with tensor networks. Throughout this work, we will restrict to finite abelian symmetries. This is not a severe restriction, as many physically relevant SPT phases protected by other groups remain non-trivial even when a finite abelian subgroup of the symmetry is enforced [46]. One example is the Haldane phase, which may be defined as the non-trivial SPT phase protected by SO(3) symmetry, but is effectively protected by a ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ subgroup. The non-trivial phase protected by the latter symmetry is also called the cluster phase, as it contains the 1D cluster state [45]. Being the simplest non-trivial SPT phase, we will often refer to this example throughout the paper.

2.1. Introduction to tensor networks

A powerful tool to describe topological phases is the tensor network formalism, in which the wave function is decomposed into a network of local tensors Ai associated to each site. Tensor networks are ideal candidates for capturing states with symmetries and/or topological order, as they allow us to understand global properties of a states in terms of symmetries of the local tensors, which in turn describe the entanglement structure of the state [30, 31].

In this paper we consider the one-dimensional tensor network states called matrix product states (MPS). With this ansatz one can efficiently approximate states obeying an area law in entanglement entropy, such as ground states of gapped, local Hamiltonians [47, 48]. An MPS is defined by a single rank-three tensor A as

Equation (2)

where Ai are matrices such that A = ∑iAi ⊗ |i⟩. From now on, we only consider injective MPS, which are defined as those for which the transfer matrix $T={\sum }_{i}{A}^{i}\otimes {\left({A}^{i}\right)}^{{\dagger}}$ has a unique eigenvalue of largest magnitude. Physically, this condition holds when the MPS is the unique ground state of its parent Hamiltonian, which is indeed the case for states in SPT phases without symmetry-breaking.

Injective MPS satisfy an important property, often called the fundamental theorem of MPS, which states that any global onsite symmetry, u(g)N|Ψ[A]⟩ = |Ψ[A]⟩, implies that the local tensor A transforms under the on-site symmetry action as

Equation (3)

where u(g) is some group representation and V(g) is a projective representation, as pictured in figure 1(a) [49]. We take A to be in canonical form so that V(g) is unitary. The projective representation differs from a linear representation as it obeys the relation

Equation (4)

with a phase ω called a cocycle. The fundamental theorem elucidates that the projective symmetry action of V(g) occurs on the virtual level of each site tensor A, such that the entanglement structure and topological properties of the global state are encoded locally. As such the properties of V(g) play an important role in tensor networks.

Figure 1.

Figure 1. In this figure, u and V have a dependence on g which is omitted. 1(a) Graphical representation of equation (3). 1(b) Symmetries of the transfer operator T. 1(c) Definition of the left-fixed point ρL. 1(d) Graphical calculation of the trace part of the irrep probabilities leading to (16).

Standard image High-resolution image

The transfer operator T, which inherits the symmetries of A as shown in figure 1(b), is an important object in coming calculations, so we establish some notation here. Let |R⟩ and ⟨L| denote the right and left eigenvectors of T corresponding to the largest eigenvalue, which we can set to be equal to 1 with normalisation, such that T|R⟩ = |R⟩ and ⟨L|T = ⟨L|. For the purposes of this work, it is often convenient to express T as a quantum channel $\mathbb{T}$ defined as $\mathbb{T}\left(\rho \right)={\sum }_{i}{A}^{i}\rho {A}^{i{\dagger}}$. Then, |R⟩ and ⟨L| correspond to the fixed-points ρR and ρL of $\mathbb{T}$ and ${\mathbb{T}}^{{\dagger}}\left(\rho \right)={\sum }_{i}{A}^{i{\dagger}}\rho {A}^{i}$, respectively, see figure 1(c).

2.2. Classification of SPT phases

SPT order is defined by equivalence classes of short-range entangled states, i.e. families of states which are connected by a finite-depth quantum circuit respecting a particular symmetry, which corresponds to an adiabatic path of gapped, local Hamiltonians [2527]. As such, this order is called 'topologically trivial', but nevertheless intrinsically non-local properties prevail in presence of a symmetry, such as topologically protected edge mode degeneracy and string order [3739]; this follows from the non-trivial symmetry action of the projective representation V(g) on the edges [28, 29].

It has been shown that 1D SPT phases are classified by the second cohomology group H2(G, U(1)) which is formed by the equivalence classes of cocycles ω up to coboundaries of a particular projective representation V(g) [28, 30, 31]. Hence, SPT order is intimately linked to the projective representation V(g), and remarkably demonstrates that global patterns of entanglement appear via a local mechanism, which emphasises the natural suitability of local tensor descriptions.

In the following we focus on bosonic SPT order at zero temperature. For completeness we add that, generally, bosons in d-dimensional SPT phases of matter are classified by the d + 1 group cohomology Hd+1(G, U(1)) [26], although models beyond group cohomology have also been studied in 3D and 4D [27, 50].

2.3. Projective irreps of abelian groups

We now introduce several properties about projective irreducible representations of finite abelian groups that will be relevant in later calculations.

Let us introduce the term ω-irrep to refer to an irreducible representation with cocycle ω. Firstly, a general projective representation V(g) of a finite group G with cocycle ω can be written as a direct sum over ω-irreps Va(g)

Equation (5)

where na is the multiplicity for a given ω-irrep a [51]. The second property we make use of is the fact that any two ω-irreps of a finite abelian group are projectively equivalent. Namely, if we fix $\tilde {V}\left(g\right)$ to be an arbitrary reference ω-irrep, every other ω-irrep Va(g) can be related to it by

Equation (6)

where μa(g) can be thought of as a phase factor, as it is a linear character, and Ua is some unitary [52]. This allows us to simplify the general form of V(g) in equation (5), which is a direct sum over the ω-irreps containing multiple tensor products, to a single tensor product when G is finite abelian. Namely,

Equation (7)

where we have removed the unitaries Ua through an appropriate choice of basis. This illustrates that, for finite abelian groups, all ω-irreps for a given ω have the same dimension, which we call Dω.

To calculate Dω, we need to introduce the notion of the projective centre group kω. Given a cocycle ω under the group G, kω is defined by

Equation (8)

Then, Dω is determined by the following equation [53],

Equation (9)

For example, the Haldane phase has projective irreps given by the two-dimensional Pauli operators. Conversely, for non-abelian groups the irreps may have different dimensions, an example of which is S4, the symmetric group on four elements, which has two- and four-dimensional projective irreps.

Finally, we note that for any ω-irrep Vω(g), the following condition about the trace holds [51],

Equation (10)

This will be helpful for calculations later on.

2.3.1. Maximal non-commutativity

SPT phases of special interest are the so-called maximally non-commutative (MNC) phases. These phases act as universal resources for MBQC [42, 45, 46, 54, 55]. A cocycle ω, along with the corresponding SPT phase, is called MNC if kω = {e}, meaning it has a trivial projective centre. For such phases, Dω takes the maximum value of $\sqrt{\vert G\vert }$. Since Dω is equal to the topologically protected edge degeneracy of SPT phases [28], MNC phases therefore have the maximum edge degeneracy for a given group G. From now on, we will suppress the index ω in kω for notational simplicity.

For each MNC cocycle ω there is only one ω-irrep up to unitary equivalence [53], such that equation (7) becomes

Equation (11)

The left part of the tensor product, which transforms trivially under symmetry, is referred to as the junk subspace. The size of this space determines the bond dimension and hence bounds the entanglement entropy of the state. We will also refer to the trivially transforming part of the MPS tensor in non-MNC phases as the junk subspace, although strictly there are multiple subspaces, corresponding to the existence of multiple projective irreducible representations.

We note that some symmetry groups host multiple MNC phases; such phases cannot be distinguished by their edge mode degeneracy, as the ω-irreps all have the same dimension. Order parameters as in references [3740], however, can distinguish between them by microscopically probing the specific non-local action on the virtual level of the tensor network, which we discuss further in section 4.3.

3. Accessible entanglement distillation

How much entanglement can be extracted from a state obeying a symmetry G under LOCC respecting the same symmetry? In this section we define the accessible entanglement in the presence of G-symmetric LOCC (G-LOCC) and derive an expression through multi-shot entanglement distillation which is consistent with previous works e.g. references [59]. We will first define G-LOCC and motivate why we might expect this to effect the entanglement which is accessible under these operations.

We define G-LOCC by restricting LOCC protocols to positive-operator valued measure (POVM) sets $\left\{{M}_{\alpha }^{{\dagger}}{M}_{\alpha }\right\}$ that commute with the global symmetry U(g) = u(g)N such that [U(g), Mα] = 0 ∀gG, where α are the measurement outcomes. Note that the Mα are not necessarily orthogonal measurements. The accessible entanglement we will motivate that exists under such POVM sets is given by

Equation (12)

where ${p}_{\alpha }=\mathrm{Tr}\left({M}_{\alpha }\rho {M}_{\alpha }^{{\dagger}}\right)$ are measurement probabilities corresponding to the post-measurement state ${\rho }_{\alpha }={M}_{\alpha }\rho {M}_{\alpha }^{{\dagger}}$ up to normalisation and the entanglement entropy $E\left({\rho }_{AB}\right)$ of a bipartite state ρAB is given by the von Neumann entropy $S\left({\rho }_{A}\right)$, where ${\rho }_{A}={\mathrm{Tr}}_{B}\left({\rho }_{AB}\right)$ is the reduced density operator [4]. We will now argue that the entanglement entropy overestimates the physical entanglement Eacc due to the structure imposed by symmetry. This line of thought leads naturally into the entanglement distillation protocol of the next section, in which we will derive equation (12).

A simple argument considers that local operations may not mix symmetry sectors, and that local operations can only decrease entanglement. As the state ρ is symmetric under the symmetry G which imposes the G-LOCC, enforcing [u(g)N, ρ] = 0, the reduced density ρA also has the symmetry $\left[u{\left(g\right)}^{\otimes {N}_{A}},{\rho }^{A}\right]=0$. In the following we will make use of a particular POVM set to directly measure the symmetry and capture properties of the SPT phase under G-LOCC. We utilise the projective measurement Πα onto the irrep sectors given by

Equation (13)

where χα(g) is the character corresponding to irrep α and NA are the sites in the A-subsystem (see also [37]). Due to the symmetry, the reduced state can be written as ${\rho }^{A}={\bigoplus}_{\alpha }{p}_{\alpha }{\rho }_{\alpha }^{A}$, where pα are the measurement probabilities defined above for the POVM operators Mα = Πα, and where ${\rho }_{\alpha }^{A}={{\Pi}}_{\alpha }{\rho }^{A}{{\Pi}}_{\alpha }^{{\dagger}}/{p}_{\alpha }$.

All allowed operations commute with the symmetry and hence operate only within single sectors α which can be written as ρα,out = Λα(ρin) with the map ${{\Lambda}}_{\alpha }\left(\cdot \right)={M}_{\alpha }\left(\cdot \right){M}_{\alpha }^{{\dagger}}$, and Mα defining an element of a POVM set obeying the symmetry and acting on a single sector. These operations are local by definition. Since operations which mix the symmetry sectors of states are not supported, any entanglement between different sectors is erased by G-LOCC. Hence, only the entanglement within individual symmetry sectors contributes. The accessible entanglement defined in equation (12) is therefore the sum over the entanglement within each symmetry sector α. Clearly the entanglement in each sector E(ρα) is less than the total entanglement, but so is the weighted sum of E(ρα) over α. As this defines the accessible entanglement, it is therefore also smaller or equal to the entanglement,

Equation (14)

Hence G-LOCC leads to a reduced accessible entanglement. Note that this expression ensures that product states have Eacc = 0. The considerations above naturally lead to an operational definition of the accessible entanglement.

3.1. Entanglement distillation under G-LOCC

We now present how entanglement distillation under G-LOCC leads us to the accessible entanglement in equation (12). Entanglement distillation is the process of distilling Bell pairs from asymptotically many copies of a state under LOCC, and is consistent with a partial order on states through the majorisation criterion [4, 56]. This leads to the equivalence of the conversion ratio M/N, between N copies of a pure state |Ψ⟩ to M copies of the Bell state in the asymptotic limit N, to E the entanglement entropy [57]. We now consider entanglement distillation under G-LOCC.

We measure the POVM set $\left\{{{\Pi}}_{\alpha }^{{\dagger}}{{\Pi}}_{\alpha }\right\}$ with Πα as defined in equation (13) the projector onto each irrep α of the symmetry G imposing the G-LOCC, such that on average we get every channel containing the normalised output state ρα with a probability pα in the asymptotic limit. This action splits the state into the symmetry sectors which impose the super-selection rule, so that operations are restricted to within these subspaces. This makes it possible to act with LOCC within each subspace. Then the entanglement entropy of the output state at each branch α computes the number of Bell pairs distilled from the α-channel. Clearly, the total entanglement extracted from this procedure is the weighted sum of the entanglement from each branch, giving the expression in equation (12).

Furthermore, as the LOCC can be defined free of SSR within each sector, each branch contains an optimal distillation within each symmetry sector such that the full distillation is optimal [4], i.e. the maximal possible ratio M/N of M Bell pairs produced from N copies of |Ψα⟩ is achieved. This concludes the description of entanglement distillation under G-LOCC, which employs the full rigour of distillation under LOCC, and as such is of itself complete.

3.2. Symmetry measurement

In order to carry out calculations later on, we rewrite the irrep probabilities in tensor network notation through some simple manipulations which we sketch here. We consider a system on a ring with N sites in the limit of the number of sites going to infinity which allows us to use properties of the fixed point, such that bipartitioning cuts the ring in half and results in two boundaries. Using ${p}_{\alpha }=\mathrm{Tr}\left({{\Pi}}_{\alpha }\rho \right)$, and inserting the form of the symmetric projection operator from equation (13), we should recall that Πα acts only on the A-subsystem, so the rest is traced over, leaving the fixed point action on the remaining half.

By using the fact that the symmetry action in Πα acts locally, we can pull the sum out and by engaging the fundamental theorem, equation (3), we find an effective action of the symmetry group on the virtual system. Due to the cross-cancellation of all V(g), V(g) except for the action at the edges, the rest of the expression becomes

Equation (15)

We now use that ${T}^{{N}_{A}}\to \vert \mathrm{R}\rangle \langle \mathrm{L}\vert $ as NA, and for simplicity we switch from the language of vectors {|L⟩, |R⟩} to matrices {ρL, ρR} which are the same object, the fixed point of the MPS, considered either as vectors or as matrices. Then the remaining expression is

Equation (16)

using right-canonical form such that ρR is the identity [58]. The part of the summand involving the trace in the calculations leading to equation (16) is shown pictorially in figure 1.

3.3. Inaccessible entanglement

Having defined the accessible entanglement by distillation under G-LOCC earlier, we now conversely define the inaccessible entanglement as the amount of entanglement that the G-LOCC prevents access to:

Equation (17)

While the accessible entanglement captures the physical entanglement of a system with SPT order, inaccessible entanglement measures the entanglement protected by the presence of symmetry and stored in the state. We show below that the inaccessible entanglement can be written as

Equation (18)

where pα are the irrep probabilities defined above. In the following we will use log to signify log base-2. Note that equation (18) is the entropy of the probability distribution corresponding to the irrep weights of the symmetry group G on the state, Einacc = S({pα}).

Recall that the reduced density ρA has the symmetry $\left[u{\left(g\right)}^{\otimes {N}_{A}},{\rho }^{A}\right]=0$, and therefore can be written as ${\rho }^{A}={\bigoplus}_{\alpha }{p}_{\alpha }{\rho }_{\alpha }^{A}$ where ρα = ΠαρA/pα. Therefore the entanglement entropy of the state is

Equation (19)

Then equation (18) follows since the first term in the second equality is the accessible entanglement, and subtracting this gives the relation for inaccessible entanglement. Notice that since EEinacc, the presence of entanglement is a necessary condition for inaccessible entanglement.

Given the irrep probabilities in equation (16), we now have a tensor network formulation of Einacc. In the following, we explore how different classes of SPT phases behave with regards to inaccessible entanglement.

4. Bounds for the inaccessible entanglement

In this section we derive bounds on the entanglement that is inaccessible due to SPT order. It is trivial to deduce that Einacc = 0 for a product state (which has no entanglement) or a state with no symmetry (which has no SSR). We show, however, a non-zero lower bound in the presence of symmetries for states with non-trivial SPT order. This bound, together with the upper bound, reads as

Equation (20)

where G is the symmetry group protecting the topological order and k is the projective centre of G associated to the cocycle characterising the SPT phase (defined in equation (8)). We thereby develop a prescription for all SPT phases under finite abelian groups by showing that non-trivial SPT phases remarkably incur a non-zero lower bound on the inaccessible entanglement.

4.1. Maximal inaccessible entanglement in the MNC phase

We first consider the simpler case of MNC phases, which obey a strong condition on inaccessible entanglement where the lower bound meets the upper bound

Equation (21)

given the symmetry G. MNC phases therefore maximise the inaccessible entanglement. The irrep probabilities are ${p}_{\alpha }=\frac{1}{\vert G\vert }\;\forall \alpha $, which produces maximal entropy S({pα}), and hence equation (21). We first give an example to illustrate this result.

The Haldane or cluster phase is a canonical example of the MNC phase, which is protected by the symmetry $G={\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ for which the cohomology group is known to be ${H}^{2}\left(G,U\left(1\right)\right)={\mathbb{Z}}_{2}$, indicating one trivial and one SPT phase [33, 42]. One valid symmetry representation is given by u(g) = ⨁αχα(g), where χα is the character of the irrep α, and the projective representation in the MNC phase is given by the Pauli operators including the identity, V(g) = σ(g). States satisfying this symmetry have an MNC cocycle as all the Pauli operators mutually anti-commute, so the projective centre k contains only the identity. Since the Pauli matrices are traceless, Tr(σ(g)) = 0 ∀gG, the only contribution to pα in equation (16) is from the identity element and hence ${p}_{\alpha }=\frac{1}{4}\;\forall \alpha $. Therefore in the Haldane phase the inaccessible entanglement is 2.

To derive a similar result for all states in an MNC phase, we start from equation (16). We first use symmetries of the left fixed point. The main step will be to use the simplified form of the projective representation in equation (11). We begin by fixing the form of the left fixed point according to the symmetry imposed by equation (5). Inherited from the symmetries of the transfer matrix T, the left fixed point is also symmetric under $V\left(g\right)=\mathbb{1}\otimes \tilde {V}\left(g\right)$, i.e. ${\rho }_{\mathrm{L}}=\left(\mathbb{1}\otimes \tilde {V}\left(g\right)\right){\rho }_{\mathrm{L}}\left(\mathbb{1}\otimes \tilde {V}{\left(g\right)}^{{\dagger}}\right)$. By Schur's Lemma, ρL can therefore be written as ${\rho }_{\mathrm{L}}={\tilde {\rho }}_{\mathrm{L}}\otimes \mathbb{1}$, for some matrix ${\tilde {\rho }}_{\mathrm{L}}$ carrying correlations and corresponding to the junk subspace. We choose normalisation Tr(ρL) = 1 which implies that $\mathrm{Tr}\left({\tilde {\rho }}_{\mathrm{L}}\right)=1/{D}_{\omega }$.

Inserting back the above form of the fixed point ρL into equation (16), the irrep probabilities can be expressed as

Equation (22)

Now multiplying out the corresponding parts of the tensor product, and reducing the trace over it,

Equation (23)

Using now equation (10) and that $\mathrm{Tr}\left({\tilde {\rho }}_{\mathrm{L}}\right)=1/{D}_{\omega }$, the above equation becomes

Equation (24)

Using χα(e) = 1, pα finally takes the same value for all irreps α,

Equation (25)

The irrep probabilities are degenerate, meaning that the weight of each sector contributes equally to Einacc, and the entropy is maximised which confirms Einacc = log(|G|). This demonstrates that MNC phases have the maximal set of topologically protected degenerate edge modes Dω = |G| from equation (9), which is reflected in the inaccessible entanglement.

4.2. Generalisation of bounds to non-MNC phases

We generalise the inaccessible entanglement to describe all SPT phases, and crucially show that for non-MNC phases there exists a non-zero lower bound,

Equation (26)

for the group G and projective centre group k defined in equation (8). We will first outline the steps taken to prove this. We use the general form of V(g) in equation (7), and thus are prevented from easily evaluating the trace over ρL. However, much of the following proof remains in the same vein as in the previous section, by simplifying the expression for pα as much as possible by symmetry under V(g). Finally we make an argument with entropy configurations from which we deduce the lower bound.

First we use the symmetry of ρL under V(g) to deduce the fixed point. By Schur's lemma, the fixed point is again ${\rho }_{\mathrm{L}}={\tilde {\rho }}_{\mathrm{L}}\otimes \mathbb{1}$, where now ${\tilde {\rho }}_{\mathrm{L}}={\bigoplus}_{a}{\tilde {\rho }}_{\mathrm{L},a}$, and each ${\tilde {\rho }}_{\mathrm{L},a}$ has dimension na × na. Again we choose the normalisation $\mathrm{Tr}\left({\tilde {\rho }}_{\mathrm{L}}\right)=1/{D}_{\omega }$ for convenience. Recalling the form of V(g) from equation (7), the measurement probability then is written

Equation (27)

Separating the trace over the tensor product,

Equation (28)

Using equation (10), we can evaluate the traces over the projective representation, such that pα further simplifies to

Equation (29)

Crucially, at this point, pα depends only on the value that χα takes in kG. This will lead to degeneracy in the different pα, giving our lower bound of Einacc. To derive a simplified expression for pα, we insert ${\tilde {\rho }}_{\mathrm{L}}{\bigoplus}_{a}{\mu }_{a}\left(g\right)={\bigoplus}_{a}{\mu }_{a}\left(g\right){\tilde {\rho }}_{\mathrm{L},a}$, and ${D}_{\omega }=\sqrt{\vert G\vert /\vert k\vert }$ to arrive at

Equation (30)

We now use that the μa(g) are linear characters of G, i.e. there is a function u(a) such that μa(g) = χu(a)(g) ∀gG. Then, we can write ${\chi }_{\alpha }\left(s\right){\mu }_{a}\left(s\right)\overline{{\mu }_{{a}^{\prime }}\left(s\right)}={\chi }_{\alpha }\left(s\right){\chi }_{u\left(a\right)}\left(s\right)\overline{{\chi }_{u\left({a}^{\prime }\right)}\left(s\right)}$. Combining the first two characters as χα(g)χu(a)(g) = χαu(a)(g), we can now use the row character orthogonality relation ${\sum }_{g\in G}\overline{{\chi }_{\alpha }\left(g\right)}{\chi }_{\beta }\left(g\right)=\vert G\vert {\delta }_{\alpha \beta }$ to simplify the sum ${\sum }_{s\in k}{\chi }_{\alpha \cdot u\left(a\right)}\left(g\right)\overline{{\mu }_{{a}^{\prime }}\left(s\right)}=\vert k\vert {\delta }_{\alpha \cdot u\left(a\right),u\left({a}^{\prime }\right)}$ [51]. This leaves us with the final expression:

Equation (31)

We hereby arrive at the final expression above in equation (31). To calculate the lower bound on inaccessible entanglement we use the fact that the probabilities pα depend only on the values that χα takes in k, which means that each value of pα occurs $\frac{\vert G\vert }{\vert k\vert }$ times. When pα have such a degeneracy, the configuration with lowest possible entropy is that for which $\frac{\vert G\vert }{\vert k\vert }$ of the pα are equal to $\frac{\vert k\vert }{\vert G\vert }$, and the rest are 0. This leads to the lower bound on ${E}_{\mathrm{i}\mathrm{n}\mathrm{a}\mathrm{c}\mathrm{c}}=\mathrm{log}\left(\frac{\vert G\vert }{\vert k\vert }\right)$ for non-MNC phases. Combining this with the upper bound given by the size of the symmetry group, leads to the main result presented in equation (26).

4.3. Comparison with string order parameter

We show here that the string order parameter for 1D SPT phases [38] can be related to the inaccessible entanglement Einacc. The probabilities pα for each symmetry sector α are the Fourier transform of the string order parameter with identities as the end operators,

Equation (32)

where the string order is defined

Equation (33)

and OA, OB are in a set of carefully chosen operators specific to the symmetry and projective representation which allow a particular selection rule to be detected. The rule changes at the phase transition point and allows unique determination of the phase, even distinguishing different MNC phases [38, 39].

This has allowed us to give an operational interpretation to string order as well as more concretely linking Einacc to phase detection. The expression in equation (32) clarifies why inaccessible entanglement is not directly an order parameter; the missing end operators in inaccessible entanglement mean that the full information of the phase cannot be captured due to the lack of additional structure afforded, which the string order still possesses.

5. Investigation of the bounds

In this section we explore the bounds on the inaccessible entanglement in SPT states, and present numerical results to consolidate our findings. We consider the following main questions. Firstly, can states be constructed to explore the whole bound? Secondly, where do states typically live in the bound? We consider how to explicitly construct states both on the lower and upper bound, and probe the SPT phase and entanglement properties of the state. Lastly, we examine the effect of varying bond and physical dimension on the inaccessible entanglement.

We first introduce some conventions we will use in this section. When performing interpolations between states of interest, we will filter certain components of the state |Ψ[A(λ)]⟩, i.e. we choose A(λ) in the form

Equation (34)

for some set of indices I. Here and in the rest of this section, the basis set {|j⟩} is that which diagonalises u(g), such that u(g)|j⟩ = χj(g)|j⟩. The path defined by tuning parameter λ ∈ [0, 1] for the state |Ψ[A(λ)]⟩ is a particular adiabatic evolution where each MPS is the ground state of some Hamiltonian H(λ). By interpolating λ acting on a particular symmetry sector we can filter out the state's support on that sector, and effectively eliminate that symmetry action, which enables us to manipulate the symmetry of the state in a smooth, controlled manner.

Throughout this numerical investigation we mainly employ an MPS construction which generates random states in a particular SPT phase by inputting u(g) and V(g) and symmetrising a random MPS tensor. This allows us to construct generic families of states in a chosen SPT phase and to study their properties. We first generate the random, injective tensor M sampled from a Gaussian distribution of mean 0 and variance 1 over the complex numbers. We then sum over Mi with elements of the symmetry as follows,

Equation (35)

The MPS tensor defined above naturally satisfies the symmetries in equation (3) imposed by the fundamental theorem. The two crucial ingredients of the construction are the physical representation of the symmetry u(g), written as a direct sum over its linear irreps χα(g) with multiplicity mα, and the projective representation V(g), built from projective irreps Va(g) with multiplicity na. The dimension of V(g) is the bond dimension D = ∑ana dim(Va(g)) while the dimension of u(g) is the physical dimension d = ∑αmα. Note that all figures presented will display a sample of 106 states.

5.1. . Tight bound for the inaccessible entanglement

We demonstrate that there exists no tighter bound for Einacc in the trivial phase by interpolating from an example in an SPT-trivial phase to a product state, which adiabatically connects the upper and lower bound, as shown in figure 2. We will use a toy MPS construction as our example for an SPT-trivial maximally entangled state with zero accessible entanglement. With this construction, we can interpolate to a product state and hence demonstrate the tightness of the bound. The MPS tensor is given by

Equation (36)

where the indices i and j run from 1 to D, and the physical index (ij) runs from 1 to d = D2. This state is a product of maximally entangled pairs. The MPS generated by this tensor satisfies the symmetry condition of equation (3) with $u\left(g\right)=V\left(g\right)\otimes \overline{V\left(g\right)}$ and therefore V(g) can be any invertible matrix satisfying the group relations of G. For convenience we will use $V\left(g\right)={\bigoplus}_{a=0}^{D}{\chi }_{a}\left(g\right)$ to study the trivial SPT phase. Then, by the Clebsch–Gordan series the linear representation is written $u\left(g\right)={\bigoplus}_{\alpha =0}^{D}\left({\mathbb{1}}_{D}\otimes {\chi }_{\alpha }\left(g\right)\right)$.

Figure 2.

Figure 2. Inaccessible entanglement of states |Ψ[A(λ)]⟩ for a filter λ. This is implemented in two ways: firstly, for families of random states and a certain λ (scattered dots) defined by the MPS tensor in equation (35), and secondly an interpolation in λ on a particular trivial MPS construction defined in equation (36) (solid magenta line). The tensors are constructed with ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry and the interpolation on any MPS tensor A(λ) as defined in equation (34), where I = {0} is the trivial irrep. For reference, the cluster state is also displayed (red dot).

Standard image High-resolution image

We consider ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry by using the MPS tensor introduced in equation (36) with bond dimension D = 4 and physical dimension d = 16. The path we choose is the interpolation |Ψ[A(λ)]⟩ as defined in equation (34) with I = {0} to filter all but the trivial irrep which connects the highly entangled state |Ψ[A(λ = 1)]⟩ to the product state |Ψ[A(λ = 0)]⟩ in the trivial irrep, while respecting the symmetry. This interpolation smoothly connects Einacc = 2 to Einacc = 0 tuning through an irrep probability distribution ${p}_{\alpha }=\left\{\frac{1}{4},\frac{1}{4},\frac{1}{4},\frac{1}{4}\right\}$ to pα = {1, 0, 0, 0}. The example state we give is but one of many possible examples which could have produced this. As we will later show, indeed states typically saturate the upper bound, while having (close to) zero inaccessible entanglement or residing in the middle region is rare.

5.2. Typical behaviour in the MNC and trivial phase

In this section we discuss the inaccessible entanglement of states in the trivial and non-trivial (MNC) SPT phase of ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$. We begin by discussing the cluster state as a canonical example of a state in an MNC phase (the cluster phase). We comment on the allowed irrep probabilities in trivial and non-trivial SPT phases in this simple case; trivial order has no restrictions, whereas the MNC phase is fixed.

We first more exhaustively discuss the inaccessible entanglement of the cluster state, which we have calculated in section 4.1. The cluster state has pα = 1/4 ∀α, so Einacc = 2 which is the upper bound on inaccessible entanglement for this symmetry group. The cluster state is the unique ground state of the stabiliser Hamiltonian ${H}_{\mathrm{C}}=-{\sum }_{n}{\sigma }_{n}^{z}{\sigma }_{n+1}^{x}{\sigma }_{n+2}^{z}$ for sites n, and it can be prepared by a finite depth circuit of CZ = diag(1, 1, 1, −1) gates between neighbouring pairs of sites each initialised in the state |+⟩N; hence it is short-range entangled [45, 59, 60]. An MPS description of the cluster state can be given by the Pauli matrices σi, i = 1, x, y, z which has bond dimension D = 2 and physical dimension d = 4, so the linear representation has multiplicity mα = 1 for each irrep such that u(g) = ⨁αχα(g). Note that we use the notation σi for MPS constructions and σ(g) for representations, where both refer to the set of Pauli matrices. The Schmidt values of the state are $\left(\frac{1}{2},\frac{1}{2}\right)$, so E(ρ) = 2S(ρA) = 2. Therefore the accessible entanglement is zero; all the entanglement is inaccessible. Note that the factor of two comes from periodic boundary conditions; partitioning the system cuts through two bonds.

Let us now consider the rest of the cluster phase. The inaccessible entanglement persists throughout the cluster phase, as demonstrated in figure 2 by studying random states with a non-trivial multiplicity in the physical representation. In this figure we use the MPS tensor A from equation (35), where SPT-trivial states are constructed with na = 4, mα = 2 ∀a, α (bond dimension D = 8 and physical dimension d = 16), while the MNC phase is constructed with na = 4, mα = 2 ∀a, α (D = 4 and d = 16). We can view Einacc as an invariant in a particular sense since it takes the same value throughout this phase, being independent of the correlations within the junk subspace and only dependent on the part of the state in which symmetries act non-trivially. States in the cluster phase with larger bond dimension can allow more entanglement due to a non-trivial junk subspace, which allows non-zero accessible entanglement. These results provide a new angle on the cluster phase.

Let us compare the trivial phase to the MNC phase. Figure 2 demonstrates that trivial SPT order displays less restricted combinations of (Einacc, E) compared to the MNC phase; this originates from a lack of enforced structure in irrep probabilities, while the MNC phase has a fixed, degenerate probability distribution. Despite this key difference, a random state in the SPT trivial phase typically has similar (Einacc, E)-values compared to the MNC phase value, as they are generally close to the upper bound. The closer we tune random states in either phase towards the product state, the lower the entanglement gets on average, but while for the trivial phase the inaccessible entanglement also decreases on average, the MNC phase has a fixed inaccessible entanglement. Since the entanglement entropy cannot decrease below the fixed Einacc in the MNC phase, the path tuning an MNC phase to a product state would see a phase transition.

We now explore the irrep probability distributions, which can reveal crucial information about the composition of the inaccessible entanglement, as displayed in figure 3. While the MNC phase can only be realised by a degenerate probability distribution, the trivial phase is unconstrained. Although typically random trivial states have near maximal inaccessible entanglement, one can distinguish it from an MNC ordered state given enough precision on the irrep probabilities. Additionally, we emphasise that while the MNC phases of a system with a symmetry G have a fixed value for the inaccessible entanglement, this is not enough to distinguish two MNC phases from the same group G. While two such phases are mathematically inequivalent, some of their physical properties, such as the topologically protected edge mode degeneracy and entanglement spectrum, are unchanged.

Figure 3.

Figure 3. Irrep measurement probability distributions for a selection of four random states from the families displayed in figure 2, three with trivial SPT order with a filtering λ, where λ → 0 denotes tuning the state towards a product state, and one with MNC order. The MNC phase strictly contains states with a degenerate irrep distribution, whereas trivial states can have entirely different irrep probabilities. The interpolation is from an almost degenerate irrep distribution, which mimics the MNC phase, to an irrep distribution weighted only on the trivial irrep, corresponding to zero inaccessible entanglement; notice that between the λ = 1 state and the MNC phase the probabilities are not quite equal due to the different SPT order.

Standard image High-resolution image

5.3. Exploring a non-MNC phase

How does the inaccessible entanglement behave for non-MNC phases? In this part of our Investigation, we explore the properties of non-MNC phases, which have interesting characteristics compared to MNC or trivial phases, since states with this SPT order live in a finite region of the bound which is fully restricted, having a non-zero, symmetry dependent lower and upper bound, which are not equal to each other. We study the simplest symmetry hosting a non-MNC phase $G={\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$, which has ${H}^{2}\left(G,U\left(1\right)\right)={\mathbb{Z}}_{2}$.

The first point of interest is the possibility to drive states towards the lower bound by reducing the symmetry of the state to effective sub-symmetries. Secondly, we observe very little difference in the inaccessible entanglement between the trivial and non-trivial phase for random states; they both reside near the upper bound. As before, the trivial and non-trivial phases are still discriminated by the structure of irrep measurement probabilities. Finally, we make an analysis on the effect of bond dimension on the patterns of inaccessible entanglement in random states, and show that increasing D increases the variance and mean of the inaccessible entanglement. We will clarify that this is due to a significant dependence on the structure of the junk subspace.

5.3.1. Reduced effective symmetries

While in section 5.2 we showed that states in the trivial phase can be driven to the lower bound (Einacc = 0 for trivial states) simply by interpolating towards a product state, we now show that considering a larger sub-symmetry allows additional interesting behaviour. Indeed, both the trivial and the non-MNC phase can be driven towards Einacc = 2 by effectively enforcing a ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry through suppression of particular Ai in the MPS tensor A as introduced in equation (36), with u(g) = ⨁αχα(g) where mα = 1 ∀α, and with V(g) constructed with na = 2 for a ∈ {0, 1} since there are two projective irreps. We refer to Einacc = 2 as the lower bound, although it is only the lower bound for the non-trivial phase.

The non-MNC phase is depicted in figure 4. As λ → 1, random states typically live near the upper bound Einacc = 3 in either phase, while as λ → 0 states get trapped nearer the lower bound. The latter happens at comparatively low values of λ, illustrating further that typical states tend to have high inaccessible entanglement. As an aside, we do not include the value λ = 0 for which the symmetry is actually enforced, in order to be consistent with assumptions made in the derivation of the bounds, since these states will not be injective.

Figure 4.

Figure 4. Histogram of the inaccessible entanglement for the non-MNC phase of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$ in families of the random MPS tensor A with a filter λ which drives states towards an effective ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry as λ → 0. Moving through each λ value illustrates how states are gradually forced from the upper bound onto the lower bound, which corresponds to the upper bound of the trivial phase with ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry.

Standard image High-resolution image

Let us describe how we determine which irreps are filtered. We denote elements g of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$ by g = (x, y) where x = 0, 1, 2, 3 and y = 0, 1. Then, the irreps can be labelled by a pair α = 0, 1, 2, 3 and β = 0, 1 such that

Equation (37)

The irreps we filter are those for which α = 1 or 3, such that the unfiltered irreps are only faithful to a ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ subgroup generated by (x, y) = (2, 0) and (0, 1). Therefore in the limit λ → 0 the MPS effectively only has a ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry.

5.3.2. Comparing trivial to non-trivial phase

We discuss how the inaccessible entanglement is characterised in the non-MNC and trivial phase of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$, as illustrated by the following numerical results. We show that SPT trivial states generally have high inaccessible entanglement, which makes them hard to distinguish from the non-trivial states, but the lack of degeneracy in the irrep probabilities (present in the non-trivial phase) reveals their triviality. The SPT-trivial states are constructed with na = 1, mα = 2 ∀a, α (bond dimension D = 8 and physical dimension d = 16), while the non-MNC phase is constructed with na = 2, mα = 1 ∀a, α (D = 8 and d = 8).

Studying figure 5, there are some main remarks. From equation (26), the non-trivial SPT phase is bounded by 2 ⩽ Einacc ⩽ 3 whereas the trivial SPT can get arbitrarily close to zero inaccessible entanglement. Since states in the trivial phase can reach values below Einacc = 2, decreasing λ drives states towards approaching this value from below, rather than from above. States with non-MNC order meanwhile become increasingly clustered above the bound, as they cannot pass below it, as we saw earlier displayed in figure 4.

Figure 5.

Figure 5. Inaccessible entanglement versus entanglement of states in the SPT phases of $G={\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$. We study random states |Ψ[A(λ)]⟩ generated with the construction in equation (35) with a particular filtering λ effecting the sub-symmetry ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ as in figure 4, acting on three trivial and two non-MNC families of states. The non-MNC phase is restricted to within the bound 2 ⩽ Einacc ⩽ 3 whereas the trivial phase is lower bounded by zero.

Standard image High-resolution image

We demonstrate that one can actually infer SPT triviality or non-triviality from the irrep probability distributions, displayed in figure 6. Notice that non-MNC phase irrep probabilities are four-fold degenerate; this is due to only two inequivalent irreps which contribute to the calculation for the measurement probabilities pα. By contrast each irrep probability can be different in the trivial phase.

Figure 6.

Figure 6. Irrep measurement probabilities of a selection of random states picked from distributions as in figure 5 with filtering λ where λ → 0 drives states towards an effective ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$ symmetry, comparing the trivial phase to the non-MNC phase of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$. The non-MNC phase irrep probabilities are four-fold degenerate for any filtering, whereas the trivial phase gives different probabilities to each irrep in general. However, for both phases, as λ → 0 the irrep probabilities increasingly resemble the degeneracy of the MNC phase of ${\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$.

Standard image High-resolution image

Let us consider the physical insights offered by three example parameters. In each, the difference between trivial and non-trivial phase is apparent. Firstly, recall from section 5.3.2 that all states with λ = 1 have a near maximal inaccessible entanglement. The closer to saturating this value a state is, the closer to degenerate the irrep probabilities become. Therefore in the non-MNC phase, the probabilities are approximately ${p}_{\alpha }=\frac{1}{8}\;\forall \alpha $. Notably, this still differs from the behaviour in an MNC phase, as the irrep probabilities are still not completely flat, having instead a four-fold degeneracy. The degeneracy in the non-MNC phase becomes more apparent for λ = 0.3, and even more prominently with λ = 0.01 which generates the effective sub-symmetry, and echoes the irrep probabilities of the cluster phase, where ${p}_{\alpha }=\frac{1}{4}$ for half the irreps α, with the other half being zero. For all three examples, the trivial phase may have eight different irrep probabilities, which are quite similar to the non-trivial probabilities but are very unlikely to be exactly degenerate; although such states may have indistinguishable inaccessible entanglement on average compared to the non-trivial phase, it is remarkable that due to a trivial projective representation characterising the state, they lose crucial symmetry structure in the irrep probabilities.

5.3.3. Accessible entanglement in the junk subspace

We examine how inaccessible entanglement depends on the bond dimension. Clearly increasing bond dimension shifts states to a larger entanglement entropy by virtue of the tensor network construction, but it also leads to a higher average inaccessible entanglement. We consider the non-trivial SPT phase of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$, which has two projective irreps. We argue that an imbalance in the multiplicities of the two irreps leads to larger proportions of states near the upper bound of inaccessible entanglement compared to equal multiplicities. The numerics for this study are displayed in figure 7, where we construct states as in equation (35) with a constant u(g) = ⨁αχα(g) where mα = 1 ∀α but where we vary the multiplicities of V(g) and hence the junk subspace.

Figure 7.

Figure 7. Effects of different irrep distributions of V(g) for random states constructed as in equation (35) in the non-MNC phase of ${\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{2}$, with a constant u(g) = ⨁αχα(g) where mα = 1 ∀α. The labels [n0, n1] are the multiplicities of the two irreducible projective representations in V(g). The first example (blue dots) has a trivial junk subspace and is therefore limited to a line. States with uneven multiplicities on the irreps have less possible inaccessible entanglement compared to the same bond dimension which has equal multiplicities. Larger bond dimension allows more entanglement but the inaccessible entanglement remains capped at Einacc = 3, as this upper bound depends only on G.

Standard image High-resolution image

Let us first explain the significance of the junk subspace, introduced in equation (11), by considering the simple case of the MNC phase. The cluster state is represented by the MPS tensor Ai = σi which has a trivial junk subspace. In the MNC phase, the accessible entanglement is determined only by the junk subspace of the MPS tensors; a trivial junk subspace has Eacc = 0, and non-trivial subspace allows non-zero accessible entanglement. A large junk subspace, effected by higher bond dimension, has the potential to host more entanglement since the upper bound on entanglement entropy is given by the Schmidt rank which is log(D); in other words, there are more free parameters and hence more correlations are possible. By increasing the junk subspace and exploring the cluster phase Ai = Biσi for some non-trivial Bi, the inaccessible entanglement remains the same, since it depends only on the part of the state which transforms non-trivially under the symmetry, yet the entanglement and accessible entanglement can grow. We now extend this argument to a more general case.

In non-MNC phases, as opposed to MNC phases, the inaccessible entanglement is not fixed, so there is greater freedom in how the total entanglement is divided into accessible and inaccessible parts. However, the importance of the junk subspace for the accessible entanglement is still clear. As the total size of the junk subspaces in each block increases, so does the possible values of the inaccessible entanglement for a given total entanglement. Indeed, the family n = [1, 1] has no junk subspace, and we see that the inaccessible entanglement is uniquely determined by the total entanglement. Comparing the two families n = [1, 5] and n = [3, 3] reveals the same effect. Even though total bond dimension is the same, the structure of the junk subspaces is different, with the number of free parameters in the junk subspace being 1 + 5 × 5 = 26 compared to 2 × 3 × 3 = 18 respectively. In the former case, the larger number of parameters means more possible values of accessible entanglement, leading to the more spread-out distribution in figure 7. This highlights the power of the inaccessible entanglement to also capture properties due to symmetry structure on the virtual level.

6. Discussion

6.1. Restricting symmetry to a subgroup

Up until this point, we have fixed a symmetry group G and considered the inaccessible entanglement under G-LOCC for different G-symmetric states. Now, we consider the inverted scenario, in which we fix a particular state and consider G-LOCC for different symmetries G. Intuitively, reducing the number of enforced symmetries should reduce Einacc. To see this explicitly, let us take a state in an MNC phase of G and determine Einacc under H-LOCC where H is a subgroup of G. Following the calculation in section 4.1, we find that ${p}_{\alpha }=\frac{1}{\vert H\vert }$ for all α, where α now runs over the |H| irreps of H. Therefore, equation (18) gives Einacc = log(|H|). As expected, we find that Einacc decreases as smaller symmetry groups are enforced, corresponding to more of the entanglement in our fixed state becoming accessible as our LOCC becomes less restricted.

Restricting symmetries to a subgroup also effects the SPT order of a state; a state with SPT order under G symmetry may be trivial under H symmetry for HG. Yet, as demonstrated above, if we begin with a state in an MNC phase, the inaccessible entanglement under H-LOCC will always take the maximum value. For example, consider a state in an MNC phase of $G={\mathbb{Z}}_{4}{\times}{\mathbb{Z}}_{4}$. If we restrict to the subgroup $H={\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}$, the SPT order becomes trivial, but we nonetheless have Einacc = log(|H|) = 2. This provides an example of a state in a trivial SPT phase which, due to the 'hidden' presence of SPT order under a larger symmetry group, maximises Einacc in the way that would normally be expected from a state in the MNC phase. The maximal inaccessible entanglement therefore captures the underlying MNC behaviour, even though the actual SPT order is destroyed by operations which do not protect the symmetry.

6.2. Subsystem SPT order

Our results immediately apply to certain 2D subsystem SPT (SSPT) phases [43, 44]. SSPT order generalises the concept of SPT order to include subsystem symmetries, which act on rigid subsystems such as lines or fractals. As an example, the 2D cluster state [45] has subsystem symmetries corresponding to flipping every spin along a line [43, 61, 62]. These systems can often be analysed with dimensional reduction which translates the subsystem symmetry group in 2D to an extensive global on-site symmetry group of an effective 1D system [44, 6264]. Because of this, we can immediately apply our results to these phases as well.

For example, if we place the 2D cluster state on a cylinder of circumference N such that the line symmetries wrap diagonally along the cylinder periodically, we can consider each block of N × N spins as a single site, such that we get an effective 1D chain with symmetry group $G={\left({\mathbb{Z}}_{2}{\times}{\mathbb{Z}}_{2}\right)}^{N}$ [62]. For each N, this 1D system is in an MNC phase with respect to G, so our general results can be applied to show that the inaccessible entanglement will be equal to N. For the 2D cluster state, this is all of the entanglement, which shows that there is no accessible entanglement in the state if the subsystem symmetries are enforced. The above analysis, which extends to the general family of fractal subsystem SPT phases defined in references [44, 64], shows that Einacc for these subsystem SPT phases satisfies an area law in 2D.

6.3. Relation to computational power

The study of SPT order shares a remarkably symbiotic relationship with quantum computation via the paradigm of measurement-based quantum computation (MBQC) [45]. In MBQC, quantum computation is performed using single-site projective measurements on an entangled many-body state. A state is called a universal resource for MBQC if these measurements allow the circuit model of quantum computation to be efficiently simulated, with the cluster state being a canonical example. Characterising universal resource states is a fundamental open problem in MBQC. Remarkably, there is a deep connection between the MBQC universality of a state and its SPT order: many SPT phases in 1D and 2D are computational phases of matter, meaning that every state within the phase is a universal resource [42, 44, 46, 54, 55, 6264]. A question which arises naturally due to their separate connections to SPT order is the following: can inaccessible entanglement predict whether a state is computationally universal for MBQC?

One intriguing connection comes from the importance of MNC phases in each setting: these are the phases which are universal for MBQC in 1D [42, 46, 54], and they are also the phases in which Einacc is maximised in the entire phase. This connection extends to the 2D SSPT phases discussed in the previous section [44, 6264]. This suggests that a maximised value of Einacc may imply that a state is universal. However if we more closely analyse the MBQC scheme in reference [46], which utilises 1D MNC SPT phases, we see that the connection might not always be certain. In each phase, there are certain measure-zero subsets of states which are not universal, even though Einacc remains maximised within these subsets. Of course, this does not preclude the existence of a different MBQC scheme for which these subsets are universal. Indeed, a similar scheme from reference [55] comes with a different set of non-universal states which covers some of the holes left by the scheme of reference [46].

When we consider non-MNC phases, the connection becomes less clear still. In reference [65], a scheme of MBQC is introduced which utilises non-MNC phases. Crucially, unlike the MNC case, universality is not guaranteed in non-MNC phases, and is determined principally by the on-site symmetry representation u(g). To check whether the universal states within a phase can be distinguished from the non-universal ones, we took random states from each case and computed their Einacc. However, we found that there was no clear differentiating behaviour of Einacc between the two cases. This suggests that Einacc does not relate strongly to computational power beyond the MNC case.

7. Conclusion and outlook

We demonstrated that investigating the properties of G-LOCC is deeply connected to questions about phases of matter. We defined the accessible entanglement Eacc = ∑αpαEα in this setting operationally, and thereby showed that the inaccessible entanglement corresponds to the number of Bell pairs inextricable under symmetry-restricted local operations. The main result of this work is that, given a 1D system with a global onsite (finite abelian) symmetry, there is a tight bound on the inaccessible entanglement $\mathrm{log}\left(\frac{\vert G\vert }{\vert k\vert }\right){\leqslant}{E}_{\mathrm{i}\mathrm{n}\mathrm{a}\mathrm{c}\mathrm{c}}{\leqslant}\mathrm{log}\left(\vert G\vert \right)$, which depends on the symmetry group and SPT phase (via k) in question. This shows that there is always some entanglement present in non-trivial SPT phases which cannot be extracted via symmetry-respecting operations. In the maximally non-commutative SPT phases, which play an important role in measurement-based quantum computation [42, 46], we have |k| = 1, such that every state in these phases has Einacc = log(|G|). In particular, the 1D and 2D cluster states, which are highly entangled by certain measures [59, 66], have zero accessible entanglement under G-LOCC for suitable G.

We studied these bounds numerically by constructing random states in different SPT phases and calculating Einacc. We find that the whole bound can be explored, although typical states tend to have near maximal Einacc, even in the trivial phase. We characterised those states near the lower bound as those which have low weight in certain symmetry sectors, and therefore have an effective subgroup symmetry. Although it is difficult to distinguish trivial from non-trivial SPT phases by Einacc alone, we show that they can be distinguished by their irrep probabilities, which exhibit an exact degeneracy in non-trivial phases. We demonstrate that the inaccessible entanglement is the entropy of the irrep probability distribution corresponding to the Fourier transform of the string order parameter, which allows Einacc to harness some of the properties of the order parameter, and the irrep probabilities themselves are a good contender to access this information. Recent studies have accessed the entanglement spectrum of the cluster state on a noisy, intermediate-scale quantum (NISQ) computer [15, 67], and we believe a similar study could be done with our method which might prove more able to identify topological phases beyond the cluster state and illuminate their computational power.

We also affirmed the question: can 'latent' inaccessible entanglement appear due to the presence of a larger symmetry, which the description misses out on? We show that an MNC phase protected by some symmetry G can become SPT-trivial by partially violating the symmetry through restricting operations to a symmetry HG. This 'hidden' order is detected by the inaccessible entanglement, since Einacc still contains the information of the SPT phase under the original symmetry that is not detected by the entanglement alone.

Throughout this work, we have focused on 1D SPT phases, as well as 2D subsystem SPT phases via dimensional reduction. For 2D SPT phases with global symmetries, the classification is given by the third cohomology group H3(G, U(1)), and it is not clear what bounds may exist for the inaccessible entanglement. Therefore a natural future direction for investigation is to extend Einacc to PEPS.

An intriguing question is whether the inaccessible entanglement acts as a resource for a task in quantum information processing, in analogy to the super-selection induced variance (SIV) which can be viewed as a resource for quantum data hiding, introduced in reference [13]. It was found that states obeying particle number conservation can be distilled into a part containing pure SIV and a disjoint part containing pure entanglement, which we can now confirm is the accessible entanglement. The presence of SIV is a necessary condition for perfect data hiding, a protocol where classical data is hidden in such a way that it cannot be recovered by LOCC without quantum communication [14, 68]. One can ask whether these non-local quantities can be formalised into the framework of a resource theory. It is also natural to ask about the connection between the inaccessible entanglement and SIV, by extending the definition of SIV to arbitrary symmetries.

Acknowledgments

We would like to thank Nick Bultinck, David Sauerwein, and Frank Verstraete for insightful discussions and comments. DTS was supported by a fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC). This work has been supported by the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme through the ERC-StG WASCOSYS (No. 636201) and the ERC-CoG GAPS (No. 648913), by the Deutsche Forschungsgemeinschaft (DFG) under Germany's Excellence Strategy (EXC-2111 – 390814868), and by the Severo Ochoa project SEV-2015-0554 (MINECO).

Please wait… references are loading.