Classical and Quantum Information Theory: An Introduction for the Telecom Scientist

Hardcover (Print)
Buy New
Buy New from BN.com
$97.03
Used and New from Other Sellers
Used and New from Other Sellers
from $25.98
Usually ships in 1-2 business days
(Save 75%)
Other sellers (Hardcover)
  • All (13) from $25.98   
  • New (6) from $106.00   
  • Used (7) from $25.98   

Overview

Information theory lies at the heart of modern technology, underpinning all communications, networking, and data storage systems. This book sets out, for the first time, a complete overview of both classical and quantum information theory. Throughout, the reader is introduced to key results without becoming lost in mathematical details. Opening chapters present the basic concepts and various applications of Shannon's entropy, moving on to the core features of quantum information and quantum computing. Topics such as coding, compression, error-correction, cryptography and channel capacity are covered from classical and quantum viewpoints. Employing an informal yet scientifically accurate approach, Desurvire provides the reader with the knowledge to understand quantum gates and circuits. Highly illustrated, with numerous practical examples and end-of-chapter exercises, this text is ideal for graduate students and researchers in electrical engineering and computer science, and practitioners in the telecommunications industry. Further resources and instructor-only solutions are available at www.cambridge.org/9780521881715.

Read More Show Less

Editorial Reviews

From the Publisher
"The author is an extremely eminent researcher in optical communications. Hence, he has impeccable credentials for writing this book. He brings a direct industrial perspective to this endeavor. That expertise has resulted in a first-class text that will be well received by those who have the privilege to teach future generations of telecom scientists."
K. Alan Shore, Optics and Photonics News
Read More Show Less

Product Details

  • ISBN-13: 9780521881715
  • Publisher: Cambridge University Press
  • Publication date: 2/28/2009
  • Pages: 714
  • Product dimensions: 6.90 (w) x 9.80 (h) x 4.70 (d)

Meet the Author

Emmanuel Desurvire is Director of the Physics Research Group at Thales Research and Technology, and has held previous positions at Stanford University, AT&T Bell Laboratories, Columbia University and Alcatel. With over 25 years' experience in the field of optical communications, he has received numerous recognitions for his scientific contributions, including the 1998 Benjamin Franklin Medal in Engineering, the 2005 William Streifer Scientific Achievement Award, and, in 2007, the IEEE/LEOS John Tyndall Award, Engineer of the Year Award and the France-Telecom Prize of the Académie des Sciences.

Read More Show Less

Table of Contents

1. Probabilities basics; 2. Probability distributions; 3. Measuring information; 4. Entropy; 5. Mutual information and more entropies; 6. Differential entropy; 7. Algorithmic entropy and Kolmogorov complexity; 8. Information coding; 9. Optimal coding and compression; 10. Integer, arithmetic and adaptive coding; 11. Error correction; 12. Channel entropy; 13. Channel capacity and coding theorem; 14. Gaussian channel and Shannon-Hartley theorem; 15. Reversible computation; 16. Quantum bits and quantum gates; 17. Quantum measurments; 18. Qubit measurements, superdense coding and quantum teleportation; 19. Deutsch/Jozsa alorithms and quantum fourier transform; 20. Shor's factorization algorithm; 21. Quantum information theory; 22. Quantum compression; 23. Quantum channel noise and channel capacity; 24. Quantum error correction; 25. Classical and quantum cryptography; Appendix A. Boltzmann's entropy; Appendix B. Shannon's entropy; Appendix C. Maximum entropy of discrete sources; Appendix D. Markov chains and the second law of thermodynamics; Appendix E. From discrete to continuous entropy; Appendix F. Kraft-McMillan inequality; Appendix G. Overview of data compression standards; Appendix H. Arithmetic coding algorithm; Appendix I. Lempel-Ziv distinct parsing; Appendix J. Error-correction capability of linear block codes; Appendix K. Capacity of binary communication channels; Appendix L. Converse proof of the Channel Coding Theorem; Appendix M. Block sphere representation of the qubit; Appendix N. Pauli matrices, rotations and unitary operators; Appendix O. Heisenberg Uncertainty Principle; Appendix P. Two qubit teleportation; Appendix Q. Quantum Fourier transform circuit; Appendix R. Properties of continued fraction expansion; Appendix S. Computation of inverse Fourier transform in the factoring of N=21 through Shor's algorithm; Appendix T. Modular arithmetic and Euler's Theorem; Appendix U. Klein's inequality; Appendix V. Schmidt decomposition of joint pure states; Appendix W. State purification; Appendix X. Holevo bound; Appendix Y. Polynomial byte representation and modular multiplication.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)