Sciweavers

12 search results - page 2 / 3
» Almost Optimal Bounds for Direct Product Threshold Theorem
Sort
View
STOC
1995
ACM
108views Algorithms» more  STOC 1995»
13 years 8 months ago
A parallel repetition theorem
We show that a parallel repetition of any two-prover one-round proof system (MIP(2, 1)) decreases the probability of error at an exponential rate. No constructive bound was previou...
Ran Raz
CORR
2006
Springer
120views Education» more  CORR 2006»
13 years 5 months ago
On the Role of Shared Entanglement
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of ...
Dmitry Gavinsky
ICQNM
2007
IEEE
131views Chemistry» more  ICQNM 2007»
13 years 11 months ago
Comparison of two bounds of the quantum correlation set
— From a geometric viewpoint, quantum nonlocality between two parties is represented as the difference of two convex bodies, namely the sets of possible results of classical and ...
David Avis, Tsuyoshi Ito
CRYPTO
2007
Springer
106views Cryptology» more  CRYPTO 2007»
13 years 9 months ago
Indistinguishability Amplification
system is the abstraction of the input-output behavior of any kind of discrete system, in particular cryptographic systems. Many aspects of cryptographic security analyses and pro...
Ueli M. Maurer, Krzysztof Pietrzak, Renato Renner
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 9 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson