Limits for compression of quantum information carried by ensembles of mixed states

Abstract

We consider the problem of compression of the quantum information carried by ensemble of mixed states. We prove that for arbitrary coding schemes the least number of qubits needed to convey the signal states asymptotically faithfully is bounded from below by the Holevo function $S(\varrho )-{\sum }_i{p}_{i}S({\varrho }_i)$. We also show that a compression protocol can be composed with another one, provided that the latter offers perfect transmission. Such a compound protocol is applied to the case of binary source. It is conjectured to reach the obtained bound. Finally, we point out that in the case of mixed signal states there could be a difference between the maximal compression rates at the coding schemes which are ``blind'' to the signal and the ones which assume the knowledge about the identities of the signal states.

RevTeX, 8 pages

Cited by in corpus (37)

• The Role of Relative Entropy in Quantum Information Theory
• A Survey on Quantum Channel Capacities
• Quantum Kolmogorov Complexity
• Distinguishability of States and von Neumann Entropy
• Coding Theorems of Quantum Information Theory
• A Generic Security Proof for Quantum Key Distribution
• On asymptotic continuity of functions of quantum states
• Second-order asymptotics for source coding, dense coding and pure-state entanglement conversions
• Exponents of quantum fixed-length pure state source coding
• Compression of sources of probability distributions and density operators
• On quantum coding for ensembles of mixed states
• Compressibility of Mixed-State Signals
• Efficient Quantum Compression for Ensembles of Identically Prepared Mixed States
• Towards a geometrical interpretation of quantum information compression
• Reduced State Uniquely Defines Groverian Measure of Original Pure State
• Optimal compression for mixed signal states
• Perspectives for a mixed two-qubit system with binomial quantum states
• Towards a unified approach to information-disturbance tradeoffs in quantum measurements
• General Mixed State Quantum Data Compression with and without Entanglement Assistance
• Elliptic Blowup Equations for 6d SCFTs. IV: Matters
• On the reversible extraction of classical information from a quantum source
• Optimal Visible Compression Rate For Mixed States Is Determined By Entanglement Of Purification
• Visible compression of commuting mixed states
• Quantum information is incompressible without errors
• Entanglement-Assisted Quantum Data Compression
• Quantum Data Compression of Ensembles of Mixed States with Commuting Density Operators
• Quantum Compression of Tensor Network States
• From Quantum Source Compression to Quantum Thermodynamics
• Numerical Analysis of Boosting Scheme for Scalable NMR Quantum Computation
• Rate Reduction of Blind Quantum Data Compression with Local Approximations Based on Unstable Structure of Quantum States
• A Rate-Distortion Perspective on Quantum State Redistribution
• Two-Server Oblivious Transfer for Quantum Messages
• Additive entanglemement measures cannot be more than asymptotically continuous
• Strongly non-quantitative classical information in quantum carriers
• Exact and local compression of quantum bipartite states
• Quantum Private Information Retrieval for Quantum Messages
• Thermodynamic Constraints on Information Transmission in Quantum Ensembles