Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Universal quantum computation with little entanglement   We show that universal quantum computation can be achieved in the standard
pure-state circuit model while, at any time, the entanglement entropy of all
bipartitions is small---even tending to zero with growing system size. The
result is obtained by showing that a quantum computer operating within a small
region around the set of unentangled states still has universal computational
power, and by using continuity of entanglement entropy. In fact an analogous
conclusion applies to every entanglement measure which is continuous in a
certain natural sense, which amounts to a large class. Other examples include
the geometric measure, localizable entanglement, smooth epsilon-measures,
multipartite concurrence, squashed entanglement, and several others. We discuss
implications of these results for the believed role of entanglement as a key
necessary resource for quantum speed-ups.

3
The categories of this paper are: physics
26
The categories of this paper are: bayes-an
31
The categories of this paper are: ao-sci
9
The categories of this paper are: nlin
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
10
The categories of this paper are: q-bio
5
The categories of this paper are: gr-qc
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
18
The categories of this paper are: econ
24
The categories of this paper are: dg-ga
29
The categories of this paper are: funct-an
32
The categories of this paper are: atom-ph