Classical Simulation of quantum evolution on tree graphs

Preprint
Publisher Website
Google Scholar
  • 8 November 2005
Abstract
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.

This publication has 0 references indexed in Scilit: