Apart from such a “practical view”, it has been argued that complexity aspects are also relevant from the fundamental point of view: Zurek [3] defines the physical entropy of a classical system as the sum of the Shannon entropy (formalizing the missing knowledge about the state) and the algorithmic information content (algorithmic randomness, i.e. the Kolmogorov complexity) present in the available data about the system. Mora et al. [4] describes a quantum generalization of Kolmogorov complexity and discusses also its thermodynamical relevance.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature
B. Schumacher: Quantum coding. Phys. Rev. A 51(4), 2738–2747 (1995)
M. Nielsen and I. Chuang: Quantum Information and Computation. (Cambridge University Press, Cambridge 2000)
W. Zurek: Algorithmic randomness and physical entropy. Phys. Rev. A 40, 4731–4751 (1989)
C. Mora, H. Briegel, and B. Kraus: Quantum Kolmogorov complexity and its applications. arXiv.org:quant-ph/0610109.
T. Cover and J. Thomas: Elements of Information Theory. (Wiley, New York 1991)
R. Omnes: The Interpretation of Quantum Mechanics. (Princeton University Press, Princeton 1994)
J. Jauch: Foundations of Quantum Mechanics. (Addison Wesley, New York 1968)
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Janzing, D. (2009). Quantum Entropy. In: Greenberger, D., Hentschel, K., Weinert, F. (eds) Compendium of Quantum Physics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70626-7_163
Download citation
DOI: https://doi.org/10.1007/978-3-540-70626-7_163
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70622-9
Online ISBN: 978-3-540-70626-7
eBook Packages: Physics and AstronomyPhysics and Astronomy (R0)