Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Foundations of Physics

Basic Properties of Quantum Automata

Stanley Gudder

Published Feb 1, 2000• 21 citations
Publisher
DOI
10.1023/a:1003649201735

Related papers

Quantum Automata with Open Time Evolution

Mika Hirvensalo

In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.

IGI Global eBooks•Jan 1, 2012•0 citations

Characterizations of quantum automata

Daowen Qiu, Mingsheng Ying

Theoretical Computer Science•Sep 17, 2003•22 citations

Various Aspects of Finite Quantum Automata

Mika Hirvensalo

Lecture notes in computer science•Jan 1, 2008•32 citations

Quantum Automata with Open Time Evolution

Mika Hirvensalo

In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.

International Journal of Natural Computing Research•Jan 1, 2010•61 citations

On quantum-mechanical automata

David Z. Albert

Physics Letters A•Oct 1, 1983•90 citations

THE PRODUCT OF QUANTUM AUTOMATA

Zhi–Wen Mo, QING-LEI CHEN, Jun Liu

In this paper we want to establish the multiplication theory of quantum automata(orthomodular lattice-valued automata). According this theory, we kan construct complex quantum automata. First we give the definition of direct product, cascading product and ring product. Then we discuss the basic properties of them. At last, we give the form of the language that can be recognized by product quantum automata.

World Scientific proceedings series on computer engineering and information science•Oct 1, 2012•0 citations
In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.
In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.