Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Average-case complexity versus approximate simulation of commuting
  quantum computations   We use the class of commuting quantum computations known as IQP
(Instantaneous Quantum Polynomial time) to strengthen the conjecture that
quantum computers are hard to simulate classically. We show that, if either of
two plausible average-case hardness conjectures holds, then IQP computations
are hard to simulate classically up to constant additive error. One conjecture
relates to the hardness of estimating the complex-temperature partition
function for random instances of the Ising model; the other concerns
approximating the number of zeroes of random low-degree polynomials. We observe
that both conjectures can be shown to be valid in the setting of worst-case
complexity. We arrive at these conjectures by deriving spin-based
generalisations of the Boson Sampling problem that avoid the so-called
permanent anticoncentration conjecture.

26
The categories of this paper are: bayes-an
4
The categories of this paper are: cond-mat
33
The categories of this paper are: plasm-ph
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
22
The categories of this paper are: chao-dyn
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
36
The categories of this paper are: cmp-lg
37
The categories of this paper are: supr-con
12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
27
The categories of this paper are: comp-gas
16
The categories of this paper are: stat