Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: On the Quantum Kolmogorov Complexity of Classical Strings   We show that classical and quantum Kolmogorov complexity of binary strings
agree up to an additive constant. Both complexities are defined as the minimal
length of any (classical resp. quantum) computer program that outputs the
corresponding string.
  It follows that quantum complexity is an extension of classical complexity to
the domain of quantum states. This is true even if we allow a small
probabilistic error in the quantum computer's output. We outline a mathematical
proof of this statement, based on an inequality for outputs of quantum
operations and a classical program for the simulation of a universal quantum
computer.

0
The categories of this paper are: hep-ph
30
The categories of this paper are: q-alg
27
The categories of this paper are: comp-gas
15
The categories of this paper are: nucl-ex
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
36
The categories of this paper are: cmp-lg
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
11
The categories of this paper are: hep-lat
2
The categories of this paper are: math
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
14
The categories of this paper are: math-ph
12
The categories of this paper are: nucl-th
17
The categories of this paper are: q-fin