arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.02760quant-phcond-mat.stat-mechcs.ITmath.IT
收藏

奥卡姆量子环:通过量子信道同步和压缩经典密码过程

Occam's Quantum Strop: Synchronizing and Compressing Classical Cryptic Processes via a Quantum Channel

J. R. Mahoney, C. Aghamohammadi, J. P. Crutchfield

摘要:

随机过程的统计复杂性作为一个基本属性脱颖而出:同步一个过程发生器到另一个过程发生器所需的最小信息。然而,在量子信道上同步时需要多少信息呢?最近的工作表明,将因果相似性表示为量子态不可分割性提供了量子优势。我们推广到同步,并提供了一系列的建设,利用扩展的因果结构,发现大量增加的量子优势。我们证明,最大的压缩是由过程的神秘顺序-一个经典的,拓扑性质密切相关的马尔可夫顺序,本身的历史依赖性的措施。我们介绍了一个有效的算法,计算的量子优势和关闭注意到,优势是有代价的-一个权衡预测的生成复杂性。

英文摘要:

A stochastic process's statistical complexity stands out as a fundamental property: the minimum information required to synchronize one process generator to another. How much information is required, though, when synchronizing over a quantum channel? Recent work demonstrated that representing causal similarity as quantum state-indistinguishability provides a quantum advantage. We generalize this to synchronization and offer a sequence of constructions that exploit extended causal structures, finding substantial increase of the quantum advantage. We demonstrate that maximum compression is determined by the process's cryptic order---a classical, topological property closely allied to Markov order, itself a measure of historical dependence. We introduce an efficient algorithm that computes the quantum advantage and close noting that the advantage comes at a cost---one trades off prediction for generation complexity.

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

↑