• Keine Ergebnisse gefunden

Matrix product states and correlation functions

8. Adaptive cluster approximation 109

8.8. Adaptive-cluster transformation for reduction of entanglement

8.8.1. Matrix product states and correlation functions

Matrix product states (MPS) and density-matrix renormalization group theory (DMRG, [White, 1992, 1993; Östlund and Rommer, 1995; Schollwöck, 2005; Schollwöck, 2011]1) have been shown to be a powerful tools for quantum chemistry [Chan and Sharma, 2011; Marti and Reiher, 2011; Kurashige, 2014]. For the discussion of matrix product states, we follow the discussions in [Eisert, 2013] and [Schuch, 2013]. We focus on the case of open boundary conditions. We assume that the system consists of L sites with a local basis |0i = |00i, | ↑i = |10i, | ↓i = |01i and | ↑↓i = |11i. Thus, the local dimen-sion d is assumed to be equal to four and the total number of one-particle basis states is Nχ = 2L.

The central idea of matrix product states is to write the coefficientscj1,...,jL of a many-particle wave function

|Ψi= X

j1,...,jL∈{0,↑,↓,↑↓}

cj1,...,jL|j1, ..., jLi (8.28) as a product [Fannes et al., 1992; Östlund and Rommer, 1995; Rommer and Östlund, 1997]

cj1,...,jL = Xd1

i1=1 d2

X

i2=1

...

dL−1

X

iL−1=1

Mi(1),j1 1Mi(2),j1,i22· · ·Mi(L−1),jL−2,iL−1L−1Mi(L),jL−1L (8.29)

=M(1),j1M(2),j2· · ·M(L),jL (8.30)

with the vectors M(1),j1 ∈ C1×d1 and M(L),jL ∈CdL−1×1 as well as the matrices M(i),ji ∈ Cdi×di+1 for 1< i < L. di are called bond dimensions. The maximal bond dimensions are d1 =d, d2 =d2, d3 =d3, ... dL−2 =d2 dL−1 =d, (8.31) whered is the local dimension. The maximal bond dimensiondl of the bond between site l and l+ 1 is the number of Schmidt values qj in the Schmidt-decomposition

|Ψi=

dl

X

k=1

qkA,ki ⊗ |ΨB,ki (8.32)

1A more complete list of references can be found in the reviews [Schollwöck, 2005], [Verstraete et al., 2008] and [Schollwöck, 2011].

with

A,ki= X

j1,...,jl

cA,k,j1,...,jl|j1, ..., jli (8.33)

B,ki= X

jl+1,...,jL

cB,k,jl+1,...,jL|jl+1, ..., jLi. (8.34) The von Neumann entropy of entanglement between the subsystem A consisting of the sites 1, ..., l and the subsystem B consisting of the sites l+ 1, ..., L is defined as

SA|B =−Tr (ρAlog2ρA), (8.35) whereρA = TrB|ΨihΨ|is the reduced density matrix and TrB is the partial trace over the basis of the system B. The reduced density matrix ρA can be written with the Schmidt decomposition of the state |Ψi as

ρA=X

k

qk2A,kihΨA,k| (8.36) and the entanglement entropy as

SA|B=−X

k

qk2log2q2k. (8.37)

Thus, the entanglement entropySA|Bis directly related to the bond dimensions of a matrix product state. A matrix product state with the maximal bond dimensions can represent any many-particle wave function. Matrix product states can efficiently represent states with small numbers of non-zero Schmidt values qk because this situation corresponds to a small bond dimension and hence a small size of matrices M(i),ji.

A matrix product state is a representative of the much more general class of tensor wave functions. A graphical representation of tensors and operations drastically simplifies the notation. We define a scalar as a box

x= ∈C (8.38)

and a vector as a box with a leg

~x= ∈CD. (8.39)

A vector is a tensor of rank one and has one leg. An n-th order tensor has n legs. The leg can also have an explicitly given index j to select a specific element, i.e.

~xj = . (8.40)

A matrix as a tensor of rank two is represented as

A= ∈CD×D. (8.41)

A contraction of an index is a summation over all possible values an index (a shared leg) can take. Thus, a matrix-matrix product can be written as

(A·B)ab =X

j

AajBjb = = =Cab. (8.42)

8.8. Adaptive-cluster transformation for reduction of entanglement

The coefficients cj1,...,jL represent a tensor of rankL and can be drawn as

cj1,...,jL = . (8.43)

We have oriented the legs vertically to indicate that the indexes correspond to local basis states. These indexes are called physical indexes. The matrix-product-state representa-tion in Eq. (8.29) can be drawn as

cj1,...,jL = . (8.44)

The indexes that correspond to horizontal legs are called bond indexes.

For a variational minimization of the total energy, i.e., the expectation value of the Hamiltonian ˆH, we also need to be able to compute expectation values hΨ|O|ˆ Ψiof opera-tors ˆO. We first discuss the case where the operator ˆO is supported on neighboring sites, l and l+ 1. With this restriction, ˆO has the general form

