Jump to ContentJump to Main Navigation
Introduction to Quantum Information Science$
Users without a subscription are not able to see the full content.

Vlatko Vedral

Print publication date: 2006

Print ISBN-13: 9780199215706

Published to Oxford Scholarship Online: January 2010

DOI: 10.1093/acprof:oso/9780199215706.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 22 August 2019

Quantum information II

Quantum information II

(p.68) 6 Quantum information II
Introduction to Quantum Information Science

Vlatko Vedral

Oxford University Press

This chapter discusses the principles of quantum information. The quantum mechanical equivalent of the Shannon noisy-channel communication theorem is obtained, along with some profound statements about the behavior of quantum information during generalised quantum measurements. The latter are very important in studies of quantum entanglement, but also in exploring the connections between thermodynamics, information theory, and quantum physics. This chapter also discusses equalities and inequalities related to entropy, the Holevo bound, capacity of a bosonic channel, information gained through measurements, relative entropy and thermodynamics, entropy increase due to erasure, and Landauer's erasure and data compression.

Keywords:   quantum information, quantum measurements, entropy, Holevo bound, relative entropy, thermodynamics, Landauer's erasure, data compression

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .