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.
- Received 12 February 2006
DOI:https://doi.org/10.1103/PhysRevA.74.022320
©2006 American Physical Society