Abstract
Quantum computation and information studies how information is encoded in nature according to the laws of quantum mechanics and what this means for its computational power. In this note, we present a short and rather schematic introduction to quantum information theory by drawing comparisons to classical probability theory. For more details on quantum information theory and computation we refer to [3].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: Proceedings of the 39th ACM Symposium on Theory of Computing, STOC (2007)
Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes via quantum argument. In: STOC 2003, pp. 106–115 (2003)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
Raz, R.: Exponential separation of quantum and classical communication complexity. In: Proceedings of 31st ACM STOC, pp. 358–367 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kerenidis, I. (2009). Introduction to Quantum Information Theory. In: Desmedt, Y. (eds) Information Theoretic Security. ICITS 2007. Lecture Notes in Computer Science, vol 4883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10230-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-10230-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10229-5
Online ISBN: 978-3-642-10230-1
eBook Packages: Computer ScienceComputer Science (R0)