SECOND QUANTIZED KOLMOGOROV COMPLEXITY-Reference-Cited by-同舟云学术

SECOND QUANTIZED KOLMOGOROV COMPLEXITY

Published:2008-08 Issue:04 Volume:06 Page:907-928
ISSN:0219-7499
Container-title:International Journal of Quantum Information
language:en
Short-container-title:Int. J. Quantum Inform.

Author:

ROGERS CAROLINE¹,VEDRAL VLATKO¹²,NAGARAJAN RAJAGOPAL¹

Affiliation:

1. Department of Computer Science, University of Warwick, Coventry CV47AL, United Kingdom

2. School of Physics and Astronomy, University of Leeds, Leeds LS29JT, United Kingdom

Abstract

The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantized Kolmogorov complexity where the length of a description is defined to be the average length of its superposition. We discuss this complexity's basic properties. We define the corresponding prefix complexity and show that the inequalities obeyed by this prefix complexity are also obeyed by von Neumann entropy.

Publisher

World Scientific Pub Co Pte Lt

Subject

Physics and Astronomy (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S021974990800375X

Reference19 articles.

1. On Lossless Quantum Data Compression With a Classical Helper

2. Quantum Complexity Theory

3. Quantum Kolmogorov Complexity

4. Lossless quantum data compression and variable-length coding

5. Algorithmic Information Theory

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Second quantised information distance;IET Quantum Communication;2022-09-28

2. Kolmogorov complexity as intrinsic entropy of a pure state: Perspective from entanglement in free fermion systems;Physical Review B;2022-07-25

3. Quantum information distance;International Journal of Quantum Information;2021-09

4. State complexity and quantum computation;Annalen der Physik;2015-06-16

5. Maximal tree size of few-qubit states;Physical Review A;2014-06-30