No Arabic abstract
The rates at which classical and quantum information can be simultaneously transmitted from two spatially separated senders to a single receiver over an arbitrary quantum channel are characterized. Two main results are proved in detail. The first describes the region of rates at which one sender can send classical information while the other sends quantum information. The second describes those rates at which both senders can send quantum information. For each of these situations, an example of a channel is given for which the associated region admits a single-letter description. This is the authors Ph.D. dissertation, submitted to the Department of Electrical Engineering at Stanford University in March, 2005. It represents an expanded version of the paper quant-ph/0501045, containing a number of tutorial chapters which may be of independent interest for those learning about quantum Shannon theory.
Transmission and storage of quantum information are the fundamental building blocks for large-scale quantum communication networks. Reliable certification of quantum communication channels and quantum memories requires the estimation of their capacities to transmit and store quantum information. This problem is challenging for continuous variable systems, such as the radiation field, for which a complete characterization of processes via quantum tomography is practically unfeasible. Here we develop protocols for detecting lower bounds to the quantum capacity of continuous variable communication channels and memories. Our protocols work in the general scenario where the devices are used a finite number of times, can exhibit correlations across multiple uses, and can be under the control of an adversary. Our protocols are experimentally friendly and can be implemented using Gaussian input states (single-mode squeezed or coherent) and Gaussian quantum measurements (homodyne or heterodyne). These schemes can be used to certify the transmission and storage of continuous variable quantum information, and to detect communication paths in quantum networks.
We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some possible applications of our result. We also show that our scheme allows a reasonable distribution of channel capacity over two senders.
We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region characterizes the rates at which it is possible for one sender to send classical information while the other sends quantum information. The second region gives the rates at which each sender can send quantum information. We give an example of a channel for which each region has a single-letter description, concluding with a characterization of the rates at which each user can simultaneously send classical and quantum information.
The positivity and nonadditivity of the one-letter quantum capacity (maximum coherent information) $Q^{(1)}$ is studied for two simple examples of complementary quantum channel pairs $(B,C)$. They are produced by a process, we call it gluing, for combining two or more channels to form a composite. (We discuss various other forms of gluing, some of which may be of interest for applications outside those considered in this paper.) An amplitude-damping qubit channel with damping probability $0leq p leq 1$ glued to a perfect channel is an example of what we call a generalized erasure channel characterized by an erasure probability $lambda$ along with $p$. A second example, using a phase-damping rather than amplitude-damping qubit channel, results in the dephrasure channel of Ledtizky et al. [Phys. Rev. Lett. 121, 160501 (2018)]. In both cases we find the global maximum and minimum of the entropy bias or coherent information, which determine $Q^{(1)}(B_g)$ and $Q^{(1)}(C_g)$, respectively, and the ranges in the $(p,lambda)$ parameter space where these capacities are positive or zero, confirming previous results for the dephrasure channel. The nonadditivity of $Q^{(1)}(B_g)$ for two channels in parallel occurs in a well defined region of the $(p,lambda)$ plane for the amplitude-damping case, whereas for the dephrasure case we extend previous results to additional values of $p$ and $lambda$ at which nonadditivity occurs. For both cases, $Q^{(1)}(C_g)$ shows a peculiar behavior: When $p=0$, $C_g$ is an erasure channel with erasure probability $1-lambda$, so $Q^{(1)}(C_g)$ is zero for $lambda leq 1/2$. However, for any $p>0$, no matter how small, $Q^{(1)}(C_g)$ is positive, though it may be extremely small, for all $lambda >0$. Despite the simplicity of these models we still lack an intuitive understanding of the nonadditivity of $Q^{(1)}(B_g)$ and the positivity of $Q^{(1)}(C_g)$.
We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss multiple-access channel and solve the one-shot capacity region enabled by an entanglement source composed of sender-receiver pairwise two-mode squeezed vacuum states. The EA capacity region is strictly larger than the capacity region without entanglement-assistance. With two-mode squeezed vacuum states as the source and phase modulation as the encoding, we also design practical receiver protocols to realize the entanglement advantages. Four practical receiver designs, based on optical parametric amplifiers, are given and analyzed. In the parameter region of a large noise background, the receivers can enable a simultaneous rate advantage of 82.0% for each sender. Due to teleportation and superdense coding, our results for EA classical communication can be directly extended to EA quantum communication at half of the rates. Our work provides a unique and practical network communication scenario where entanglement can be beneficial.