General Mixed State Quantum Data Compression with and without Entanglement Assistance
Zahra Baghali Khanian, Andreas Winter

TL;DR
This paper establishes the optimal quantum data compression rates for general mixed states with and without entanglement assistance, based on the Koashi-Imoto decomposition, unifying various source coding scenarios.
Contribution
It provides a comprehensive formula for the minimal qubit rate for compressing general quantum sources, including entanglement-assisted cases, using the Koashi-Imoto decomposition.
Findings
Optimal compression rate expressed via Koashi-Imoto decomposition.
Determination of the full feasible qubit-ebit rate region.
Unification of pure and mixed state quantum source coding.
Abstract
We consider the most general (finite-dimensional) quantum mechanical information source, which is given by a quantum system that is correlated with a reference system . The task is to compress in such a way as to reproduce the joint source state at the decoder with asymptotically high fidelity. This includes Schumacher's original quantum source coding problem of a pure state ensemble and that of a single pure entangled state, as well as general mixed state ensembles. Here, we determine the optimal compression rate (in qubits per source system) in terms of the Koashi-Imoto decomposition of the source into a classical, a quantum, and a redundant part. The same decomposition yields the optimal rate in the presence of unlimited entanglement between compressor and decoder, and indeed the full region of feasible qubit-ebit rate pairs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
