2003/04/30 by I. Devetak, Igor Devetak, Andreas Winter +1 · 3 citations
Computer Science · Mathematics · Physics and Astronomy · #Classical capacity #Discrete mathematics #LOCC #Mathematics #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum channel #Quantum discord #Quantum entanglement #Quantum information #Quantum mechanics #Quantum state #Randomness #Separable state #Statistical physics #Statistics #quant-ph
paper · pdf · doi:10.1109/tit.2004.838115
published as IEEE Trans. Inf. Theory 50(12):3183-3196, 2004 · 22 pages, LaTeX
arxiv created 2004/04/13 · openalex publication_date 2004/11/30 · arxiv updated 2017/08/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
The problem of converting noisy quantum correlations between two parties into noiseless classical ones using a limited amount of one-way classical communication is addressed. A single-letter formula for the optimal tradeoff between the extracted common randomness and classical communication rate is obtained for the special case of classical-quantum correlations. The resulting curve is intimately related to the quantum compression with classical side information tradeoff curve Q/sup */(R) of Hayden, Jozsa, and Winter. For a general initial state, we obtain a similar result, with a single-letter formula, when we impose a tensor product restriction on the measurements performed by the sender; without this restriction, the tradeoff is given by the regularization of this function. Of particular interest is a quantity we call "distillable common randomness" of a state: the maximum overhead of the common randomness over the one-way classical communication if the latter is unbounded. It is an operational measure of (total) correlation in a quantum state. For classical-quantum correlations it is given by the Holevo mutual information of its associated ensemble; for pure states it is the entropy of entanglement. In general, it is given by an optimization problem over measurements and regularization; for the case of separable states we show that this can be single-letterized.