Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Second-Order Asymptotics for the Classical Capacity of Image-Additive Quantum Channels (1308.6503v3)

Published 29 Aug 2013 in quant-ph, cs.IT, math-ph, math.IT, and math.MP

Abstract: We study non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of classical information that can be transmitted when a quantum channel is used a finite number of times and a fixed, non-vanishing average error is permissible. We consider the classical capacity of quantum channels that are image-additive, including all classical to quantum channels, as well as the product state capacity of arbitrary quantum channels. In both cases we show that the non-asymptotic fundamental limit admits a second-order approximation that illustrates the speed at which the rate of optimal codes converges to the Holevo capacity as the blocklength tends to infinity. The behavior is governed by a new channel parameter, called channel dispersion, for which we provide a geometrical interpretation.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Marco Tomamichel (108 papers)
  2. Vincent Y. F. Tan (205 papers)
Citations (69)

Summary

We haven't generated a summary for this paper yet.