Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 2980
Articles: 2'031'962
Articles rated: 2577

21 January 2021
 
  » arxiv » 1309.0429

 Article overview


Constant-Space Quantum Interactive Proofs Against Multiple Provers
Tomoyuki Yamakami ;
Date 2 Sep 2013
AbstractWe present upper and lower bounds of the prover complexity of multiple-prover quantum interactive proof systems whose verifiers are limited to two-way quantum finite automata. We prove that a two-way communication model of expected polynomial-time multiple-prover systems can recognize languages in NEXP, the nondeterministic exponential-time class. This answers an open question raised by Nishimura and Yamakami [J. Comput. System Sci, 75, pp.255--269, 2009]. Our proofs are simple and intuitive, although they heavily rely on an earlier result on multiple-prover interactive proof systems of Feige and Shamir [J. Comput. System Sci., 44, pp.259--271, 1992].
Source arXiv, 1309.0429
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  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/)






ScienXe.org
» my Online CV
» Free


News, job offers and information for researchers and scientists:
home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2021 - Scimetrica