Applications of position-based coding to classical communication over quantum channels
From MaRDI portal
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.
Recommendations
- Position-based coding and convex splitting for private communication over quantum channels
- Classical Codes for Quantum Broadcast Channels
- scientific article; zbMATH DE number 5320294
- Universal coding for classical-quantum channel
- A Decoupling Approach to Classical Data Transmission Over Quantum Channels
- A coding problem via quantum channels
- A note on random coding bounds for classical-quantum channels
- Polar Codes for Classical-Quantum Channels
- Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
- Quantum-to-classical rate distortion coding
Cites work
- A Father Protocol for Quantum Broadcast Channels
- A Fully Quantum Asymptotic Equipartition Property
- A generalization of quantum Stein's lemma
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A One-Shot Achievability Result for Quantum State Redistribution
- A quantum version of Sanov's theorem
- An Information-Spectrum Approach to Classical and Quantum Hypothesis Testing for Simple Hypotheses
- Channel Coding Rate in the Finite Blocklength Regime
- Classical Capacities of Compound and Averaged Quantum Channels
- Classical Codes for Quantum Broadcast Channels
- Classical Communication Over a Quantum Interference Channel
- Coding theorem and strong converse for quantum channels
- Coding Theorems for Compound Problems via Quantum Rényi Divergences
- Conditional expectation in an operator algebra. IV. Entropy and information
- Discriminating quantum states: the multiple Chernoff distance
- Entanglement Sampling and Applications
- Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
- Entanglement-Assisted Capacity of Quantum Multiple-Access Channels
- Finite Blocklength Converse Bounds for Quantum Channels
- General formulas for capacity of classical-quantum channels
- General formulas for fixed-length quantum entanglement concentration
- Generalized relative entropies and the capacity of classical-quantum channels
- Hadamard quantum broadcast channels
- scientific article; zbMATH DE number 1821199 (Why is no real title available?)
- scientific article; zbMATH DE number 3418522 (Why is no real title available?)
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- Lower Bounds on the Probability of Error for Classical and Classical-Quantum Channels
- Making Good Codes for Classical-Quantum Channel Coding via Quantum Hypothesis Testing
- On channel capacity per unit cost
- On entanglement-assisted classical capacity
- On quantum Rényi entropies: a new generalization and some properties
- On the reliability function for a quantum communication channel.
- On the second-order asymptotics for entanglement-assisted communication
- One-Shot Entanglement-Assisted Quantum and Classical Communication
- One-Shot Lossy Quantum Data Compression
- One-Shot Marton Inner Bound for Classical-Quantum Broadcast Channel
- Optimal sequence of quantum measurements in the sense of Stein s lemma in quantum hypothesis testing
- Position-based coding and convex splitting for private communication over quantum channels
- Quantum Broadcast Channels
- Quantum detection and estimation theory
- Quantum hypothesis testing and non-equilibrium statistical mechanics
- Quantum information theory
- Quantum systems, channels, information. A mathematical introduction.
- Quasi-entropies for finite quantum systems
- Reliability function of general classical-quantum channel
- Second-order asymptotics for quantum hypothesis testing
- Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. -- quantum lattice systems and more
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Second-order coding rates for pure-loss bosonic channels
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- Smooth Entropies and the Quantum Information Spectrum
- Strong converse and Stein's lemma in quantum hypothesis testing
- Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication
- Strong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Rényi relative entropy
- The transition probability in the state space of a \(^*\)-algebra
- The capacity of the quantum channel with general signal states
- The capacity of the quantum multiple-access channel
- The Chernoff lower bound for symmetric quantum hypothesis testing
- The coding theorem for a class of quantum channels with long-term memory
- The proper formula for relative entropy and its asymptotics in quantum probability
- The Quantum Capacity of Channels With Arbitrarily Correlated Noise
- Universal coding for classical-quantum channel
- Upper bounds on the error probabilities and asymptotic error exponents in quantum multiple state discrimination
Cited in
(12)- Position-based coding and convex splitting for private communication over quantum channels
- Sequential, successive, and simultaneous decoders for entanglement-assisted classical communication
- On composite quantum hypothesis testing
- On distinguishability distillation and dilution exponents
- Properties of noncommutative Rényi and Augustin information
- On the near-optimality of one-shot classical communication over quantum channels
- Shannon’s information theory 70 years on: applications in classical and quantum physics
- Classical capacities of memoryless but not identical quantum channels
- Union bound for quantum information processing
- State transfer on the multi-access channel network
- Postselected communication over quantum channels
- Generalized quantum asymptotic equipartition
This page was built for publication: Applications of position-based coding to classical communication over quantum channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120037)
