The quantum limitations on the maximum communication rate (capacity) possible through a single noiseless channel with signals of finite duration are investigated. They may be summarized in the characteristic information function defined here. In the absence of dispersion this description is a Lorentz-invariant one, and applies also in the presence of exterior gravitational fields. For long duration the characteristic information function corresponds to the standard quantum-channel-capacity formula of Gordon, of Lebedev and Levitin, and of Pendry. For finite signal duration it proves useful to distinguish between heralded and self-heralding signals, according to whether their arrival is anticipated or not. The two types have different characteristic functions. These are calculated here for occupation-number signal states in channels where the carrier quantum field may be represented by independent modes. The Gordon-Lebedev-Levitin-Pendry formula provides an upper bound to the exact results for both types of signals. The linear bound on communication rate of Bremermann and the present author bounds the capacity only for self-heralding signals. However, it is the better estimator of capacity for self-heralding signals with modest information content.
The quantum limitations on the maximum communication rate (capacity) possible through a single noiseless channel with signals of finite duration are investigated. They may be summarized in the characteristic information function defined here. In the absence of dispersion this description is a Lorentz-invariant one, and applies also in the presence of exterior gravitational fields. For long duration the characteristic information function corresponds to the standard quantum-channel-capacity formula of Gordon, of Lebedev and Levitin, and of Pendry. For finite signal duration it proves useful to distinguish between heralded and self-heralding signals, according to whether their arrival is anticipated or not. The two types have different characteristic functions. These are calculated here for occupation-number signal states in channels where the carrier quantum field may be represented by independent modes. The Gordon-Lebedev-Levitin-Pendry formula provides an upper bound to the exact results for both types of signals. The linear bound on communication rate of Bremermann and the present author bounds the capacity only for self-heralding signals. However, it is the better estimator of capacity for self-heralding signals with modest information content.
Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are described here. Quantum channel capacity theory is reviewed for both steady state and burst communication. An analytic approximation is given for the maximum signal information possible with occupation number signal states as a function of mean signal energy. A theorem guaranteeing that these states are optimal for communication is proved. A heuristic "proof" of the linear bound on communication is given, followed by rigorous proofs for signals with specified mean energy, and for signals with given energy budget. And systems of many parallel quantum channels are shown to obey the linear bound for a natural channel architecture. The time-energy uncertainty principle is reformulated in information language by means of the linear bound. The quantum bound on information storage capacity of quantum mechanical and quantum field devices is reviewed. A simplified version of the analytic proof for the bound is given for the latter case. Solitons as information caches are discussed, as is information storage in one-dimensional systems. The influence of signal self-gravitation on communication is considered. Finally, it is shown that acceleration of a receiver acts to block information transfer.
Information must take up space, must weigh, and its flux must be limited. Quantum limits on communication and information storage leading to these conclusions are described here. Quantum channel capacity theory is reviewed for both steady state and burst communication. An analytic approximation is given for the maximum signal information possible with occupation number signal states as a function of mean signal energy. A theorem guaranteeing that these states are optimal for communication is proved. A heuristic "proof" of the linear bound on communication is given, followed by rigorous proofs for signals with specified mean energy, and for signals with given energy budget. And systems of many parallel quantum channels are shown to obey the linear bound for a natural channel architecture. The time-energy uncertainty principle is reformulated in information language by means of the linear bound. The quantum bound on information storage capacity of quantum mechanical and quantum field devices is reviewed. A simplified version of the analytic proof for the bound is given for the latter case. Solitons as information caches are discussed, as is information storage in one-dimensional systems. The influence of signal self-gravitation on communication is considered. Finally, it is shown that acceleration of a receiver acts to block information transfer.
The capacity C of a communication channel is the maximum rate at which information can be transmitted without error from the channel's input to its output. The authors review quantum limits on the capacity that can be achieved with linear bosonic communication channels that have input power P. The limits arise ultimately from the Einstein relation that a field quantum at frequency f has energy E=hf. A single linear bosonic channel corresponds to a single transverse mode of the bosonic field---i.e., to a particular spatial dependence in the plane orthogonal to the propagation direction and to a particular spin state or polarization. For a single channel the maximum communication rate is ${C}_{\mathrm{WB}}=(\frac{\ensuremath{\pi}}{\mathrm{ln}2})\sqrt{\frac{2P}{3h}}$ bits/s. This maximum rate can be achieved by a "number-state channel," in which information is encoded in the number of quanta in the bosonic field and in which this information is recovered at the output by counting quanta. Derivations of the optimum capacity CWB are reviewed. Until quite recently all derivations assumed, explicitly or implicitly, a number-state channel. They thus left open the possibility that other techniques for encoding information on the bosonic field, together with other ways of detecting the field at the output, might lead to a greater communication rate. The authors present their own general derivation of the single-channel capacity upper bound, which applies to any physically realizable technique for encoding information on the bosonic field and to any physically realizable detection scheme at the output. They also review the capacities of coherent communication channels that encode information in coherent states and in quadrature-squeezed states. A three-dimensional bosonic channel can employ many transverse modes as parallel single channels. An upper bound on the information flux that can be transferred down parallel bosonic channels is derived.
In this paper, we give two independent and rigorous derivations for the quantum bound on the information transmission rate proposed independently by Bekenstein [Phys. Rev. Lett. 46, 623 (1981)] and Bremermann .ul2 [Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, edited by L. M. LeCam and J. Neyman (University of California Press, Berkeley, 1967], preceded by a heuristic argument showing why such a bound must hold. In both approaches, information carriers are quanta for some field. The first method resembles the microcanonical approach to statistical mechanics, where the strategy of overestimating the real number of states by relaxing the indistinguishability of quanta was adopted. The second is based entirely upon maximum-entropy methods. Amazingly enough, the results obtained by these physically unrelated premises turn out to be identical, namely, that the single (noiseless) channel capacity is I${\mathrm{\ifmmode \dot{}\else \.{}\fi{}}}_{\mathrm{max}}$=E/2\ensuremath{\pi}\ensuremath{\Elzxh} bits ${\mathrm{s}}^{\mathrm{\ensuremath{-}}1}$. It is further shown that, in a finite time \ensuremath{\tau}, no information can ever be conveyed unless the energy threshold 2\ensuremath{\pi}\ensuremath{\Elzxh}/\ensuremath{\tau} is reached, allowing the reinterpretation of the time-energy uncertainty in informational-theoretic language.
The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analog of the capacity-power function, and we generalize results in classical information theory for transmitting classical information through noisy channels. We show that the capacity-power function for a classical-quantum channel, for both unassisted and private protocol, is concave, and we also prove additivity for unentangled and uncorrelated ensembles of input signals for such channels. This implies that we do not need regularized formulas for calculation. We show that these properties also hold for all noiseless channels when we restrict the set of input states to be pure quantum states. For general channels, we geometrically prove that the capacity-power function is piecewise concave, with further support from numerical simulations. Further, we connect channel capacity to properties of random quantum states. In particular, we obtain analytical expressions for the capacity-power function for the case of noiseless channels using properties of random quantum states under an energy constraint and concentration phenomena in large Hilbert spaces.
The performance of communication through a quantum conductor is limited by the laws of physics. The optimum channel capacity, the maximum rate at which information can be transmitted under a given signal power, i.e., the heat current, connects the theory of communication, quantum physics, and thermodynamics. Here, the author calculates the distribution of fluctuations of self-information and finds a Jarzynski equality like universal relation connecting the fluctuations of information, the R\'enyi entropy of order zero, and the optimum capacity.