A New Proof of the Quantum Noiseless Coding Theorem
From MaRDI portal
Publication:4490518
DOI10.1080/09500349414552191zbMath0942.81534OpenAlexW2025187617MaRDI QIDQ4490518
Richard Jozsa, Benjamin W. Schumacher
Publication date: 16 July 2000
Published in: Journal of Modern Optics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09500349414552191
Related Items (40)
Efficient and exact quantum compression ⋮ A family of generalized quantum entropies: definition and properties ⋮ Lower bound for the quantum capacity of a discrete memoryless quantum channel ⋮ Trading quantum for classical resources in quantum data compression ⋮ Three-qubit protocol to purify generalized Werner states ⋮ Source coding with quantum side information at several decoders ⋮ Bounds for smooth min- and max-entropy ⋮ Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction ⋮ A simplification of entanglement purification ⋮ Entanglement thresholds for displaying the quantum nature of teleportation ⋮ Geometry of two-qubit states with negative conditional entropy ⋮ The apex of the family tree of protocols: optimal rates and resource inequalities ⋮ The rise and fall of redundancy in decoherence and quantum Darwinism ⋮ The Shannon-McMillan theorem for ergodic quantum lattice systems ⋮ Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem ⋮ W STATE GENERATION AND EFFECT OF CAVITY PHOTONS ON THE PURIFICATION OF DOT-LIKE SINGLE QUANTUM WELL EXCITONS ⋮ Precision of estimation and entropy as witnesses of non-markovianity in the presence of random classical noises ⋮ Stationary quantum source coding ⋮ A quantum version of Sanov's theorem ⋮ Improved entanglement-purification protocol using three Werner states and LOCC ⋮ AN OPERATIONAL ALGEBRAIC APPROACH TO QUANTUM CHANNEL CAPACITY ⋮ Quantum Kolmogorov complexity ⋮ Deterministic quantum state transformations ⋮ Counterexamples to the maximal \(p\)-norm multiplicativity conjecture for all \(p>1\) ⋮ Alexander S. Holevo's researches in quantum information theory in 20th century ⋮ Information and computation: Classical and quantum aspects ⋮ QUANTUM ENTROPY AND INFORMATION IN DISCRETE ENTANGLED STATES ⋮ Quantum sources and a quantum coding theorem ⋮ Primality Test Via Quantum Factorization ⋮ Communication Using Quantum States ⋮ Fidelity for Mixed Quantum States ⋮ Reduction of Quantum Entropy by Reversible Extraction of Classical Information ⋮ Information theory of quantum entanglement and measurement. ⋮ Characterization of quantum teleportation processes by nonlinear quantum channel and quantum mutual entropy ⋮ Negative Entropy and Information in Quantum Mechanics ⋮ Capacities of Quantum Erasure Channels ⋮ The data compression theorem for ergodic quantum information sources ⋮ General bounds for quantum discord and discord distance ⋮ Dynamic and compressed quantum many-body state secret sharing based on site-independent matrix product states ⋮ Transmission of classical information via quantum entanglement
Cites Work
This page was built for publication: A New Proof of the Quantum Noiseless Coding Theorem
