Results 1  10
of
4,773
On the Power of Quantum MultiProver Interactive Proof Systems
, 2001
"... In this paper we introduce a quantum analogue of multiprover interactive proof systems by naturally extending the model of singleprover quantum interactive proof systems defined by Watrous. It is proved that the class of languages having quantum multiprover interactive proof systems is equal to N ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper we introduce a quantum analogue of multiprover interactive proof systems by naturally extending the model of singleprover quantum interactive proof systems defined by Watrous. It is proved that the class of languages having quantum multiprover interactive proof systems is equal
Quantum multiprover interactive proof systems with limited prior entanglement
 Journal of Computer and System Sciences
"... This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among prov ..."
Abstract

Cited by 46 (5 self)
 Add to MetaCart
This paper gives the first formal treatment of a quantum analogue of multiprover interactive proof systems. In quantum multiprover interactive proof systems there can be two natural situations: one is with prior entanglement among provers, and the other does not allow prior entanglement among
Entitled: ZeroKnowledge MultiProver Interactive Proofs
, 2013
"... This is to certify that the thesis prepared ..."
Quantum Multi Prover Interactive Proofs with Communicating Provers ∗
"... We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange inf ..."
Abstract
 Add to MetaCart
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are unlimited in the classical communication between them. At first, this model may seem very weak, as provers who exchange
Generalized tsirelson inequalities, commutingoperator provers, and multiprover interactive proof systems
 In CCC ’08
, 2008
"... ar ..."
Interactive proofs and the hardness of approximating cliques
 JOURNAL OF THE ACM
, 1996
"... The contribution of this paper is twofold. First, a connection is shown between approximating the size of the largest clique in a graph and multiprover interactive proofs. Second, an efficient multiprover interactive proof for NP languages is constructed, where the verifier uses very few random b ..."
Abstract

Cited by 170 (11 self)
 Add to MetaCart
The contribution of this paper is twofold. First, a connection is shown between approximating the size of the largest clique in a graph and multiprover interactive proofs. Second, an efficient multiprover interactive proof for NP languages is constructed, where the verifier uses very few random
The quantum moment problem and bounds on entangled multiprover games
 In Proceedings of 23rd IEEE Conference on Computational Complexity
, 2008
"... We study the quantum moment problem: Given a conditional probability distribution together with some polynomial constraints, does there exist a quantum state ρ and a collection of measurement operators such that (i) the probability of obtaining a particular outcome when a particular measurement is p ..."
Abstract

Cited by 35 (2 self)
 Add to MetaCart
value of the game. It follows that the class of languages recognized by a multiprover interactive proof system where the provers share entanglement is recursive.
How to Delegate Computations: The Power of NoSignaling Proofs
"... We construct a 1round delegation scheme (i.e., argumentsystem) for every language computable in time t = t(n), where the running time of the prover is poly(t) and the running time of the verifier is n · polylog(t). In particular, for every language in P we obtain a delegation scheme with almost li ..."
Abstract
 Add to MetaCart
linear time verification. Our construction relies on the existence of a computational subexponentially secure private information retrieval (PIR) scheme. The proof exploits a curious connection between the problem of computation delegation and the model of multiprover interactive proofs that are sound
A Taxonomy of Proof Systems
 BASIC RESEARCH IN COMPUTER SCIENCE, CENTER OF THE DANISH NATIONAL RESEARCH FOUNDATION
, 1997
"... Several alternative formulations of the concept of an efficient proof system are nowadays coexisting in our field. These systems include the classical formulation of NP , interactive proof systems (giving rise to the class IP), computationallysound proof systems, and probabilistically checkable pro ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
proofs (PCP), which are closely related to multiprover interactive proofs (MIP). Although these notions are sometimes introduced using the same generic phrases, they are actually very different in motivation, applications and expressive power. The main objective of this essay is to try to clarify
QMIP = MIP∗
"... The way entanglement influences the power of quantum and classical multiprover interactive proof systems is a longstanding open question. We show that the class of languages recognized by quantum multiprover interactive proof systems, QMIP, is equal to MIP∗, the class of languages recognized by ..."
Abstract
 Add to MetaCart
The way entanglement influences the power of quantum and classical multiprover interactive proof systems is a longstanding open question. We show that the class of languages recognized by quantum multiprover interactive proof systems, QMIP, is equal to MIP∗, the class of languages recognized
Results 1  10
of
4,773