Quantum Coding with Finite Resources
arXiv:1504.04617 · doi:10.1038/ncomms11419
Abstract
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over asymptotically many uses of the channel. We argue that this asymptotic treatment is insufficient to the point of being irrelevant in the quantum setting where decoherence severely limits our ability to manipulate large quantum systems in the encoder and decoder. For all practical purposes we should instead focus on the trade-off between three parameters: the rate of the code, the number of coherent uses of the channel, and the fidelity of the transmission. The aim is then to specify the region determined by allowed combinations of these parameters. Towards this goal, we find approximate and exact characterizations of the region of allowed triplets for the qubit dephasing channel and for the erasure channel with classical post-processing assistance. In each case the region is parametrized by a second channel parameter, the quantum channel dispersion. In the process we also develop several general inner (achievable) and outer (converse) bounds on the coding region that are valid for all finite-dimensional quantum channels and can be computed efficiently. Applied to the depolarizing channel, this allows us to determine a lower bound on the number of coherent uses of the channel necessary to witness super-additivity of the coherent information.
arXiv commentv2: 24 pages, 6 figures, new author, new title, merged with arXiv:1504.05376v1
References in corpus (34)
- Mixed State Entanglement and Quantum Error Correction
- Distillation of secret key and entanglement from quantum states
- The capacity of the noisy quantum channel
- Quantum data processing and error correction
- Information transmission through a noisy quantum channel
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Quantum Communication With Zero-Capacity Channels
- Quantum Information Processing with Finite Resources -- Mathematical Foundations
- An improved bound on distillable entanglement
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- Quantum Channel Capacity of Very Noisy Channels
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- All Teleportation and Dense Coding Schemes
- Duality Between Smooth Min- and Max-Entropies
- On Quantum Fidelities and Channel Capacities
- The quantum capacity of channels with arbitrarily correlated noise
- A decoupling approach to the quantum capacity
- Second-order asymptotics for quantum hypothesis testing
- One-shot decoupling
- Finite blocklength converse bounds for quantum channels
- Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
- Unbounded number of channel uses are required to see quantum capacity
- The decoupling approach to quantum information theory
- The quantum capacity with symmetric side channels
- Asymptotic Relative Entropy of Entanglement for Orthogonally Invariant States
- On the power of PPT-preserving and non-signalling codes
- Single-shot Quantum State Merging
- The apex of the family tree of protocols: Optimal rates and resource inequalities
- Binding entanglement channels
- Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
- A linear program for the finite block length converse of Polyanskiy-Poor-Verdú via non-signalling codes
- Additive Extensions of a Quantum Channel
- "Pretty strong" converse for the quantum capacity of degradable channels
- Decoding quantum information via the Petz recovery map
Cited by in corpus (50)
- Converse bounds for private communication over quantum channels
- Optimizing practical entanglement distillation
- Quantifying the magic of quantum channels
- Efficiently computable bounds for magic state distillation
- Gaussian hypothesis testing and quantum illumination
- Principles of Quantum Communication Theory: A Modern Approach
- Semidefinite programming strong converse bounds for classical capacity
- Strong converse rates for quantum communication
- Quantum coding with low-depth random circuits
- Semidefinite programming relaxations for quantum correlations
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- Energy-constrained private and quantum capacities of quantum channels
- Non-asymptotic entanglement distillation
- Beyond the thermodynamic limit: finite-size corrections to state interconversion rates
- Position-based coding and convex splitting for private communication over quantum channels
- No-go theorems for quantum resource purification II: new approach and channel theory
- Semidefinite programming converse bounds for quantum communication
- Tuning quantum channels to maximize polarization entanglement for telecom photon pairs
- Moderate deviation analysis for classical communication over quantum channels
- Finite-key security analysis for multilevel quantum key distribution
- Extendibility limits the performance of quantum processors
- Upper bounds on secret key agreement over lossy thermal bosonic channels
- One-Shot Manipulation of Dynamical Quantum Resources
- Decoding quantum information via the Petz recovery map
- On converse bounds for classical communication over quantum channels
- Entanglement-assisted private communication over quantum broadcast channels
- Semidefinite programming hierarchies for constrained bilinear optimization
- Capacity estimation and verification of quantum channels with arbitrarily correlated errors
- Resource theory of unextendibility and non-asymptotic quantum capacity
- Union bound for quantum information processing
- The variance of relative surprisal as single-shot quantifier
- Second-order coding rates for key distillation in quantum key distribution
- Beating the Classical Limits of Information Transmission using a Quantum Decoder
- Relative entropy of steering: On its definition and properties
- Finite Block Length Analysis on Quantum Coherence Distillation and Incoherent Randomness Extraction
- An invitation to the sample complexity of quantum hypothesis testing
- Trade-offs on number and phase shift resilience in bosonic quantum codes
- One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- Reliable Quantum Memories with Unreliable Components
- Characterizing scalable measures of quantum resources
- Optimal one-shot entanglement sharing
- Image Compression and Reconstruction Based on Quantum Network
- Second Law of Entanglement Dynamics for the Non-Asymptotic Regime
- Attainability of quantum state discrimination bounds with collective measurements on finite copies
- Detecting Quantum Capacities of Continuous-Variable Quantum Channels
- Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
- Quantum dimension test using the uncertainty principle
- A Minimax Converse for Quantum Channel Coding
- Simplest non-additive measures of quantum resources
- Enlarging the notion of additivity of resource quantifiers