Skip to main content
SpringerLink
Log in

On Halting Process of Quantum Turing Machine

  • Published:
Open Systems & Information Dynamics

Abstract

We prove that there is no algorithm to tell whether an arbitrarily constructed Quantum Turing Machine has same time steps for different branches of computation. We, hence, cannot avoid the notion of halting to be probabilistic in Quantum Turing Machine.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

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

    Article  Google Scholar 

  2. M. Ozawa, Phys. Rev. Lett. 80, 631 (1998); Theoret. Informatics and Appl. 34, 379 (2000).

    Google Scholar 

  3. N. Linden and S. Popescu, quant-ph/9806054.

  4. Y. Shi, Phys. Lett. A 293, 277 (2002).

    Article  Google Scholar 

  5. E. Bernstein and U. Vazirani, SIAM Journal on Computing 26, 1411 (1997).

    Article  Google Scholar 

  6. D. Deutsch, Proc. Roy. Soc. London Ser. A 400, 96 (1985).

    Google Scholar 

  7. P. W. Shor, SIAM J. Computing 26, 1484 (1997).

    Article  Google Scholar 

  8. L. Grover, Phys. Rev. Lett. 79, 325 (1997).

    Article  Google Scholar 

  9. M. Ohya and N. Masuda, Open Syst. Inforamtion Dyn. 7, 33 (2000).

    Article  Google Scholar 

  10. R. Penrose, The Emperor’s New Mind, Oxford University Press, 1989.

Download references

Author information

Author notes

  1. Takayuki Miyadera

    Present address: National Institute of Advanced Industrial Science and Technology, Japan

Authors and Affiliations

  1. Department of Information Sciences, Tokyo University of Science, Noda City, Chiba, 278-8510, Japan

    Takayuki Miyadera & Masanori Ohya

Authors
  1. Takayuki Miyadera
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masanori Ohya
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Takayuki Miyadera.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Miyadera, T., Ohya, M. On Halting Process of Quantum Turing Machine. Open Syst Inf Dyn 12, 261–264 (2005). https://doi.org/10.1007/s11080-005-0923-2

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11080-005-0923-2

Keywords

Search

Navigation