Trading quantum for classical resources in quantum data compression
From MaRDI portal
Abstract: We study the visible compression of a source E of pure quantum signal states, or, more formally, the minimal resources per signal required to represent arbitrarily long strings of signals with arbitrarily high fidelity, when the compressor is given the identity of the input state sequence as classical information. According to the quantum source coding theorem, the optimal quantum rate is the von Neumann entropy S(E) qubits per signal. We develop a refinement of this theorem in order to analyze the situation in which the states are coded into classical and quantum bits that are quantified separately. This leads to a trade--off curve Q(R), where Q(R) qubits per signal is the optimal quantum rate for a given classical rate of R bits per signal. Our main result is an explicit characterization of this trade--off function by a simple formula in terms of only single signal, perfect fidelity encodings of the source. We give a thorough discussion of many further mathematical properties of our formula, including an analysis of its behavior for group covariant sources and a generalization to sources with continuously parameterized states. We also show that our result leads to a number of corollaries characterizing the trade--off between information gain and state disturbance for quantum sources. In addition, we indicate how our techniques also provide a solution to the so--called remote state preparation problem. Finally, we develop a probability--free version of our main result which may be interpreted as an answer to the question: ``How many classical bits does a qubit cost? This theorem provides a type of dual to Holevo's theorem, insofar as the latter characterizes the cost of coding classical bits into qubits.
Recommendations
- On the reversible extraction of classical information from a quantum source
- Compressing quantum mixed-state sources by sending classical information
- On Lossless Quantum Data Compression With a Classical Helper
- Quantum-to-classical rate distortion coding
- Quantum rate-distortion theory for memoryless sources
Cites work
- A continuity property of the entropy density for spin lattice systems
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A New Proof of the Quantum Noiseless Coding Theorem
- A simple proof of the unconditional security of quantum key distribution
- A single quantum cannot be cloned
- Elimination of correlation in random codes for arbitrarily varying channels
- On the Power of Quantum Computation
- On the reversible extraction of classical information from a quantum source
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Rapid solution of problems by quantum computation
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- The capacity of hybrid quantum memory
- The capacity of the quantum channel with general signal states
- Unconditional security in quantum cryptography
Cited in
(17)- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- On quantum coding for ensembles of mixed states
- Simple construction of quantum universal variable-length source coding
- On Lossless Quantum Data Compression With a Classical Helper
- On the Distributed Compression of Quantum Information
- On the reversible extraction of classical information from a quantum source
- Quantum rate-distortion theory for memoryless sources
- Compressing quantum mixed-state sources by sending classical information
- The information-theoretic costs of simulating quantum measurements
- Encoding Classical Information Into Quantum Resources
- A compressed classical description of quantum states
- Optimal trading of classical communication, quantum communication, and entanglement
- A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes
- Lower bound on expected communication cost of quantum Huffman coding
- Quantum-to-classical rate distortion coding
- Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
- A theoretical framework for quantum image representation and data loading scheme
This page was built for publication: Trading quantum for classical resources in quantum data compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4832733)
