A strong direct product theorem for disjointness
Proceedings of the forty-second ACM symposium on Theory of computing
Near-optimal extractors against quantum storage
Proceedings of the forty-second ACM symposium on Theory of computing
Constructive proofs of concentration bounds
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Strong direct product theorems for quantum communication and query complexity
Proceedings of the forty-third annual ACM symposium on Theory of computing
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Three-Query Locally Decodable Codes with Higher Correctness Require Exponential Length
ACM Transactions on Computation Theory (TOCT)
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Bell violations through independent bases games
Quantum Information & Computation
Communication lower bounds using directional derivatives
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Direct product via round-preserving compression
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
The Bonami-Beckner hypercontractive inequality is a powerful tool in Fourier analysis of real-valued functions on the Boolean cube. In this paper we present a version of this inequality for matrix-valued functions on the Boolean cube. Its proof is based on a powerful inequality by Ball, Carlen, and Lieb. We also present a number of applications. First, we analyze maps that encode n classical bits into m qubits, in such a way that each set of k bits can be recovered with some probability by an appropriate measurement on the quantum encoding; we show that if m