On the Quantum Kolmogorov Complexity of Classical Strings

Details On the Quantum Kolmogorov Complexity of Classical Strings On the Quantum Kolmogorov Complexity of Classical Strings

2007-07-19

arxiv.org/abs/0707.2924v2

Int. J. Quant. Inf. 7, 701-711 (2009)

Physics

Quantum Physics

10 pages, no figures. Published version

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the Quantum Kolmogorov Complexity of Classical Strings does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Quantum Kolmogorov Complexity of Classical Strings, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Quantum Kolmogorov Complexity of Classical Strings will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-545143