Skip to main content
Conference Proceedings

An application of quantum finite automata to interactive proof systems (extended abstract)

Lecture Notes in Computer Science (2005) 3317 225-236
DOI: 10.1007/978-3-540-30500-2_21
9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Quantum finite automata have been studied intensively since their introduction in late 1990s. 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. © Springer-Verlag Berlin Heidelberg 2005.

Author supplied keywords

Cite

CITATION STYLE

APA

Nishimura, H., & Yamakami, T. (2005). An application of quantum finite automata to interactive proof systems (extended abstract). In Lecture Notes in Computer Science (Vol. 3317, pp. 225–236). Springer Verlag. https://doi.org/10.1007/978-3-540-30500-2_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free