Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Extension of Gleason's Theorem for Quantum Computation   We develop a synthesis of Turing's paradigm of computation and von Neumann's
quantum logic to serve as a model for quantum computation with recursion, such
that potentially non-terminating computation can take place, as in a quantum
Turing machine. This model is based on the extension of von Neumann's quantum
logic to partial states, defined here as sub-probability measures on the
Hilbert space, equipped with the natural pointwise partial ordering. The
sub-probability measures allow a certain probability for the non-termination of
the computation. We then derive an extension of Gleason's theorem and show
that, for Hilbert spaces of dimension greater than two, the partial order of
sub-probability measures is order isomorphic with the collection of partial
density operators, i.e., trace class positive operators with trace between zero
and one, equipped with the usual partial ordering induced from positive
operators. We show that the expected value of a bounded observable with respect
to a partial state can be defined as a closed bounded interval, which extends
the classical definition of expected value.

2
The categories of this paper are: math
37
The categories of this paper are: supr-con
14
The categories of this paper are: math-ph
10
The categories of this paper are: q-bio
19
The categories of this paper are: eess
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
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
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
28
The categories of this paper are: alg-geom
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
30
The categories of this paper are: q-alg