Correlation length in random MPS and PEPS
C\'ecilia Lancien, David P\'erez-Garc\'ia

TL;DR
This paper investigates the typical correlation properties of random translation-invariant MPS and PEPS, showing they generally exhibit exponential decay of correlations with large spectral gaps, which has implications for understanding generic features of quantum many-body states.
Contribution
It provides a quantitative analysis demonstrating that random translation-invariant MPS and PEPS usually have exponential decay of correlations and large spectral gaps, revealing generic features of these states.
Findings
Random MPS and PEPS typically have exponential decay of correlations.
Parent Hamiltonian and transfer operator usually have a large spectral gap.
Results include quantitative estimates with optimal dependency on dimensions.
Abstract
Tensor network states are used extensively as a mathematically convenient description of physically relevant states of many-body quantum systems. Those built on regular lattices, i.e. matrix product states (MPS) in dimension 1 and projected entangled pair states (PEPS) in dimension 2 or higher, are of particular interest in condensed matter physics. The general goal of this work is to characterize which features of MPS and PEPS are generic and which are, on the contrary, exceptional. This problem can be rephrased as follows: given an MPS or PEPS sampled at random, what are the features that it displays with either high or low probability? One property which we are particularly interested in is that of having either rapidly decaying or long-range correlations. In a nutshell, our main result is that translation-invariant MPS and PEPS typically exhibit exponential decay of correlations at…
Peer 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.
Correlation length in random MPS and PEPS
Cécilia Lancien, David Pérez-García
Cécilia Lancien: Institut de Mathématiques de Toulouse & CNRS, Université Paul Sabatier, F-31062 Toulouse Cedex 9, France.
David Pérez-García: Departamento de Análisis Matemático, Universidad Complutense de Madrid, 28040 Madrid, Spain & Instituto de Ciencias Matemáticas, 28049 Madrid, Spain.
(Date: April 27th 2021)
Abstract.
Tensor network states are used extensively as a mathematically convenient description of physically relevant states of many-body quantum systems. Those built on regular lattices, i.e. matrix product states (MPS) in dimension and projected entangled pair states (PEPS) in dimension or higher, are of particular interest in condensed matter physics. The general goal of this work is to characterize which features of MPS and PEPS are generic and which are, on the contrary, exceptional. This problem can be rephrased as follows: given an MPS or PEPS sampled at random, what are the features that it displays with either high or low probability? One property which we are particularly interested in is that of having either rapidly decaying or long-range correlations. In a nutshell, our main result is that translation-invariant MPS and PEPS typically exhibit exponential decay of correlations at a high rate. We have two distinct ways of getting to this conclusion, depending on the dimensional regime under consideration. Both yield intermediate results which are of independent interest, namely: the parent Hamiltonian and the transfer operator of such MPS and PEPS typically have a large spectral gap. In all these statements, our aim is to get a quantitative estimate of the considered quantity (generic correlation length or spectral gap), which has the best possible dependency on the physical and bond dimensions of the random MPS or PEPS.
Key words and phrases:
Non-asymptotic theory of random matrices and random tensor networks, Many-body quantum systems, Decay of correlations.
Contents
-
1.3 Summary of our main results and connections with previous works
-
2 Typical spectral gap of the parent Hamiltonian of random MPS and PEPS
-
3 Consequence: Typical correlation length in random MPS and PEPS
-
3.1 Rough upper bound on the typical correlation length via the detectability lemma
-
3.2 Tighter upper bound on the typical correlation length via a refined Lieb–Robinson bound
-
4 Typical spectral gap of the transfer operator of random MPS and PEPS
-
5 Consequence: Typical correlation length in random MPS and PEPS
1. Introduction
1.1. Motivations
One of the main practical problems when dealing with many-body quantum systems is the curse of dimensionality: a system composed of -dimensional particles has dimension , a number of degrees of freedom too large to handle in most computations as soon as more than a few particles are involved. However, it is known that, in many contexts, physically relevant states of many-body quantum systems are actually well approximated by states living in a very small subset of the whole exponentially large state space, namely the one of tensor network states. Intuitively, these should be a mathematically convenient way of representing states of systems composed of many sub-systems having a certain geometry and subject to interactions respecting this geometry.
Tensor network states are constructed as follows: Given a non-oriented graph with vertex set and edge set , we put at each a tensor , where denotes the degree of (i.e. the number of edges at ). We get in this way a tensor . Then, we contract together the indices of corresponding to a same edge to obtain a tensor . The -dimensional indices are thus called bond indices while the -dimensional ones are called physical indices. This construction procedure is exemplified in Figure 1 (using a graphical representation of tensors to be explained in more details afterwards). It is clear from the construction that tensor network states have the practical advantage of requiring few parameters to be described: if has vertices, each of them having degree at most , then the resulting tensor network state is described by at most parameters, which is linear rather than exponential in .
Often the underlying graph is taken to be a regular lattice. The corresponding tensor network state is then usually referred to as a matrix product state (MPS) in dimension and a projected entangled pair state (PEPS) in dimension or higher. MPS and PEPS are especially interesting in the context of condensed matter physics. Indeed, it is rigorously proven in some cases and conjectured in others that they are good approximations of ground states of gapped local many-body Hamiltonians [28, 29, 3, 37]. They are therefore used (amongst other) as Ansatz in ground energy computations, allowing for optimization over a tractable number of parameters, even when a large number of particles are involved. They have also been used very successfully to obtain analytical results concerning the understanding and classification of quantum phases of matter (see [17] for a recent review on this topic).
This brings us to the general problem we are interested in, which is, very broadly speaking, the following: are common beliefs about MPS and PEPS at least true generically? Or to rephrase it a bit more precisely: which features of MPS and PEPS are typical and which are exceptional? The kind of features that we have in mind include: being the ground state of a parent Hamiltonian which is either gapped or gapless, exhibiting either rapidly decaying or long-range correlations etc. One possible route to tackle this question is to sample MPS and PEPS at random (in a way which should be as physically relevant as possible) and study what are the characteristics that these generically display.
Note that random tensor network states have already been successfully studied in the context of holography. Indeed, tensor network states also provide a natural framework for studying AdS/CFT correspondence. And it turns out that random ones actually reproduce several conjectured properties in this theory [34] (see also [32] for a pioneer work in this direction). Finally, let us point out that the formalism of tensor networks has also been recently applied in several areas beyond quantum physics: machine learning [14, 15], PDEs [7, 21], finance [42] or signal processing [21]. The underlying reason is again the fact that tensor networks can parametrize efficiently highly complex multidimensional tensors.
In this work, we will be looking at a Gaussian model of random tensor network states (described rigorously below). The main reason for this is that it is arguably the first model that one should look at. Indeed, the most important take-home message from standard random matrix theory is that all ‘sufficiently well-behaved’ random matrix models exhibit features which are somehow similar to that of their Gaussian counterpart. It is thus not unreasonable to conjecture that the same should be true for at least some of the properties of random tensor network states that we study. The Gaussian setting has the advantage of allowing for the use of powerful tools to compute averages explicitly and of often displaying provably strong concentration around these averages. So it really serves as a benchmark for other settings, where we might expect averages to be of the same order of magnitude (but where concentration is usually much weaker). Even in terms of proof techniques, it is often the case that results on a given random matrix/tensor model are established by first showing that it can be suitably compared to a Gaussian model, and then using the known result for the latter. Hence, as a first investigation of the question of typical spectral gaps and correlation lengths in random tensor network states, it does make sense to start with a Gaussian model.
1.2. The model
In the sequel, we will always denote by the physical dimension and by the bond dimension. We will use the following graphical notation: A vertex with brown edge and grey edges represents a random vector in whose entries are independent complex Gaussians with mean [math] and variance , as exemplified in Figure 2.
Two such diagrams next to one another represent the tensor product of the corresponding vectors, while two merged edges represent the contraction on the corresponding indices. And when arrows are added on some edges of a given diagram it means that it has to be viewed as an operator rather than a vector (the direction of the arrows indicating which are the input and output spaces). Finally, we will be facing the case at some point where copies of play the same role, and we will for simplicity replace the corresponding grey edges by thick grey edge. All these ‘composition’ and ‘decoration’ operations on Gaussian diagrams are illustrated in Figure 3.
In the -dimensional case, we construct a random translation-invariant MPS (with periodic boundary conditions) in the following way: We pick as -site tensor
[TABLE]
where the ’s are independent complex Gaussians with mean [math] and variance . We then repeat it on sites disposed on a circle and contract consecutive bond indices to obtain an -site MPS . The corresponding transfer operator on is obtained by contracting the -dimensional indices of and . It can thus be written as
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance .
This random MPS construction is illustrated in Figures 4 and 5. The choice of variance for our Gaussian -site tensor might appear odd at first sight. However, as we will see later, it is precisely with this variance that the resulting random MPS is with high probability close to having norm (i.e. to actually being a state).
Similarly, in the -dimensional case, we construct a random translation-invariant PEPS (with periodic boundary conditions) in the following way: We pick as -site tensor
[TABLE]
where the ’s are independent complex Gaussians with mean [math] and variance . We then repeat it on sites disposed on a torus and contract consecutive bond indices (in both row and column directions) to obtain an -site PEPS . This means that its contraction on an -site column is
[TABLE]
The corresponding transfer operator on is obtained by contracting the -dimensional indices of and . It can thus be written as
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance .
This random PEPS construction is illustrated in Figure 6. Just as in the MPS case, the seemingly odd choice of variance for our Gaussian -site tensor is only to guarantee that the resulting random PEPS is with high probability close to having norm .
Later on in the paper, to simplify notation, we may sometimes write indices running from to modulo , i.e. identify index with index and index [math] with index .
In what follows, we will denote by the maximally entangled unit vector. Letting being the canonical orthonormal basis of , the latter is defined as
[TABLE]
An important property of MPS and PEPS is injectivity, and more generally normality. Let us start by recalling the definition of these terms.
Definition 1.1** (Injectivity and normality).**
An MPS, resp. a PEPS, is called injective if its -site tensor, viewed as a linear map from the bond space to the physical space, i.e. from to , resp. from to , is injective. It is called normal if there exists an integer , resp. integers , such that after blocking together segments of sites, resp. rectangles of sites, it becomes injective.
Let us see what the above definition means concretely in our case. The random MPS defined by the -site tensor of equation (1) is normal if there exists such that the following map is injective:
[TABLE]
And the random PEPS defined by the -site tensor of equation (3) is normal if there exists such that the following map is injective:
[TABLE]
If , resp. , then the random MPS, resp. PEPS, is injective.
Fact 1.2**.**
Our random MPS and PEPS, with -site tensor as defined by equations (1) and (3) respectively, are almost surely normal.
Additionally, we also have more precisely that, if , resp. , then our random MPS, resp. PEPS, is almost surely injective.
Proof.
The first general statement follows from [39, Theorem 3.4], which says that the set of -site tensors on , resp. , giving rise to a non-normal MPS, resp. PEPS, is a proper sub-manifold of the space of all -site tensors.
The second more specific statement is immediate once noticed that the -site operators and are simply Gaussian operators:
[TABLE]
Hence they are almost surely injective as soon as their output dimension is larger than their input dimension. ∎
Having identified the dimensional regime where our random MPS and PEPS are almost surely injective (namely and ) will be of great importance for us later on. Indeed, if an MPS or a PEPS is injective, then [18, Theorem 3] tells us that it is guaranteed to be the unique ground state of its parent Hamiltonian, which additionally takes the simplest possible form. This fact will be particularly useful to us in Section 2, where we need to estimate the typical spectral gap of the random MPS and PEPS parent Hamiltonians (and where it is explained in detail how these local Hamiltonians are constructed).
What is more, we know from [16, Footnote 1] that the normality of an MPS or a PEPS implies the irreducibility of the corresponding transfer operator. Hence, as a consequence of Fact 1.2 we get that as defined in equation (2) and as defined in equation (5) are almost surely irreducible. This fact will be crucial for us in Section 4, where we have to estimate the typical spectral gap of the random MPS and PEPS transfer operators.
1.3. Summary of our main results and connections with previous works
As already said, our goal in this work is to study what are the features that our models of random translation-invariant MPS and PEPS, with -site random tensors respectively defined by equations (1) and (3), typically exhibit. We are particularly interested in understanding what is their typical correlation length. We try to tackle this question through two distinct strategies. Both ultimately boil down to determining what is the typical spectral gap of a random operator associated to our random tensor network states: either their parent Hamiltonian or their transfer operator. The first approach, through the study of the parent Hamiltonian has the advantage of yielding results which are true for any system size for both MPS and PEPS, but the disadvantage of applying only to injective MPS and PEPS. On the contrary, the approach through the transfer operator has the advantage of being valid beyond the injectivity regime, but the disadvantage of giving results which depend on the system size in the PEPS case. So they somehow complement each other.
The overall merit of our various results could perhaps be summarized as follows: In the -dimensional case, none of them is qualitatively surprising. What is interesting is that we are able to prove quantitative lower bounds on the generic spectral gap of the random parent Hamiltonian and transfer operator, in terms of the physical and bond dimensions (which translate into quantitative upper bounds on the generic correlation length of the random MPS). In the -dimensional case though, nothing was known (and there was not even a consensus on what should be expected). So already the qualitative result that, in some range of physical and bond dimensions, random PEPS generically exhibit exponential decay of correlation is relevant in its own.
First, in Section 2, we place ourselves in the injectivity regime of our random tensor networks, i.e. in the case of MPS and in the case of PEPS, where it makes sense to talk about their canonical parent Hamiltonian. The latter is precisely defined in Section 2. For now, let us just say that it is a -local (nearest-neighbour interaction) Hamiltonian which is frustration-free and has the MPS or PEPS as unique ground state. We are able to show that, at least in a ‘super-injectivity’ regime, this parent Hamiltonian has with high probability a large spectral gap. More precisely, we obtain the following result, which appears as Theorems 2.12 (for the case of MPS) and 2.19 (for the case of PEPS).
Theorem 1.3**.**
Let . Denote by , resp. , the parent Hamiltonian of our random MPS, resp. PEPS. If for some , then
[TABLE]
and if for some , then
[TABLE]
where are universal constants.
In words, Theorem 1.3 tells us the following: as grow, with , resp. , it holds that, with probability going to , the spectral gap of , resp. , is going to (at least) . Let us point out immediately that the constraints on the scaling of with respect to are likely to be far from optimal. It is indeed clear when looking at the whole reasoning in Section 2 that, in several steps, we use general bounds that might be rough in our particular case. It seems however that getting better ones could require a very careful analysis, that we do not pursue here. We build our whole reasoning upon the well-known fact that, in some range of parameters, Wishart matrices (suitably rescaled) can be approximated by the identity in a strong sense.
Let us also mention that the question of whether random local Hamiltonians are generically gapped or gapless has recently been studied in [41] and [38], with a quite different perspective than ours. In both works, the local terms composing the Hamiltonian are picked at random, while what we pick at random is the ground state of the Hamiltonian. In [41] local terms are sampled independently, and it is shown that the obtained Hamiltonian is gapless with probability in the thermodynamic limit. In [38], on the contrary, only one local term is sampled and repeated, hence imposing translation-invariance of the obtained Hamiltonian, which is shown to be gapped with strictly positive probability in the thermodynamic limit. This latter setting is in fact very close to ours: in addition to being translation-invariant, the random local Hamiltonian which is studied is frustration-free (a characteristics that the parent Hamiltonian of an MPS or PEPS has by definition). And it indeed leads to a similar conclusion.
As a consequence of Theorem 1.3 we have that, in this same regime, our random MPS and PEPS exhibit, with probability going to as grow, exponential decay of correlations. This result appears as Theorems 3.1 and 3.2 in Section 3. Even though already interesting, it still has two weaknesses. First of all, it only applies to the injectivity regime. Indeed, even if the constraints for MPS and for PEPS could probably be improved, there is no way that we can say anything about the range for MPS and for PEPS via this approach (which consists in showing exponential decay of correlations in a tensor network state through showing that its parent Hamiltonian is gapped). Second of all, it cannot give anything stronger than a constant correlation length. In our specific case, we can actually improve the latter point by using the powerful recent result of [26]. Indeed, we have more than a lower bound on the typical spectral gap of the parent Hamiltonian, namely an upper bound on the typical commutator of the local terms composing it. And this enables us to prove that, in fact, the correlation length typically decays as (see Theorems 3.5 and 3.8 in Section 3).
However, to remedy the first problem it is necessary to look for another possible way to prove typical exponential decay of correlations in our random MPS and PEPS. A very natural one is through showing that their associated transfer operator is typically gapped, a result which is moreover of independent interest. This is what we do in Section 4, ultimately obtaining Theorems 4.15 (for the case of MPS) and 4.23 (for the case of PEPS), which are summarized below.
Theorem 1.4**.**
Let . Denote by the transfer operator of our random MPS. Then,
[TABLE]
where are universal constants.
Let . Denote by the transfer operator of our random PEPS. If and with and , then
[TABLE]
where are universal constants.
Let us comment first on the MPS case, where the result is valid for any and . The spectral gap question that we investigate has already been studied in [30, 44] and [23] on different random models (not all of them motivated by the study of random MPS), involving unitary and truncated unitary rather than Gaussian operators. In these three pieces of work the emphasis is put on having as tight as possible average results, while we mostly care about the order of magnitude but want to show that it is generic. It however remains that all approaches yield one similar result, namely an expected spectral gap of the considered random transfer operator larger than . Our proof strategy, to first lower bound the expected spectral gap of , follows closely that of [44] and [23]. An additional difficulty in our case comes from the fact that we are dealing with a non-normal random matrix model, which makes the analysis of its spectrum significantly more delicate. In order to then show that this lower bound is actually also typical we make use of a slightly refined version of the standard Gaussian concentration inequality.
Concerning the PEPS case, we see that we are able to prove that the transfer operator is generically gapped only in the regime where grow polynomially with . While this is to be expected for , it seems much less natural for though. This scaling can however easily be enforced by a so-called blocking procedure, namely: We start from a square lattice with sites, where , each having physical dimension and bond dimension . We then redefine site as being a square of sites. We thus obtain a square lattice with sites, each having physical dimension and bond dimension . Hence indeed, setting and , we have and . Finally, for the parameters to be in the valid range, we just have to impose on the parameters that they satisfy and . Let us emphasize here that the proof techniques to prove a lower bound on the typical spectral gap of are, as far as we are aware of, essentially new. The basic idea is some kind of recursion procedure that uses the MPS results as building blocks.
As a quite straightforward consequence of Theorem 1.4 we obtain that our random MPS and PEPS typically exhibit exponential decay of correlations at a provably high rate, and in a dimension regime that goes beyond the injectivity one. This result appears as Theorems 5.7 and 5.9 in Section 5.
Theorem 1.4 has several other implications, some of which are studied in Section 6. In particular, we draw the path towards constructions of random quantum expanders and random dissipative evolutions.
Let us make some final comments on the extra technical difficulties when trying to extend -dimensional results to -dimensional ones. Our first approach, based on looking at the parent Hamiltonian, has the great advantage of not being that much more complicated for PEPS than for MPS. The reason behind this is that, in both cases, the terms composing the parent Hamiltonian have the same locality (namely they just involve sites). The only thing that makes the PEPS case slightly more subtle is that the terms which act non-trivially on a given site are of different kinds ( identical ‘horizontal’ terms and identical ‘vertical’ terms), while in the MPS case there are only identical terms which act non-trivially on a given site. On the other hand, our second approach, based on looking at the transfer operator, is way more difficult to go through for PEPS than for MPS. Indeed, the transfer operator of a PEPS, contrary to that of an MPS, depends on the system size (since it is not constructed from its -site tensor but from its -site column tensor). Hence, while in the MPS case any statement about the transfer operator is automatically valid for any system size, this is not true anymore in the PEPS case.
1.4. A few key results in Gaussian concentration
Let us conclude this introductory part with two technical results that we will be using in multiple occasions throughout this paper. The first one is the celebrated concentration inequality for Lipschitz functions on Gaussian space, which was proved independently in [9] and [45]. The second one is a local version of this concentration inequality, which is useful when the considered function does not have a small Lipschitz constant on the whole Gaussian space but only on a large measure subset, and which was established in [6].
Theorem 1.5** (Gaussian concentration inequality, global version [9, 45]).**
Let be -Lipschitz (with respect to the Euclidean norm). For a Gaussian vector with mean [math] and variance , we have
[TABLE]
Theorem 1.6** (Gaussian concentration inequality, local version [6]).**
Let and let be -Lipschitz on (with respect to the Euclidean norm). For a Gaussian vector with mean [math] and variance , we have
[TABLE]
Finally, we will also use several times the fact that (suitably rescaled) large Wishart matrices of large enough parameter are with high probability close to the identity. More precisely, we will need the result below, which can be found in [5, Proposition 6.33].
Theorem 1.7** (Strong convergence of Wishart matrices [5]).**
Fix . Let be an Wishart matrix of parameter (i.e. where is an matrix whose entries are independent complex Gaussians with mean [math] and variance ). Then,
[TABLE]
2. Typical spectral gap of the parent Hamiltonian of random MPS and PEPS
In this section we want to show that, in the dimensional regime where our random MPS and PEPS are injective, their canonical parent Hamiltonians are typically gapped. We are actually only able to establish this in a ‘super-injective’ regime, which might be an artefact of our proof techniques. We first study the MPS case in Section 2.1 and then follow step by step the same reasoning for the PEPS case in Section 2.2. The final results appear as Theorems 2.12 and 2.19 respectively.
Let us just briefly emphasize again a point that we have already raised in the introduction. The corollaries of these results in terms of typical correlation length (see Section 3) are very powerful in the PEPS case but not as much as they could be in the MPS case. Indeed, for the latter, our second approach through characterizing the typical spectral gap of the transfer operator (see Section 4) yields stronger typical correlation length consequences (see Section 5). The interest of nevertheless carrying through the MPS analysis here is two-fold: First, the result on the typical spectral gap of the parent Hamiltonian is interesting in its own. Second, the overall reasoning can really be seen as a ‘warm up’ before getting into the slightly more intricate to follow, but in the end entirely analogous, PEPS reasoning.
Before we move on, let us just state here one quite straightforward fact concerning the maximum norm increase of a matrix under realignment, which we will make use of several times later on. We recall that the realignment (in the canonical tensor orthonormal bases) of an matrix is the matrix defined by
[TABLE]
Fact 2.1**.**
Let . For any matrix ,
[TABLE]
2.1. The case of MPS
We assume here that , so that our random MPS is injective with probability (see Fact 1.2). We know from [18] that, in this case, there exists a canonical way of constructing a -local frustration-free Hamiltonian on whose unique ground state is , with ground energy [math]. We call it the parent Hamiltonian of and denote it by . We now want to show that this random Hamiltonian typically has a large (lower) spectral gap . Note that since the smallest eigenvalue of is [math], is actually nothing else than the second smallest eigenvalue of .
Let us first recall how the Hamiltonian is constructed. Define as
[TABLE]
where the ’s are the matrices appearing in equation (2) defining the transfer operator associated to . Equivalently,
[TABLE]
where is the -site MPS having as -site tensor and as boundary condition. By construction we always have , so that . And in our case we actually have with probability . Denoting by the projector on , the parent Hamiltonian of is then defined as
[TABLE]
2.1.1. Approximating the local ground space projectors
The following operator will appear repeatedly in our subsequent computations:
What will be crucial for us is that, in the range that we are interested in, (suitably renormalized) is generically close to the identity. Indeed, as immediate corollary of Theorem 1.7 (applied with and ) we have the result below.
Proposition 2.2**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
Let us now define the operators as
Q:\mathbf{C}^{D}\otimes\mathbf{C}^{D}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$P=QQ^{*}:\mathbf{C}^{d}\otimes\mathbf{C}^{d}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$M=Q^{*}Q:\mathbf{C}^{D}\otimes\mathbf{C}^{D}\longrightarrow\mathbf{C}^{D}\otimes\mathbf{C}^{D}
We will first show that, in the range , just as , (suitably renormalized) is close to the identity.
Proposition 2.3**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
Proof.
Observe that , while , i.e. equivalently . Thus,
[TABLE]
where the first and last inequalities are by Fact 2.1. Now, we know by Proposition 2.2 that
[TABLE]
and therefore also that
[TABLE]
Hence putting everything together, we eventually get
[TABLE]
which (suitably re-labelling ) is exactly the announced result. ∎
As a direct consequence of Lemma 2.3 we get the following upper bound on the operator norm of .
Corollary 2.4**.**
Let , for some . Then, there exists a universal constant such that
[TABLE]
Proof.
We deduce from Lemma 2.3 that
[TABLE]
Just recalling that , so that , we get precisely the claimed result. ∎
From now on we set .
Proposition 2.5**.**
Let , for some . Let be defined as in equation (6). Then, there exist universal constants such that
[TABLE]
Proof.
Define , and let . Note that and . Hence,
[TABLE]
What is more, observe that
[TABLE]
We thus actually have that, for all ,
[TABLE]
Now, we know by Lemma 2.3 that
[TABLE]
while we know by Corollary 2.4 that
[TABLE]
Therefore putting everything together,
[TABLE]
which (suitably re-labelling ) is exactly the announced result. ∎
Lemma 2.6**.**
Let be two independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then,
[TABLE]
Proof.
The first deviation inequality is a direct application of the Gaussian concentration inequality, recalled in Theorem 1.5. The function that we are looking at here is , which is such that and clearly -Lipschitz. Hence,
[TABLE]
The second deviation inequality is easily obtained from the first one and the local version of the Gaussian concentration inequality, recalled in Theorem 1.6. The function that we are looking at here is , which is such that . Moreover
[TABLE]
So setting , we have that is -Lipschitz on . And by the first deviation inequality we also know that . Hence,
[TABLE]
The proof is thus complete. ∎
Corollary 2.7**.**
Let be independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then,
[TABLE]
where is a universal constant.
Proof.
Denote by two independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then, we have by the union bound
[TABLE]
where the next-to-last inequality is by Lemma 2.6. Just noticing that
[TABLE]
(and re-labelling by ), we thus have proved the claimed result. ∎
Proposition 2.8**.**
Let , for some . Let be defined as in equation (6). Then, there exist universal constants such that
[TABLE]
Proof.
First, observe that can be written as
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Hence,
[TABLE]
We thus have by Corollary 2.7, applied with , that
[TABLE]
Now, we also know by Proposition 2.5 (recalling that with probability ) that
[TABLE]
As a consequence of the two above inequalities, we get that
[TABLE]
And this clearly implies that
[TABLE]
which (suitably re-labelling ) is exactly the announced result. ∎
Putting Propositions 2.5 and 2.8 together we immediately get that is with high probability close to , the projector on . More precisely, we have Proposition 2.9 below.
Proposition 2.9**.**
Let , for some . Let be defined as in equation (6) and be the projector on . Then, there exist universal constants such that
[TABLE]
Proposition 2.10**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
In order to prove Proposition 2.10, i.e. that and are close to one another, we will actually show that both of them are close to , where is defined as
Before doing so, there are still two operators that we have to introduce:
N:\mathbf{C}^{d}\otimes\mathbf{C}^{D}\otimes\mathbf{C}^{D}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$N^{\prime}:\mathbf{C}^{D}\otimes\mathbf{C}^{D}\otimes\mathbf{C}^{d}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}
Proof.
Note that and . Hence,
[TABLE]
Next, observe that , where . Consequently,
[TABLE]
Now, we know by Corollary 2.4 that
[TABLE]
while we know by Proposition 2.2 that
[TABLE]
and therefore also that
[TABLE]
Hence putting everything together, we eventually get
[TABLE]
Similarly, we can show that
[TABLE]
As a consequence, we have
[TABLE]
which (suitably re-labelling ) implies precisely the announced result. ∎
2.1.2. Conclusions
Combining Propositions 2.9 and 2.10, we immediately get Theorem 2.11 below.
Theorem 2.11**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
Proof.
Setting , we have
[TABLE]
with . Now on the one hand, we know by Proposition 2.10 that
[TABLE]
While on the other hand, we know by Proposition 2.9 that
[TABLE]
and therefore also that
[TABLE]
We thus get that
[TABLE]
which (suitably re-labelling ) is exactly the announced result. ∎
We are now in position to prove that the parent Hamiltonian of , as defined by equation (7), is typically gapped.
Theorem 2.12**.**
Let , for some . Let be the parent Hamiltonian of , as defined by equation (7). Then, there exist universal constants such that
[TABLE]
Proof.
In order to prove Theorem 2.12 we will use a now standard strategy, first introduced in [20, Theorem 6.4]. Namely, we will actually show that, with probability larger than , . For the sake of simplifying notation we set , , so that
[TABLE]
And thus,
[TABLE]
Now first, since the ’s are projectors,
[TABLE]
Then, since and commute for ,
[TABLE]
And finally, we know by Theorem 2.11 that, with probability larger than , . So, with probability larger than ,
[TABLE]
Hence putting everything together, we eventually get that, with probability larger than ,
[TABLE]
which (suitably re-labelling ) is indeed what we wanted to show. ∎
2.2. The case of PEPS
To study the case of PEPS we will follow step by step the strategy adopted in the case of MPS. We may thus skip several details.
We assume here that , so that our random PEPS is injective with probability (see Fact 1.2). We know from [18] again that, in this case, there exists a canonical way of constructing a -local frustration-free Hamiltonian on whose unique ground-state is , with ground energy [math]. As before, we call it the parent Hamiltonian of , denote it by , and want to show that it typically has a large (lower) spectral gap .
This PEPS parent Hamiltonian is constructed similarly to the MPS parent Hamiltonian: Define as
[TABLE]
where is the -site PEPS having as -site tensor and as boundary condition. By construction we always have , so that . And in our case we actually have with probability . Then, denote by the projector on . To streamline notation we use the following shorthand for ‘vertical’ and ‘horizontal’ -site terms: for any ,
[TABLE]
The parent Hamiltonian of is then defined as
[TABLE]
So in conclusion, the PEPS parent Hamiltonian can actually be seen as a sum of terms which are of the form of an MPS parent Hamiltonian, just that the boundary dimensions are not but . This means that, up to this replacement, we can use all the intermediate results proved in the MPS case.
2.2.1. Approximating the local ground space projectors
We now have to look at the following three operators :
W:\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D}\longrightarrow\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D}$$W^{\prime}:\mathbf{C}^{D}\otimes\mathbf{C}^{D^{3}}\longrightarrow\mathbf{C}^{D}\otimes\mathbf{C}^{D^{3}}$$W^{\prime\prime}:\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D}\longrightarrow\mathbf{C}^{D}\otimes\mathbf{C}^{D^{3}}
While the operators that we now have to consider are:
Q:\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D^{3}}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$P=QQ^{*}:\mathbf{C}^{d}\otimes\mathbf{C}^{d}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$M=Q^{*}Q:\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D^{3}}\longrightarrow\mathbf{C}^{D^{3}}\otimes\mathbf{C}^{D^{3}}
Note that all these operators can be viewed either as ‘vertical’ or as ‘horizontal’ operators. The analysis that follows is exactly the same in both cases, as the distribution of an operator does not depend on its orientation. So we do not make the distinction for now. It is only later, when looking at the commutation relations between operators of the form and , that it will matter whether the operators and involved have the same or different orientations.
We can first show that, in the range that we are interested in, (suitably renormalized) are generically close to the identity. Indeed, as immediate corollary of Theorem 1.7 (applied with and ) we have the result below, which is the analogue of Proposition 2.2.
Proposition 2.13**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
And the same holds for .
We can then show that, in the range , also (suitably renormalized) is close to the identity, i.e. an analogue of Proposition 2.3.
Proposition 2.14**.**
Let , for some . Then, there exist universal constants such that
[TABLE]
Proof.
We argue as in the proof of Proposition 2.3, observing that , while and , where and are the maximally entangled unit vectors. Thus,
[TABLE]
where the first and last inequalities are by Fact 2.1. Now, we know by Proposition 2.13 that
[TABLE]
and therefore also that
[TABLE]
Hence putting everything together, we eventually get
[TABLE]
which (suitably re-labelling ) is exactly the announced result. ∎
As a direct consequence of Proposition 2.14 we get the following upper bound on the operator norm of , just as Corollary 2.4 is derived from Proposition 2.3.
Corollary 2.15**.**
Let , for some . Then, there exists a universal constant such that
[TABLE]
We now define . With the above preliminary results at hand, we can derive the analogues of Propositions 2.9 and 2.10, following exactly the same proof strategies. We therefore only recall the main steps in the arguments.
Proposition 2.16**.**
Let , for some . Let be defined as in equation (8) and be the projector on . Then, there exist universal constants such that
[TABLE]
Proof.
Proposition 2.16 is a consequence of the two following results:
[TABLE]
The first equation is due to the fact that, for any such that ,
[TABLE]
and the latter quantity is, with probability larger than , smaller than .
The second equation is obtained by combining the first equation, which tells us that
[TABLE]
with the observation that
[TABLE]
Indeed, we get from these that, with probability larger than , . ∎
Proposition 2.17**.**
Let , for some . Then, there exist universal constants such that, for the orientations ‘’ and ‘’ being either ‘’ or ‘’,
[TABLE]
The proof of Proposition 2.17 goes exactly as the one of Proposition 2.10. Namely, in the case where , it consists in showing that and are both close to , where is defined as
And in the case where , it consists in showing that and are both close to , where is the same as but with one vertical and one horizontal indices swapped on site number (see the proof of Proposition 2.17 below for a precise definition).
For this we need, as before, to introduce two last operators
N:\mathbf{C}^{d}\otimes(\mathbf{C}^{D})^{\otimes 4}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}$$N^{\prime}:(\mathbf{C}^{D})^{\otimes 4}\otimes\mathbf{C}^{d}\longrightarrow\mathbf{C}^{d}\otimes\mathbf{C}^{d}
Proof.
For the case where , we have the following chain of (in)equalities:
[TABLE]
Now, define the swap operator on as
[TABLE]
and the swapped version of as
[TABLE]
Then, for the case where , we have the following chain of (in)equalities:
[TABLE]
where the next to last inequality is because .
In both cases, the last expression of the chain of (in)inequalities is, with probability larger than , smaller than , which concludes the proof. ∎
2.2.2. Conclusions
Combining these two results we can then immediately deduce the analogue of Theorem 2.11.
Theorem 2.18**.**
Let , for some . Then, there exist universal constants such that, for the orientations ‘’ and ‘’ being either ‘’ or ‘’,
[TABLE]
And we can finally use Theorem 2.18 above to derive Theorem 2.19, in the exact same way that Theorem 2.12 is derived from Theorem 2.11.
Theorem 2.19**.**
Let , for some . Let be the parent Hamiltonian of , as defined by equation (9). Then, there exist universal constants such that
[TABLE]
3. Consequence: Typical correlation length in random MPS and PEPS
In the previous section we showed that the parent Hamiltonians of our random MPS and PEPS are typically gapped, at least in a ‘super-injectivity’ dimensional regime. In this section we derive from the latter result that our random MPS and PEPS typically exhibit exponential decay of correlations.
Let us begin with explaining precisely what we mean when we talk about correlations in an MPS or a PEPS. Set in the case of MPS and in the case of PEPS. Let be an -site translation-invariant MPS or PEPS. Let be such that and let be Hermitian operators on . We would like to compare the value of the observable on to the product of the values of and on . So we define the correlation function
[TABLE]
and we ask whether it is small for far way from each other. This is represented in the case of our random MPS in Figure 7.
In what follows, given , we denote by the graph distance between and , i.e. the smallest number of edges separating a vertex in from a vertex in . And we will show that typically decays exponentially fast with , i.e. for some . We call the inverse of the rate , , the correlation length of the MPS or PEPS.
It was seminally observed in [33] that an MPS or a PEPS exhibiting exponential decay of correlations can be derived from its parent Hamiltonian being gapped. Here we first show how a more basic approach already gives such kind of statement, even though with a non-optimal scaling. We then proceed to improving this result by following a route more similar to that of [33].
3.1. Rough upper bound on the typical correlation length via the detectability lemma
Our first strategy to prove typical exponential decay of correlations in our random MPS and PEPS, from the statements of Section 2 on the typical spectral gap of their parent Hamiltonian, is to make use of a result proved in [22]. The latter relies on the detectability lemma, first introduced in [1] and later improved and simplified in [2]. The reasoning is in fact entirely the same for MPS and PEPS. The only thing that changes is the range of physical and bond dimensions for which we are able to say something, the constraints being exactly those of either Theorem 2.12 or Theorem 2.19.
Let us start with the case of MPS.
Theorem 3.1**.**
Let , for some , and , where is a universal constant. Let be the random -site translation-invariant MPS whose random -site tensor is defined as in equation (1). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
Since is a frustration-free local Hamiltonian, we know by [22, Theorem 1] that, if it has a spectral gap , then
[TABLE]
Now, we also know by Theorem 2.12 that, with probability larger than , , which is larger than (say) for large enough. And the proof is thus complete (re-labelling into ). ∎
Let us now turn to the case of PEPS, which is treated in the exact same way as the case of MPS.
Theorem 3.2**.**
Let , for some , and , where is a universal constant. Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
Since is a frustration-free local Hamiltonian, we know by [22, Theorem 1] that, if it has a spectral gap , then
[TABLE]
Now, we also know by Theorem 2.19 that, with probability larger than , , which is larger than (say) for large enough. And the proof is thus complete (re-labelling into ). ∎
To summarize, we have shown that, as a straightforward consequence of Theorem 2.12 and Theorem 2.19, our random MPS and PEPS typically exhibit exponential decay of correlation at a rate which is at least a constant independent of any other parameter (physical dimension , bond dimension , number of particles ).
3.2. Tighter upper bound on the typical correlation length via a refined Lieb–Robinson bound
It is actually possible to improve the previous result, namely a typical upper bound on the correlation length of our random MPS and PEPS of order , to a typical upper bound of order . To achieve this we first use a Lieb–Robinson bound, recently proved in [26], which is suited to the case where the local terms composing the Hamiltonian have small commutators. From there we derive exponential decay of correlations by following the same reasoning as the one detailed, for instance, in [31].
Set again in the case of MPS and in the case of PEPS, and let be an -site translation-invariant MPS or PEPS with parent Hamiltonian . Then, for any Hermitian operator on and any , define
[TABLE]
In the sequel, for any and any Hermitian operator on , we will use the short-hand notation for .
Let us start with the case of MPS.
Lemma 3.3**.**
Let , for some . Let be the random -site translation-invariant MPS whose random -site tensor is defined as in equation (1). Then, with probability larger than , for any such that and any Hermitian operators on , for any ,
[TABLE]
where are universal constants.
Proof.
The result immediately follows from [26, Lemma 12]. We just have to see how the commutator and exponential decay conditions (equations (14) and (15) of [26]) read in our case. Recall that, using the same notation as in Section 2.1, . Let us start with the bound on the commutator: If , then
[TABLE]
While we know by Theorem 2.11 that, with probability larger than ,
[TABLE]
Let us now turn to the bound on the exponential decay: Setting , , we have
[TABLE]
Plugging these values into equation (16) of [26] gives exactly the announced result. ∎
Corollary 3.4**.**
Let , for some . Let be the random -site translation-invariant MPS whose random -site tensor is defined as in equation (1). Then, with probability larger than , for any such that and any Hermitian operators on , for any such that ,
[TABLE]
where are universal constants.
Proof.
Taking in Lemma 3.3, we get
[TABLE]
And as soon as (say) , we have
[TABLE]
which, up to re-labelling the constants, is exactly the claimed result. ∎
Theorem 3.5**.**
Let , for some . Let be the random -site translation-invariant MPS whose random -site tensor is defined as in equation (1). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
We proceed in the exact same way as how, in [31], Theorem 2 is proved from Theorem 1. We thus get from Corollary 3.4 that, if has a spectral gap , then with probability larger than ,
[TABLE]
Now, we also know by Theorem 2.12 that, with probability larger than , , which is larger than (say) for large enough. And therefore, with probability larger than ,
[TABLE]
which, up to re-labelling the constants, is precisely the announced result. ∎
Let us now turn to the case of PEPS, which here again can be analysed just as the case of MPS.
Lemma 3.6**.**
Let , for some . Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on , for any ,
[TABLE]
where are universal constants.
Proof.
The result immediately follows from [26, Lemma 12]. We just have to see how the commutator and exponential decay conditions (equations (14) and (15) of [26]) read in our case. Recall that, using the same notation as in Section 2.2, . Let us start with the bound on the commutator: If or , then
[TABLE]
if or , then
[TABLE]
and if or , then
[TABLE]
While we know by Theorem 2.11 that, with probability larger than ,
[TABLE]
Let us now turn to the bound on the exponential decay: Setting , , , , we have
[TABLE]
Plugging these values into equation (16) of [26] gives exactly the announced result. ∎
Corollary 3.7**.**
Let , for some . Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on , for any such that ,
[TABLE]
where are universal constants.
Proof.
Taking in Lemma 3.6, we get
[TABLE]
And as soon as (say) , we have
[TABLE]
which, up to re-labelling the constants, is exactly the claimed result. ∎
Theorem 3.8**.**
Let , for some . Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
We proceed in the exact same way as how, in [31], Theorem 2 is proved from Theorem 1. We thus get from Corollary 3.7 that, if has a spectral gap , then with probability larger than ,
[TABLE]
Now, we also know by Theorem 2.19 that, with probability larger than , , which is larger than (say) for large enough. And therefore, with probability larger than ,
[TABLE]
which, up to re-labelling the constants, is precisely the announced result. ∎
To summarize, we have derived from Theorems 2.11, 2.12 and Theorems 2.18, 2.19 that our random MPS and PEPS typically exhibit exponential decay of correlation at a rate which is at least of order .
It is quite instructive to look at how the results of Theorem 3.8 get modified under blocking. There are two ways in which one can do such grouping of sites: either before or after sampling the random -site tensor. In both cases, the blocking procedure goes as follows: We start from a square lattice with sites, where , each having physical dimension and bond dimension . We then redefine site as being a square of sites. We thus obtain a square lattice with sites, each having physical dimension and bond dimension .
Let us first look at the simplest situation to analyse, i.e. the one where we do the redefinition of sites before the sampling. In this case, we only have to plug the scaling for in Theorem 3.8, to obtain the result below.
Theorem 3.9**.**
Fix and let . Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
The situation where the redefinition of sites is done after the sampling is only slightly more subtle to deal with. In this case, it is the scaling for and that we have to plug in Theorem 3.8. Indeed, site in the new lattice actually corresponds to the square of sites in the old lattice. Hence, regions in the new lattice correspond to regions in the old lattice which are such that and . We thus get the result below.
Theorem 3.10**.**
Fix with and let . Set also . Let be the random -site translation-invariant PEPS whose random -site tensor is defined as in equation (3). Then, with probability larger than , for any such that and any Hermitian operators on ,
[TABLE]
where are universal constants.
Let us just make one last comment about the parent Hamiltonian of in this latter case. It takes the same form as before, i.e.
[TABLE]
except that, now, site is the square of sites . The interesting fact to point out is that this grouping makes the new -site projectors commute more than the old ones . This intuitive statement is made quantitative by [35, Theorem 3], which upper bounds the commutator of the new projectors in terms of the spectral gap of the old parent Hamiltonian . More precisely, we thus get: If or , then
[TABLE]
if or , then
[TABLE]
and if or , then
[TABLE]
While we know by Theorem 2.19 that, with probability larger than , , so that by [35, Theorem 3]
[TABLE]
Comparing Theorems 3.9 and 3.10, we see that they yield a typical correlation length of order for the former and for the latter. The result of Theorem 3.9 is absolutely not surprising: blocking before sampling the random tensor simply means that the physical and bond dimensions of site have been scaled up, so that the correlation decay rate is expected to scale up accordingly. In contrast, the result of Theorem 3.10 is slightly more subtle. Also, since in this second case the random tensor is sampled on a site having physical and bond dimensions and , these need to be large for the result to actually hold with probability close to . While in the first case the random tensor is sampled on a site having physical and bond dimensions and , which are automatically large as grows.
4. Typical spectral gap of the transfer operator of random MPS and PEPS
In this section, in contrast to the two previous ones, we do not constrain our random MPS and PEPS to be injective. What we want to show here is that their associated transfer operators are typically gapped. In the MPS case, treated in Section 4.2, we can prove this, in a quantitative way, for any physical and bond dimensions (see Theorem 4.15). On the contrary, in the PEPS case, treated in Section 4.3, we need to impose that the physical and bond dimensions grow polynomially with the number of particles and scale in a specific way with respect to one another (see Theorem 4.23).
4.1. Toolbox and strategy
Our goal here will be to show that the random transfer operators and , as defined by equations (2) and (5), typically have a large (upper) spectral gap. For this we will make use of two technical results, providing variational formulas for the singular values of a matrix (see e.g. [10, Problem III.6.1]) and a majorization result between the eigenvalues and the singular values of a matrix (see e.g. [10, Theorem II.3.6]).
Before stating them, let us fix some notation. Given an complex matrix we denote by its eigenvalues, ordered so that , and by its singular values. We furthermore define its upper spectral gap as . This is the same notation as the one we were using in Sections 2 and 3 for the lower spectral gap, but there should be no possible confusion.
Also, given an complex matrix , we will denote by its corresponding map on complex matrices. Formally, we identify
[TABLE]
What is important for us is that this identification preserves the spectrum.
Theorem 4.1** (Minimax principle for singular values [10]).**
Let be an complex matrix. Then, for any ,
[TABLE]
where denotes the set of rank projectors on .
As an immediate consequence of Theorem 4.1 we see that, for any unit vector ,
[TABLE]
Indeed, the minimax principle applied to the case tells us that is equal to the infimum over unit vectors of .
Theorem 4.2** (Weyl’s majorant theorem [10]).**
Let be an complex matrix. Then, for any ,
[TABLE]
In particular, applying Theorem 4.2 to the case , we get
[TABLE]
Theorem 4.3** (Perron-Froebenius theorem for irreducible positive maps [19]).**
Let be an irreducible positive map on matrices. Then,
[TABLE]
As a consequence of Theorem 4.3 we have that, if there exists such that for some , then .
Lemma 4.4**.**
Let be an complex matrix satisfying the following: there exists a unit vector such that and for some . Then, .
Proof.
Let be unit vectors, which we write as , where is a unit vector orthogonal to and are such that , for . We then have
[TABLE]
Now, by assumption, , while . Also,
[TABLE]
Hence, . And we therefore get, by the triangle inequality and the fact that ,
[TABLE]
Since the latter upper bound holds for any unit vectors , it indeed proves that . ∎
Proposition 4.5**.**
Let be an complex matrix and be its corresponding map on complex matrices. Assume that the following holds: (i) is positive irreducible and there exists a positive semidefinite matrix on such that , (ii) there exists a unit vector in such that and , where . Then,
[TABLE]
so that in particular
[TABLE]
Proof.
To begin with, condition (i) implies, by Theorem 4.3, that
[TABLE]
Next, Theorem 4.2 tells us that
[TABLE]
Now, condition (ii) implies, first of all by Lemma 4.4 that , and second of all by Theorem 4.1 . Hence,
[TABLE]
And the proof is thus complete. ∎
With the result of Proposition 4.5 in mind, we can now explain what is our strategy in order to show that the random MPS transfer operator , as defined by equation (2), typically has a spectral gap . We know by Fact 1.2 that, with probability , the positive map corresponding to is irreducible. Our goal is thus to find a positive semidefinite matrix on and a unit vector in such that, with high probability
[TABLE]
[TABLE]
for some . Indeed, we know by Proposition 4.5 that if equations (11) and (12) hold it guarantees that, with high probability
[TABLE]
We proceed similarly for the random PEPS transfer operator , as defined by equation (5), with a positive semidefinite matrix on and a unit vector in .
Before proceeding, we shall make one last simple observation on the spectrum of the random MPS transfer operator , which straightforwardly follows from noticing that and have the same spectrum. The latter claim is in turn a consequence of the fact that , where denotes the flip unitary on (which is defined by , for any ).
Fact 4.6**.**
Let be defined as in equation (2). If then . And therefore, for any , .
4.2. The case of MPS
Our candidate semidefinite positive matrix on satisfying with high probability equation (11) will be the identity matrix , while our candidate unit vector in satisfying with high probability equation (12) will be the maximally entangled unit vector . Before launching into proofs, let us briefly explain what is the intuition behind such choice. First, it is easy to check (cf. subsequent computations) that . It is thus natural to expect that the largest eigenvalue of should be close to and that the corresponding eigenvector should be close to . Second, we know from observations in Section 2.1 that for a Wishart matrix with parameter . And it was proved in [4] that the singular value distribution of , i.e. of , converges in moments to the quarter-circle distribution. This means that the singular values of are at least almost all of order at most . However, this result does not tell us anything about potential isolated singular values (or in fact eigenvalues), which is what would truly matter for our purposes. What is more, even the statement about so-called weak convergence of the singular value distribution of was proved only in the regime where is of order . While, as we will later see, our results are valid for any respective scaling of and .
4.2.1. Computing the typical value of the transfer CP map on the identity
Proposition 4.7**.**
Let be defined as in equation (2) and let be its corresponding CP map. Then,
[TABLE]
which implies that
[TABLE]
Proof.
Recall that
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance . This means that is distributed as , for a matrix whose entries are independent complex Gaussians with mean [math] and variance , i.e. for a Wishart matrix of parameter . Hence, by Theorem 1.7 (applied with and ), we know that
[TABLE]
as claimed. ∎
4.2.2. Computing the expected overlap of the transfer operator with the maximally entangled state
Proposition 4.8**.**
Let be defined as in equation (2). Then, and
[TABLE]
Proof.
The claimed result easily follows from a direct computation. Indeed,
[TABLE]
So first it is clear that . And second,
[TABLE]
where the last equality is because, for each , . ∎
4.2.3. Upper bounding the expected norm of the projection of the transfer operator on the orthogonal of the maximally entangled state
Lemma 4.9**.**
Let be a matrix whose entries are independent complex Gaussians with mean [math] and variance . Then, for any even such that , we have
[TABLE]
Proof.
Given , we denote by the set of permutations of , by the full cycle and, for any , by the number of cycles in the cycle decomposition of . Then, it is well-known that we can write
[TABLE]
where (see e.g. [36, Appendix B.2] for further details). Now, we know from [40, Lemma 12] that and, for each , . Hence,
[TABLE]
Consequently, if , we have
[TABLE]
where the first inequality is because and the second inequality is because . And the advertised result follows, simply replacing by . ∎
Lemma 4.10**.**
Let be independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then,
[TABLE]
Proof.
The reasoning is directly inspired from the one in the proofs of [44, Lemma 4.1 and Theorem 4.2] and [43, Theorem 16.6]. First observe that
[TABLE]
Next, for any , we know that , so that by Jensen inequality
[TABLE]
Now, for any even , writing , we have
[TABLE]
Yet, for each , we know by Hölder inequality that
[TABLE]
which implies, since for identically distributed random variables , that
[TABLE]
We thus have shown that
[TABLE]
where the first equality is because the only non vanishing terms in the sum are non negative and the last equality is because , where is a matrix whose entries are independent complex Gaussians with mean [math] and variance . Now, we know from Lemma 4.9 that, for any even such that ,
[TABLE]
Hence putting everything together, we finally get that, for such ,
[TABLE]
Choosing in the above inequality, we see that
[TABLE]
Since for all , the claimed result follows. ∎
Proposition 4.11**.**
Let be defined as in equation (2). Then,
[TABLE]
Proof.
To begin with, note that . Indeed, by the triangle inequality
[TABLE]
and by Hölder inequality
[TABLE]
Next, observe that , so that we can re-write
[TABLE]
where the ’s are independent copies of the ’s. Now, by Jensen inequality
[TABLE]
Yet, we know from Lemma 4.10 that
[TABLE]
Putting everything together, we thus get
[TABLE]
which is exactly the announced result. ∎
4.2.4. Typical spectral gap of the transfer operator
Lemma 4.12**.**
Let be a projector on , and define the function , of -uples of matrices, as
[TABLE]
Then, for independent matrices whose entries are independent complex Gaussians with mean [math] and variance , we have
[TABLE]
Proof.
Define the following subset of the set of -uples of matrices:
[TABLE]
We will first show that, for independent matrices whose entries are independent complex Gaussians with mean [math] and variance , we have
[TABLE]
For this, we will use the Gaussian concentration inequality, recalled in Theorem 1.5. Let us start with showing that the average of the function we are interested in is upper bounded by . Indeed, by Jensen inequality
[TABLE]
Yet, for a matrix whose entries are independent complex Gaussians with mean [math] and variance , it is well known that . And therefore,
[TABLE]
Let us now turn to showing that the Lipschitz constant of the function we are interested in is upper bounded by . Indeed, by the triangle inequality (twice)
[TABLE]
With these two estimates at hand, we can conclude that
[TABLE]
which, taking , is exactly what we wanted to prove.
We will now make us of the local version of the Gaussian concentration inequality, recalled in Theorem 1.6. In the case of our function and our subset , we have that, if , then
[TABLE]
where the first inequality is by the triangle inequality, the third inequality is also by the triangle inequality (after noticing that ), the fourth inequality is by Cauchy-Schwarz inequality, the fifth inequality is because and for any , and the sixth inequality is by assumption on . Putting together this upper bound on the Lipschitz constant of on with the upper bound on the probability of the complement of , we eventually get
[TABLE]
which is exactly the announced result. ∎
Proposition 4.13**.**
Let be defined as in equation (2). Then,
[TABLE]
Proof.
Observe first of all that . So we will apply Lemma 4.12 to the case where . We know from Proposition 4.8 that
[TABLE]
so that by Lemma 4.12 (with playing the role of )
[TABLE]
which is precisely what we wanted to show. ∎
Proposition 4.14**.**
Let be defined as in equation (2). Then,
[TABLE]
Proof.
Let us start with the first deviation probably. We will apply Lemma 4.12 to the case where . We know from Proposition 4.11 that
[TABLE]
so that by Lemma 4.12 (with playing the role of )
[TABLE]
which is precisely what we wanted to show.
As for the second deviation probability, it follows from the first one applied to instead of . Indeed, is distributed as so we know by what precedes that
[TABLE]
Now, , so that , and the proof is thus complete. ∎
Theorem 4.15**.**
Let be the random MPS transfer operator, as defined in equation (2). Then,
[TABLE]
Proof.
First, we know from Proposition 4.7 that
[TABLE]
Second, we know from Proposition 4.13 (with ) that
[TABLE]
and from Proposition 4.14 (with ) that
[TABLE]
Now, we also know by Proposition 4.5 that, if the three following conditions are satisfied
[TABLE]
then . So the four deviation probabilities above imply by the union bound that
[TABLE]
which is precisely what we wanted to show. ∎
4.3. The case of PEPS
4.3.1. Computing the typical value of the transfer CP map on the identity
Lemma 4.16**.**
Let be two independent matrices whose entries are complex Gaussians with mean [math] and variance . Then,
[TABLE]
where is a universal constant.
Proof.
By definition, what we want to show is that, with probability larger than , the supremum over all unit vectors of is at most . With this goal in mind, let us first fix unit vectors and set , so that . Observe that are independent Gaussian vectors with mean [math] and variance . Hence by Theorem 1.5,
[TABLE]
This implies that, defining the subset of the set of pairs of vectors in as
[TABLE]
we have
[TABLE]
Now, defining the function of pairs of vectors in as
[TABLE]
we have that, if , then
[TABLE]
This means that is -Lipschitz on . Hence by Theorem 1.6,
[TABLE]
Now, fix and let be a -net in the unit sphere of (i.e. a subset of the unit sphere of such that, for any unit vector there exists such that ). We know that can be chosen such that (see e.g. [5, Lemma 5.3]). By the union bound, we thus get from equation (13) that
[TABLE]
Finally, define , resp. , as the supremum over all unit vectors , resp. all , of . Then, given unit vectors , letting be such that , we have
[TABLE]
Hence taking the supremum on the left hand side, we see that
[TABLE]
Choosing in equation (14), and recalling that by the inequality above , we eventually get
[TABLE]
To conclude, we just have to observe that the right hand side is smaller than for . ∎
Proposition 4.17**.**
Let be defined as in equation (5) and be its corresponding CP map. Then,
[TABLE]
which implies that
[TABLE]
where is a universal constant.
Proof.
Recall that
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance . This means that is distributed as
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance .
Let us first look at the term corresponding to in expression (15), i.e.
[TABLE]
For each , is a Wishart matrix of parameter . So by Theorem 1.7 (applied with and ), we know that
[TABLE]
Hence by the union bound,
[TABLE]
Now, assume that are matrices satisfying , . Then,
[TABLE]
The first inequality can easily be shown by induction, after noticing that
[TABLE]
so that
[TABLE]
Putting together equations (16) and (17), we thus get that the probability that
[TABLE]
is smaller than . And consequently, just noticing that
[TABLE]
we get by the triangle inequality that
[TABLE]
Let us now look at the other terms in expression (15). For each , define
[TABLE]
so that can be written as
[TABLE]
Fix . By the triangle inequality, we have
[TABLE]
Now, given and such that , set . We then have that, for , is independent from , while for , . Hence, for , we know from Lemma 4.16 that
[TABLE]
While for , we know from Theorem 1.7 that
[TABLE]
And therefore, by the union bound,
[TABLE]
Since , we thus have by the union bound again that
[TABLE]
And consequently, once more by the union bound, the probability that
[TABLE]
is smaller than
[TABLE]
Hence, just noticing that
[TABLE]
we eventually get that
[TABLE]
And therefore, by the triangle inequality and the union bound,
[TABLE]
We are now left with combining the results of the two parts of the proof. Indeed, since , we eventually obtain that
[TABLE]
which yields the announced result. ∎
4.3.2. Computing the typical overlap of the transfer operator with the maximally entangled state
Proposition 4.18**.**
Let be defined as in equation (5). Then, and
[TABLE]
Proof.
Let be defined as in equation (2). Observe that
[TABLE]
where is distributed as with , . Hence, we first know by Fact 4.6 that . Second, we know from Propositions 4.13 and 4.14 (combined with observations from Proposition 4.5) that
[TABLE]
Consequently,
[TABLE]
And therefore, taking , we get that
[TABLE]
By equation (18), this implies that, with probability greater than , the two following hold
[TABLE]
which is precisely what we wanted to show. ∎
4.3.3. Upper bounding the typical norm of the projection of the transfer operator on the orthogonal of the maximally entangled state
In the sequel, we will make extensive use of the following simple observation: given positive random variables and positive numbers ,
[TABLE]
Indeed, if , resp. , then necessarily either or .
We now gather three deviation inequalities that we will also use repeatedly later on.
Lemma 4.19**.**
Let be independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then,
[TABLE]
where is a universal constant.
Proof.
The proof follows step by step that of Lemma 4.12, just slightly generalizing it in one point, so some details are skipped here. We first fix and define the following subset of the set of -uples of matrices:
[TABLE]
Reasoning as in the proof of Lemma 4.12 we obtain that, for independent matrices whose entries are independent complex Gaussians with mean [math] and variance ,
[TABLE]
We then use the local version of the Gaussian concentration inequality, recalled in Theorem 1.6. In our case, the functions that we are looking at are
[TABLE]
Arguing again exactly as in the proof of Lemma 4.12 it can be shown that, for
[TABLE]
while for
[TABLE]
Finally we know that and . Putting everything together, we thus get that
[TABLE]
Choosing in the two deviation probabilities above satisfying, respectively, and , we eventually obtain that there exist universal constants such that
[TABLE]
which are precisely the first two deviation inequalities. As for the third one, we simply have to recall that, for each , . Therefore, for all ,
[TABLE]
And since we know by what precedes that the latter sum of deviation probabilities is upper bounded by
[TABLE]
the third deviation inequality is proved as well. ∎
Lemma 4.20**.**
Let and , , be independent matrices whose entries are independent complex Gaussians with mean [math] and variance . Then, for all , the probability that
[TABLE]
is smaller than , where is a universal constant.
Proof.
We will show by induction that the result is true for being any . To simplify notation, we will set
[TABLE]
and for each ,
[TABLE]
We know from Lemma 4.19 that
[TABLE]
So the statement is true for .
Let us now assume that the statement is true for some and show that this implies that it is true also for . Observe that, setting for each and , and , we have for each ,
[TABLE]
So by the triangle inequality,
[TABLE]
Now, we know from Lemma 4.19 that
[TABLE]
and therefore also that
[TABLE]
What is more, we know by the initialisation step and by the recursion hypothesis that
[TABLE]
Consequently, for all ,
[TABLE]
So the statement is indeed true for , which concludes the proof. ∎
Corollary 4.21**.**
Let and , , be independent matrices whose entries are independent complex Gaussians with mean [math] and variance . And define the random variables and . Set also
[TABLE]
Then, for all , the probability over that
[TABLE]
is smaller than , where is a universal constant.
Proof.
We know from Lemma 4.20 that, for all , the probability over that
[TABLE]
is smaller than . Taking , this implies that, for all (so that ), there exists a set of ’s of measure larger than such that, for all fixed , the random variable
[TABLE]
satisfies
[TABLE]
Assume that the latter holds. Then, setting , we can re-write
[TABLE]
Now on the one hand,
[TABLE]
While on the other hand,
[TABLE]
where the first equality is by change of variables and the last inequality is by assumption on . Yet, we clearly have
[TABLE]
And it can easily be shown by successive integrations by parts that, as soon as ,
[TABLE]
Hence in the end, for all ,
[TABLE]
Putting everything together, we eventually obtain that, for all ,
[TABLE]
which is exactly the announced result. ∎
Proposition 4.22**.**
Let be defined as in equation (5). Then, for all ,
[TABLE]
where is as defined in equation (20) and is a universal constant.
Proof.
To begin with, arguing as in the proof of Proposition 4.11, note that
[TABLE]
Next, observe that
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance . We thus get by Jensen inequality that is upper bounded by
[TABLE]
which, by the triangle inequality, is itself upper bounded by
[TABLE]
To simplify notation latter on, let us set
[TABLE]
[TABLE]
First of all, we know from Corollary 4.21 that, for any , for all ,
[TABLE]
We will now show that, for any , for all ,
[TABLE]
Note that the latter random variable can be re-written as
[TABLE]
where we introduced the notation, for each ,
[TABLE]
Given and such that , we define . We then have that, for , is independent from , while for , . Hence, for , we know from Lemma 4.19 with that, for all ,
[TABLE]
While for , we know again from Lemma 4.19 with that, for all ,
[TABLE]
And therefore, for all ,
[TABLE]
Since , we thus have that, for all ,
[TABLE]
And consequently, for all , the probability that
[TABLE]
is smaller than
[TABLE]
Simply noticing that
[TABLE]
we eventually get what we claimed, namely that, for all ,
[TABLE]
We now just have to combine the two results of equations (22) and (23) to obtain our final result. Indeed, observe that on the one hand
[TABLE]
while on the other hand
[TABLE]
Hence, we have shown that, for all ,
[TABLE]
is larger than
[TABLE]
with probability smaller than , which implies that the same holds for . And this in turn implies by equation (21) that the same holds for , as announced.
Just as in the proof of Proposition 4.14, the second deviation probability follows from the first one, applied to instead of . ∎
4.3.4. Typical spectral gap of the transfer operator
Theorem 4.23**.**
Let be the random PEPS transfer operator as defined in equation (5). Then, for all ,
[TABLE]
with probability larger than
[TABLE]
where is as defined in equation (20) and is a universal constant.
In particular, if and with and , then
[TABLE]
where are universal constants.
Proof.
First, we know by Proposition 4.17 that
[TABLE]
Second, we know from Proposition 4.18 that
[TABLE]
and from Proposition 4.22 that
[TABLE]
Now, we also know by Proposition 4.5 that, if the three following conditions are satisfied
[TABLE]
then
[TABLE]
This means that the above holds with probability larger than
[TABLE]
and the first assertion (24) is proved.
The second assertion (25) can easily be checked by inserting the values of and in equation (24). The only details to check are that for , (so that the range of possible values for is not empty). ∎
5. Consequence: Typical correlation length in random MPS and PEPS
In the previous section we showed that the transfer operators of our random MPS and PEPS are typically gapped. In this section we derive from the latter result that our random MPS and PEPS typically exhibit exponential decay of correlations. Compared to the statements in Section 3, those in the current section have one main advantage: they apply to a dimensional regime that goes beyond the one of injectivity.
5.1. Preliminary facts
Lemma 5.1**.**
Let be an complex matrix satisfying the following: for some and, for all , with for some . Then, there exists a unit vector such that, for any and any complex matrices ,
[TABLE]
Proof.
By the Schur decomposition, we know that can be written in triangular form as , with , for all , and . Hence, for any , , with having the same form as and . As a consequence, we have
[TABLE]
We now just need to upper bound the error terms in the three expressions above. For the first one we clearly have
[TABLE]
For the second one we get by Hölder inequality that
[TABLE]
And for the third one we get again by Hölder inequality that
[TABLE]
And we thus get precisely the announced result. ∎
Corollary 5.2**.**
Let be an complex matrix satisfying the following: for some and, for all , with for some . Let be such that and . Then, for any complex matrices ,
[TABLE]
Proof.
We know by Lemma 5.1 (and using the notation introduced there) that
[TABLE]
Set and , which are clearly such that and . Set also
[TABLE]
We then have
[TABLE]
which is exactly what we wanted to show. ∎
Lemma 5.3**.**
Let be the -site column tensor of a translation-invariant MPS (if ) or PEPS (if ). Denote by its associated transfer operator on and by its contraction on sites. Fix also . Then, for any Hermitian operators on ,
[TABLE]
where are operators on satisfying .
Proof.
The first two equalities are simply by definition of . So let us turn to the last two equalities. Given a Hermitian operator on , its corresponding operator on is defined by
[TABLE]
Hence, for any unit vector , we have
[TABLE]
And we thus have shown, as wanted, that . ∎
The way is constructed from in the above proof is probably much easier to understand with a diagram than with a formula. In the MPS case, it is simply represented by:
AA
Let us now make a simple but important observation. Let be the -site tensor of a translation-invariant MPS (if ) or PEPS (if ). Denote by its associated transfer operator on and by its contraction on sites. We will focus here on a slightly less general setting than the one of Section 3, for the sake of readability. More precisely, we will consider only the case of Hermitian operators supported on one -site column. Hence, for any and any Hermitian operators on , we adapt the definition of the correlation function from equation (10) to
[TABLE]
By Lemma 5.3 we know that the latter can actually be re-written as
[TABLE]
where are operators on satisfying .
In what follows, we will need two easy deviation bounds for some scalar products in Gaussian variables. We gather them below.
Lemma 5.4**.**
Let be a Gaussian vector in with mean [math] and variance . Then,
[TABLE]
Proof.
Lemma 5.4 is a straightforward application of the Gaussian concentration inequality, as recalled in Theorem 1.5. Indeed, first by Jensen inequality
[TABLE]
And second it is clear that is -Lipschitz. Therefore,
[TABLE]
which is exactly the announced result. ∎
Lemma 5.5**.**
Let be independent Gaussian vectors in with mean [math] and variance . Then,
[TABLE]
Proof.
Lemma 5.5 is simply a bound on the tails of the Gaussian distribution. Indeed, observe that is distributed as a complex Gaussian with mean [math] and variance . And it is well-known that, for such ,
[TABLE]
which concludes the proof. ∎
5.2. The case of MPS
Lemma 5.6**.**
Let be defined as in equation (2). Then,
[TABLE]
Proof.
To begin with, observe that is distributed as , where is a Gaussian vector in with mean [math] and variance . Indeed,
[TABLE]
where we have set, for each , , so that the ’s are distributed as independent complex Gaussians with mean [math] and variance . Now, for such vector , we know by Lemma 5.4 that
[TABLE]
And the proof is thus complete. ∎
Theorem 5.7**.**
Let be the random -site translation-invariant MPS whose random -site tensor is defined as in equation (1). Then, with probability larger than , for any and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
First of all, we know by Theorem 4.15 that there exist universal constants such that, with probability larger than ,
[TABLE]
Next, we know by Lemma 5.6 (applied with, say, ) that, with probability larger than ,
[TABLE]
Now, combining Corollary 5.2 and Lemma 5.3 we know that, setting , we have, for any and any Hermitian operators on ,
[TABLE]
Putting everything together, we thus eventually get that there exist universal constants such that, with probability larger than , for any and any Hermitian operators on ,
[TABLE]
exactly as announced. ∎
5.3. The case of PEPS
Lemma 5.8**.**
Let be defined as in equation (5). Then,
[TABLE]
Proof.
The proof technique is largely inspired from that of Proposition 4.22. So we might skip a few details here.
To begin with, observe that is distributed as
[TABLE]
where the ’s are independent Gaussian vectors in with mean [math] and variance . Indeed,
[TABLE]
where we have set, for each and each , , , so that the ’s are independent complex Gaussians with mean [math] and variance .
Now, given , we can re-write
[TABLE]
where we introduced the notation, for each ,
[TABLE]
Given and such that , we define . We then have that, for , is independent from , while for , . Hence, for , we know from Lemma 5.5 that
[TABLE]
while for , we know from Lemma 5.4 that
[TABLE]
And therefore,
[TABLE]
Since , we thus have
[TABLE]
We then simply have to notice that, on the one hand,
[TABLE]
while on the other hand,
[TABLE]
And consequently, we get in the end that
[TABLE]
which implies precisely the result we wanted to show. ∎
Theorem 5.9**.**
Let be the random -site translation-invariant PEPS whose random -site column tensor is defined as in equation (4). Assume that , for some universal constant , and that and with and . Then, with probability larger than , for any and any Hermitian operators on ,
[TABLE]
where are universal constants.
Proof.
First of all, we know by Theorem 4.23 that there exist universal constants such that, with probability larger than ,
[TABLE]
Next, we know by Lemma 5.8 (applied with ) that, with probability larger than ,
[TABLE]
Now, combining Corollary 5.2 and Lemma 5.3 we know that, setting , we have, for any and any Hermitian operators on ,
[TABLE]
We now just have to observe that, for , (so that the range of possible values for is not empty), and that with the assumptions we made on , we have and . Hence putting everything together, we eventually get that there exist universal constants such that, with probability larger than , for any and any Hermitian operators on ,
[TABLE]
exactly as announced. ∎
Note that the setting of Theorem 5.9 is more or less the same as the one of Theorem 3.9, with having to grow with . The only difference is that in Theorem 5.9 and are both polynomial in , while in Theorem 3.9 is polynomial in and is sub-polynomial in . Anyway, the obtained typical correlation length is of the same order in both cases, namely .
6. Other implications
6.1. New random constructions of quantum expanders
Let be an MPS transfer operator, of the form
[TABLE]
where the ’s are matrices. can equivalently be seen as a completely positive (CP) map on the set of matrices, having Kraus operators, defined by
[TABLE]
Given a unit vector , written as
[TABLE]
define , matrix with unit Hilbert–Schmidt norm, as
[TABLE]
It is then easy to see that
[TABLE]
So and have the same eigenvalues and associated eigenvectors in one-to-one correspondence.
The notion of quantum expander was introduced in [8]. We here adopt the slightly generalized definition of [30], which applies to any completely positive trace-preserving (CPTP) map (not necessarily unital, i.e. having the maximally mixed state as fixed state). A CPTP map on matrices is called -regular if it has Kraus rank at most , and it is called -expanding if its second largest eigenvalue (in modulus) is at most . Such a CPTP map is called a quantum expander with parameters if, in addition, its fixed state has entropy at least . A ‘good’ quantum expander should have as large at possible and as small as possible.
Let be the random MPS transfer operator, as defined by equation (1), and let be its associated random CP map, which is thus defined by
[TABLE]
We know by Theorem 4.15 that
[TABLE]
which by the preceding discussion is equivalent to
[TABLE]
Furthermore, denoting by the eigenvector of with associated eigenvalue , we also know by Theorem 4.15 that, with probability larger than , there exists a vector with norm at most such that
[TABLE]
This implies that the eigenvector of with associated eigenvalue is , which, with probability larger than , is of the form
[TABLE]
where has Hilbert–Schmidt norm at most .
is a priori not TP. Nevertheless, we will show that we can construct a random CPTP map which is with high probability a good approximation of (at least as soon as for some universal constant ). With this aim in view set
[TABLE]
Saying that is close to being TP is equivalent to saying that is close to the identity, which is what we prove below.
Lemma 6.1**.**
Let be the random matrix defined by equation (27). Then,
[TABLE]
where are universal constants.
Proof.
Observe that, re-scaled by a factor , is a Wishart matrix of parameter . The result thus immediately follows from Theorem 1.7, applied with and . ∎
By Lemma 6.1 we get in particular that is invertible with probability larger than . If this is the case, then we can define the map by
[TABLE]
is by construction a CPTP map. Let us now show that it is with high probability a good approximation of .
Corollary 6.2**.**
Let and be the random CP and CPTP maps defined by equations (26) and (28). Then,
[TABLE]
where are universal constants.
Proof.
For any such that , we have
[TABLE]
where the first inequality is by the triangle inequality, after noticing that , while the second inequality is by Hölder inequality.
Now first of all, we know by Lemma 6.1 that, with probability larger than , , so a fortiori . What is more, with probability larger than , for any such that ,
[TABLE]
Putting everything together, we thus eventually get that, with probability larger than , for any such that ,
[TABLE]
which (suitably re-labelling ) is precisely the advertised result. ∎
Proposition 6.3**.**
Let be the random CPTP map defined by equation (28), and denote by its fixed state. Then,
[TABLE]
where are universal constants.
Proof.
Since is CP, we can assume without loss of generality that . We can thus define , which is the state such that . Then,
[TABLE]
This means that
[TABLE]
and therefore, by the triangle inequality, that
[TABLE]
Now, first of all we know that, with probability larger than , , so that
[TABLE]
Next, we know by Corollary 6.2 that, with probability larger than ,
[TABLE]
Since we also know that, with probability larger than , , this implies that, with probability larger than ,
[TABLE]
Putting everything together we thus get that, with probability larger than ,
[TABLE]
The only thing that now remains to be done is to upper bound the typical value of . Since , we actually have to lower bound the typical value of . Yet, we know that, with probability larger than ,
[TABLE]
where the last inequality is because .
So in the end we have shown that, with probability larger than ,
[TABLE]
which (suitably re-labelling ) is precisely the advertised result. ∎
Theorem 6.4**.**
Let be the random CPTP map defined by equation (28). Then, with probability larger than , is a quantum expander with parameters , where are universal constants.
Proof.
The fact that is -regular is clear by definition. The fact that, with probability larger than , , so that is -expanding, is established in the proof of Proposition 6.3. So it only remains to lower bound the typical entropy of . By concavity of we have
[TABLE]
Combining this observation with Proposition 6.3 we get that, with probability larger than ,
[TABLE]
which concludes the proof (after suitably re-labelling ). ∎
6.2. A model of random dissipative evolution
In the recent past, the analysis of local random circuits has triggered great interest. Very broadly speaking, the main question that one tries to answer in this field is: after which depth does the action of a circuit composed of local random unitaries ‘resembles’ that of a global random unitary (on any input many-body state)? Typical features of a global Haar-distributed unitary, that one would like to reproduce in a more economical way, include: scrambling [12, 11, 27], decoupling [13], entanglement spreading [24, 25] etc. Such models for random reversible evolutions have now been studied quite extensively. But what about similar models for random dissipative evolutions?
Our random PEPS transfer operator, as defined by equation (5), actually provides one such model of random evolution in the open system picture. Indeed, as explained in Section 6.1 in the case of MPS, a random transfer operator can equivalently be seen (after renormalization) as a random quantum channel, i.e. a random evolution of a system coupled to an environment. What is more, the quantum channel corresponding to a PEPS transfer operator is by construction acting on its input many-body state with some locality constraints, as a local circuit in the case of isolated systems. The only issue is that, in this particular context of chaotic quantum dynamics, a non translation-invariant model is usually more relevant than a translation-invariant one.
So let us start with explaining how the results of Section 4.3 can be extended to the case of non translation-invariant random PEPS. The model that we are now considering is constructed in a very similar way to the one we have been looking at up to here: the only difference is that we sample the -site tensors independently from one another, each being distributed as the -site tensor defined by equation (3). Let us denote by the corresponding transfer operator, i.e.
[TABLE]
where the ’s are independent matrices whose entries are independent complex Gaussians with mean [math] and variance .
The analogues of Propositions 4.18 and 4.22 now read as follows.
Proposition 6.5**.**
Let be defined as in equation (29). Then, and there exist universal constants such that
[TABLE]
Proposition 6.6**.**
Let be defined as in equation (29). Then, there exist universal constants such that, for all ,
[TABLE]
where .
Note that the only difference with Propositions 4.18 and 4.22 is an extra factor in the deviation probabilities. This is quite intuitive to understand: contrary to which is made out of one single random tensor repeated times, is made of independent random tensors, so that deviation probabilities for each of them have to somehow add up. We will not fully redo the proofs in this non translation-invariant case, but simply explain how the proofs in the translation-invariant case have to be modified.
Sketch of proof of Proposition 6.5.
Similarly to the proof of Proposition 4.18, we begin with observing that
[TABLE]
where the ’s are independent and distributed as with and . Next, for each , write as with and . We thus have
[TABLE]
Now, we know from Propositions 4.13 and 4.14 that, for each , with probability larger than , and . Therefore, with probability larger than , the two following hold
[TABLE]
which is precisely what we wanted to show. ∎
Sketch of proof of Proposition 6.6.
Our first claim is: Lemma 4.20 holds exactly the same when, instead of having only independent matrices ’s, one has independent matrices ’s, only replacing by in the deviation probability. Indeed, the induction proof works exactly alike. The only thing that changes is that we now have to define
[TABLE]
and the upper bound (19) becomes
[TABLE]
Then, we know on the one hand that with probability at most , so that also, clearly, with probability at most . While we know on the other hand that, by recursion hypothesis, with probability at most and with probability at most . This implies, exactly as wanted, that with probability at most .
It then immediately follows that also Corollary 4.21 holds exactly the same when, instead of having only independent matrices ’s, one has independent matrices ’s, only replacing by in the deviation probability. And from there we deduce that Proposition 4.22 as well holds exactly the same for instead of , only replacing by, say, in the deviation probability. ∎
From Propositions 6.5 and 6.6, one can then straightforwardly derive the analogue of Theorem 4.23 in this independent case, as stated below.
Theorem 6.7**.**
There exist universal constants such that, for all ,
[TABLE]
where .
In particular, there exist universal constants such that, if and with and , then
[TABLE]
This lower bound on the typical spectral gap of the PEPS transfer operator , together with the knowledge that is typically close to its largest eigenvalue eigenvector, would now allow for an analysis quite similar to that carried on in Section 6.1 for the MPS transfer operator . In particular, one could study the following questions: How close typically is the fixed point of the quantum channel , corresponding to , to the maximally mixed state? And when iteratively applying to an input state, how fast does the latter typically converge towards this fixed point?
6.3. Miscellaneous final comments
Let us start with a few comments on the results of Section 4, about the typical spectral gap of random transfer operators. In the MPS case, we know that the scaling we obtain for the spectral gap is optimal. In the PEPS case though, the statements that we are able to make remain not fully satisfying. The main open question clearly is: could these results be improved so that growing polynomially with is not needed? With our current proof techniques, the exponents in this polynomial dependence could be optimized. But getting rid of this limitation would require totally different arguments. Hence for now, the transfer operator approach does not seem to be the most suited to tackle the case of higher dimensional regular lattices. Indeed, even though it is extremely powerful in dimension , it is doomed to yield results which are not independent of the system size in dimension or higher.
Concerning the results of Section 2, they are likely to be sub-optimal in both the MPS and PEPS cases. Indeed, there is no a priori obstruction for the validity regime to be improved to for MPS and for PEPS. So it would be nice to be able to get closer to this regime. It is indeed clear what are the two points in the proofs where we probably lose something. First it is when upper bounding the operator norm of realigned random matrices (Proposition 2.3 in the case of MPS): we pick up local dimension factors which are quite likely not to be necessary. Second it is when upper bounding the operator norm of approximate ground space projectors on the complement of the ground space by their trace norm (Proposition 2.8 in the case of MPS). In both cases, getting upper bounds with the optimal order of magnitude would require a careful analysis of the specific random matrix models under consideration. Using similar techniques as those used in the proofs of Section 4.2, this does not seem out of reach. What is more, a nice feature of the parent Hamiltonian approach is that it can a priori be easily generalized to any regular lattice.
Let us also say, about this parent Hamiltonian analysis, that it could in principle be generalized to non-injective random MPS and PEPS. For instance, if our random MPS is in a dimensional regime where it is almost surely injective only after blocking together sites (with ), then its associated canonical parent Hamiltonian is not -local but -local. However, its construction remains entirely similar, and the strategy to try and lower bound its spectral gap as well. So we believe that the reasoning would carry through. It would just be more cumbersome, which is why we have restricted ourselves to writing it down properly only under the injectivity assumption. Of course, this guess that our results would generalize in a quite straightforward way to -injective random MPS is only for a fixed constant. Instead, if were to depend on other parameters involved (such as ), then the analysis could become much more subtle.
These results on random parent Hamiltonians being typically gapped obviously trigger a new question: instead of constructing a translation-invariant ground state at random and then studying the spectral properties of the corresponding local translation-invariant Hamiltonian, what about directly constructing the Hamiltonian at random? This viewpoint is the one adopted in [38]. It would be interesting to see if the results in the latter could be extended to non frustration-free situations (i.e. to situations which are outside of the parent Hamiltonian picture).
Another, very different, route that one could explore is how to change our model of random MPS and PEPS in a meaningful (but manageable) manner? A natural idea would be to sample the -site tensors in a non unitarily-invariant way. Indeed, in a model where either physical or bond indices would be favoured, or even some bond indices compared to others, interesting phenomena might arise. But being able to attack such problem seems to be quite challenging. It would also be useful to understand what happens when some symmetry is imposed on the random -site tensors (i.e. when the latter are sampled under the constraint that they are invariant under the action of some group). This situation of MPS and PEPS exhibiting a local symmetry is indeed very important in practice [17].
Acknowledgements
We would like to thank Andrea Coser, David Gosset and Ramis Movassagh for sharing various interesting thoughts at several points of this project. We are also extremely grateful to Henrik Wilming for pointing out to us a mistake in the first version of this work. Finally, we would like to thank the two anonymous referees for their numerous and insightful comments, which truly helped in improving the presentation of our results. C.L. acknowledges financial support from the French CNRS (project PEPS JCJC) and the French ANR (project Investissement d’Avenir ANR-11-LABX-0040). D.P.-G. acknowledges financial support from the European Research Council (European Union’s Horizon 2020 research and innovation programme, grant No. 648913), the Spanish MICINN (projects MTM2014-54240-P, MTM2017-88385-P and Severo Ochoa CEX2019-000904-S) and the Comunidad de Madrid (projects QUITEMAD+ S2013/ICE-2801 and P2018/TCS-4342).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] D. Aharonov, I. Arad, Z. Landau, U. Vazirani. The detectability lemma and quantum gap amplification. Proc. 41st Annual ACM Symposium on Theory of Computing 417–426, 2009.
- 2[2] A. Anshu, I. Arad, T. Vidick. A simple proof of the detectability lemma and spectral gap amplification. Phys. Rev. B 93(205142), 2016.
- 3[3] I. Arad, A. Kitaev, Z. Landau, U. Vazirani. An area law and sub-exponential algorithm for 1D systems. Preprint , 2013.
- 4[4] G. Aubrun, I. Nechita. Realigning random states. J. Math. Phys. 53(102210), 2012.
- 5[5] G. Aubrun, S.J. Szarek. Alice and Bob Meet Banach: The Interface of Asymptotic Geometric Analysis and Quantum Information Theory . Mathematical surveys and monographs 223, American Mathematical Society, 2017.
- 6[6] G. Aubrun, S.J. Szarek, E. Werner. Hastings’ additivity counterexample via Dvoretzky’s theorem. Commun. Math. Physics 305(1):85–97, 2011.
- 7[7] M. Bachmayr, R. Schneider, A. Uschmajew. Tensor networks and hierarchical tensors for the solution of high-dimensional partial differential equations. Found. Comput. Math. 16(6):1423–1472, 2016.
- 8[8] A. Ben-Aroya, O. Schwartz, A. Ta-Shma. Quantum expanders: Motivation and constructions. Proc. 23rd IEEE Conference on Computational Complexity 292–303, 2008.
