Tensor renormalization group in bosonic field theory
Manuel Campos, German Sierra, Esperanza Lopez

TL;DR
This paper applies a tensor network algorithm with a novel SVD approach to compute the partition function of a free boson on a lattice, revealing fixed point structures and matching conformal field theory results in the massless limit.
Contribution
It introduces a continuous matrix SVD for tensor networks, enabling highly accurate calculations of bosonic field theories on lattices.
Findings
Emergence of a CDL fixed point structure
Accurate reproduction of conformal field theory results
Precise determination of the central charge in the massless limit
Abstract
We compute the partition function of a massive free boson in a square lattice using a tensor network algorithm. We introduce a singular value decomposition (SVD) of continuous matrices that leads to very accurate numerical results. It is shown the emergence of a CDL fixed point structure. In the massless limit, we reproduce the results of conformal field theory including a precise value of the central charge.
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.
Tensor renormalization group in bosonic field theory
Manuel Campos, German Sierra and Esperanza Lopez
Instituto de Física Teórica UAM/CSIC, C/ Nicolás Cabrera 13-15, Cantoblanco, 28049 Madrid, Spain
Abstract
We compute the partition function of a massive free boson in a square lattice using a tensor network algorithm. We introduce a singular value decomposition (SVD) of continuous matrices that leads to very accurate numerical results. It is shown the emergence of a CDL fixed point structure. In the massless limit, we reproduce the results of conformal field theory including a precise value of the central charge.
††preprint: IFT-UAM/CSIC-19-11
Tensor Networks (TN) have become in recent years a standard technique to study a wide variety of problems in Condensed Matter Physics, Statistical Mechanics, Quantum Field Theory and other areas of Physics V08 ; O14 . In quantum lattice systems TN provide variational ansatzs for many body wave functions denoted tensor network states (TNS). Well known examples of TNS are Matrix Product States (MPS) for 1D systems A88 ; F92 ; K93 ; O95 ; V03 ; V04 that underlies the DMRG method W92 ; D97 ; S05 , Projected Entangled Pairs States (PEPS) that is a 2D version of MPS VC04 ; S98 , Multiscale Entanglement Renormalization Ansatz (MERA) V07 ; G08 ; P09 , etc. The use of TNS has also made possible to classify the symmetry protected phases in 1D, explore the topological phases of matter in 2D P10 ; C11 ; N11 and provide simple versions of holography in the AdS/CFT correspondence Sw12 ; LS15 ; PY15 ; Mo15 ; MN15 ; CK17 .
In classical spin systems the DMRG techniques where applied to compute the partition function N95 . Later on the method was improved expressing the partition function and correlations using 4-index tensors M05 . An important step was made by Levin and Nave who proposed the Tensor Renormalization Group (TRG) LN07 were the Kadanoff-Wilson blocking method is improved by implementing entanglement techniques in the truncation procedure K66 ; W75 . However the TRG does not fully succeed in removing the short range entanglement. For non critical systems, the TRG converges towards non trivial tensors with a corner double line (CDL) structure LN07 ; GW09 . This difficulty was solved by implementing techniques first developed for MERA EV15 ; EV15b .
The aim of this letter is to explore the application of real space tensor network techniques to study quantum field theories. Our motivation is to revisit quantum field theory, and in particular renormalization group issues from a framework naturally adapted to capture the role played by entanglement. As a first step, we efficiently adapt the TRG protocol to evaluate the partition function of a free boson. Like in the ordinary TRG, a CDL type infrared fixed point emerges at the expected length scale. In the conformal limit we obtain a competitive estimation for the value of the central charge. Our implementation of the TRG is based on the simple rules of gaussian integration, and hence we name it gaussian TRG (gTRG).
The model. We will consider a free scalar of mass in two dimensions. Continuous versions of tensor networks have been proposed for the study of quantum field theories V10 ; H13 ; J15 ; TC18 ; HV18 . However they are not yet developed to the extent ordinary tensor networks are, and we will not pursue them here. In the following, space-time will be discretized while field variables retain their continuous character. This choice breaks symmetries like translation and rotation but they can be recovered in the continuum limit. Space-time will be represented by a square lattice with periodic boundary conditions. At each site of the lattice lives a variable . The euclidean partition function is
[TABLE]
where is measured in lattice units.
The interactions on the lattice described by (1) are pairwise between the fields at neighbour sites. It is convenient to change to a vertex model, where the fields live on the edges and the interactions take place at the lattice sites. On the dual tilted lattice, we define the statistical weights
[TABLE]
that can be depicted as
[TABLE]
We have shadowed the interaction vertices for clarity.
Gaussian SVD. We will implement a TRG protocol to reduce iteratively the number of degrees of freedom. The basic tool used in systems with a finite number of degrees of freedom is the singular value decomposition (SVD) of the network tensors. Any finite rank matrix can be decomposed as , where and are unitary matrices and is diagonal with non-negative entries. The latter result also holds for compact operators acting on Hilbert spaces of continuous functions. This result has been used to implement the standard TRG approach to a -boson field theory Sh12 . Here we shall not follow this approach but one that is inspired on standard field theory techniques. Indeed, we will impose two requirements at each step of the coarse graining procedure: i) the statistical weights should remain gaussian and ii) the lattice variables should be continuous fields. These requirements leads us to adapt the SVD suitably.
We will allow several fields to live at each lattice edge. For simplicity we still denote them collectively as . The number of fields per edge plays the role of bond dimension. We group the fields entering each vertex in two sets labelled as and . Generic gaussian weights have the form
[TABLE]
with and real matrices of dimension and a constant. We search for a decomposition of inspired in the SVD. Namely, we want to factorize the dependence on L and R fields by introducing new variables, which according to the previous requirements should have the interpretation of fields
[TABLE]
A way to proceed is working directly with the quadratic forms that appear in the exponent of the gaussian weights. The L and R fields are connected by the matrix B, which thus hinders factorization. Since is real, we have with and also real. We are assuming that contains only strictly positive entries and hence it is of dimension . Introducing new fields , we can rewrite
[TABLE]
where we have used straightforward gaussian integrations to define
[TABLE]
Relation (5) is a continuous SVD, with the entries of the diagonal matrix providing the singular values. act as canonically conjugate variables of the original fields. However, the diagonal factors cause (4) to deviate from a SVD
[TABLE]
These matrices will probe crucial in the implementation of the TRG. They are the price to pay for the enormous simplification of working at the level of the exponent, dealing only with finite dimensional matrices. We will refer to (4) as gaussian SVD (gSVD).
Gaussian TRG. It is an iterative application of the following transformations of a model defined on a lattice of sites into a lattice of sites
[TABLE]
namely: i) gSVD of the weights of the -fields, ii) construction of the weights of the -fields, iii) gSVD of the weights of the -fields, and iv) construction of the weights of the -fields. The and -fields turn out to have very different properties (see below). We shall label the associated matrices with a subscript or , corresponding to the tilted and directed lattices that are rotated by every TRG transformation. A complete RG cycle returns to the same type of lattice, and thus it is composed of two TRG steps.
We will use a subindex to label the RG iteration as indicated in the above figure. The initial lattice, defined by the weights (2), has by assumption . Its associated matrix has two equal singular values, and thus . With no truncations, the bond dimension doubles when transforming from to -fields, i.e. , and remains constant in the reverse step, i.e. . Hence .
The singular values added at each RG transformation are expected to encode correlations at larger coarse grained scales. In the vacuum of the bosonic theory correlations decay with distance. Hence at some RG step the new singular values should start being sufficiently small to set them to zero with a small error cost. This reduces the dimension of the ancillary field space and renders the calculation feasible. Since we are not dealing with an ordinary SVD, there is some degree of ambiguity involved in this implementation. We will proceed as follows. The matrix can be rewritten as
[TABLE]
where are diagonal matrices with the highest (), and smallest (), eigenvalues of respect to a chosen cutoff. Based on that, we can substitute
[TABLE]
where and can refer to the or -fields. The matrix is given by (5) with replaced by . The delta function eliminates the dependence on the fields , reducing the bond dimension. The difference between the exact and the truncated weights is , where
[TABLE]
In the large field limit, can be arbitrarily large no matter how small are the entries of . In order to justify (8) it is necessary to have the large field values suppressed. This is achieved by the factors , which in particular contain the mass terms for the lattice fields. The high accuracy of the numerical results presented below indicates that these matrices indeed play efficiently the role of field regulators.
We name this adapted TRG protocol gTRG. The integration leading to the new weights at each gTRG step are gaussian and thus easy to perform. From now on we use a scheme in which , and hence the relation satisfied by the initial weights will be preserved (see SM.A). In this scheme the same gSVD data characterize every lattice site.
Results. The partition function of a free boson can be computed analytically using momentum eigenmodes. For a lattice of size with periodic boundary conditions it reads
[TABLE]
where . Comparison with the exact result allow us to test the performance of the gTRG method. In Fig.1 we plot the relative error in the free energy per site, , as a function of the mass for different maximal bond dimensions . A large lattice with has been chosen. With we obtain an error below . The results for become increasingly noisy because we reach the accuracy limit of the numerical tools we are using: Mathematica with default settings. The dashed lines in Fig.1 are averaged results for the absolute value of . With the average precision is , while in the best cases we have reached an error below .
Truncation is introduced in a step leading from a to a -lattice, since it is then when the bond dimension increases. Fig.2-left shows the singular values of . No truncation has been yet applied and hence . We observe that the singular values are very strongly decaying. This general property allow us to truncate them affecting only mildly the accuracy of the results. Notably it also holds in the limit of very small masses, explaining the smooth and efficient behaviour of the gTRG in a regime which is problematic for the ordinary TRG.
Independently of the bond dimension, we have discarded singular values smaller than a threshold in order to minimize numerical errors. The value of depends on the numerical precision with which we are operating. In our case, we found appropriate to set . Imposing this threshold in fact improves the effectiveness of the TRG in a rather not trivial way that involves both and -fields and is explained in the SM.B. Fig.2-right shows the relative error in the free energy per site as a function of the bond dimension for . This curve has two well differentiated segments. The first one falls as , with . This is the typical TRG behaviour, in which improving the precision is increasingly expensive LN07 ; EV15 . The parameter starts playing a role at . At this point the curve enters its second segment, where we observe that the precision improves at a lower computational cost.
Massless case.- The accurate results of the gTRG for small masses allow us to address the massless case. In the limit and , with constant, the exact partition function (10) can be approximated by (see SM.D)
[TABLE]
where is the partition function of a massless boson in a torus with moduli parameter CFT . In our case .
The leading contribution to the free energy per site comes from the exponential term in (11)
[TABLE]
where is the Catalan constant. The CFT partition function is responsible for the leading finite size corrections. Choosing , equation (11) yields
[TABLE]
where is the theoretical value of the central charge A86 ; B86 . Taking and and using (13) we obtain respectively
[TABLE]
These values are derived with by averaging over in order to minimize the numerical noise. For larger the numerical noise wins over the leading finite size effect, while for smaller lattices higher order finite size effects worsen the result.
RG flow. The RG behaviour of free field theories is extremely simple. When a mass parameter is present, it runs with the scale according to its bare dimension. Hence a small mass will become of order one in lattice units after
[TABLE]
RG iterations. For correlations should be mostly confined to occur inside a single lattice plaquette. Entanglement inside a plaquette is modelled by a corner double line (CDL) structure LN07 ; GW09
[TABLE]
The TRG has the drawback of being unable to eliminate such ultralocal entanglement and reach a trivial IR fixed point. Instead it promotes the inner correlations from half of the plaquettes to the next coarse graining level, reproducing again a CDL structure. The same should apply to the gTRG.
The emergence of a CDL structure requires that the singular values of form equal value pairs. The singular values of have a strong tendency to arrange in pairs. Indeed, Fig.2-left shows that the six highest singular values have already paired up after three RG cycles. This is however not the case for . Its singular values in the first RG cycle can be derived explicitly
[TABLE]
For small masses and . In successive RG cycles, the gap between the largest singular value and the rest slowly decreases until it closes. The singular values then pair up as required for CDL behaviour and acquire fixed values. The smaller the mass, the larger the gap and the more RG iterations are necessary. Fig.3-left shows the RG flow of the singular values for and . Pairing is effective for in agreement with (15), which gives .
The same behaviour is seen in Fig.3-right. We have plotted the singular values of obtained with . The singular values pair up for masses larger than . Below they rapidly unpair, with the largest singular value strongly detaching from the rest. In rescaled lattice units the threshold mass is . Hence a CDL structure does not emerge until scales larger than the correlation length, , are reached.
Let us denote by the submatrix of that connects fields on opposite links. While the pairing of singular values is necessary for CDL, the vanishing of in two successive gTRG steps is a sufficient condition (see SM.C). We define
[TABLE]
where is the Frobenius norm and the largest singular value of . The RG evolution of this quantity is plotted in Fig.4-left for the example of Fig.3-left. It abruptly decreases at the same scale at which the singular values pair up, confirming that the complete CDL structure is realized.
Fig.4-right shows the number of RG cycles necessary to attain a CDL IR fixed point using for criterium . Similar results are obtained for large and small bond dimensions. In both cases they are consistent with the scaling argument (15). An extrapolation to the massless limit implies and thus an infinite correlation length. This suggests that the gTRG keeps some long distance information for any bond dimensions. The reason behind it could be related with an important feature of the gTRG. It is constructed such that the lattice variables are always fields, which can take arbitrarily large values. As a consequence the diagonal matrix in (5), whose components play the rol of singular values for the gSVD, contains arbitrarily small entries even after truncation. On the contrary, the ordinary TRG discards the singular values smaller than a chosen cutoff.
Conclusions.- We have implemented the Tensor Renormalization Group method to compute the partition function of a free boson in two euclidean dimensions. The guiding principle is to preserve the gaussian character of the statistical weights. This led us to modify the singular value decomposition to handle continuous degrees of freedom taking unbounded values. We have obtained very accurate numerical results keeping a small number of fields in the RG iteration procedure. There is still some residual short range entanglement that give rise to CDL tensors. We expect that a version of the TNR along the lines of references EV15 ; EV15b would eliminate it completely reducing the computational cost to achieve the same accuracy as it occurs for spin models. We envisage the generalization of this method to models with interactions. It would likely require the use of perturbative techniques. The final goal is to improve the performance of the entanglement based RG method in quantum field theory.
Acknowledgements.
Acknowledgements.
We would like to thank M. C. Bañuls, J. I. Cirac, G. Evenbly, M. García-Pérez, E. Kim, J.I. Latorre, C. Pena, S. Ryu, L. Tagliacozzo and G. Vidal for conversations. We acknowledge financial support from the grants FPA2015-65480-P and FIS2015-69167-C2-1-P (MINECO/FEDER), QUITEMAD+ S2013/ICE-2801 and SEV-2016-0597 of the “Centro de Excelencia Severo Ochoa” Programme.
I SUPPLEMENTARY MATERIAL
Appendix A A. gTRG algorithm
In order to apply the gTRG algorithm, we first write the bosonic partition function as a contraction of a square tensor network in which each tensor is given by eq.2. This tensor is uniquely identified by a matrix which encodes all the Boltzmann weights.
[TABLE]
with . Similarly at each step we will have square lattices of tensors described by matrices , where indicates the RG cycle and represents the or -fields. The goal of the gTRG algorithm is to compute from its coarse-grained version . If then and , while if then and . Namely and .
From now on, when no confusion is possible we just write and . Following the TRG, we use the gSVD to split in “left” and “right” tensors as shown in eq.(3). Accordingly we separate the fields in their left and right components and , where collectively denote all fields that lives in the corresponding lattice link. is then decomposed in 4 blocks
[TABLE]
As we will show, those blocks have further structure and it is possible to decompose them as
[TABLE]
where , and are symmetric and positive semi-definite matrices, and is a diagonal matrix with non-negative entries. The matrices , and act on the fields of each separated lattice link. This structure is verified by the initial weights, where those little blocks are just numbers
[TABLE]
The proof proceeds by induction. We assume that the previous structure is realized by . Now we perform the gSVD of using the SVD of , as explained in the body of the article. Since we have assumed that are positive definite, so is , and its SVD reduces to a diagonalization. The diagonalization of can be computed from the diagonalization of its blocks . The isometries span the space of non-zero eigenvalues and is the diagonal matrix with the non-zero eigenvalues of . The diagonal matrix and isometry are
[TABLE]
At this point, if the number of new fields is too big or some of the eigenvalues in are too small, we can implement the truncation as explained in the main text.
In the original TRG algorithm, each tensor of the lattice is split in two . The gTRG algorithm proceeds in the same way. Due to the assumed structure of we have , so that
[TABLE]
This relation can be written pictorially as
[TABLE]
[TABLE]
To obtain the new tensor we have to contract a loop of four tensors . Depending on how we label the two halves of each tensor , “left” an “right”, we can have different resulting tensors that are equivalent under a suitable change of fields . We are going to fix this freedom in such a way that all are equal up to rotation, since at the next step they will be split along different axis, and have the structure showed at (19) and (20). Our choice can be depicted as
[TABLE]
The resulting lattice of tensors preserves the translational and rotational symmetries of the original lattice, but only at the level of plaquettes, as it can be seen in the following figure
[TABLE]
The new tensor is given by
[TABLE]
with
[TABLE]
The matrix collects terms quadratic in in the exponent of the integrand and the cross terms in and , while is the corresponding factor of . It is convenient to decompose in two blocks such that . We have
[TABLE]
where is defined as in (22) but substituting by , and the matrix shifts to . Straightforward manipulations show that has the structure described in (19) and (20), with
[TABLE]
where . The matrix is diagonal with non-negative entries. The matrices , and are symmetric by construction. They are also positive semi-definite. This is evident for and since their eigenvalues are those of , which is positive semi-definite because so are and by assumption. After some simple algebra, is also shown to be positive semi-definite.
If the eigenvalues of are all non vanishing, . Since is then an orthogonal matrix, the previous expressions make clear that the matrices and have half of their eigenvalues equal to zero. It can be seen that the same result holds for . As a result, when we perform a new gTRG iteration the bond dimension does not increase. Moreover is a isometry and (30) does not restrict the number of positive eigenvalues of the new matrices , . In the generic case, all of them will be non-vanishing. This property is verified by the initial lattice tensor. Therefore, without truncation, and .
Computation of the partition function.
In this article we compute the partition function of square lattices with sites and periodic boundary conditions, with . After each gTRG step, the number of sites is reduced by . Therefore, after RG steps our lattice only have sites and there are only two tensors left. Then, performing another gTRG transformation the lattice becomes the tensor trace of just one tensor .
[TABLE]
It is important to take into account that the definition of the tensor in the last step is special, since we are not free to arrange the loop of tensors as in (26). Instead, we are forced to use a disposition in which and are placed at opposite sides, as in the following figure
[TABLE]
Appendix B B. Details of the truncation
In order to minimize the numerical error, the gTRG discards singular values of below a given threshold . Without truncation, the singular values of follow an approximately exponential distribution with smaller values added at each step, see Fig.2-left. If we allow large enough, at some point some of them will be smaller than . Using the value , this happens when for , and at smaller for bigger masses. Truncations which involves have relevant differences with those in which plays no role. In the latter case truncation is only triggered when the maximal bond dimension is reached. Before that, the bond dimensions doubles in the gTRG steps that lead from to -fields and remains constant when transforming from to -fields. Therefore
[TABLE]
On the contrary, a typical sequence of bond dimensions which involves is
[TABLE]
corresponding to and . Instead of at once, the maximal bond dimension is now attained in successive steps.
Before truncation, the matrices have quite different properties from : i) half of their singular values are zero, ii) those non-vanishing stay above values. The singular values of are shown for illustration in Fig.5-left. Once triggers truncation , as seen in (34). Moreover, the two previous properties of are not satisfied anymore. More than half of its singular values are now positive. The largest of them behave as before. The new ones instead decay in an approximately exponential way, similar to those of the -lattices. In Fig.5-right we show the singular values of the matrix associated to (34). We observe that the first singular values stay above , while the next ones strongly decay. A total number of survive the cutoff. Hence, after truncation is triggered .
The resulting stepwise pattern of reaching the maximal bond dimension has important consequences in the performance of the gTRG. Fig.2-right shows that it lowers the numerical cost of improving the precision with respect to cases where does not intervene. Interestingly, this turns out to rely on the possibility of having . Indeed, we have checked that restricting the bond dimensions to only increase in the to transformations clearly worsens the results.
Appendix C C. CDL structure
In this section we explain the details of the corner double line (CDL) structure that appears in the gTRG algorithm. The internal structure of the CDL tensors is given by
[TABLE]
where the internal lines represent cross-terms between the corresponding fields in the exponent. The matrix factorizes thus in the tensor product of four equal blocks
[TABLE]
where and are symmetric, positive definite real matrices.
In terms of the definitions introduced in SM.A, CDL requires: i) , ii) half of the eigenvalues of and are zero, iii) the subspaces spanned by the eigenvectors of and with non-zero eigenvalues are orthogonal, iv) the mass matrix does not connect these subspaces. We will now show that if the submatrices coincide in two consecutive gTRG steps, or equivalently, a RG cycle, then the full CDL structure is realized. The indicator defined in (17), where , measures the deviation from this condition. Following the notation of SM.A, we label two consecutive gTRG steps with indices and and their associated fields by and . We assume and . The matrix decomposes as , where the diagonal matrix collects its positive eigenvalues and is a isometry. Using (30) and further applying the following change of basis to the fields in each lattice link
[TABLE]
we obtain
[TABLE]
These matrices clearly satisfy all the requirements for CDL, and lead to (35) with and .
The CDL structure is a fixed point of the gTRG algorithm. Let us perform a gTRG iteration taking as starting point (37). The non-zero block of the matrices and has maximal rank and thus the new bond dimension is again . This implies that , where and is the orthogonal matrix that diagonalizes . The building blocks of the new tensors, defined in (30), satisfy
[TABLE]
Therefore , and the complete CDL structure is realized with and . A new gTRG iteration leads to and , showing that that a RG cycle leaves invariant the exponent of the gaussian weights. Interestingly, a gTRG step exchanges the roles of and .
Appendix D D. Exact results and relation with Conformal Field Theory
Let us consider a lattice and real scalar fields . The partition function is given by
[TABLE]
with
[TABLE]
Let us make the Fourier transform
[TABLE]
where the periodic boundary conditions imply
[TABLE]
and the reality condition reads
[TABLE]
In momentum space the action becomes
[TABLE]
Performing the gaussian integration yields
[TABLE]
Relation with CFT
In the limit , we can approximate eq.(45) by
[TABLE]
We will compute this product in the limit , keeping the ratio constant. For this purpose we shall employ the following formula
[TABLE]
that using
[TABLE]
becomes
[TABLE]
Let us write eq.(46) as
[TABLE]
where
[TABLE]
We can split the product in (50) as
[TABLE]
The first factor is given by
[TABLE]
while the second factor can be obtained using (49),
[TABLE]
where
[TABLE]
Combining eqs.(50), (53) and (D) yields
[TABLE]
Let us define
[TABLE]
Fig. 6 shows that for , the values of this function near 1 can be approximated by
[TABLE]
These analytic expressions can be derived from eq.(57). Hence in the limit , with constant, we find
[TABLE]
where
[TABLE]
The exponent 2 in eq.(59) comes from the terms around that contribute with the same amount as those near .
Let us now evaluate the first product in eq.(56)
[TABLE]
where
[TABLE]
To approximate the sum (61), we use the Euler-MacLaurin formula
[TABLE]
and compute the various terms
[TABLE]
where is the Catalan constant. The rest of the quantities are given in the limit by
[TABLE]
Therefore
[TABLE]
which plugged into eq.(61) yields,
[TABLE]
Collecting terms, eq.(56) becomes
[TABLE]
that can be written as
[TABLE]
where is the free energy per site
[TABLE]
is the partition function of a massless boson on a torus with moduli parameter CFT
[TABLE]
and
[TABLE]
is the Dedekind eta function. Eq.(45) is symmetric under the exchange , a condition that is guaranteed in (71) by the modular invariance of
[TABLE]
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) F. Verstraete, J.I. Cirac, V. Murg, “Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems”, Adv. Phys. 57 ,143 (2008)
- 2(2) Román Orús, “A practical introduction to tensor networks: Matrix product states and projected entangled pair states”, Ann. Phys. 349 , 117 (2014).
- 3(3) I. Affleck, T. Kennedy, E. H. Lieb, and H. Tasaki, “Valence bond ground states in isotropic quantum antiferromagnets”, Commun. Math. Phys., 115 , 477 (1988).
- 4(4) M. Fannes, B. Nachtergaele, and R. F. Werner, “Finitely correlated states on quantum spin chains”, Commun. Math. Phys. 144 , 443 (1992).
- 5(5) A. Klümper, A. Schadschneider, and J. Zittartz “Matrix-product-groundstates for one-dimensional spin-1 quantum antiferromagnets”, Europhys. Lett. 24, 293 (1993).
- 6(6) S. Östlund and S. Rommer, “Thermodynamic Limit of Density Matrix Renormalization”, Phys. Rev. Lett. 75 , 3537 (1995).
- 7(7) G. Vidal, “Efficient Classical Simulation of Slightly Entangled Quantum Computations”, Phys. Rev. Lett. 91 , 147902 (2003).
- 8(8) F. Verstraete, D. Porras, and J. I. Cirac, “DMRG and periodic boundary conditions: a quantum information perspective”, Phys. Rev. Lett. 93 , 227205 (2004).
