Entropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem

Simple item page
dc.creatorBenatti, Fabio
dc.creatorKrueger, Tyll
dc.creatorMueller, Markus
dc.creatorSiegmund-Schultze, Rainer
dc.creatorSzkola, Arleta
dc.date2005-06-10
dc.date2006-10-17
dc.date.accessioned2026-07-07T08:18:20Z
dc.date.available2026-07-07T08:18:20Z
dc.descriptionIn classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of quantum Kolmogorov complexity, both based on the shortest qubit descriptions of qubit strings that, run by a universal quantum Turing machine, reproduce them as outputs.
dc.description26 pages, no figures. Reference to publication added: published in the Communications in Mathematical Physics (http://www.springerlink.com/content/1432-0916/)
dc.identifierhttps://arxiv.org/abs/quant-ph/0506080
dc.identifierhttp://arxiv.org/abs/quant-ph/0506080
dc.identifierCommunications in Mathematical Physics, Vol. 265, No.2 / July 2006, 437-461
dc.identifierdoi:10.1007/s00220-006-0027-z
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/134394
dc.subjectQuantum Physics
dc.subjectInformation Theory
dc.subjectMathematical Physics
dc.subjectDynamical Systems
dc.titleEntropy and Quantum Kolmogorov Complexity: A Quantum Brudno's Theorem
dc.typetext

Files

Collections

arXiv