A property of quantum relative entropy with an application to privacy in quantum communication

DOI10.1145/1568318.1568323zbMATH Open1325.81034arXiv0705.2437OpenAlexW2076807569WikidataQ130924877 ScholiaQ130924877MaRDI QIDQ3452229FDOQ3452229

Authors: Rahul Jain, Pranab Sen, Jaikumar Radhakrishnan 

Publication date: 11 November 2015

Published in: Journal of the ACM (Search for Journal in Brave)

Abstract: We prove the following theorem about relative entropy of quantum states. "Substate theorem: Let rho and sigma be quantum states in the same Hilbert space with relative entropy S(rho|sigma) = Tr rho (log rho - log sigma) = c. Then for all epsilon > 0, there is a state rho' such that the trace distance ||rho' - rho||_t = Tr sqrt{(rho' - rho)^2} <= epsilon, and rho'/2^{O(c/epsilon^2)} <= sigma." It states that if the relative entropy of rho and sigma is small, then there is a state rho' close to rho, i.e. with small trace distance ||rho' - rho||_t, that when scaled down by a factor 2^{O(c)} `sits inside', or becomes a `substate' of, sigma. This result has several applications in quantum communication complexity and cryptography. Using the substate theorem, we derive a privacy trade-off for the set membership problem in the two-party quantum communication model. Here Alice is given a subset A of [n], Bob an input i in [n], and they need to determine if i in A. "Privacy trade-off for set membership: In any two-party quantum communication protocol for the set membership problem, if Bob reveals only k bits of information about his input, then Alice must reveal at least n/2^{O(k)} bits of information about her input." We also discuss relationships between various information theoretic quantities that arise naturally in the context of the substate theorem.

Full work available at URL: https://arxiv.org/abs/0705.2437

Recommendations

• scientific article; zbMATH DE number 2086397
• Quantum and approximate privacy
• All inequalities for the relative entropy
• Quantum private information retrieval with sublinear communication complexity
• Properties of subentropy

zbMATH Keywords

quantum information theoryprivacyquantum communication complexity

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Cited In (10)

• A minimax approach to one-shot entropy inequalities
• A separation between divergence and Holevo information for ensembles
• Interactive Information Complexity
• Resource requirements of private quantum channels and consequences for oblivious remote state preparation
• Everywhere-Tight Information Cost Tradeoffs for Augmented Index
• Quantum private information retrieval has linear communication complexity
• Interactive Information Complexity
• Exponential decay of correlations implies area law
• An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs
• Information theories with adversaries, intrinsic information, and entanglement

This page was built for publication: A property of quantum relative entropy with an application to privacy in quantum communication

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452229)