Local density matrices of many-body states in the constant weight subspaces
Jianxin Chen, Muxin Han, Youning Li, Bei Zeng, Jie Zhou

TL;DR
This paper investigates how the fixed total weight constraint in many-body spin states imposes strong restrictions on their local density matrices, impacting entanglement and applications in quantum information and quantum gravity.
Contribution
It characterizes the combinatorial constraints on reduced density matrices of states in constant weight subspaces, revealing limitations on entanglement structures.
Findings
Constraints on reduced density matrices due to constant weight condition
Implications for quantum marginal problems and error-correcting codes
Relevance to spin-network structures in quantum gravity
Abstract
Let be the spin- Hilbert space with -dimensional single particle space. We fix an orthonormal basis for each , with weight . Let be the subspace of with a constant weight , with an orthonormal basis subject to . We show that the combinatorial properties of the constant weight condition imposes strong constraints on the reduced density matrices for any vector in the constant weight subspace, which limits the possible entanglement structures of . Our results find applications in the overlapping quantum marginal problems, quantum error-correcting codes, and the spin-network structures in quantum gravity.
Click any figure to enlarge with its caption.
Figure 1Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
††thanks: Author to whom correspondence should be addressed: [email protected]
Local density matrices of many-body states
in the constant weight subspaces
Jianxin Chen
Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, Maryland, USA
Muxin Han
Department of Physics, Florida Atlantic University, FL 33431, USA
Institut für Quantengravitation, Universität Erlangen-Nürnberg, Staudtstr. 7/B2, 91058 Erlangen, Germany
Youning Li
Department of Physics, Tsinghua University, Beijing, People’s Republic of China
Collaborative Innovation Center of Quantum Matter, Beijing 100190, People’s Republic of China
Bei Zeng
Department of Mathematics & Statistics, University of Guelph, Guelph, Ontario, Canada
Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada
Jie Zhou
Perimeter Institute for Theoretical Physics, Waterloo, Ontario, Canada
Abstract
Let be an -particle Hilbert space, whose individual single-particle space is the one with spin and dimension . Let be the subspace of with constant weight , consisting of vectors whose total spins are . We show that the combinatorial properties of the constant weight condition impose strong constraints on the reduced density matrices for any vector in the constant weight subspace , which limit the possibility of the entanglement structures of . Our results find applications in the overlapping quantum marginal problem, quantum error-correcting codes, and the spin-network structures in quantum gravity.
I Introduction
Consider a system of particles, each with spin and dimension . The Hilbert space of the system is then , where all of the ’s are identical. For any vector , its entanglement structure can be analyzed by the reduced density matrices (RDMs) of Tóth (2007); Horodecki et al. (2009). There are, however, always restrictions on these RDMs, given by, e.g. the principle of entanglement monogamy Tóth (2007); Horodecki et al. (2009). In a more general setting, the quantum marginal problem considers the consistency of a set of given local density matrices. This problem turns out to be a hard problem even with the existence of quantum computers. On the other hand, generic states are always highly entangled, in the large- limit Hayden et al. (2006).
Besides those general analyses, there are also physical considerations that may restrict the form of , hence the entanglement structures of . For instance, ground states of local Hamiltonians would satisfy the entanglement area law, hence may be well-approximated by the tensor network representation Zeng et al. (2015); Eisert et al. (2010); Verstraete et al. (2006). States with special symmetry are also discussed such as the Dicke states and their generalizations Tóth (2007); Wieczorek et al. (2009). Stabilizer/graph states are considered in the scenario of quantum error correction and one-way quantum computing Calderbank et al. (1998); Gottesman (1997); Raussendorf and Briegel (2001); Hein et al. (2004). Very recently, states that may be represented by (restricted) Boltzman machine are considered to apply machine learning techniques to study many-body ground states Carleo and Troyer (2017).
In this work, we consider the restriction to constant weight subspaces. A state in possesses a constant weight , if it lies in the subspace which has an orthonormal basis satisfying . In the spin language, the state has a fixed -component of the total spin. These subspaces arise naturally as decoherence free subspaces under collective dephasing of the system Lidar et al. (1998) – that is, since each qubit gets a phase factor that only depends on its own weight, any constant weight state obtains a global phase for the collective dephasing. In this sense, a constant weight state is invariant under the collective dephasing noise, hence is decoherence free. Also, constant weight states are discussed in many other contexts, such as the atomic Dicke states and its generalizations. When , this subspace contains the invariant subspace of zero angular momentum, which is widely discussed in loop quantum gravity. Despite that the constant-weight condition arise naturally in these many places, the entanglement structure of these spaces has not been studied systematically.
We discuss the properties of the RDMs of constant weight states in a very general setting. We show that there exist linear conditions between the elements of RDMs, for any , and , which can be written down explicitly. Our key idea is that the combinatorial properties given by the constant weight constraint, which is mathematically a partition of , lead to such linear structures of the reduced density matrices. These conditions could find many applications. For instance, it implies that there is no perfect tensor in a constant weight subspace, for any when , which is a concept that has recently received attention from understanding quantum gravity from the quantum information viewpoint Pastawski et al. (2015); Li et al. (2017). Also, given the intimate connections between perfect tensors and quantum error-correcting codes, our results give restrictions on the achievable distance on constant-weight quantum codes. In practice, our conditions can also be used as good certificates for decoherence-free subspaces.
We organize our paper as follows. In Sec. II, we define our notions and provide background information on constant weight subspaces in the case. In Sec. III.1 we discuss the combinatorial structure of the constant weight condition that leads to our main theorem on linear relations of RDMs. In Sec. III.2, we discuss further the relationships between these linear structures. In Sec. IV, we discuss the application of our main results to the quantum marginal problem and the nonexistence of perfect tensors. In Sec. V.1, we discuss the generalization to the case. Finally, in Sec. V.2, we discuss the generalization for relaxing the constant weight condition by introducing the notion of frequency matrix.
II Preliminaries
According to the standard representation theory Fulton and Harris (2013), the study of representations of the Lie group is essentially equivalent to that of the Lie algebra . In this work, we shall use the language of the latter for simplicity.
The Lie algebra is generated by the Chevalley-Serre basis , whose Lie algebra structure is given by
[TABLE]
They act on the standard representation of by multiplication by the following matrices:
[TABLE]
These matrices are related to the Pauli matrices
[TABLE]
by
[TABLE]
The finite dimensional irreducible representations of are classified by the dimension . One has for each an irreducible representation of dimension , where is the standard representation.
Each representation of dimension , not necessarily irreducible, can be decomposed into a direct sum of irreducible representations. Moreover, there exists a Hermitian metric on such that the decomposition is orthogonal. We shall denote the dual of with respect to the Hermitian metric by , and the dual of a vector by .
According to the weight decomposition of irreducible representations, one can then find an orthonormal basis of
[TABLE]
whose weights, the eigenvalues under the action of , are
[TABLE]
respectively. Note that here the weight is 2 times the usual notion of spin. See Figure. 1 for an illustration.
We label each of the vectors in the basis for by its sub-index , and vice versa. We shall adapt this convenient convention throughout this work.
We consider in this work the tensor product
[TABLE]
where all of the components are identical to some given representation, not necessarily irreducible, say . In our following discussion, we shall consider the non-trivial case .
A basis of is then provided by , whose elements are indexed by the multi-indices corresponding to the vector
[TABLE]
The weight of this vector is easily seen to be
[TABLE]
Any vector in is then represented by
[TABLE]
We now discuss the notion of partial trace. Choose a subset of components for , and define
[TABLE]
The identity operator is equivalently represented by a unique tensor , or alternatively a unique tensor , where the notation means the linear dual in the category of vector spaces. The explicit formula for is displayed in (2.14) below.
The Hermitian metric gives an identification between the Hermitian dual and the linear dual . This identification will be assumed frequently in this work. By this identification, the element then determines an element in . Thus one can contract it with the tensor . This is equivalent to the following pairing using the Hermitian metric
[TABLE]
As priori, is only an element in , but in (2.12), we have used such identification to identify it with an element in .
Definition 1** **(Partial trace)
The partial trace of over the vector space is defined to be
[TABLE]
The above definition can be applied to a general element in which is not necessarily of the form .
Writing , where runs over the index set for the orthonormal basis of and over that for , we then have
[TABLE]
The notation stands for the cardinality of the index set .
Hence (hereafter )
[TABLE]
Example 2
Consider the case. Given a state , taking partial trace over can be calculated by
[TABLE]
With respect to the basis we have chosen, is naturally represented by its entries
[TABLE]
The tensor has rank one, hence the dimension of its kernel is . Taking the partial trace over would at most increase the rank of the resulting partial trace by : forgetting about the component in would at most decrease the dimension of the kernel by . Therefore, the rank of has an upper bound
[TABLE]
In order that the partial trace, as an element in , has full rank, the following condition has to be met
[TABLE]
In the present case, all of the components are isomorphic representations. Hence the above condition reduces to
[TABLE]
Intuitively, one must contract enough components in order for the resulting partial trace to have possibly maximal rank.
III Combinatorics in partial trace on the constant weight subspace
We shall discuss in this section some combinatorial structure of partial trace and of the constant weight subspace, based on which we shall discuss some applications in Section IV .
Among the entries in the partial trace (2.17), of particular interest are the diagonal ones
[TABLE]
We fix for some . Writing the index set as , where is a multi-index and, . Then the diagonal pieces of the partial trace over are represented by the entries
[TABLE]
An element takes the form . By moving the position of from to a position valued in the set which symbolically is denoted by , we get similarly the quantities. To be more precise, denote
[TABLE]
then we have
[TABLE]
Here the notation means the index is omitted. For simplicity, we denote and . Since the sub-index of already contains the information , we can denote for convenience .
Later we shall consider
[TABLE]
where indicates that the index labels different basis vectors in .
III.1 Combinatorial identity in the constant weight subspace
After restricting to the constant weight subspace of consisting of vectors of weight , an index that appear in the sum (3.4) corresponds to a -tuple , where is the weight of the vector labeled by for . The constant weight condition is translated to the condition that is a solution to the equation
[TABLE]
where the subindex of labels different components , and the subindex of labels different basis vectors in each . We denote the latter set of solutions by .
Note that different elements in can correspond to the same partition: permuting an -tuple can give a different -tuple but they correspond to the same partition. After modulo the action by the symmetry group , the set of cosets is then in one-to-one correspondence with the set of partitions (with all elements in a partition valued in ) of the following function of weight() and
[TABLE]
More precisely, any element in the set , denoted by , is given by a partition
[TABLE]
Here is the frequency of appearing in the partition, which is independent of the choice of the representative of the coset . They are subject to the conditions that
[TABLE]
Therefore, we get the following result.
Lemma 3
There exists a nonzero solution to the equation
[TABLE]
An explicit one is given by
[TABLE]
Remark 4
A natural question is about the uniqueness of the solution. This will be addressed in Section V.2 below using the notion of frequency matrix.
Example 5
Take . Then and for . Consider the case . Labeling the basis in by spin, which is half of the eigenvalue of acting on , we then have the following
[TABLE]
We can now prove the following theorem.
Theorem 6
Consider the constant weight subspace of consisting of vectors of weight . Fix an integer and an index such that the set of solutions to (3.5) is non-empty. Then there exists a nonzero solution to the equation
[TABLE]
where indicates that labels different basis vectors in .
Proof.
Straightforward computation as in (3.4) shows that
[TABLE]
After interchanging the order of summation on and , one would obtain
[TABLE]
Now we restrict ourselves to the constant weight subspace and hence replace the multi-index by a solution given in (3.5). Then the LHS in (3.12) gives
[TABLE]
Theorem 6 is then equivalent to the vanishing of (3.13) above.
We define to be the set of distinct values in the entries of . This gives a function on the set of solutions. It is obvious that it is invariant under the action by the group and hence descends to a function on the set of partitions. We then define to be for any representation of . Therefore,
[TABLE]
For any partition , if , then automatically. It follows that
[TABLE]
This is vanishing due to the equation for any , as proved in Lemma 3.
\sqcap$$\sqcup
The above results exhibit only part of the combinatorial properties in partial trace. The actual combinatorial structure in partial trace is much richer. For example, the quantity considered in (3.4) is closely related to
[TABLE]
whose -diagonal entry is
[TABLE]
In particular, if we take , then defines an element in and we have
[TABLE]
The summation of the above over gives the further trace over . We therefore have
[TABLE]
When combined with Theorem 6, this will be useful in the applications discussed in Section IV below where we shall prove that the converse statement is also true.
III.2 The relation between different
For different choices of , the patterns in the combinatorics of the partial trace shown in Lemma 3 in fact only depends on the cardinality of .
For different values of , Theorem 6 gives different sets of relations. We shall show in this section that the most informative one is the one with largest possible subject to the condition (the least possible number of components being traced out according to (2.20)), the others are its consequences.
Fixing , consider another value such that . Our argument is by induction. Hence we shall assume for now that . We single out the component in . Assume it is the first component, by permutation or relabeling if necessary.
Recall that the relations in Lemma 3 is about the combinatorics of . We now show that the solution given in (3.10) implies the solution . We start with the fact that each of the partitions satisfies
[TABLE]
Here the existence of is guaranteed by induction hypothesis. Later we shall see that the solution given in (3.10) is a natural one consistent with the induction procedure.
The goal is then to prove the existence of such that the ′-version of the above equations are satisfied, for any .
Choose a value for the first component in the process of taking partial trace over the components. We can then classify into two sets: one involves and the other one does not. For those not involving the specified , it must involve some other value . Then we apply the following same reasoning to .
If we can prove the result for any possible value of , then by exhausting all the possible values for , we are done with the checking for any , as any must be of the form for some .
Hence it suffices to consider those involving any fixed value , for which we have , with
[TABLE]
We set
[TABLE]
for some . We want it to depend only on the numbers being partitioned and so that we can proceed by induction.
Now we compute
[TABLE]
We set
[TABLE]
and
[TABLE]
This then does the job . In fact, from this one can see that is independent of . Furthermore, one has from the above and (3.20) that
[TABLE]
Hence it keeps the pattern for shown in (3.21) unchanged. Therefore, one can proceed by induction.
IV Applications
Theorem 6 is a strong structural condition on the partial trace . One immediate application is for the overlapping quantum marginal problem when restricting to the constant weight subspace. For overlapping quantum marginal problem, very few results were known Chen et al. (2014, 2016) and most of them can only be applied to small systems. To the best of our knowledge, no further conditions are known if we restrict the pre-image to lie in a given subspace.
To make things precise, we first give the definitions of density operator and density matrix, which are the practical notions in talking about distributions in probability theory.
Definition 7** **(Density operator and density matrix)
Suppose is a Hermitian vector space. A density operator is an element in satisfying
- •
It is normalized in the sense that .
- •
It is a self-adjoint, positive definite operator.
Fixing an orthonormal basis for , then the density operator is represented by a matrix called the density matrix. The self-adjoint property translates into the property that the density matrix is Hermitian. We denote its diagonal entries by
[TABLE]
For example, for any unit norm vector , the operator gives a density operator.
IV.1 Quantum marginal problem
The quantum marginal problem is formulated in the following way. Consider the Hermitian vector space . For each subset , define
[TABLE]
Given a collection of density operators , consisting of one density operator(called two-body below) for each , we want to ask whether there exists a density operator on , supported on the subspace of constant weight , such that its partial trace over satisfies the following relation
[TABLE]
When there exists such a , then is a state in the constant weight subspace .
If not, then there could be two possibilities:
-
there does not exist at all, either on the constant weight subspace or not;
-
there exist some global states but none of them is in a constant weight subspace.
Our results of Theorem 6 directly give necessary conditions for this problem. With respect to some given orthonormal basis of of the form (2.8), which is induced by those on the components , the diagonal entries of are given by . If (4.3) is true, then these diagonal entries must coincide with the ones defined in (3.1) in Section III. Hence one must have, for the solution given in (3.10) (which in particular depends on ), the following relations provided in (3.11):
[TABLE]
as well as the relations obtained by moving the index set inside .
For instance, we can take , our result then leads to a new necessary condition for the set of the density operators having a lift into a constant weight subspace:
[TABLE]
These linear constraints cannot be obtained from the trivial conditions
[TABLE]
Here is another closely related problem. Assuming that indeed descends from a density operator , we want to know to what extent we can know the property of (e.g., deviation from being supported on a constant weight subspace) from the condition (4.5) and its permutations.
We now show that the necessary condition (4.5) and its permutations provided by Theorem 6 is actually sufficient, provided that the above assumption that descends from a density operator is met. Note that the condition (4.5) and its permutations are much weaker than the set of relations obtained by permuting (4.4).
To see this, we assume that (4.5) and its permutations are met for a set of given by (3.10) for some ,
[TABLE]
Then we get
[TABLE]
We first decompose into a sum of its projections to the constant weight subspaces
[TABLE]
Then since different ’s are orthogonal, we have
[TABLE]
Denote the diagonal matrices of by . Then we have for the diagonal entries that
[TABLE]
Applying Theorem 6 to each component , we get
[TABLE]
This gives
[TABLE]
On the other hand, from (4.8), (4.11), we also have
[TABLE]
One can change the order of summation on and and get
[TABLE]
Taking the difference between (4.13) and (4.15), we obtain
[TABLE]
Simplifying this relation a little further, we get
[TABLE]
The combinatorics in (3.16) tells that
[TABLE]
Then it follows from (4.17) that
[TABLE]
In particular, a consequence of this says that the expectation value of the operator on the density operator is the same as that of the constant operator . Here acts nontrivially on only, hence must be diagonal since is in the Cartan subalgebra.
[TABLE]
We remark that (4.20) is in fact stronger than this. From (2.17) we can see that only have diagonal terms: this is special as the leftover after the partial trace has only one component. Therefore, (4.20) actually means that the following two are equivalent operators (contrasting (4.6))
[TABLE]
Taking further the partial trace over then yields (4.21).
We have shown in (4.22) that
[TABLE]
Permuting the index from to gives
[TABLE]
Multiplying this by a polynomial operator , and summing over , we then get
[TABLE]
Taking gives
[TABLE]
Taking yields
[TABLE]
Combining the above two, we get
[TABLE]
This can be true only when is supported on the constant weight subspace .
Hence we have shown that one can determine whether a state is supported on a constant weight subspace by all of its two-body local information. The proof above also shows that the vanishing of fluctuation of would give another necessary and sufficient condition to this problem. However, in the case leakage exists, our method gives a more practical and powerful criteria than the mean and fluctuation method.
IV.2 Perfect tensor
As another concrete example of our applications, we now use our conditions to study the notion of perfect tensor, which is recently widely studied in the theory of AdS/CFT, and is understood as an interesting proposal to realize the holographic principle in many-body quantum systems. Perfect tensors can build tensor network state exhibiting interesting holographic correspondence Pastawski et al. (2015). In particular, the tensor network made by perfect tensors derives the Ryu-Takayanagi formula of holographic entanglement entropy, namely, the entanglement entropy of the boundary quantum system equals the minimal surface area in the bulk Qi (2013); Han and Hung (2017).
Furthermore, recently it has been shown that perfect tensors can represent quantum channels which are of strongest quantum chaos Hosur et al. (2016). The quantum transition defined by perfect tensors turns out to maximally scramble the quantum information such that the initial state cannot be recovered by local measurements. It has also been suggested that a perfect tensor should represent the holographic quantum system dual to the bulk quantum gravity with a black hole.
Definition 8** **(Perfect tensor)
A vector is called a perfect tensor if for all possible choices satisfying , the condition
[TABLE]
is satisfied for some non-vanishing constant .
The following result follows from Theorem 6.
Theorem 9
Fixing , then for any , there does not exist a perfect tensor in the constant weight subspace with weight .
Proof.
We prove by contradiction. Suppose there exists a perfect tensor . We can then take with cardinality such that the condition in (2.20) is fullfilled. That is,
[TABLE]
Then according to Definition 8, one must have
[TABLE]
for some non-vanishing constant . It is easy to see that only depends on the cardinality of : the further trace over should give a multiple of the identity endomorphism which is independent of the choice of .
We now consider the entries constructed in (3.2). All of them are equal to which without loss of generality can be normalized to . Then we have
[TABLE]
We now show that if , that is, the set is nonempty, then there always exists such that
[TABLE]
The condition requires according to (4.30). To check the condition (4.33), we compute
[TABLE]
Due to the structure theory of representations, one has . Hence the condition boils down to
[TABLE]
This can always be satisfied by choosing a suitable , which is contradictory with the claim in Theorem 6. Hence there does not exist such a perfect tensor. \sqcap$$\sqcup
Perfect tensors also have an intimate connection to quantum error-correcting codes Raissi et al. (2018). An -spin perfect tensor can be equivalently viewed as a length- quantum error-correcting code encoding a single quantum state, with the code distance . Our results hence indicates in the constant weight subspace, there is no such code exist.
We will now use our results to further understand the existence of invariant perfect tensors. Invariant tensors are the tensors in with vanishing total angular momentum. They play an important role in the theory of loop quantum gravity Han et al. (2007); Rovelli and Vidotto (2014), and particularly the structure of Spin-Networks Penrose (1971); Rovelli and Smolin (1995). Spin-network states, as quantum states of gravity, are networks of invariant tensors, and represent the quantization of geometry at the Planck scale. Classically an arbitrary three-dimensional geometry can be discretized and built piece by piece by gluing polyhedral geometries. The spin-network state built by invariant tensors quantizes the geometry made by polyhedra. As the building block of spin-network, the -valent invariant tensor represents the quantum geometry of a polyhedron with faces. The reason in brief is that the quantum constraint equation (vanishing total angular momentum) is a quantum analog of the polyhedron closure condition in three-dimensional space (see e.g. Appendix A in Li et al. (2017) for details).
Given that both invariant tensors and perfect tensors relate to quantum gravity from different perspectives, it is interesting to incorporate the idea of perfect tensors with that of invariant tensors, and define a new concept that we call invariant perfect tensor.
Definition 10** **(Invariant perfect tensor)
A nonzero vector is called an invariant tensor if
[TABLE]
A nonzero vector is called an invariant perfect tensor if it is both perfect and invariant.
A partial study of invariant perfect tensors has been carried out in Li et al. (2017), which shows that at invariant tensors are always perfect, but strictly there is no invariant perfect tensor at , although invariant tensors generically approximate perfect tensors asymptotically in large .
The result in Theorem 9 generalizes the conclusion for invariant perfect tensor to arbitrary . Since invariant tensors live in the constant weight subspace, we obtain the following.
Corollary 11
There does not exist invariant perfect tensor for any , for .
invariant tensors are employed in spin-network states for 2+1 dimensional gravity, while invariant tensors build spin-network states for 3+1 dimensional gravity Perez (2003); Baez (1998). The above results show that the entanglement exhibited by the local building block of quantum gravity (at Planck scale) is not as much as a perfect tensor. So the holographic property of quantum states is obscure at the Planck scale. The holography displayed by quantum gravity at semi-classical level then suggests that in order to understand quantum gravity using tensor networks, the entanglement of perfect tensor, as being important to understand holography, should be a large scale effect coming from coarse-graining the Planck scale microstates. Namely although the perfect tensor is missing at the Planck scale, it may emerge approximately at the larger scale, and makes tensor networks demonstrate holography. This idea is very much consistent with the recent proposal in Han and Hung (2017), which shows the spin-network states in 3+1 dimensions can indeed give tensor networks exhibiting holographic duality at the larger scale. Then it is interesting to understand how (approximate) perfect tensors emerge from non-perfect invariant tensors via coarse-graining from the Planck scale to larger scale. The research in this perspective will be reported in a future publication.
V Generalizations and extensions
V.1 Generalization to
We have considered in the above the case where is the tensor product of copies of a not necessarily irreducible representation of . We now generalize this to the case.
Consider , where all of the ’s are given by the same irreducible representation of of dimension . Suppose a basis of the Cartan subalgebra of is given by . One then has the weight space decomposition
[TABLE]
where is the weight space and is the eigenspace with the weight vector , that is
[TABLE]
In particular, the action of any element in the Cartan subalgebra, symbolically denoted by , is diagonal on and hence on .
The above decomposition is orthogonal. We choose an orthonormal basis whose eigenvalues under are given by .
The constant-weight condition becomes the condition that under the action of the Cartan subalgebra generated by , the weight vector is constant, say . In particular, the weight under is the fixed number .
Then everything discussed in the case follows. The same reasoning also works when is not irreducible, in which case a similar orthogonal decomposition in (5.1) still exists, thanks to the structure theory for finite dimensional representations of the Lie group .
This then shows that there is no perfect tensor in a constant weight subspace for the group when .
V.2 Relaxing the constant weight subspace condition
We now discuss to what extent one can relax the constant weight condition.
Recall that the combinatorics in partial trace allows one to pass from the space to its quotient . What makes the proof in Theorem 9 work is the relation (3.9) in Lemma 3
[TABLE]
with the condition in (4.33)
[TABLE]
The condition
[TABLE]
is automatically satisfied, according to (3.8) which follows from the definition of .
Suppose we impose a certain constraint which is not necessarily the constant weight condition. Assume that the set of vectors satisfying this constraint, required to be independent of the ordering of the components, is indexed by the set . Denote the cardinality of the quotient by . Then the non-existence of perfect tensors in the space would follow if the following conditions are satisfied
[TABLE]
We fix a set of representatives for , and denote the matrix of frequencies by
[TABLE]
Then the above two equations become the conditions for the vector
[TABLE]
We denote to be the matrix obtained by adding a row of ’s below the -th row of . The existence of such a vector is equivalent to the condition that
[TABLE]
Example 12
Consider the case where each in is the irreducible representation of dimension . We put the constant weight condition. This is the main interest in this work. In this case, it is straightforward to show that the cardinality of is
[TABLE]
where are formal parameters with grading respectively, and is the sum of the coefficients of the grading- terms in the Taylor expansion of near . Lemma 3 applies to this case.
The existence of a non-trivial solutions tells that . In fact, more is known and we can show that for generic and . For simplicity we consider the case where each in is the irreducible representation of with dimension . The general case where is not irreducible is similar.
Now according to (3.8), we see that if is a certain partition in , then the following is also a partition if
[TABLE]
where are subject to the condition that . Furthermore, one also has the combinations
[TABLE]
The former gives a genuine partition provided the relation can be satisfied, which is the case when . The latter is similar. We shall refer to the case the generic case, the others are isolated cases which can be dealt with easily.
We then take the frequency vectors corresponding to the partitions in the set
[TABLE]
By computing the determinants inductively, it is easy to see that the corresponding frequency vectors span a vector space of dimension at least . Combing the relation implied by Lemma 3, we are then led to the conclusion that for generic .
Example 13
As another example, we put the constraint
[TABLE]
where , are the weights of the basis . The solution to (5.6) then exists if we choose suitably.
Acknowledgments
We thank Markus Grassl for helpful discussions. J. C. was supported by the Department of Defence. M. H. acknowledges support from the US National Science Foundation through grant PHY-1602867, and Start-up Grant at Florida Atlantic University, USA. Y. L. acknowledges support from Chinese Ministry of Education under grants No.20173080024. B. Z. is supported by NSERC and CIFAR. J. Z. was supported in part by Perimeter Institute for Theoretical Physics. Research at Perimeter Institute is supported by the Government of Canada through Innovation, Science and Economic Development Canada and by the Province of Ontario through the Ministry of Research, Innovation and Science.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Tóth (2007) G. Tóth, Journal of the Optical Society of America B 24 , 275 (2007).
- 2Horodecki et al. (2009) R. Horodecki, P. Horodecki, M. Horodecki, and K. Horodecki, Reviews of modern physics 81 , 865 (2009).
- 3Hayden et al. (2006) P. Hayden, D. W. Leung, and A. Winter, Communications in Mathematical Physics 265 , 95 (2006).
- 4Zeng et al. (2015) B. Zeng, X. Chen, D.-L. Zhou, and X.-G. Wen, ar Xiv preprint ar Xiv:1508.02595 (2015).
- 5Eisert et al. (2010) J. Eisert, M. Cramer, and M. B. Plenio, Reviews of Modern Physics 82 , 277 (2010).
- 6Verstraete et al. (2006) F. Verstraete, M. M. Wolf, D. Perez-Garcia, and J. I. Cirac, Physical review letters 96 , 220601 (2006).
- 7Wieczorek et al. (2009) W. Wieczorek, R. Krischek, N. Kiesel, P. Michelberger, G. Tóth, and H. Weinfurter, Physical review letters 103 , 020504 (2009).
- 8Calderbank et al. (1998) A. Calderbank, E. Rains, P. Shor, and N. Sloane, IEEE Transactions on Information Theory 44 , 1369 (1998).
