SECOND QUANTIZED KOLMOGOROV COMPLEXITY

DOI10.1142/S021974990800375XMaRDI QIDQ3536074zbMATH OpenFDO

Authors Caroline Rogers, Vlatko Vedral, Rajagopal Nagarajan

Publication date 17 November 2008

Published in International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.2642

zbMATH Keywords

quantum Kolmogorov complexityindeterminate length quantum stringsinequalities of von Neumann entropyvariable length compression

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Quantum computation (81P68) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: The Kolmogorov complexity of a string is the length of its shortest description. We define a second quantised 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.

Recommendations

• THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
• Quantum Kolmogorov complexity
• Quantum algorithmic entropy
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• Quantum Kolmogorov complexity based on classical descriptions

Cites work

• A new inequality for the von Neumann entropy
• A strange application of Kolmogorov complexity
• ALGORITHMIC COMPLEXITY OF QUANTUM STATES
• Algorithmic Information Theory
• Inequalities for Shannon entropy and Kolmogorov complexity
• On Lossless Quantum Data Compression With a Classical Helper
• Quantum Complexity Theory
• Quantum Kolmogorov complexity
• Quantum Kolmogorov complexity based on classical descriptions
• Quantum algorithmic entropy
• Reversible arithmetic coding for quantum data compression

Cited in

(8)

• Quantum Kolmogorov complexity
• Prefix-free quantum Kolmogorov complexity
• Quantum complexity and the virial theorem
• Quantum information distance
• State complexity and quantum computation
• Complexity measure: a quantum information approach
• Lossless quantum data compression and quantum Kolmogorov complexity
• THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY

This page was built for publication: SECOND QUANTIZED KOLMOGOROV COMPLEXITY

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3536074)