No Arabic abstract
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)$.
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.
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.
We consider quantum key distribution (QKD) and entanglement distribution using a single-sender multiple-receiver pure-loss bosonic broadcast channel. We determine the unconstrained capacity region for the distillation of bipartite entanglement and secret key between the sender and each receiver, whenever they are allowed arbitrary public classical communication. A practical implication of our result is that the capacity region demonstrated drastically improves upon rates achievable using a naive time-sharing strategy, which has been employed in previously demonstrated network QKD systems. We show a simple example of the broadcast QKD protocol overcoming the limit of the point-to-point strategy. Our result is thus an important step toward opening a new framework of network channel-based quantum communication technology.
Using the deterministic, on-demand generation of two entangled phonons, we demonstrate a quantum eraser protocol in a phononic interferometer where the which-path information can be heralded during the interference process. Omitting the heralding step yields a clear interference pattern in the interfering half-quanta pathways; including the heralding step suppresses this pattern. If we erase the heralded information after the interference has been measured, the interference pattern is recovered, thereby implementing a delayed-choice quantum erasure. The test is implemented using a closed surface-acoustic-wave communication channel into which one superconducting qubit can emit itinerant phonons that the same or a second qubit can later re-capture. If the first qubit releases only half of a phonon, the system follows a superposition of paths during the phonon propagation: either an itinerant phonon is in the channel, or the first qubit remains in its excited state. These two paths are made to constructively or destructively interfere by changing the relative phase of the two intermediate states, resulting in a phase-dependent modulation of the first qubits final state, following interaction with the half-phonon. A heralding mechanism is added to this construct, entangling a heralding phonon with the signalling phonon. The first qubit emits a phonon herald conditioned on the qubit being in its excited state, with no signaling phonon, and the second qubit catches this heralding phonon, storing which-path information which can either be read out, destroying the signaling phonons self-interference, or erased.
We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity, but replacing the relative entropy with the Hoeffding distance. Similarly, our upper bound is in terms of a quantity obtained by replacing the relative entropy with the recently introduced max-relative entropy in the definition of the divergence radius of a channel.