Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The complexity of simulating constant-depth BosonSampling   BosonSampling is a restricted model of quantum computation proposed recently,
where a non-adaptive linear-optical network is used to solve a sampling problem
that seems to be hard for classical computers. Here we show that, even if the
linear-optical network has a constant number (greater than four) of beam
splitter layers, the exact version of the BosonSampling problem is still
classically hard, unless the polynomial hierarchy collapses to its third level.
This is based on similar result known for constant-depth quantum circuits and
circuits of 2-local commuting gates (IQP).

33
The categories of this paper are: plasm-ph
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
20
The categories of this paper are: acc-phys
14
The categories of this paper are: math-ph
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
7
The categories of this paper are: hep-th
21
The categories of this paper are: adap-org
1
The categories of this paper are: cs