In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this general context, we recall two well known constructions, by proving: 1. Languages generated with isolated cut-point by a class of bounded rational formal series axe regular. 2. If a class of formal series is closed under f-complement, Hadamard product and convex linear combination, then the class of languages generated with isolated cut-point is closed under boolean operations. We introduce a general model of 1-way quantum automata and we compare their behaviors with those of measure-once, measure-many and reversible 1-way quantum automata.
|Titolo:||Quantum computing: 1-way quantum automata|
|Autori interni:||PALANO, BEATRICE SANTA (Ultimo)|
BERTONI, ALBERTO (Primo)
MEREGHETTI, CARLO (Secondo)
|Parole Chiave:||formal power series; quantum finite automata|
|Settore Scientifico Disciplinare:||Settore INF/01 - Informatica|
|Data di pubblicazione:||2003|
|Digital Object Identifier (DOI):||10.1007/3-540-45007-6_1|
|Tipologia:||Book Part (author)|
|Appare nelle tipologie:||03 - Contributo in volume|
- PubMed Central loading...