• DocumentCode
    1173283
  • Title

    Distilling common randomness from bipartite quantum states

  • Author

    Devetak, Igor ; Winter, Andreas

  • Author_Institution
    IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA
  • Volume
    50
  • Issue
    12
  • fYear
    2004
  • Firstpage
    3183
  • Lastpage
    3196
  • Abstract
    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*(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.
  • Keywords
    correlation theory; data compression; entropy; information theory; optimisation; quantum communication; quantum entanglement; quantum noise; Holevo mutual information; bipartite quantum states; classical side information; distillable common randomness; entanglement entropy; noisy quantum correlations; one-way classical communication; optimization problem; quantum compression; single-letter formula; Councils; Data mining; Entropy; Hilbert space; Mathematics; Mutual information; Performance evaluation; Quantum mechanics; Random variables; Tensile stress; 65; Additivity; common randomness; quantum theory; tradeoff;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2004.838115
  • Filename
    1362905