Interactive Leakage Chain Rule for Quantum Min-entropy
arXiv:1809.10694
Abstract
The leakage chain rule for quantum min-entropy quantifies the change of min-entropy when one party gets additional leakage about the information source. Herein we provide an interactive version that quantifies the change of min-entropy between two parties, who share an initial classical-quantum state and are allowed to run a two-party protocol. As an application, we prove new versions of lower bounds on the complexity of quantum communication of classical information.
arXiv commentA few terminology mistakes were corrected in this version
References in corpus (8)
- The operational meaning of min- and max-entropy
- Insecurity of Quantum Secure Computations
- Optimal lower bounds for quantum automata and random access codes
- Quantum Entanglement and the Communication Complexity of the Inner Product Function
- Quantum Private Information Retrieval has linear communication complexity
- Quantum entropic security and approximate quantum encryption
- Computational Notions of Quantum Min-Entropy
- Further Limitations on Information-Theoretically Secure Quantum Homomorphic Encryption