AbstractIn this paper we analyze some features of the behaviour of quantum automata. In particular we prove that the class of languages recognized by quantum automata with isolated cut point is the class of reversible regular languages. As a more general result, we give a bound on the inverse error that implies the regularity of the language accepted by a quantum automaton
In this paper we analyze several models of 1-way quantum finite automata, in the light of formal pow...
One of important questions on quantum computing is whether there is a computational gap between the ...
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38...
AbstractIn this paper we analyze some features of the behaviour of quantum automata. In particular w...
AbstractWe analyze some features of the behaviour of quantum automata, providing analogies and diffe...
AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and ...
AbstractThis paper focuses on quantum analogues of various models of counter automata, and almost co...
We consider the model of one-way automata with quantum and classical states (qcfas) introduced in [2...
Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs a...
(eng) We study the following decision problem: is the language recognized by a quantum finite automa...
AbstractKravtsev introduced 1-way quantum 1-counter automata (1Q1CAs), and showed that several non-c...
AbstractWe define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and veri...
We consider the model of one-way automata with quantum and classical states (QCFAs) introduced in [2...
AbstractGenerally, unitary transformations limit the computational power of quantum finite automata ...
We prove that any unary regular language can be accepted with constant cut point and isolation by a ...
In this paper we analyze several models of 1-way quantum finite automata, in the light of formal pow...
One of important questions on quantum computing is whether there is a computational gap between the ...
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38...
AbstractIn this paper we analyze some features of the behaviour of quantum automata. In particular w...
AbstractWe analyze some features of the behaviour of quantum automata, providing analogies and diffe...
AbstractWe analyze the properties of probabilistic reversible decide-and-halt automata (DH-PRA) and ...
AbstractThis paper focuses on quantum analogues of various models of counter automata, and almost co...
We consider the model of one-way automata with quantum and classical states (qcfas) introduced in [2...
Quantum finite automata were introduced by C.Moore and J.P.Crutchfield in [MC 97] and by A.Kondacs a...
(eng) We study the following decision problem: is the language recognized by a quantum finite automa...
AbstractKravtsev introduced 1-way quantum 1-counter automata (1Q1CAs), and showed that several non-c...
AbstractWe define q quantum finite automata (qQFAs) and q quantum regular grammars (qQRGs), and veri...
We consider the model of one-way automata with quantum and classical states (QCFAs) introduced in [2...
AbstractGenerally, unitary transformations limit the computational power of quantum finite automata ...
We prove that any unary regular language can be accepted with constant cut point and isolation by a ...
In this paper we analyze several models of 1-way quantum finite automata, in the light of formal pow...
One of important questions on quantum computing is whether there is a computational gap between the ...
The computational model of Quantum Finite Automata has been introduced by multiple authors (e.g. [38...
DOI
Add to ORKG