64
Thermal tensor network renormalization group algorithms and applications Gang Su University of Chinese Academy of Sciences Dec. 1-5, 2014 IOP Beijing [email protected] http://tcmp2.ucas.ac.cn

Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

  • Upload
    others

  • View
    1

  • Download
    0

Embed Size (px)

Citation preview

Page 1: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Thermal tensor network renormalization group algorithms and applications

Gang Su

University of Chinese Academy of Sciences

Dec. 1-5, 2014 IOP Beijing

[email protected]

http://tcmp2.ucas.ac.cn

Page 2: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Wei Li Shi-Ju Ran Yang Zhao Shou-Shu Gong Bin Xi Xin Yan Tao Liu Fei Ye Zhe Zhang

Acknowledgements

Collaborators:

Grants: NSFC MOST CAS

Prof. Song Gao (PKU)

Page 3: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Outline

• Motivation

• Linearized tensor renormalization group (LTRG) approach and applications

• Optimized decimation of tensor networks with super-orthogonalization (ODTNS) and implications

• Theory of tensor network contractor dynamics (NCD) and applications

• Concluding remarks

Page 4: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

T

g gc 0

Quantum critical

Phase I Phase II

Quantum phase transition

In some cases, phase I and phase II cannot be distinguished by any local order parameter.

disordered quantum states vs. quantitative measure

Topological order

Page 5: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Traditional quantum phases and topological phases

traditional topological

Order parameter local nonlocal

Spontaneously symmetry breaking

yes no

Mathematical description

group theory tensor categories (quantum group)

Low-lying effective theory

Ginzburg-Landau field theory

doubled Chern-Simons theory, deconfined gauge

theory

Underlying physics spontaneous magnetization,

condensation of particles

condensation of quasi-particles (e.g. gauged

boson, fermion, anyon)

Page 6: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Topological phases are unique states of matter incorporating long-range quantum entanglement, hosting exotic excitations with fractional quantum statistics.

• Topological order describes the property of a quantum state, not a Hamiltonian.

• Topological entanglement entropy (TEE):

( ) [ ln( )]A AS A Tr

(| 0 0 |)A Tr

For a bipartite system, A and B

reduced density matrix

entanglement entropy

( ) ( )S A S B duality property

In 2D, ( ) ...S A L L: length with smooth boundary; …: the terms vanishing when L->infinity; α: non-universal coefficient, near the boundary

ln( )D 2

i

i

D d Total quantum dimension of the medium

Kitaev & Preskill (PRL 2006) Levin & Wen (PRL 2006)

Page 7: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Topological entanglement entropy (TEE, -γ) is a universal additive constant characterizing the long-range entanglement in the ground state.

model γ

Z2 spin liquid Ln2

Kagome J1-J2 model 0.698, 0.694

Toric-code model 0.693

Haldane model 0.349

Transverse-field Ising model

0.0014, 0.0004

Coupled spin-dimer model

0.006, 0.002

Page 8: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• For the gapped systems without considering any symmetry

Short-range entanglement state: can be represented by direct product of states through local unitary transformations. Belong to the same phase

Long-range entanglement state: cannot be represented by direct product of states through local unitary transformations. Topological states

Wen et al, 2010, 2012

• For the gapped systems with consideration of symmetry

Short-range entanglement state: do not belong to the same phase. Symmetry protected topological phase

Long-range entanglement state: complicated. Symmetry enriched topological phase

Gapped phases

Page 9: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Gapless quantum spin liquids

• Stable gapless phase with no broken symmetries

• no free particle description

• Power-law correlations

Algebraic Spin Liquids

Routes to gapless spin liquids

• Frustration • low spin • low coordination number

How to characterize?

Page 10: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Herbertsmithite, ZnCu3(OH)6Cl2, spin-1/2 kagome lattice, with additional Dzyaloshinskii-Moriya interactions. It is thought that the ground-state is a spin liquid, with no onsite magnetization and no spin gap.

