Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Shi et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: