On the Quantum Complexity of Classical Words

author: Markus Müller, Institute for Mathematics, TU Berlin
published: Nov. 30, 2007,   recorded: October 2007,   views: 2654

See Also:

Download slides icon Download slides: eccs07_mueller_qcc_01.pdf (1.1 MB)

Help icon Streaming Video Help

Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


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 program that outputsthe corresponding word.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 some analytical estimates and a classical programfor the simulation of a universal quantum computer.

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: