On hybrid models of quantum finite automata (Q2353395): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: QPL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049266369 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1206.2131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undecidability on quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense quantum coding and quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way finite automata with quantum and classical states. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular languages accepted by quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452048 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of 1-Way Quantum Finite Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Various Aspects of Finite Quantum Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of one-way general quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determination of equivalence between quantum sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining the equivalence for one-way quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on quantum sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of minimizing probabilistic and quantum automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum automata and quantum grammars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum finite automata with control language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of quantum finite automata to interactive proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of sequential quantum machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-letter quantum finite automata: decidability of the equivalence and minimization of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially more concise quantum recognition of non-RMM regular languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of simulating space-bounded quantum computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a quantum programming language / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded-error quantum computation with small space bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the state complexity of semi-quantum finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Way Finite Automata with Quantum and Classical States / rank
 
Normal rank

Latest revision as of 12:56, 10 July 2024

scientific article
Language Label Description Also known as
English
On hybrid models of quantum finite automata
scientific article

    Statements

    On hybrid models of quantum finite automata (English)
    0 references
    0 references
    0 references
    13 July 2015
    0 references
    Unitary operators perform the state evolution of quantum finite automata (QFA). Hybrid quantum finite automatons differ from quantum finite automata. They are composed of two interactive components, a quantum component and a classical one. An input symbol is scanned; the quantum and classical components interact to evolve into new states during which communication may occur between them. There are three main classes of quantum hybrid finite automata that differ in the way they communicate which each other. In class one only quantum-classical communication is allowed, the quantum component sends its measurement result to the classical component. In class two only classical-quantum communications is allowed, the classical component sends its current state to the quantum component. In class three both classical-quantum and quantum-classical communication are allowed. First, the classical component sends its current state to the quantum component and then the quantum component sends its measurement result to the classical component. In the paper it is shown that non-hybrid quantum finite automata that perform a unitary state evolution can simulate all the three classes. It seems that hybrid quantum finite automata are equivalent to quantum finite automata. From the authors' abstract: ``As corollaries, some results in the literature concerning the language recognition power and the equivalence problem of hybrid QFA follow directly from these relationships clarified in this paper.''
    0 references
    0 references
    0 references
    0 references
    0 references
    quantum computing
    0 references
    automata theory
    0 references
    quantum finite automata (QFA)
    0 references
    hybrid quantum finite automata
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references