Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Quantifiable simulation of quantum computation beyond stochastic
  ensemble computation   In this study, a distinctive feature of quantum computation (QC) is
characterized. To this end, a seemingly-powerful classical computing model,
called "stochastic ensemble machine (SEnM)," is considered. The SEnM runs with
an ensemble consisting of finite copies of a single probabilistic machine,
hence is as powerful as a probabilistic Turing machine (PTM). Then the
hypothesis--that is, the SEnM can effectively simulate a general circuit model
of QC--is tested by introducing an information-theoretic inequality, named
readout inequality. The inequality is satisfied by the SEnM and imposes a
critical condition: if the hypothesis holds, the inequality should be satisfied
by the probing model of QC. However, it is shown that the above hypothesis is
not generally accepted with the inequality violation, namely, such a simulation
necessarily fails, implying that PTM $\subseteq$ QC.

9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
36
The categories of this paper are: cmp-lg
28
The categories of this paper are: alg-geom
7
The categories of this paper are: hep-th
12
The categories of this paper are: nucl-th
33
The categories of this paper are: plasm-ph
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
30
The categories of this paper are: q-alg
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
15
The categories of this paper are: nucl-ex
26
The categories of this paper are: bayes-an