SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Short seed extractors against quantum storage
Proceedings of the forty-first annual ACM symposium on Theory of computing
New bounds on classical and quantum one-way communication complexity
Theoretical Computer Science
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
Quantum-resilient randomness extraction
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Short Seed Extractors against Quantum Storage
SIAM Journal on Computing
Better short-seed quantum-proof extractors
Theoretical Computer Science
Efficient device-independent quantum key distribution
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
The impossibility of non-signaling privacy amplification
Theoretical Computer Science
Hi-index | 754.84 |
We address the question whether quantum memory is more powerful than classical memory. In particular, we consider a setting where information about a random n-bit string X is stored in s classical or quantum bits, for s