SECOND QUANTIZED KOLMOGOROV COMPLEXITY

DOI10.1142/S021974990800375XzbMath1153.81471arXiv0809.2642MaRDI QIDQ3536074

Rajagopal Nagarajan, Vlatko Vedral, Caroline Rogers

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

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

Related Items (4)

Quantum information distance ⋮ State complexity and quantum computation ⋮ COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH ⋮ LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY

Cites Work

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

This page was built for publication: SECOND QUANTIZED KOLMOGOROV COMPLEXITY