|
| | | | |
| | | |
| Stat |
Members: 2980
Articles: 2'031'962
Articles rated: 2577
21 January 2021 |
|
| | | | |
|
Article overview
| |
|
|
An Application of Quantum Finite Automata to Interactive Proof Systems | | Harumichi Nishimura
; Tomoyuki Yamakami
; | | Date: |
5 Oct 2004 | | Subject: | Quantum Physics; Computational Complexity | quant-ph cs.CC | | Abstract: | 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. | | Source: | arXiv, quant-ph/0410040 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser CCBot/2.0 (https://commoncrawl.org/faq/)
|
| |
|
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER