Second-order coding rates for pure-loss bosonic channels
From MaRDI portal
(Redirected from Publication:291579)
Abstract: A pure-loss bosonic channel is a simple model for communication over free-space or fiber-optic links. More generally, phase-insensitive bosonic channels model other kinds of noise, such as thermalizing or amplifying processes. Recent work has established the classical capacity of all of these channels, and furthermore, it is now known that a strong converse theorem holds for the classical capacity of these channels under a particular photon number constraint. The goal of the present paper is to initiate the study of second-order coding rates for these channels, by beginning with the simplest one, the pure-loss bosonic channel. In a second-order analysis of communication, one fixes the tolerable error probability and seeks to understand the back-off from capacity for a sufficiently large yet finite number of channel uses. We find a lower bound on the maximum achievable code size for the pure-loss bosonic channel, in terms of the known expression for its capacity and a quantity called channel dispersion. We accomplish this by proving a general "one-shot" coding theorem for channels with classical inputs and pure-state quantum outputs which reside in a separable Hilbert space. The theorem leads to an optimal second-order characterization when the channel output is finite-dimensional, and it remains an open question to determine whether the characterization is optimal for the pure-loss bosonic channel.
Recommendations
Cites work
- scientific article; zbMATH DE number 5320291 (Why is no real title available?)
- scientific article; zbMATH DE number 3213251 (Why is no real title available?)
- scientific article; zbMATH DE number 3349081 (Why is no real title available?)
- A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks
- A Mathematical Theory of Communication
- A solution of Gaussian optimizer conjecture for quantum channels
- Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
- Channel Coding Rate in the Finite Blocklength Regime
- Corrections to “Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions”
- General formulas for capacity of classical-quantum channels
- Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
- On the reliability function for a quantum communication channel.
- On the second-order asymptotics for entanglement-assisted communication
- Optimal multiple quantum statistical hypothesis testing
- Quantum information theory
- Refinement of the upper bounds of the constants in Lyapunov's theorem
- Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
- Second-order asymptotics for quantum hypothesis testing
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Strong Converse for the Classical Capacity of Optical Quantum Communication Channels
- Strong converse for the classical capacity of the pure-loss bosonic channel
- The Third-Order Term in the Normal Approximation for the AWGN Channel
- The capacity of the quantum channel with general signal states
- Ultimate information carrying limit of quantum systems
Cited in
(7)- Classical capacities of bosonic channels
- Quantum information theory in infinite dimensions with application to optical channels
- Union bound for quantum information processing
- Applications of position-based coding to classical communication over quantum channels
- Second-order asymptotics for quantum hypothesis testing in settings beyond i.i.d. -- quantum lattice systems and more
- Classical capacities of memoryless but not identical quantum channels
- Strong converse for the classical capacity of the pure-loss bosonic channel
This page was built for publication: Second-order coding rates for pure-loss bosonic channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291579)
