Back to Search
Start Over
An application of quantum finite automata to interactive proof systems
- Source :
-
Journal of Computer & System Sciences . Jun2009, Vol. 75 Issue 4, p255-269. 15p. - Publication Year :
- 2009
-
Abstract
- Abstract: Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer working with finite-dimensional quantum memory space. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell. Our quantum interactive proof systems are juxtaposed to DworkâStockmeyer''s classical interactive proof systems whose verifiers are two-way probabilistic finite automata. We demonstrate strengths and weaknesses of our systems by studying how various restrictions on the behaviors of quantum-automaton verifiers affect the power of quantum interactive proof systems. [Copyright &y& Elsevier]
- Subjects :
- *SET theory
*MATHEMATICS
*TOPOLOGY
*ARITHMETIC
Subjects
Details
- Language :
- English
- ISSN :
- 00220000
- Volume :
- 75
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- Journal of Computer & System Sciences
- Publication Type :
- Academic Journal
- Accession number :
- 37149737
- Full Text :
- https://doi.org/10.1016/j.jcss.2008.12.001