Simulating quantum systems on the Bethe lattice by translationally invariant infinite-tree tensor network

DOI10.1016/J.AOP.2011.11.012zbMATH Open1245.82013arXiv1106.3033OpenAlexW3103745625MaRDI QIDQ765797FDOQ765797

ádám Nagy

Publication date: 22 March 2012

Published in: Annals of Physics (Search for Journal in Brave)

Abstract: We construct an algorithm to simulate imaginary time evolution of translationally invariant spin systems with local interactions on an infinite, symmetric tree. We describe the state by symmetric iPEPS and use translation-invariant operators for the updates at each time step. The contraction of this tree tensor network can be computed efficiently by recursion without approximations and one can then truncate all the iPEPS tensors at the same time. The translational symmetry is preserved at each time step that makes the algorithm very well conditioned and stable. The computational cost scales like $O(D^{q+1})$ with the bond dimension $D$ and coordination number $q$, much favourable than that of the iTEBD on trees [D. Nagaj et al. Phys. Rev. B extbf{77}, 214431 (2008)]. Studying the transverse-field Ising model on the Bethe lattice, we find a second order phase transition with finite correlation lengths.

Full work available at URL: https://arxiv.org/abs/1106.3033

zbMATH Keywords

phase transitionsimaginary time evolutioninfinite tree tensor network (iTTN)Ising model on trees

Mathematics Subject Classification ID

Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Phase transitions (general) in equilibrium statistical mechanics (82B26) Statistical mechanics of magnetic materials (82D40)

Cites Work

• Tensor Decompositions and Applications
• A Multilinear Singular Value Decomposition
• Matrix product operator representations

Cited In (2)

• Random transverse field Ising model on the Cayley tree: analysis via boundary strong disorder renormalization
• Gauging tensor networks with belief propagation

   Recommendations

• An efficient algorithm for translationally invariant finite-size periodic lattice systems in one spatial dimension 👍 👎
• Simulated annealing for tensor network states 👍 👎
• Transition-Matrix Monte Carlo Method for Quantum Systems 👍 👎
• Matrix product operator representations 👍 👎
• Light-cone matrix product 👍 👎

This page was built for publication: Simulating quantum systems on the Bethe lattice by translationally invariant infinite-tree tensor network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765797)