Oˆ = Xd

jl=1 d

X

jl+1=1 d

X

kl=1 d

X

kl+1=1

Okjll,j,kj+1l+1|jj, jl+1ihkl, kl+1|. (8.45) The tensor O can be represented graphically as a tensor with four physical indexes as

Okjl,jj+1

l,kl+1 = . (8.46)

Matrix product operators will be discussed in detail in section 8.8.3. The expectation value hΨ|O|ˆ Ψi can be drawn in the graphical representation as

hΨ|O|ˆ Ψi= . (8.47)

As every shared leg represents a summation, a naive evaluation of the contractions would result in an exponential complexity. Thus, a more efficient way of contracting the network is needed. For this purpose, the tensor network is contracted starting from the rightmost and the leftmost end. At first, the two ends are contracted. The tensor

Lα,β = =Xd

j=1

Mα(1),jMβ(1),j = (8.48)

and the tensor

Rα,β = =Xd

j=1

Mα(L),jMβ(L),j = (8.49)

are defined and represent the ends of the network. The analogous contraction of the physical index can be performed for every site. This leads to the definition of the transfer operator

E(k)

α,β,γ,δ = =Xd

j=1

Mα,β(k),j(Mγ,δ(k),j) = . (8.50)

Similarly, a two-site transfer operator for the operator ˆO can be defined as

(EO)α,β,γ,δ = = . (8.51)

With these definitions the expectation value can be written as

hΨ|O|ˆ Ψi=LE(2)· · ·E(l−1)EOE(l+2)· · ·E(L−1)R. (8.52) To estimate the computational complexity, we assume, that the bond dimensions di are bounded by a maximal bond dimension D. Rcan be viewed as anD2-dimensional vector, because it has two bond indexes. Therefore, E(L−1)R is a matrix-vector multiplication with a computational complexity ∈ O(D4) and hence the computation of the expectation value has a complexity ∈ O(LD4). The transfer operator can be used to discuss the spatial decay of correlations functions of matrix product states. Following [Schuch, 2013;

Eisert, 2013], we take an infinite translational invariant matrix product state

cj1,...,jL = TrMj1· · ·MjL = . (8.53)

and consider the thermodynamic limit L→ ∞. The transfer operator is Eα,β,γ,δ =Xd

j=1

Mα,βj (Mγ,δj ) = (Eγ,δ,α,β) (8.54) and site-independent. We estimate the correlation functionhOˆaOˆbi, where ˆOais supported on site a and ˆOb is supported on site b. We assume a < b. The corresponding transfer operators are

(Ea)α,β,γ,δ = = (8.55)

(Eb)α,β,γ,δ = = . (8.56)

8.8. Adaptive-cluster transformation for reduction of entanglement

Thus, the expectation value hOˆaOˆbi can be written as

hOˆaOˆbi= TrEaEb−a−1EbEL−1−b+a

TrEL . (8.57)

The transfer operator E can be represented as a D2 ×D2 hermitian matrix with the eigenvalues λ1λ2...λD2. E can be written in its eigendecomposition as

We assume that the maximal eigenvalue λ1 is unique. E can be chosen such that the maximal eigenvalue λ1 is equal to one and hence

m→∞lim Em =|e1ihe1|. (8.59)

Thus, in the thermodynamic limitL→ ∞and for finiteb−a, we obtain for the correlation function in Eq. (8.57) the form

hOˆaOˆbi=he1|EaEb−a−1Eb|e1i (8.60)

The second terms governs the spatial decay of the correlation function. The correlation length ζ that quantifies the decay for |b−a| 1 of the correlation function as

|hOˆaOˆbi − hOˆaihOˆbi| ∝e−ζ−1|b−a| (8.64) is given by the second eigenvalue as

ζ−1 =−log|λ2|. (8.65)

This shows that correlation functions of matrix product states decay exponentially in case the largest eigenvalue of the transfer operator is unique. This fact also indicates that matrix product states can efficiently represent ground states of gapped models because in gapped models the correlations functions decay exponentially. In case the largest eigenvalue of the transfer operator is not unique, i.e., λ1 =λ2, we have

m→∞lim Em =|e1ihe1|+|e2ihe2| (8.66)

and for the correlation function Thus, the correlation function has a constant long-range contribution Olong−range that is independent of the distance of a and b. The spatial decay for large |b −a| is again exponential

|hOˆaOˆbi − hOˆaihOˆbi −Olong−range| ∝e−ζ−1|b−a| (8.70) and the correlations length ζ is determined by the third eigenvalue λ3 as

ζ−1 =−log|λ3|. (8.71)

The generalization to n-times degeneracy of the largest eigenvalue, i.e. λ1 = ...= λn, is straight forward and also leads to constant long-range contribution. Thus, matrix product states can describe exponentially decaying and constant long-range correlation functions efficiently. However, matrix product states cannot describe algebraically decaying corre-lation functions, i.e.

|hOˆaOˆbi − hOˆaihOˆbi| ∝ |b−a|−α, (8.72) efficiently.