Skip to main content

Quantum Reed—Solomon Codes

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1719))

Abstract

We introduce a new class of quantum error—correcting codes derived from (classical) Reed—Solomon codes over finite fields of characteristic two. Quantum circuits for encoding and decoding based on the discrete cyclic Fourier transform over finite fields are presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • 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. A. Barenco, C. H. Bennett, R. Cleve, D. P. Divincenzo, N. Margolus, P. Shor, T. Sleator, J. A. Smolin, and H. Weinfurter, Elementary gates for quantum computation, Physical Review A, 52 (1995), pp. 3457–3467.

    Article  Google Scholar 

  2. A. Berthiaume, Quantum Computation, in Complexity Theory Retrospective II, L. A. Hemaspaandra and A. L. Selman, eds., Springer, New York, 1997, pp. 23–51.

    Google Scholar 

  3. T. Beth and M. Grassl, The Quantum Hamming and Hexacodes, Fortschritte der Physik, 46 (1998), pp. 459–491.

    Article  MathSciNet  Google Scholar 

  4. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Quantum Error Correction Via Codes over GF(4), IEEE Transactions on Information Theory, IT-44 (1998), pp. 1369–1387.

    Article  MathSciNet  Google Scholar 

  5. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist., Physical Review A, 54 (1996), pp. 1098–1105.

    Article  Google Scholar 

  6. J. I. Cirac and P. Zoller, Quantum Computation with Cold Trapped Ions, Physical Review Letters, 74 (1995), pp. 4091–4094.

    Article  Google Scholar 

  7. D. G. Cory, A. F. Fahmy, and T. F. Havel, Ensemble Quantum Computing by Nuclear Resonance Spectroscopy, Technical Report TR-10-96, B.C. M. P., Harvard Medical Medical School, Boston, Dec. 1996.

    Google Scholar 

  8. P. M. A. Dirac, The Principles of Quantum Mechanics, Clarendon Press, Oxford, 4th ed., 1958.

    MATH  Google Scholar 

  9. W. Geiselmann, Algebraische Algorithmenentwicklung am Beispiel der Arithmetik in endlichen Körpern, Shaker, Aachen, 1994. Zugleich Dissertation, Universität Karlsruhe, 1993.

    Google Scholar 

  10. M. Grassl and T. Beth, Codierung und Decodierung zyklischer Quantencodes, in Fachtagung Informations-und Mikrosystemtechnik, B. Michaelis and H. Holub, eds., Magdeburg, 25–27 Mar. 1998.

    Google Scholar 

  11. M. Grassl, T. Beth, and T. Pellizzari, Codes for the Quantum Erasure Channel, Physical Review A, 56 (1997), pp. 33–38.

    Article  MathSciNet  Google Scholar 

  12. L. K. Grover, A fast quantum mechanical algorithm for database search, in Proceedings 28th Annual ACM Symposium on Theory of Computing (STOC), New York, 1996, ACM, pp. 212–219.

    Google Scholar 

  13. D. Jungnickel, Finite Fields, BI-Wissenschaftsverlag, Mannheim, 1993.

    MATH  Google Scholar 

  14. E. Knill and R. Laflamme, Concatenated Quantum Codes. LANL preprint quant-ph/9608012, 1996.

    Google Scholar 

  15. —, Theory of quantum error-correcting codes, Physical Review A, 55 (1997), pp. 900–911.

    Article  MathSciNet  Google Scholar 

  16. F. J. Macwilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.

    Google Scholar 

  17. M. Pücshel, M. Rötteler, and T. Beth, Fast Quantum Fourier Transforms for a Class of Non-abelian Groups, in Proceedings AAECC-13, 1999.

    Google Scholar 

  18. P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms, in Proceedings 35th Annual Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society Press, Nov. 1994, pp. 124–134.

    Google Scholar 

  19. A. Steane, Error Correcting Codes in Quantum Theory, Physical Review Letters, 77 (1996), pp. 793–797.

    Article  MATH  MathSciNet  Google Scholar 

  20. —, Multiple Particle Interference and Quantum Error Correction, Proceedings of the Royal Society London Series A, 452 (1996), pp. 2551–2577.

    Article  MathSciNet  Google Scholar 

  21. —, Quantum computing, Reports on Progress in Physics, 61 (1998), pp. 117–173.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grassl, M., Geiselmann, W., Beth, T. (1999). Quantum Reed—Solomon Codes. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1999. Lecture Notes in Computer Science, vol 1719. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46796-3_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-46796-3_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66723-0

  • Online ISBN: 978-3-540-46796-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics