Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Searching for evidence of algorithmic randomness and incomputability in
  the output of quantum random number generators   Ideal quantum random number generators (QRNGs) can produce algorithmically
random and thus incomputable sequences, in contrast to pseudo-random number
generators. However, the verification of the presence of algorithmic randomness
and incomputability is a nontrivial task. We present the results of a search
for algorithmic randomness and incomputability in the output from two different
QRNGs, performed by applying tests based on the Solovay-Strassen test of
primality and the Chaitin-Schwartz theorem. The first QRNG uses measurements of
quantum vacuum fluctuations. The second QRNG is based on polarization
measurements on entangled single photons; for this generator, we use looped
(and thus highly compressible) strings that also allow us to assess the ability
of the tests to detect repeated bit patterns. Compared to a previous search for
algorithmic randomness, our study increases statistical power by almost 3
orders of magnitude.

25
The categories of this paper are: patt-sol
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
19
The categories of this paper are: eess
33
The categories of this paper are: plasm-ph
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
21
The categories of this paper are: adap-org
7
The categories of this paper are: hep-th
20
The categories of this paper are: acc-phys
9
The categories of this paper are: nlin
1
The categories of this paper are: cs
8
The categories of this paper are: hep-ex