Matrix analysis
A polynomial-time algorithm for the equivalence of probabilistic automata
SIAM Journal on Computing
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum circuits with mixed states
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Undecidability on quantum finite automata
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Regular languages accepted by quantum automata
Information and Computation
Quantum automata and quantum grammars
Theoretical Computer Science
Quantum computation and quantum information
Quantum computation and quantum information
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Characterizations of 1-Way Quantum Finite Automata
SIAM Journal on Computing
Two-way finite automata with quantum and classical states
Theoretical Computer Science - Natural computing
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Quantum Reversibility and a New Model of Quantum Automaton
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Probabilistic Reversible Automata and Quantum Automata
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On the power of quantum finite state automata
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Optimal Lower Bounds for Quantum Automata and Random Access Codes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Characterizations of quantum automata
Theoretical Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
Small size quantum automata recognizing some regular languages
Theoretical Computer Science - The art of theory
Determination of equivalence between quantum sequential machines
Theoretical Computer Science
Theory of Computing Systems
Quantum automata for some multiperiodic languages
Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata
Theoretical Computer Science
Some Observations on Two-Way Finite Automata with Quantum and Classical States
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Note: A note on quantum sequential machines
Theoretical Computer Science
Hierarchy and equivalence of multi-letter quantum finite automata
Theoretical Computer Science
Languages Recognized with Unbounded Error by Quantum Finite Automata
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Logical reversibility of computation
IBM Journal of Research and Development
Quantum computing: 1-way quantum automata
DLT'03 Proceedings of the 7th international conference on Developments in language theory
Unbounded-error quantum computation with small space bounds
Information and Computation
On the complexity of minimizing probabilistic and quantum automata
Information and Computation
State succinctness of two-way finite automata with quantum and classical states
Theoretical Computer Science
Hi-index | 5.23 |
Generally, unitary transformations limit the computational power of quantum finite automata (QFA). In this paper, we study a generalized model named one-way general quantum finite automata (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general quantum finite automata (MO-1gQFA) where a measurement deciding to accept or reject is performed at the end of a computation, and measure-many one-way general quantum finite automata (MM-1gQFA) where a similar measurement is performed after each trace-preserving quantum operation on reading each input symbol. We characterize the measure-once model from three aspects: the closure property, the language recognition power, and the equivalence problem. We prove that MO-1gQFA recognize, with bounded error, precisely the set of all regular languages. Our results imply that some models of quantum finite automata proposed in the literature, which were expected to be more powerful, still cannot recognize non-regular languages. We prove that MM-1gQFA also recognize only regular languages with bounded error. Thus, MM-1gQFA and MO-1gQFA have the same language recognition power, in sharp contrast with traditional MO-1QFA and MM-1QFA, the former being strictly less powerful than the latter. Finally, we present a necessary and sufficient condition for two MM-1gQFA to be equivalent.