The coding of quantum communication channels in real time is considered as applied to the situation when information is coded into continuous quantum degrees of freedom (into the shape of the amplitude of quantum states with an arbitrary number of photons). It is shown that the nonlocalizability of states in quantum field theory requires that the identity of particles should be taken into account. This, together with the finiteness of the limit speed of propagation, leads to the fact that the formulas for the transmission rate of nonrelativistic communication channels have an asymptotic character; i.e., these formulas are formally valid only when the separation between messages is infinite (when the identity of particles can be neglected) and, hence, when the transmission rate in [bit/message s] is infinitely small. A real-time information capacity of a sequential relativistic quantum communication channel is obtained that takes into account the identity of particles for pure signal states with an arbitrary number of photons. An explicit analytic expression is obtained for the transmission rate of a quantum channel of finite bandwidth for one-photon input states.
The coding of quantum communication channels in real time is considered as applied to the situation when information is coded into continuous quantum degrees of freedom (into the shape of the amplitude of quantum states with an arbitrary number of photons). It is shown that the nonlocalizability of states in quantum field theory requires that the identity of particles should be taken into account. This, together with the finiteness of the limit speed of propagation, leads to the fact that the formulas for the transmission rate of nonrelativistic communication channels have an asymptotic character; i.e., these formulas are formally valid only when the separation between messages is infinite (when the identity of particles can be neglected) and, hence, when the transmission rate in [bit/message s] is infinitely small. A real-time information capacity of a sequential relativistic quantum communication channel is obtained that takes into account the identity of particles for pure signal states with an arbitrary number of photons. An explicit analytic expression is obtained for the transmission rate of a quantum channel of finite bandwidth for one-photon input states.
It is shown that the identity of particles must inevitably be taken into account, because states in quantum field theory are nonlocalizable. This circumstance, together with finite limiting velocity, is responsible for the asymptotic character of formulas for the transmission capability of nonrelativistic communication channels (they are formally valid only for infinite time delay between messages, when the identity of particles is negligible, and, correspondingly, for infinitely slow transmission in time—bits per second per message). The transmission capability of a sequential relativistic quantum communication channel is obtained in real time with allowance for the identity of particles.
Standard communication systems have transmission spectra that characterize their ability to perform frequency multiplexing over a finite bandwidth. Realistic quantum signals in quantum communication systems like transducers are inherently limited in time due to intrinsic decoherence and finite latency, which hinders the direct implementation of frequency-multiplexed encoding. We investigate quantum channel capacities for bandwidth-and-time-limited (BTL) channels to establish the optimal communication strategy in a realistic setting. For pure-loss bosonic channels, we derive analytical solutions of the optimal encoding and decoding modes for Lorentzian and box transmission spectra, along with numerical solutions for various other transmissions. Our findings reveal a general feature of sequential activation of quantum channels as the input signal duration increases, as well as the existence of optimal signal length for scenarios where only a limited number of channels are in use.
Quantum theory is, in some sense, “non-classical.” For instance, the behavior of entangled systems (i.e., shared quantum information) under measurements cannot, in general, be explained by shared classical information. With classical communication, on the other hand, both the correlations entanglement leads to as well as quantum channels can be reproduced in principle. Here, crucial questions are whether the required communications is finite; if so, then its exact amount is related to the “degree of non-classicality” of the quantum primitive. We apply information-theoretic results such as the reverse Shannon theorem for determining the required communication in the asymptotic limit. The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum state. At present, only little is known about this quantity. Our generic procedure allows for systematically evaluating the communication complexity of channels in any general probabilistic theory, in particular quantum theory. The procedure is constructive and provides the most efficient classical protocols. We illustrate it by evaluating the communication complexity of sending single qubits over a noiseless quantum channel with some finite sets of quantum states and measurements. As a second application, we determine the classical-communication rate required for the simulation of the behavior under measurements of entangled states. Here, the communication cost can be directly interpreted as the “non-classicality” of the correlation. A particular example is the simulation of non-maximally entangled pure qubit pairs, where we find the required communication rate to behave monotonically with the strength of the entanglement. For different measures of non-locality, such as the number of required non-local (PR) boxes, another behavior had been reported for the single-shot scenario.
We study the non-asymptotic fundamental limits for transmitting classical information over memoryless quantum channels, i.e. we investigate the amount of information that can be transmitted when the channel is used a finite number of times and a finite average decoding error is permissible. We show that, if we restrict the encoder to use ensembles of separable states, the non-asymptotic fundamental limit admits a Gaussian approximation that illustrates the speed at which the rate of optimal codes converges to the Holevo capacity as the number of channel uses tends to infinity. To do so, several important properties of quantum information quantities, such as the capacity-achieving output state, the divergence radius, and the channel dispersion, are generalized from their classical counterparts. Further, we exploit a close relation between classical-quantum channel coding and quantum binary hypothesis testing and rely on recent progress in the non-asymptotic characterization of quantum hypothesis testing and its Gaussian approximation.