The Quantum Communication Complexity of the Pointer Chasing Problem: The Bit Version
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A property of quantum relative entropy with an application to privacy in quantum communication
Journal of the ACM (JACM)
A direct sum theorem in communication complexity via message compression
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A separation between divergence and Holevo information for ensembles
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A separation between divergence and holevo information for ensembles
Mathematical Structures in Computer Science
Communication complexity of remote state preparation with entanglement
Quantum Information & Computation
Quantum predictive learning and communication complexity with single input
Quantum Information & Computation
Privacy preserving continuous multimedia streaming in MANETs
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
| Hi-index | 0.00 |
We prove a fundamental theorem about the relative entropy of quantum states, which roughly states that if the relative entropy, S(\rho \left\| \sigma\right.) \triangleqTr \rho (\log \rho- \log \sigma ), of two quantum states \rho and \sigma is at most c, then \frac{\rho }{{2^0 (c)}} sits inside' \sigma. Using this substate' theorem, we give tight lower bounds for the privacy loss of bounded error quantum communication protocols for the index function problem. We also use the substate' theorem to give tight lower bounds for the k-round bounded error quantum communication complexity of the pointer chasing problem, when the wrong player starts, and all the log n bits of the kth pointer are desired.