An update on quantum cryptography
Proceedings of CRYPTO 84 on Advances in cryptology
Elements of information theory
Elements of information theory
SIAM Journal on Computing
Communication complexity
Quantum vs. classical communication and computation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Exponential separation of quantum and classical communication complexity
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On quantum and probabilistic communication: Las Vegas and one-way protocols
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Quantum computation and quantum information
Quantum computation and quantum information
Dense quantum coding and quantum finite automata
Journal of the ACM (JACM)
Communication Complexity Lower Bounds by Polynomials
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Lower Bounds for Quantum Communication Complexity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Lower bounds for quantum computation and communication
Lower bounds for quantum computation and communication
The Quantum Communication Complexity of Sampling
SIAM Journal on Computing
Exponential separation of quantum and classical one-way communication complexity
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Exponential lower bound for 2-query locally decodable codes via a quantum argument
Journal of Computer and System Sciences - Special issue: STOC 2003
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
IEEE Transactions on Information Theory
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
Unbounded-error one-way classical and quantum communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We revisit the problem of conveying classical messages by transmitting quantum states, and derive new, optimal bounds on the number of quantum bits required for this task. Much of the previous work on this problem, and on other communication tasks in the setting of bounded error entanglement-assisted communication, is based on sophisticated information theoretic arguments. Our results are derived from first principles, using a simple linear algebraic technique. A direct consequence is a tight lower bound for the Inner Product function that has found applications to privacy amplification in quantum key distribution protocols.