2,307 research outputs found
An Application of Quantum Finite Automata to Interactive Proof Systems
Quantum finite automata have been studied intensively since their
introduction in late 1990s as a natural model of a quantum computer 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 automata. We demonstrate strengths and weaknesses of our
systems and further study how various restrictions on the behaviors of
quantum-automaton verifiers affect the power of quantum interactive proof
systems.Comment: This is an extended version of the conference paper in the
Proceedings of the 9th International Conference on Implementation and
Application of Automata, Lecture Notes in Computer Science, Springer-Verlag,
Kingston, Canada, July 22-24, 200
- …