On Quantum Communication Channels with Constrained Inputs

Abstract

The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the supremum of the entropy bound with respect to all apriori distributions satisfying the constraint. We also make an extension to channels with continuous alphabet. As an application we prove the formula for the capacity of the quantum Gaussian channel with constrained energy of the signal, establishing the asymptotic equivalence of this channel to the semiclassical photon channel. We also study the lower bounds for the reliability function of the pure-state Gaussian channel.

17 pages, latex209

Cited by in corpus (8)

• Coding Theorem and Strong Converse for Quantum Channels
• Quantum channels and memory effects
• Tight uniform continuity bounds for quantum entropies: conditional entropy, relative entropy distance and energy constraints
• Coding Theorems for Quantum Channels
• Remarks on additivity of the Holevo channel capacity and of the entanglement of formation
• Capacity with energy constraint in coherent state channel
• On the additivity conjecture for channels with arbitrary constraints
• Analysis of the Entanglement Cost and Calculation of the Holevo Capacity