图 书 馆
经典词的量子复杂性On the Quantum Complexity of Classical Words |
|
| 课程网址: | http://videolectures.net/eccs07_mueller_qcc/ |
| 主讲教师: | Markus Müller |
| 开课单位: | 柏林工业大学 |
| 开课时间: | 2007-11-30 |
| 课程语种: | 英语 |
| 中文简介: |  |
| 课程简介: | 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. |
| 关 键 词: | 计算机程序; 量子计算机; 量子态 |
| 课程来源: | 视频讲座网 |
| 最后编审: | 2021-01-31：nkq |
| 阅读次数: | 49 |