Skip to main content

Quantum Turing Machines: Local Transition, Preparation, Measurement, and Halting

  • Chapter
Quantum Communication, Computing, and Measurement 2

Abstract

Foundations of the theory of quantum Turing machines are investigated. The protocol for the preparation and the measurement of quantum Turing machines is discussed. The local transition functions are characterized for fully general quantum Turing machines. A new halting protocol is proposed without augmenting the halting qubit and is shown to work without spoiling the computation.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Church, Am. J. Math. 58, 345 (1936).

    Article  MathSciNet  MATH  Google Scholar 

  2. A. M. Turing, Proc. Lond. Math. Soc. Ser. 2 42, 230 (1936).

    Article  MATH  Google Scholar 

  3. C. H. Papadimitriou, Computational Complexity (Addison-Wesley, Reading, MA, 1994).

    MATH  Google Scholar 

  4. R. P. Feynman, Inter. J. Theor. Phys. 21, 467 (1982).

    Article  MathSciNet  Google Scholar 

  5. D. Deutsch, Proc. R. Soc. Lond. A 400, 97 (1985).

    Article  MathSciNet  MATH  ADS  Google Scholar 

  6. D. Deutsch, Proc. R. Soc. Lond. A 425, 73 (1989).

    Article  MathSciNet  MATH  ADS  Google Scholar 

  7. P. Benioff, J. Stat. Phys. 22, 563 (1980).

    Article  MathSciNet  ADS  Google Scholar 

  8. E. Bernstein and U. Vazirani, SIAM J. Comput. 26, 1411 (1997).

    Article  MathSciNet  MATH  Google Scholar 

  9. A. Yao, in Proceedings of the 34th Annual Symposium on foundations of Computer Science, edited by S. Goldwasser, p. 352 (IEEE Computer Society Press, Los Alamitos, CA, 1993).

    Google Scholar 

  10. P. W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, edited by S. Goldwasser, p. 124 (IEEE Computer Society Press, Los Alamitos, CA, 1994).

    Chapter  Google Scholar 

  11. J. M. Myers, Phys. Rev. Lett. 78, 1823 (1997).

    Article  MathSciNet  MATH  ADS  Google Scholar 

  12. M. Ozawa, Phys. Rev. Lett. 80, 631 (1998).

    Article  ADS  Google Scholar 

  13. H. Nishimura and M. Ozawa, “Computational complexity of uniform quantum circuit families and quantum Turing machines,” (in preparation).

    Google Scholar 

  14. N. Linden and S. Popescu, “The halting problem for quantum computers,” (e-print: quant-ph/9806054).

    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

Ozawa, M. (2002). Quantum Turing Machines: Local Transition, Preparation, Measurement, and Halting. 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_32

Download citation

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

  • 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