Kagome lattice: Z2 gap 0.13; energy per site in GS: -0.4386(5) Inconclusive!

Barlowite: Cu4FBr(OH)6

Geometrically frustrated magnets

Gapped or Gapless?

Spin ½ perfect kagome motif

T.H. Han et al, PRL 113, 227203 (2014)

T.H. Han et al, Nature 492, 406 (2012).

Page 11: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Correlated Quantum Spin Systems

• Heisenberg Model:

• Analytical methods such as mean-field theory, perturbation, bosonization, etc. are difficult to give reliable and accurate results for these models in D>1.

• Numerical means are always helpful.

Page 12: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Numerical approaches for quantum lattice systems

Various quantum Monte Carlo simulations, powerful, but suffering from “negative sign problem”, cannot access to strongly correlated electrons away from the half-filling as well as quantum spin systems with frustrations.

Exact diagonalization with Lanczos, Jacobi-Davidson algorithms, etc., are always effective for systems with small size. For large systems it depends on computer’s capacity.

Numerical renormalization group methods are always useful and effective for low dimensional quantum lattice systems. DMRG, tensor network-based methods, …

Page 13: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Thermal tensor network states based approaches

for quantum lattice systems

Needed!

To understand the exotic quantum phases and experimental observations in correlated quantum magnets

Page 14: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(1) Linearized Tensor Renormalization Group (LTRG) Method

Target: An effective algorithm to simulate the thermodynamics of low-dimensional quantum lattice models.

Strategy: First, transform the D-dimensional quantum lattice model to a (D + 1) dimensional classical tensor network by means of the Trotter-Suzuki decomposition; then, decimate linearly the tensors following the lines developed in the iTEBD scheme to obtain the thermodynamics of the original quantum many-body system. This algorithm is referred to as the linearized TRG (LTRG).

Prototype: The exactly solvable 1D quantum XY spin chain. The precision of the LTRG method is comparable with that of the transfer-matrix renormalization group (TMRG) .

Scalability: The LTRG result with remarkable precision for a 2D spin-1/2 Heisenberg antiferromagnet on a honeycomb lattice can be obtained.

W. Li et al., PRL106, 127206 (2011)

Page 15: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Consider the Hamiltonian of a 1D quantum many body model

The partition function

Page 16: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Transfer-Matrix Tensor Network

• Trotter-Suzuki decomposition: the partition function of 1d quantum system can be represented by a transfer-matrix tensor network.

• Contract the tensor network to obtain the thermodynamic properties

Page 17: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Contraction of tensor network of transfer matrices

Decimate linearly the tensors layer by layer to obtain and trace a one-dimensional MPS

Primary steps

computational cost:

Page 18: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Evaluation of Thermodynamic Quantities

• Normalize the tensors in order to avoid divergence during the RG process.

linear decimation of 2d TN: ni

coarse-graining procedure of 1d MP: mj

• Collect the renormalization factors, which determine the free energy:

• Other thermodynamic quantities can be evaluated by simple derivation.

Page 19: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Benchmark 1D XY spin chain

Free energy and relevant error w.r.t. exact solution vs 1/T

Specific heat • High precision • Small computing tasks • Readily coding • Scalable • No “negative sign” problem

LTRG method

Page 20: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Applications of LTRG method

Field induced LRO

Luttinger liquid behavior

Ground State

A Spin-1 Model Material: Ni(C2H24N4)NO2(ClO4), NTENP

(a) S=1 bond-alternating Heisenberg AF chain

Page 21: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

LTRG fitting of susceptibility and magnetization in experiments

Both magnetic curves can be well fitted, as well as the high-field curve.

Page 22: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

A TLL behavior is observed at low temperature in a longitudinal field. An excitation gap exists in a transverse field. LTRG

LTRG results with high precision explain well the distinct experimental observation under transverse and longitudinal fields at very low temperatures.

transverse

longitudinal

Page 23: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(b) Spin-1/2 honeycomb Heisenberg ladder

Compound 1 Compound 2

Page 24: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(i) J1, J2 > 0 [couplings all antiferromagnetic (AF)] (ii) J1 < 0, J2 > 0 [leg: ferromagnetic (F); rung: AF] (iii) J1 > 0, J2 < 0 [leg: AF; rung: F]

Three cases are considered: (i)

(iii)

(ii)

AF

F

Page 25: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Square (SQ) spin ladder

Honeycomb (HC) spin ladder

Spin Gap

J2

J1

J2

J1

Spin gap vs J2/J1 differs at HC ladder and square ladder

Page 26: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

1/2 magnetization plateau in HC AF

F

Diluted dimer state on ½ plateau in HC

0.0 0.5 1.0 1.5 2.0 2.5 3.0 3.50.0

0.1

0.2

0.3

0.4

0.5

m

h

J2:J

1=1.5

J2

J1

Page 27: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Phase Diagram

Spin-1/2 two-leg honeycomb spin ladder

Page 28: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Specific heat Susceptibility

(HC: honeycomb; SQ: square) S. Gao et al., EJIC, (2013).

Experimental data:

HC:

SQ:

HC:

SQ:

HC: two kinds of low-lying excitations

(LTRG results)

Page 29: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Transforming the 2D quantum model into a three-dimensional (3D) closed tensor network (TN) comprised of the tensor product density operator and a 3D brick-wall TN

• The network Tucker decomposition is proposed to obtain the optimal lower-dimensional approximation on the bond space by transforming the TN into a super-orthogonal form

• The free energy of the system can be calculated with the imaginary time evolution

Basic idea

(2) Optimized decimation of tensor networks with super-orthogonalization (ODTNS) for two-

dimensional quantum lattice models

S. J. Ran et al., PRB86, 134429 (2012)

Page 30: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Hamiltonian: ˆ ˆij

ij

H H

Trotter-Suzuki decomposition: 1

ˆ

1

ˆ ˆ, ij

KHt t

ij ij

t ij

U U e

SVD: ' ' 0

', ',ˆ| | ' '

SVDi j L R

ij ij ii s s jj s

s

ij U i j U G G

Construct TPDO:

Honeycomb lattice as an example

The density operator ρ at an inverse temperature τ has the form of a TN:

Page 31: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Linearized renormalization scheme

Evolution of 2D TPDO in imaginary time direction is equivalent to the linearized renormalization of the corresponding 3D classical model:

Evolution enlarges the bond dimension of TPDO;

Locating the optimal approximation of the local representation is crucial: Using network Tucker decomposition

LTRG algorithm: W. Li, S. J. Ran, S. S. Gong, Y. Zhao, B. Xi, F. Ye, and G. Su, Phys. Rev. Lett. 106, 127202 (2011).

Local representation (TPDO) Global minimization of

truncation error

Page 32: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Tucker decomposition

Convincing and widely-used method for the optimal approximation of a single tensor;

Applied to data compression, image processing, etc.

Review of Tucker decomposition: T. G. Kolda and B. W. Bader, SIAM Rev. 51, (3) (2009). Application: M. Alex O. Vasilescu and D. Terzopoulos, in CVPR 2003, IEEE Computer Society, 2003, pp. 93-99.

Form of Tucker decomposition of the tensor A:

Matrix singular value decomposition: M=UDVT

Keep the Dc largest singular values and corresponding singular vectors to obtain the optimal lower-dimensional approximation.

Properties of the core tensor S:

(b) Ordering:

(a) All-orthogonal:

Page 33: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Algorithms: Higher-order SVD (HOSVD), Higher-order Orthogonal Iteration (HOOI), etc.

||Si|| contains the information of the weight distribution of the tensor S for the ith mode, similar to higher-order singular values of matrix.

The optimal lower-dimensional approximation can be obtained by keeping the first Dc dimension of the core tensor and the corresponding space of U, while the cost function f=||A-A’|| is minimized (tensor A’ is the approximation of A).

