en-de
en-es
en-fr
en-pt
en-sl
en
en-zh
0.25
0.5
0.75
1.25
1.5
1.75
2
On the Quantum Complexity of Classical Words
Published on 2007-11-302670 Views
We show that classical and quantum Kolmogorov complexity of binary words agree up to an additive constant.Both complexities are defined as the minimal length of any (classical resp. quantum) computer