Kolmogorov Complexity and Combinatorial Methods in Communication Complexity
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
BQP and the polynomial hierarchy
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
Two-source extractors secure against quantum adversaries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Kolmogorov complexity and combinatorial methods in communication complexity
Theoretical Computer Science
Quantum one-way communication can be exponentially stronger than classical communication
Proceedings of the forty-third annual ACM symposium on Theory of computing
Better short-seed quantum-proof extractors
Theoretical Computer Science
The streaming complexity of cycle counting, sorting by reversals, and other problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Exact Quantum Algorithms for the Leader Election Problem
ACM Transactions on Computation Theory (TOCT)
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
A new exponential separation between quantum and classical one-way communication complexity
Quantum Information & Computation
Classical and quantum partition bound and detector inefficiency
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |
We give an exponential separation between one-way quantum and classical communication protocols for a partial Boolean function (a variant of the Boolean hidden matching problem of Bar-Yossef et al.). Previously, such an exponential separation was known only for a relational problem. The communication problem corresponds to a strong extractor that fails against a small amount of quantum information about its random source. Our proof uses the Fourier coefficients inequality of Kahn, Kalai, and Linial. We also give a number of applications of this separation. In particular, we show that there are privacy amplification schemes that are secure against classical adversaries but not against quantum adversaries; and we give the first example of a key-expansion scheme in the model of bounded-storage cryptography that is secure against classical memory-bounded adversaries but not against quantum ones.