Page 34: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Network reduced matrix (NRM) :

Superorthogonal form of tensor networks

1 2 1 2 1 2 1 1

1 2

2

, , ( ) i i i n i n i i n i i

n

g g p g g g g p g g g g g g g g g g g

p g g g

T T

The conditions of the super-orthogonal form:

(a) Ordering: all λ’s on the geometrical bonds (g1,g2, …) are positive-defined, normalized and the elements of each λ are in descending order.

(b) Orthogonality: for any tensor T in the TN and any geometrical bond gi of T, the NRM M is diagonal and equals to the square of the corresponding λ:

2

i i i i ig g g g g

Remarks:

(1) The analyses of the optimal dimension deduction of the spaces are analogous to those of the Tucker decomposition; (2) Instead of the conditions of the core tensor in the Tucker decomposition, these two conditions are non-local for the TN.

Page 35: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Network Tucker Decomposition

The key step: find the transformation matrix for each geometrical bond:

(1) Calculate the eigenvalues χL(R) and eigenvectors UL(R) of the matrix in which ML(R) is the NRM;

(2) Calculate the left (right) singular vectors P(Q) that are the intermediate matrix defined as

(3) Find the transformation matrices by

( ) 1 ( )( )L R I I L R

bc b c bcM

1/2 1/2( ) ( )L L I R R

ac a ba b bc c

b

W U U

The network Tucker decomposition (NTD) for the TPDO of the Heisenberg model

on the honeycomb lattice.

Page 36: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(4) Transform the tensors and obtain the new λ on the geometrical bond

The convergence of the NTD is tested on the honeycomb and square TN’s, whose

elements are randomly initialized with Gaussian distribution N(0,1).

(| | | |) / (2 )L R

, ,

( ) (| ( 3) ( ) | / | ( ) |) / 3S S S

S I II III

t t t t

( ) ( ) 2| ( ) |L R L R S

ab a ab

ab

The factors that describe the convergence of the NTD decay exponentially with the iteration step;

The error of the eigenvalue decomposition is around 10-15.

Page 37: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Free energy:

Ground state energy:

Truncation of the bond dimension: keep the Dc largest elements of λ and the corresponding space of the geometrical bond after transforming the TN into super-orthogonal form.

Normalization factor: normalize λ by where S=(I, II, III).

2

1

( )cD

S S

q a

a

r

Error can be estimated as

2 2

1 1

( ) / ( )c

D DS S

a a

a D a

Page 38: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Spin-1/2 Anisotropic Heisenberg Antiferromagnet on Honeycomb lattice

Local Hamiltonian:

Comparison to QMC calculations:

The energy difference with different β and Dc;

When δ=0.5, the difference △E is about 10-5 away from the critical point; near the critical point, △E~ 10-3.

When δ=1, △E is about 10-2 to 10-3 for different β.

△E becomes smaller when Dc is increased.

Trotter errors are within 10−4.

Page 39: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

The staggered magnetization and specific heat: great agreement with the QMC calculations.

The critical point can be determined by the divergent peak of specific heat.

A thermodynamic phase transition from antiferromagnetic to paramagnetic phase occurs.

• Calculate both thermodynamic and ground state properties of 2D quantum spin models

• High precision and efficiency, small tasks

• No “negative sign” problem

• Applicable to 2D quantum frustrated spin systems

ODTNS method

Page 40: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Application of ODTNS method

Husimi lattice

Page 41: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

ODTNS results

Magnetization and susceptibility

• Ground state energy: e0 =-0.4343(1); • Correlation length: =1.09(2)

Kagome lattice: energy per site in GS e0=-0.4386(5)

Page 42: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Ground state: gapless quantum spin liquid (QSL)

• 1/3 magnetization plateau (up-up-down spin state)

• Susceptibility has two peaks at low T in QSL regime

• Specific heat has even three peaks, power-law decay

Phase diagram Specific heat

Page 43: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(3) Theory of NCD and algorithm

• Thermodynamics for 2D quantum lattice models

