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
We describe a quantum circuit that produces a highly entangled state of N qubits from which one can ...
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions...
We introduce the multi-scale entanglement renormalization ansatz (MERA), an efficient representation...
We propose an efficient algorithm to classically simulate quantum evolution on tree graphs with boun...
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We p...
We develop and analyze a method for simulating quantum circuits on classical computers by representi...
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We p...
We introduce the multiscale entanglement renormalization ansatz, a class of quantum many-body states...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
We present a classical protocol to efficiently simulate any pure-state quantum computation that invo...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
Tensor network theory and quantum simulation are, respectively, the key classical and quantum comput...
We investigate for which resource states an efficient classical simulation of measurement based quan...
Classical simulation of quantum many-body systems is in general a challenging problem for the simple...
We describe a quantum circuit that produces a highly entangled state of N qubits from which one can ...
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions...
We introduce the multi-scale entanglement renormalization ansatz (MERA), an efficient representation...
We propose an efficient algorithm to classically simulate quantum evolution on tree graphs with boun...
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We p...
We develop and analyze a method for simulating quantum circuits on classical computers by representi...
The treewidth of a graph is a useful combinatorial measure of how close the graph is to a tree. We p...
We introduce the multiscale entanglement renormalization ansatz, a class of quantum many-body states...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
We present a classical protocol to efficiently simulate any pure-state quantum computation that invo...
A tree tensor network variational method is proposed to simulate quantum many-body systems with glob...
Tensor network theory and quantum simulation are, respectively, the key classical and quantum comput...
We investigate for which resource states an efficient classical simulation of measurement based quan...
Classical simulation of quantum many-body systems is in general a challenging problem for the simple...
We describe a quantum circuit that produces a highly entangled state of N qubits from which one can ...
We propose an efficient algorithm for simulating quantum many-body systems in two spatial dimensions...
We introduce the multi-scale entanglement renormalization ansatz (MERA), an efficient representation...