Quantum Kolmogorov Complexity Based on Classical Descriptions

Details Quantum Kolmogorov Complexity Based on Classical Descriptions Quantum Kolmogorov Complexity Based on Classical Descriptions

2001-02-21

arxiv.org/abs/quant-ph/0102108v2

IEEE Transactions on Information Theory, Vol. 47, No. 6, September 2001, 2464-2479

Physics

Quantum Physics

17 pages, LaTeX, final and extended version of quant-ph/9907035, with corrections to the published journal version (the two di

Scientific paper

We develop a theory of the algorithmic information in bits contained in an individual pure quantum state. This extends classical Kolmogorov complexity to the quantum domain retaining classical descriptions. Quantum Kolmogorov complexity coincides with the classical Kolmogorov complexity on the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated from above under certain conditions. With high probability a quantum object is incompressible. Upper- and lower bounds of the quantum complexity of multiple copies of individual pure quantum states are derived and may shed some light on the no-cloning properties of quantum states. In the quantum situation complexity is not sub-additive. We discuss some relations with ``no-cloning'' and ``approximate cloning'' properties.

Affiliated with

Also associated with

No associations

Rating

Quantum Kolmogorov Complexity Based on Classical Descriptions 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 Quantum Kolmogorov Complexity Based on Classical Descriptions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Quantum Kolmogorov Complexity Based on Classical Descriptions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520473