Second-order coding rates for pure-loss bosonic channels

DOI10.1007/S11128-015-0997-XzbMATH Open1338.81119DBLPjournals/qip/WildeRG16arXiv1408.5328OpenAlexW3102175845WikidataQ59453538 ScholiaQ59453538MaRDI QIDQ291579FDOQ291579

Authors: Mark M. Wilde, J. M. Renes, Saikat Guha 

Publication date: 10 June 2016

Published in: Quantum Information Processing (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1408.5328

Recommendations

• Strong converse for the classical capacity of the pure-loss bosonic channel
• Classical capacities of bosonic channels
• Quantum coding theorems
• On the reliability function for a quantum communication channel.
• On the second-order asymptotics for entanglement-assisted communication

zbMATH Keywords

optical communicationpure-loss bosonic channelsecond-order coding ratesspectral entropy

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• A Mathematical Theory of Communication
• Title not available (Why is that?)
• The capacity of the quantum channel with general signal states
• Quantum information theory
• Second-order asymptotics for quantum hypothesis testing
• On the reliability function for a quantum communication channel.
• A solution of Gaussian optimizer conjecture for quantum channels
• Strong converse for the classical capacity of the pure-loss bosonic channel
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• Asymptotic Estimates in Information Theory with Non-Vanishing Error Probabilities
• The Third-Order Term in the Normal Approximation for the AWGN Channel
• Strong Converse for the Classical Capacity of Optical Quantum Communication Channels
• Refinement of the upper bounds of the constants in Lyapunov's theorem
• On the second-order asymptotics for entanglement-assisted communication
• Title not available (Why is that?)
• General formulas for capacity of classical-quantum channels
• Second-Order Asymptotics in Fixed-Length Source Coding and Intrinsic Randomness
• Optimal multiple quantum statistical hypothesis testing
• Ultimate information carrying limit of quantum systems
• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Corrections to “Second-Order Asymptotics for Source Coding, Dense Coding, and Pure-State Entanglement Conversions”
• Channel Coding Rate in the Finite Blocklength Regime
• Title not available (Why is that?)
• A Hierarchy of Information Quantities for Finite Block Length Analysis of Quantum Tasks

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)