Skip to main content

Quantum Dense Coding

1992; Bennett, Wiesner

  • Reference work entry
Encyclopedia of Algorithms

Keywords and Synonyms

Super dense coding ; Dense coding      

Problem Definition

Quantum information theory distinguishes classical bits from quantum bits or qubits. The quantum state of n qubits is represented by a complex vector in \( { (\mathbb{C}^2)^{\otimes n} } \), where \( { (\mathbb{C}^2)^{\otimes n} } \) is the tensor product of n 2-dimensional complex vector spaces. Classical n-bit strings form a basis for the vector space \( { (\mathbb{C}^2)^{\otimes n} } \). Column vectors in \( { (\mathbb{C}^2)^{\otimes n} } \) are denoted as \( { | \psi \rangle } \) and row vectors are denoted as \( { | \psi \rangle^{\dagger} = {| \psi \rangle^*}^T \equiv \langle \psi | } \). The complex inner-product between vectors \( { | \psi \rangle } \) and \( { | \phi \rangle } \) is conveniently written as \( { \langle \psi | \phi \rangle } \).

Entangled quantum states \( { | \psi \rangle \in (\mathbb{C}^2)^{\otimes n} } \) are those quantum states that cannot be written as a product of some vectors \( {...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Bennett, C.H., Brassard, G., Crepeau, C., Jozsa, R., Peres, A., Wootters, W.K.: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Phys. Rev. Lett. 70, 1895–1899 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bennett, C.H., DiVincenzo, D.P., Smolin, J.A., Terhal, B.M., Wootters, W.K.: Remote state preparation. Phys. Rev. Lett. 87, 077902 (2001)

    Article  Google Scholar 

  3. Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Phys. Rev. Lett. 69, 2881–2884 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  4. Devetak, I., Harrow, A., Winter, A.: A resource framework for quantum Shannon theory. Tech. Report CSTR-05-008, CS Department, University of Bristol, December (2005)

    Google Scholar 

  5. Fang, X., Zhu, X., Feng, M., Mao, X., Du, F.: Experimental implementation of dense coding using nuclear magnetic resonance. Phys. Rev. A 61, 022307 (2000)

    Article  Google Scholar 

  6. Harrow, A., Hayden, P., Leung, D.: Superdense coding of quantum states. Phys. Rev. Lett. 92, 187901 (2004)

    Article  Google Scholar 

  7. Harrow, A.W.: Coherent communication of classical messages. Phys. Rev. Lett. 92, 097902 (2004)

    Article  MathSciNet  Google Scholar 

  8. Holevo, A.S.: Bounds for the quantity of information transmitted by a quantum communication channel. Problemy Peredachi Informatsii, 9, 3–11 (1973). English translation in: Probl. Inf. Transm. 9, 177–183 (1973)

    Google Scholar 

  9. Mattle, K., Weinfurter, H., Kwiat, P.G., Zeilinger, A.: Dense coding in experimental quantum communication. Phys. Rev. Lett. 76, 4656–4659 (1996)

    Article  Google Scholar 

  10. Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge University Press, Cambridge, U.K. (2000)

    MATH  Google Scholar 

  11. Schaetz T., Barrett, M.D., Leibfried, D., Chiaverini, J., Britton, J., Itano, W.M., Jost, J.D., Langer, C., Wineland, D.J.: Quantum Dense Coding with Atomic Qubits. Phys. Rev. Lett. 93, 040505 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Terhal, B. (2008). Quantum Dense Coding. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_314

Download citation

Publish with us

Policies and ethics