Algorithmic complexity of quantum capacity

被引：0
作者：
Samad Khabbazi Oskouei
Stefano Mancini
机构：
[1] Islamic Azad University,Department of Mathematics
[2] Varamin-Pishva Branch,School of Science and Technology
[3] University of Camerino,undefined
[4] INFN–Sezione Perugia,undefined
来源：
Quantum Information Processing | 2018年 / 17卷
关键词：
Algorithmic complexity; Quantum entropies; Quantum channels; Quantum capacity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We analyze the notion of quantum capacity from the perspective of algorithmic (descriptive) complexity. To this end, we resort to the concept of semi-computability in order to describe quantum states and quantum channel maps. We introduce algorithmic entropies (like algorithmic quantum coherent information) and derive relevant properties for them. Then we show that quantum capacity based on semi-computable concept equals the entropy rate of algorithmic coherent information, which in turn equals the standard quantum capacity. Thanks to this, we finally prove that the quantum capacity, for a given semi-computable channel, is limit computable.
引用
收藏
相关论文
共 24 条
  • [1] Zvonkin AK(1970)The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms Russ. Math. Surv. 25 83-undefined
  • [2] Levin LA(2001)Quantum algorithmic entropy J. Phys. A: Math. Theor. 34 6859-undefined
  • [3] Gacs P(2014)Gacs quantum algorithmic entropy in infinite dimensional Hilbert spaces J. Math. Phys. 55 082205-undefined
  • [4] Benatti F(1964)A formal theory of inductive inference Inf. Control 7 224-undefined
  • [5] Oskouei SK(1965)Three approaches to the quantitative definition of information Probl. Inf. Transm. 1 1-undefined
  • [6] Deh Abad AS(1966)On the length of programs for computing finite binary sequences J. ACM 13 547-undefined
  • [7] Solomonoff R(2001)Quantum Kolmogorov complexity J. Comput. Syst. Sci. 63 201-undefined
  • [8] Kolmogorov A(2001)Quantum Kolmogorov complexity based on classical descriptions IEEE Trans. Inf. Theory 47 2464-undefined
  • [9] Chaitin JG(2005)Algorithmic complexity and entanglement of quantum states Phys. Rev. Lett. 95 200503-undefined
  • [10] Berthiaume A(2015)Unbounded number of channel uses may be required to detect quantum capacity Nat. Commun. 6 6739-undefined
123