Classical simulation of quantum many-body systems with a tree tensor network

2005/11/30 by Yaoyun Shi, Luming Duan, Guifre Vidal · 7 citations
Physics and Astronomy · #quant-ph #cond-mat.str-el

paper · pdf · doi:10.1103/physreva.74.022320

published as Phys. Rev. A 74, 022320 (2006) · 4 pages,7 figures

arxiv created 2006/02/12 · arxiv updated 2009/12/01

Abstract

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement is bounded for any bipartite split along an edge of the tree. This is achieved by expanding the \em time-evolving block decimation simulation algorithm for time evolution from a one dimensional lattice to a tree graph, while replacing a \em matrix product state with a \em tree tensor network. As an application, we show that any one-way quantum computation on a tree graph can be efficiently simulated with a classical computer.

Cited by

• An Optimally Accurate Lanczos Algorithm in the Matrix Product State Representation
• Non-variational supervised quantum kernel methods: a review
• Autonomous Quantum Simulation through Large Language Model Agents
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• Derivatives of tree tensor networks and its applications in Runge--Kutta methods
• Trainable Quantum Neural Network for Multiclass Image Classification with the Power of Pre-trained Tree Tensor Networks
• Successive randomized compression: A randomized algorithm for the compressed MPO-MPS product