Skip to main content

A New Approach to Quantum Computation

  • Chapter
  • 709 Accesses

Abstract

A general quantum machine is characterized to capture all the possible physical structures that may be employed for effective or efficient computation. As an illustration, a specific machine is described for the permanent evaluation problem. The contrast between quantum and classical parallelism is also discussed, as is the effect of quantum error correction against decoherence and loss.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover 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. P. W. Shor, SIAM J. Comput. 26, 1474 (1997).

    Article  MathSciNet  Google Scholar 

  2. D. Deutsch, Proc. Roy. Soc. Lond. A 400, 97 (1985).

    Article  MathSciNet  MATH  ADS  Google Scholar 

  3. D. Slepian, Proc. IEEE 64, 292 (1976).

    Article  MathSciNet  Google Scholar 

  4. R. Jozsa, in The Geometric Universe, S. A. Huggett, ed. (Oxford University Press, 1998); p. 367.

    Google Scholar 

  5. A. Steane, Proc. Roy. Soc. Lond. A 452, 255 (1996).

    MathSciNet  Google Scholar 

  6. J. Preskill, quant-ph/9705031.

    Google Scholar 

  7. P. W. Shor, Phys. Rev. A 52, 2493 (1995).

    Article  ADS  Google Scholar 

  8. E. Knill and R. Laflamme, Phys. Rev. A 55, 900 (1997); theorem (V.5).

    Article  MathSciNet  ADS  Google Scholar 

  9. A. S. Holevo, Probabilistic and Statistical Aspects of Quantum Theory (North Holland, 1982); p. 67.

    Google Scholar 

  10. P. A. Benioff, J. Math Phys. 13, 908 (1972).

    Article  MathSciNet  ADS  Google Scholar 

  11. V. W. S. Chan, Tech. Rep. 489, MIT RLE (1975); theorem 9.

    Google Scholar 

  12. L. Grover, Phys. Rev. Lett. 78, 325 (1997); ibid 79, 4709 (1997).

    Article  ADS  Google Scholar 

  13. C. H. Papadimitriou, Computational Complexity (Addison Wesley, 1994); Ch. 18.

    Google Scholar 

  14. R. Motwani and P. Ragharan, Randomized Algorithms, (Cambridge University Press, 1995); ch. 11 and 12.

    Google Scholar 

  15. A. Barenco, A. Berthiaume, D. Deutsch, A. Ebert, R. Jozsa, and C. Macchiavello, SIAM J. Comput. 26, 1541 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  16. H. P. Yuen, “The Ultimate Quantum Limits on the Accuracy of Measurements,” in Proceedings of the Workshopon Squeezed States and Uncertainty Relations” NASAConference Publications 3135, 1991, pp. 13–22.

    Google Scholar 

  17. G. M. D’Ariano, U. Leonhardt, and H. Paul, Phys.Rev. A 52, 1801 (1995).

    Article  ADS  Google Scholar 

  18. S. MacLane and G. Birkhoff, Algebra, (Mac Millan, 1979); ch. XVI.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Kluwer Academic Publishers

About this chapter

Cite this chapter

Yuen, H.P. (2002). A New Approach to Quantum Computation. In: Kumar, P., D’Ariano, G.M., Hirota, O. (eds) Quantum Communication, Computing, and Measurement 2. Springer, Boston, MA. https://doi.org/10.1007/0-306-47097-7_33

Download citation

  • DOI: https://doi.org/10.1007/0-306-47097-7_33

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-0-306-46307-5

  • Online ISBN: 978-0-306-47097-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics