当前位置:
X-MOL 学术
›
Inf. Comput.
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
An extended coding theorem with application to quantum complexities
Information and Computation ( IF 0.8 ) Pub Date : 2020-11-17 , DOI: 10.1016/j.ic.2020.104660 Samuel Epstein
中文翻译:
扩展编码定理及其在量子复杂度中的应用
更新日期:2020-11-26
Information and Computation ( IF 0.8 ) Pub Date : 2020-11-17 , DOI: 10.1016/j.ic.2020.104660 Samuel Epstein
This paper introduces a new inequality in algorithmic information theory that can be seen as an extended coding theorem. This inequality has applications in new bounds between quantum complexity measures.
中文翻译:
扩展编码定理及其在量子复杂度中的应用
本文介绍了算法信息论中的一个新的不等式,可以将其视为扩展的编码定理。这种不等式在量子复杂性度量之间的新界限中具有应用。