• Accurate, efficient, small tasks, flexible

• No “sign”problem

• Applicable to 2D frustrated spin systems

Features

Contraction: by rank-1 decomposition in multilinear algebra, be realized through a contraction of a local tensor cluster with vectors on its boundary. Algorithm: an imaginary-time-sweep algorithm for implementation in practical numerical simulations. Exponents: The quasi entanglement entropy S, Lyapunov exponent ILya, and loop character Iloop, to determine the thermodynamic phase transitions of both classical and quantum systems.

Page 44: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• By means of rank-1 decomposition, the infinite tensor network can be well approximated by an optimized tree-like tensor network, transforming the contraction (decimation and observables) of an infinite tensor network into a contraction of finite-size cell tensor network.

Page 45: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Main idea Approximate the infinite contraction of the TN for the partition function and observables with a finite contraction of a local tensor cluster and vectors on its boundary.

1

• Evolve the TPDO along the imaginary time.

• Obtain the TN of partition function Z by tracing the physical bonds of the TPDO.

2

• Transform TN to ensure there is only one inequivalent T (cell tensor).

• Get the contractors by calculating the fixed point of the nonlinear mappings defined by the cell tensor.

3

• Making local contraction of the cell tensor and contractors:Calculate truncation matrices if needed through the cell tensor and the contractors. Calculate partition function and observables if needed.

Page 46: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Construction of finite temperature TNS

------ Tensor product density operator

• Trotter-Suzuki decomposition:

• Evolution

Translational invariance

1 2 3 1 2 3, , , ,i i i i i i i i

i i

i L L L

p p g g g p p g p p g p p g

p p

A G G G

1 2 3 1 2 3, , , ,j j j j j j j j

j j

j R R R

p p g g g p p g p p g p p g

p p

B G G G

1 2 3 1 2 3 1, , ,i i

L

pp g g g pp g g g p p g

p

A A G

1 2 3 1 2 3 1, , ,i ipp g g g pp g g g p p g

R

p

B B G

Page 47: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

NCD on the prototype model ------ Spin ½ Heisenberg antiferromagnet on honeycomb lattice

• Obtain TN of Z by tracing over physical bonds

1 2 3 1 2 3, ,g g g pp g g g

p

A 1 2 3 1 2 3, ,g g g pp g g g

p

B ( )i j

G

i j

Z Tr

• Transform TN so that it consists of one inequivalent tensor (cell tensor):

1 2 3 4 1 2 5 3 4 5

5

cell

g g g g g g g g g g

g

T

• Permutation invariance in each index pair:

1 2 3 4 3 2 1 4 1 4 3 2

cell cell cell

g g g g g g g g g g g gT T T

Page 48: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• A compact form of the mappings:

{ } ({ }) x x

• Fixed point conditions:

({ }) { } x x

1 2 3 4

{ }

( 1,..., ) s: a ja

a j

a i

a j cell

i g g g g g g

ga i a i

i T x x

• Define the mappings by Tcell: : the order of Tcell; : a unit-norm vector on bond a; : the vector space of corresponding bond; Γ: positive real number.

Here, bonds i and j form an index pair!

a

ax

Page 49: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Using the permutation invariance, one can have: It’s the self-consistent condition for rank-1 decomposition which is the solution of

({ })a i i

i

x x

• Note: A tensor is rank-1 means that it can be decomposed as the direct product of several vectors. The tensor norm is defined as

1 2 1 2

1 2

... ...

...

| | .g g g g

gg

T T T

Page 50: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Defective TN: destruct the loops of the TN by replacing minimal number of cell tensors with the rank-1 tensors

• The TN marked by the shaded area has no loop and can be contracted as readily as a tree TN with contractors on the boundary.

• Solid circles: rank-1 tensor

• Dashed circles: fixed point conditions

Page 51: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Observables (The TN of <O> is the same as the TN of Z except for the tensors that share the physical bonds with the operator O):

31 2 4

