Skip to main content

Quantum Computing and Entanglement for Mathematicians

  • Chapter

Part of the Lecture Notes in Mathematics book series (LNMCIME,volume 1931)

These notes are an expanded form of lectures presented at the C.I.M.E. summer school in representation theory in Venice, June 2004. The sections of this article roughly follow the five lectures given. The first three lectures (sections) are meant to give an introduction to an audience of mathematicians (or mathematics graduate students) to quantum computing. No attempt is given to describe an implementation of a quantum computer (it is still not absolutely clear that any exist). There are also some simplifying assumptions that have been made in these lectures. The short introduction to quantum mechanics in the first section involves an interpretation of measurement that is still being debated which involves the “collapse of the wave function” after a measurement. This interpretation is not absolutely necessary but it simpli- fies the discussion of quantum error correction. The next two sections give an introduction to quantum algorithms and error correction through examples including fairly complete explanations of Grover’s (unordered search) and Shor’s (period search and factorization) algorithms and the quantum perfect (five qubit) code. The last two sections present applications of representation and Lie theory to the subject. We have emphasized the applications to entanglement since this is the most mathematical part of recent research in the field and this is also the main area to which the author has made contributions. The material in subsections 5.1 and 5.3 appears in this article for the first time.

Keywords

  • Unitary Transformation
  • Quantum Algorithm
  • Reduce Density Matrix
  • Hilbert Series
  • Local Transformation

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   74.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Kostant and S. Rallis, Orbits and Lie group representations associated to symmetric spaces, Amer. J. Math., 93 (1971), 753-809.

    CrossRef  MATH  MathSciNet  Google Scholar 

  2. David Meyer and Nolan Wallach, Global entanglement in multiparticle sys-tems. Quantum information theory. J. Math. Phys. 43 (2002), no. 9, 4273-4278.

    CrossRef  MATH  MathSciNet  Google Scholar 

  3. Erik Rains, Quantum codes of minimum distance two. IEEE Trans. Inform. Theory 45 (1999), no. 1, 266-271.

    CrossRef  MATH  MathSciNet  Google Scholar 

  4. Nolan R. Wallach, The Hilbert series of measures of entanglement for 4 qubits, Acta Appl. Math. 86 (2005), no.1-2, 203-220.

    CrossRef  MATH  MathSciNet  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 Berlin Heidelberg

About this chapter

Cite this chapter

Wallach, N.R. (2008). Quantum Computing and Entanglement for Mathematicians. In: Tarabusi, E.C., D'Agnolo, A., Picardello, M. (eds) Representation Theory and Complex Analysis. Lecture Notes in Mathematics, vol 1931. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76892-0_6

Download citation