|
Sibirskie Èlektronnye Matematicheskie Izvestiya [Siberian Electronic Mathematical Reports], 2013, Volume 10, Pages 676–688
(Mi semr460)
|
|
|
|
Discrete mathematics and mathematical cybernetics
On finite automata with quantum and classical states
A. B. Grilo, A. V. Moura Institute of Computing, University of Campinas, Campinas,
SP Brazil
Abstract:
Several quantum computational models were proposed in order to study how the quantum structure of matter could improve computational tasks. Among them, there are some that are based on finite automata, which are simpler computational devices, that helps to understand how a finite number of qubits could help to increase the power of the model. In this work, we study two-way finite automata with quantum and classical states (2QCFA), focusing on computability and complexity questions. We show results presented in the literature involving languages recognizability and closure properties and we then present some partial results on languages not recognized by the model.
Keywords:
quantum automata, 2QCFA.
Received August 13, 2013, published December 14, 2013
Citation:
A. B. Grilo, A. V. Moura, “On finite automata with quantum and classical states”, Sib. Èlektron. Mat. Izv., 10 (2013), 676–688
Linking options:
https://www.mathnet.ru/eng/semr460 https://www.mathnet.ru/eng/semr/v10/p676
|
Statistics & downloads: |
Abstract page: | 167 | Full-text PDF : | 49 | References: | 41 |
|