1 2 5 3 4 5 1 2 3 4

1 2 3 4 5

, ,ˆ /

i i j j i i

i i j

i p p g g g p p g g g p p g g g gp p p

g g g g g

O A B O x x x x Z

• Lyapunov exponent: describe convergence property

єa:the infinitesimal random vector to exert a perturbation on .

The mapping

ax

[ ( )]

Page 52: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Quasi-entanglement entropy

• Contractor: it is the dominant eigenstate of M(γ) and can be written in the form of matrix product states.

• Quasi-entanglement entropy: μ is the singular value spectrum of x.

• The entanglement of the dominant eigenstate.

Page 53: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Loop character

• Recall that the defective TN formed by Tcell(γ)’s contains no loop of Tcell(γ), but contains loops of Tcell(γ’≤γ-1);

• If the cell tensor converges as γ increases, effects of larger loops can be ignored.

• Loop character : Iloop controls the error brought by the destruction of loops.

Page 54: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Truncation principle

SVD: M P Q

Rewrite: TM P Q SVD again: M P Q

• Denote the enlarged bond as g

• Truncation matrices (isometries) obtained by M:

• General strategy: Use the environment of the enlarged bond to obtain the non-local optimal truncations.

Page 55: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Calculation of truncation matrices with NCD

• Construct bilayer TN of Z (at targeted temperature ) as

ˆ ˆ ˆ( ) [ ( )] [ ( ) ( )]Z Tr Tr

1 2 3 4 1 2 5 3 4 5

5

,cellT

1 2 5 1 2 5 1 2 5, , ,pp g g g p p g g g

pp

A A

3 4 5 3 4 5 3 4 5, , .pp g g g p p g g g

pp

B B

The tensors without tilde are in the TPDO at and those with tilde are in the TPDO at .

• Result of M employing NCD with cell tensor size γ=1:

Page 56: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Imaginary-time-sweep algorithm

• Flow chart of imaginary-time-sweep algorithm (ITSA)

• Remark: sweep along the imaginary time is introduced to avoid error accumulation.

Page 57: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Error control

Error

Trotter-Suzuki decomposition

Dimension truncation

Defects

Quantity

Trotter slice τ

Page 58: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Benchmark

• Model: 2D Ising model on square lattice

• The error of free energy is compared with the exact solution.

Page 59: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Model: Heisenberg XXZ model.

• Energy, magnetization per site and specific heat at finite temperatures. A phase transition occurs.

Page 60: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Determination of Tc with three quantities

• The singular behavior of quasi-entanglement entropy, loop character and Lyapunov exponent near the critical temperature.

• Origination: the non-locality of the state near Tc.

• Model: 2D Ising model on square lattice (Tc=2.27, exact solution).

Page 61: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

• Model: 2D anisotropic Heisenberg model on honeycomb lattice.

• The critical temperature is given by QMC with specific heat Tc=0.345.

Page 62: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Thermodynamics of a 2D frustrated Heisenberg model by NCD

• Accurate results of energy, magnetization, magnetic susceptibility, specific heat, correlations, spin gap have been obtained.

• Down to temperature T~10-2J (β~102) (J the coupling constant, β the inverse temperature), the results, including specific heat (differential of energy) and susceptibility (differential of magnetization), are very stable and reliable.

• This work will be accomplished soon.

Page 63: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

(1) Three algorithms (including LTRG, ODTNS, NCD) are proposed to simulate efficiently and accurately the thermodynamics of low-dimensional quantum (frustrated) spin lattice systems;

(2) Successful applications of these methods to some intriguing 1D and 2D quantum Heisenberg models have been done, and some are in progress. Comparisons to experimental results are possible.

(3) There are large rooms to extend them to other quantum systems.

Concluding remarks

Page 64: Thermal tensor network renormalization group algorithms ...theory.iphy.ac.cn/TNSAA2014/ppt/GangSu_TNSAA2014.pdf · half-filling as well as quantum spin systems with frustrations

Thank you for attention!