ALGORITHMIC COMPLEXITY OF QUANTUM STATES

DOI10.1142/S0219749906002043zbMath1099.81020arXivquant-ph/0412172OpenAlexW1977397146MaRDI QIDQ5493927

Caterina E. Mora, Hans J. Briegel

Publication date: 16 October 2006

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

Full work available at URL: https://arxiv.org/abs/quant-ph/0412172

zbMATH Keywords

algorithmic complexityentanglementShannon entropy

Mathematics Subject Classification ID

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

Related Items

Entanglement, complexity, and causal asymmetry in quantum theories ⋮ Equilibration in low-dimensional quantum matrix models ⋮ SECOND QUANTIZED KOLMOGOROV COMPLEXITY ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ COMPLEXITY MEASURE: A QUANTUM INFORMATION APPROACH ⋮ LOSSLESS QUANTUM DATA COMPRESSION AND QUANTUM KOLMOGOROV COMPLEXITY ⋮ Informational branching universe

Cites Work

• Quantum computations: algorithms and error correction
• Unnamed Item
• Unnamed Item

This page was built for publication: ALGORITHMIC COMPLEXITY OF QUANTUM STATES