arXivDaily arXiv每日学术速递 周一至周五更新
arXiv quant-ph/9907035quant-ph
收藏

单个纯量子态信息定量定义的三种方法

Three Approaches to the Quantitative Definition of Information in an Individual Pure Quantum State

Paul Vitanyi

摘要:

类比经典的柯尔莫哥洛夫复杂性,我们发展了一个理论的算法信息的比特包含在任何一个连续的许多纯量子态:量子柯尔莫哥洛夫复杂性。经典Kolmogorov复杂性与限制在经典域的新量子Kolmogorov复杂性一致。量子柯尔莫哥洛夫复杂度是有上限的,可以从上面有效地近似。量子物体很有可能是不可压缩的。有两种可能的替代方法:将复杂度定义为有效描述对象的最短量子位程序的长度,以及使用具有可计算实参数的经典描述。

英文摘要:

In analogy of classical Kolmogorov complexity we develop a theory of the algorithmic information in bits contained in any one of continuously many pure quantum states: quantum Kolmogorov complexity. Classical Kolmogorov complexity coincides with the new quantum Kolmogorov complexity restricted to the classical domain. Quantum Kolmogorov complexity is upper bounded and can be effectively approximated from above. With high probability a quantum object is incompressible. There are two alternative approaches possible: to define the complexity as the length of the shortest qubit program that effectively describes the object, and to use classical descriptions with computable real parameters.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