Trading quantum for classical resources in quantum data compression

DOI10.1063/1.1497184zbMath1060.94009arXivquant-ph/0204038OpenAlexW3100626429WikidataQ57522555 ScholiaQ57522555MaRDI QIDQ4832733

Richard Jozsa, Patrick Hayden, Andreas Winter

Publication date: 14 December 2004

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0204038

Mathematics Subject Classification ID

Quantum computation (81P68) Source coding (94A29)

Related Items (4)

A theoretical framework for quantum image representation and data loading scheme ⋮ Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction ⋮ The capacity of a quantum channel for simultaneous transmission of classical and quantum information ⋮ A dynamical systems proof of Kraft–McMillan inequality and its converse for prefix-free codes

Cites Work

• A continuity property of the entropy density for spin lattice systems
• A simple proof of the unconditional security of quantum key distribution
• Unconditional security in quantum cryptography
• Rapid solution of problems by quantum computation
• Elimination of correlation in random codes for arbitrarily varying channels
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On the Power of Quantum Computation
• The capacity of the quantum channel with general signal states
• A New Proof of the Quantum Noiseless Coding Theorem
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• On the reversible extraction of classical information from a quantum source
• The capacity of hybrid quantum memory
• A single quantum cannot be cloned
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Trading quantum for classical resources in quantum data compression