Results 1  10
of
156,016
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
On the Power of MultiProver Interactive Protocols
 Theoretical Computer Science
, 1988
"... this paper we consider a further generalization of the proof system model, due to BenOr, Goldwasser, Kilian and Wigderson [6], where instead of a single prover there may be many. This apparently gives the model additional power. The intuition for this may be seen by considering the case of two crim ..."
Abstract

Cited by 152 (9 self)
 Add to MetaCart
collapses. Multipleprover interactive proof systems have also seen several important applications including the analysis of program testing [7, 4] and the complexity of approximation algorithms [14, 2, 1]. Brief summary of results: First we give a simple characterization of the power of the multiprover
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 47 (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 ..."
Compressive sampling
, 2006
"... Conventional wisdom and common practice in acquisition and reconstruction of images from frequency data follow the basic principle of the Nyquist density sampling theory. This principle states that to reconstruct an image, the number of Fourier samples we need to acquire must match the desired res ..."
Abstract

Cited by 1427 (15 self)
 Add to MetaCart
mathematical insights underlying this new theory, and explain some of the interactions between compressive sampling and other fields such as statistics, information theory, coding theory, and theoretical computer science.
Coherent state exchange in multiprover quantum interactive proof systems
, 2008
"... We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multiprover quantum interactive proof systems are given. First, we prove that there exists a oner ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement. Two applications of this fact to the study of multiprover quantum interactive proof systems are given. First, we prove that there exists a one
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
HumanComputer Interaction
, 1993
"... www.bcshci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351119X 1 ..."
Abstract

Cited by 582 (18 self)
 Add to MetaCart
www.bcshci.org.uk Find out what happened at HCI2004 Interacting with … music aeroplanes petrol pumps Published by the British HCI Group • ISSN 1351119X 1
KodairaSpencer theory of gravity and exact results for quantum string amplitudes
 Commun. Math. Phys
, 1994
"... We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particu ..."
Abstract

Cited by 545 (60 self)
 Add to MetaCart
We develop techniques to compute higher loop string amplitudes for twisted N = 2 theories with ĉ = 3 (i.e. the critical case). An important ingredient is the discovery of an anomaly at every genus in decoupling of BRST trivial states, captured to all orders by a master anomaly equation. In a particular realization of the N = 2 theories, the resulting string field theory is equivalent to a topological theory in six dimensions, the Kodaira– Spencer theory, which may be viewed as the closed string analog of the Chern–Simon theory. Using the mirror map this leads to computation of the ‘number ’ of holomorphic curves of higher genus curves in Calabi–Yau manifolds. It is shown that topological amplitudes can also be reinterpreted as computing corrections to superpotential terms appearing in the effective 4d theory resulting from compactification of standard 10d superstrings on the corresponding N = 2 theory. Relations with c = 1 strings are also pointed out.
Multiprover quantum MerlinArthur proof systems with small gap
, 2012
"... This paper studies multipleproof quantum MerlinArthur (QMA) proof systems in the setting when the completenesssoundness gap is small. Small means that we only lowerbound the gap with an inverseexponential function of the input length, or with an even smaller function. Using the protocol of Blie ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
and multiprover proof systems in the ‘smallgap setting’, under the assumption that EXP 6=NEXP. This implies, among others, the nonexistence of certain operators called disentanglers (defined by Aaronson et al. [ABD+09]), with good approximation parameters. We also show that in this setting the proof
Results 1  10
of
156,016