Sciweavers

32 search results - page 7 / 7
» Chernoff-Type Direct Product Theorems
Sort
View
STOC
2006
ACM
149views Algorithms» more  STOC 2006»
14 years 5 months ago
Bounded-error quantum state identification and exponential separations in communication complexity
We consider the problem of bounded-error quantum state identification: given either state 0 or state 1, we are required to output `0', `1' or `?' ("don't ...
Dmitry Gavinsky, Julia Kempe, Oded Regev, Ronald d...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 5 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...