arXiv:quant-ph/0511070 · Physical Review A

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

Yaoyun Shi, Luming Duan, Guifré Vidal

Published Aug 23, 2006• 577 citations

Abstract

We show how to efficiently simulate a quantum many-body system with tree structure when its entanglement (Schmidt number) is small for any bipartite split along an edge of the tree. As an application, we show that any one-way quantum computation on a tree graph can be efficiently simulated with a classical computer.

DOI: 10.1103/physreva.74.022320

Related papers

Classical Simulation of quantum evolution on tree graphs

Yaoyun Shi, Luming Duan

We propose an efficient algorithm to classically simulate quantum evolution on tree graphs with bounded entanglement for any bipartite partition along an edge of the tree. The algorithm combines the Schmidt decomposition with the tensor network state, where the latter is a natural extension of the matrix product states from chains to graphs. As an interesting application of this algorithm, we show that any one-way quantum computation on tree graphs can be efficiently simulated with a classical computer.

Nov 8, 20050 citations

Tree tensor networks and entanglement spectra

Iztok Pižorn, Frank Verstraete, Robert Konik

A tree tensor network variational method is proposed to simulate quantum many-body systems with global symmetries where the optimization is reduced to individual charge configurations. A computational scheme is presented, namely how to extract the entanglement spectra in a bipartite splitting of a loopless tensor network across multiple links of the network, by constructing a matrix product operator for the reduced density operator and simulating its eigenstates. The entanglement spectra of $2\ifmmode\times\else\texttimes\fi{}L$, $3\ifmmode\times\else\texttimes\fi{}L$, and $4\ifmmode\times\else\texttimes\fi{}L$ with either open or periodic boundary conditions on the rungs are studied using the presented methods, where it is found that the entanglement spectrum depends not only on the subsystem but also on the boundaries between the subsystems.

arXiv:1309.2255Physical Review BNov 1, 201323 citations

Entanglement bipartitioning and tree tensor networks

Kouichi Okunishi, Hiroshi Ueda, Tomotoshi Nishino

Abstract We propose the entanglement bipartitioning approach to design an optimal network structure of the tree tensor network (TTN) for quantum many-body systems. Given an exact ground-state wavefunction, we perform sequential bipartitioning of spin-cluster nodes so as to minimize the mutual information or the maximum loss of the entanglement entropy associated with the branch to be bipartitioned. We demonstrate that entanglement bipartitioning of up to 16 sites gives rise to nontrivial tree network structures for S = 1/2 Heisenberg models in one and two dimensions. The resulting TTNs enable us to obtain better variational energies, compared with standard TTNs such as the uniform matrix product state and perfect binary tree tensor network.

arXiv:2210.11741Progress of Theoretical and Experimental PhysicsJan 28, 202315 citations

Quantum Simulation with Hybrid Tensor Networks

Xiao Yuan, Jinzhao Sun, Junyu Liu +2 more

Tensor network theory and quantum simulation are, respectively, the key classical and quantum computing methods in understanding quantum many-body physics. Here, we introduce the framework of hybrid tensor networks with building blocks consisting of measurable quantum states and classically contractable tensors, inheriting both their distinct features in efficient representation of many-body wave functions. With the example of hybrid tree tensor networks, we demonstrate efficient quantum simulation using a quantum computer whose size is significantly smaller than the one of the target system. We numerically benchmark our method for finding the ground state of 1D and 2D spin systems of up to 8×8 and 9×8 qubits with operations only acting on 8+1 and 9+1 qubits, respectively. Our approach sheds light on simulation of large practical problems with intermediate-scale quantum computers, with potential applications in chemistry, quantum many-body physics, quantum field theory, and quantum gravity thought experiments.

arXiv:2007.00958Physical Review LettersJul 20, 202179 citations

Simulating quantum circuits using tree tensor networks

Philipp Seitz, Ismael Medina, Esther Cruz +2 more

We develop and analyze a method for simulating quantum circuits on classical computers by representing quantum states as rooted tree tensor networks. Our algorithm first determines a suitable, fixed tree structure adapted to the expected entanglement generated by the quantum circuit. The gates are sequentially applied to the tree by absorbing single-qubit gates into leaf nodes, and splitting two-qubit gates via singular value decomposition and threading the resulting virtual bond through the tree. We theoretically analyze the applicability of the method as well as its computational cost and memory requirements, and identify advantageous scenarios in terms of required bond dimensions as compared to a matrix product state representation. The study is complemented by numerical experiments for different quantum circuit layouts up to 37 qubits.

arXiv:2206.01000QuantumMar 30, 202322 citations

Application of Tensor Network State Method to 1D Quantum Systems

蕭仲評

In this thesis, we use the new numerical method multiscale entanglement renormalization ansatz (MERA) to study the one dimensional spin system. This method, MERA, utilizes a network of tensors to represent quantum many-body systems on a lattice. Other examples of tensor network state are matrix product states (MPSs) for 1D systems, tree tensor networks (TTNs) for systems with a tree shape, and projected entangled-pair states (PEPSs) for 2D systems and be- yond. The three structures dier in the graph that denes how the tensors are interconnected into a network: The graphs for MPSs, TTNs, and 2D PEPSs are, respectively, a chain, a tree, and a 2D lattice. Importantly, from these tensor networks the expectation value of local observables can be computed eciently. Developing algorithms to simulate quantum many-body systems is important for understanding and studying the physical principles. And these may become powerful tools for the analysis of quantum computation and quantum information theory. But in general ecient simulation is dicult, due to the fundamental quantum physical laws. The main method we have studied and worked on is multiscale entangle- ment renormalization ansatz (MERA) which is a variational ansatz for many- body states. MERA is a tree tensor network for 1D, 2D systems and beyond. We have developed code of ternary-MERA to compute the ground state energy, expected values of local observables, and correlators for 1D lattice systems. In a nutshell, MERA is an algorithm for entanglement renormalization which is a numerical technique based on locally reorganizing the Hilbert space of a quantum many-body system with the aim to reduce the amount of entanglement in its wave function. We use this method to study 1D Ising model, XXZ model, and J1 - J2 model, and then comparing the numerical results with exact diagonalization (ED) and density matrix renormalization group (DMRG).

Jan 1, 20100 citations