Quantum information distance
From MaRDI portal
Recommendations
Cites work
- An introduction to Kolmogorov complexity and its applications
- Clustering by Compression
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem
- Information distance
- Lossless quantum data compression and quantum Kolmogorov complexity
- On the Length of Programs for Computing Finite Binary Sequences
- Quantum algorithmic entropy
- Quantum Complexity Theory
- Quantum Computability
- Quantum Kolmogorov complexity
- QUANTUM KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS
- Quantum Kolmogorov complexity based on classical descriptions
- Quantum theory, the Church–Turing principle and the universal quantum computer
- SECOND QUANTIZED KOLMOGOROV COMPLEXITY
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY
- The Similarity Metric
This page was built for publication: Quantum information distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5037882)