Applications of position-based coding to classical communication over quantum channels
arXiv:1704.01361 · doi:10.1088/1751-8121/aae290
Abstract
Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in the entanglement-assisted setting in order to establish lower bounds for error exponents, lower bounds on the second-order coding rate, and one-shot lower bounds. We also demonstrate that position-based coding can be a powerful tool for analyzing other communication settings. In particular, we reduce the quantum simultaneous decoding conjecture for entanglement-assisted or unassisted communication over a quantum multiple access channel to open questions in multiple quantum hypothesis testing. We then determine achievable rate regions for entanglement-assisted or unassisted classical communication over a quantum multiple-access channel, when using a particular quantum simultaneous decoder. The achievable rate regions given in this latter case are generally suboptimal, involving differences of Renyi-2 entropies and conditional quantum entropies.
arXiv commentv4: 44 pages, v4 includes a simpler proof for an upper bound on one-shot entanglement-assisted capacity, also found recently and independently in arXiv:1804.09644
References in corpus (50)
- On quantum Renyi entropies: a new generalization and some properties
- The Quantum Chernoff Bound
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
- From Classical to Quantum Shannon Theory
- Coding Theorem and Strong Converse for Quantum Channels
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- One-Shot Classical-Quantum Capacity and Hypothesis Testing
- A Fully Quantum Asymptotic Equipartition Property
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- The Chernoff lower bound for symmetric quantum hypothesis testing
- Error Exponent in Asymmetric Quantum Hypothesis Testing and Its Application to Classical-Quantum Channel coding
- The quantum capacity of channels with arbitrarily correlated noise
- Second-order asymptotics for quantum hypothesis testing
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
- Optimal sequence of quantum measurements in the sense of Stein's lemma in quantum hypothesis testing
- Quantum broadcast channels
- A Generalization of Quantum Stein's Lemma
- Finite blocklength converse bounds for quantum channels
- On entanglement-assisted classical capacity
- Entanglement sampling and applications
- The Capacity of the Quantum Multiple Access Channel
- Smooth Renyi Entropies and the Quantum Information Spectrum
- A father protocol for quantum broadcast channels
- Quantum Conditional Mutual Information, Reconstructed States, and State Redistribution
- A quantum version of Sanov's theorem
- Coding Theorem for a Class of Quantum Channels with Long-Term Memory
- Lower bounds on the Probability of Error for Classical and Classical-Quantum Channels
- Generalized relative entropies and the capacity of classical-quantum channels
- Quantum Hypothesis Testing and Non-Equilibrium Statistical Mechanics
- Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels
- On the Second-Order Asymptotics for Entanglement-Assisted Communication
- One-shot entanglement-assisted quantum and classical communication
- Universal coding for classical-quantum channel
- Reliability function of general classical-quantum channel
- Discriminating quantum states: the multiple Chernoff distance
- Position-based coding and convex splitting for private communication over quantum channels
- Achieving the Holevo bound via sequential measurements
- One-shot lossy quantum data compression
- Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
- Classical communication over a quantum interference channel
- General formulas for fixed-length quantum entanglement concentration
- Classical codes for quantum broadcast channels
- Coding theorems for compound problems via quantum Rényi divergences
- Hadamard quantum broadcast channels
- A one-shot achievability result for quantum state redistribution
- Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. - quantum lattice systems and more
- Second-order coding rates for pure-loss bosonic channels
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
Cited by in corpus (27)
- Practical route to entanglement-assisted communication over noisy bosonic channels
- Entanglement-Assisted Communication Surpassing the Ultimate Classical Capacity
- Resource theory of asymmetric distinguishability
- On Composite Quantum Hypothesis Testing
- On converse bounds for classical communication over quantum channels
- Entanglement-assisted capacity regions and protocol designs for quantum multiple-access channels
- Union bound for quantum information processing
- Infinite-fold enhancement in communications capacity using pre-shared entanglement
- On the near-optimality of one-shot classical communication over quantum channels
- One-shot quantum error correction of classical and quantum information
- Simple and Tighter Derivation of Achievability for Classical Communication over Quantum Channels
- Quantum-enabled communication without a phase reference
- Fidelity-Based Smooth Min-Relative Entropy: Properties and Applications
- One-shot Capacity bounds on the Simultaneous Transmission of Classical and Quantum Information
- A Quantum Multiparty Packing Lemma and the Relay Channel
- Transceiver designs to attain the entanglement assisted communications capacity
- Reliable Simulation of Quantum Channels: the Error Exponent
- Lower Bounds on Error Exponents via a New Quantum Decoder
- One-Shot Triple-Resource Trade-Off in Quantum Channel Coding
- Strong Converse Exponent for Entanglement-Assisted Communication
- Postselected communication over quantum channels
- Adversarial quantum channel discrimination
- Quantum channel coding: Approximation algorithms and strong converse exponents
- Towards the ultimate limits of quantum channel discrimination and quantum communication
- On distinguishability distillation and dilution exponents
- Classical capacities of memoryless but not identical quantum channels
- Information storage and transmission under Markovian noise