Characterization of Sequential Quantum Machines

  • Daowen Qiu


We further investigate some properties of sequential quantum machines (SQMs) and introduce so-called quantum sequential machines (QSMs). In particular, the equivalence between SQMs and QSMs is also presented. We give a counterexample to answer an open problem proposed by S. Gudder recently.

quantum computation stochastic sequential machines sequential quantum machines 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Bertoni, A. and Carpentieri, M. (2001). Analogies and differences between quantum and stochastic automata. Theoretical Computer Sciences 262, 69–81.Google Scholar
  2. Gruska, J. (1999). Quantum Computing, McGraw-Hill, London.Google Scholar
  3. Gudder, S. (1999). Quantum automata: An overview. International Journal of Theoretical Physics 38, 2261–2282.Google Scholar
  4. Gudder, S. (2000). Quantum computers. International Journal of Theoretical Physics 39, 2151–2177.Google Scholar
  5. Moore, C. and Crutchfield, P. (2000). Quantum automata and quantum grammars. Theoretical Computer Sciences 237, 275–306.Google Scholar
  6. Paz, A. (1971). Introduction to Probabilistic Automata, Academic Press, New York.Google Scholar

Copyright information

© Plenum Publishing Corporation 2002

Authors and Affiliations

  • Daowen Qiu
    • 1
  1. 1.State Key Laboratory of Intelligent Technology and Systems, Department of Computer Science and TechnologyTsinghua UniversityBeijingPeople's Republic of China

Personalised recommendations