Quantum information distance

DOI10.1142/S0219749921500313zbMath1486.81044OpenAlexW3210040109MaRDI QIDQ5037882

Songsong Dai

Publication date: 4 March 2022

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

Full work available at URL: https://doi.org/10.1142/s0219749921500313

zbMATH Keywords

Kolmogorov complexityquantum Kolmogorov complexityinformation distancequantum information distance

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Classical models of computation (Turing machines, etc.) (68Q04)

Cites Work

• Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
• Quantum algorithmic entropy
• LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY
• QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
• THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
• SECOND QUANTIZED KOLMOGOROV COMPLEXITY
• Clustering by Compression
• The Similarity Metric
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum Computability
• Quantum Complexity Theory
• Quantum Kolmogorov complexity based on classical descriptions
• Information distance
• On the Length of Programs for Computing Finite Binary Sequences
• An introduction to Kolmogorov complexity and its applications
• Quantum Kolmogorov complexity

This page was built for publication: Quantum information distance