Pre-shared entanglement can significantly boost communication rates in the regime of high thermal noise, and a low-brightness transmitter. In this regime, the ratio between the entanglement-assisted capacity and the Holevo capacity, the maximum reliable-communication rate permitted by quantum mechanics without any pre-shared entanglement as a resource, is known to scale as $\log(1/N_S)$, where $N_S \ll 1$ is the mean transmitted photon number per mode. This is especially promising in enabling a large boost to radio-frequency communications in the weak-transmit-power regime, by exploiting pre-shared optical-frequency entanglement, e.g., distributed by the quantum internet. In this paper, we propose a structured design of a quantum transmitter and receiver that leverages continuous-variable pre-shared entanglement from a downconversion source, which can harness this purported infinite-fold capacity enhancement---a problem open for over a decade. Finally, the implication of this result to the breaking of the well-known {\em square-root law} for covert communications, with pre-shared entanglement assistance, is discussed.
A private shared Cartesian frame is a novel form of private shared correlation that allows for both private classical and quantum communication. Cryptography using a private shared Cartesian frame has the remarkable property that asymptotically, if perfect privacy is demanded, the private classical capacity is three times the private quantum capacity. We demonstrate that if the requirement for perfect privacy is relaxed, then it is possible to use the properties of random subspaces to nearly triple the private quantum capacity, almost closing the gap between the private classical and quantum c…
We consider a model of communication via a fully quantum jammer channel with quantum jammer, quantum sender and quantum receiver, which we dub quantum arbitrarily varying channel (QAVC). Restricting to finite dimensional user and jammer systems, we show, using permutation symmetry and a de Finetti reduction, how the random coding capacity (classical and quantum) of the QAVC is reduced to the capacity of a naturally associated compound channel, which is obtained by restricting the jammer to i.i.d. input states. Furthermore, we demonstrate that the shared randomness required is at most logarithm…
An important practical open question has been to design explicit, structured optical receivers that achieve the Holevo limit in the contexts of optical communication and "quantum reading." The Holevo limit is an achievable rate that is higher than the Shannon limit of any known optical receiver. We demonstrate how a sequential decoding approach can achieve the Holevo limit for both of these settings. A crucial part of our scheme for both settings is a non-destructive "vacuum-or-not" measurement that projects an n-symbol modulated codeword onto the n-fold vacuum state or its orthogonal compleme…
In this paper, we explicitly evaluate the one-shot quantum non-signalling assisted zero-error classical capacities $\M_0^{\mathrm{QNS}}$ for qubit channels. In particular, we show that for nonunital qubit channels, $\M_0^{\mathrm{QNS}}=1$, which implies that in the one-shot setting, nonunital qubit channels cannot transmit any information with zero probability of error even when assisted by quantum non-signalling correlations. Furthermore, we show that for qubit channels, $\M_0^{\mathrm{QNS}}$ equals to the one-shot entanglement-assisted zero-error classical capacities. This means that for a s…
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a pre-shared entangled Bell pair. This paper introduces a new protocol which is intended for distributed communication. Using a pre-shared entangled Bell pair and 1 classical bit 2,5 classical bits can be transmitted in average. This means not only valuable increase in capacity but the two-way distributed operation opens new fields of investigation.
Sharing correlated random variables is a resource for a number of information theoretic tasks such as privacy amplification, simultaneous message passing, secret sharing and many more. In this article, we show that to establish such a resource called shared randomness, quantum systems provide an advantage over their classical counterpart. Precisely, we show that appropriate albeit fixed measurements on a shared two-qubit state can generate correlations which cannot be obtained from any possible state on two classical bits. In a resource theoretic set-up, this feature of quantum systems can be …
We analyze the quantum binary adder channel, i.e. the quantum generalization of the classical, and well-studied, binary adder channel: in this model qubits rather than classical bits are transmitted. This of course is as special case of the general theory of quantum multiple access channels, and we may apply the established formulas for the capacity region to it. However, the binary adder channel is of particular interest classically, which motivates our generalizing it to the quantum domain. It turns out to be a very nice case study not only of multi-user quantum information theory, but also …
Entanglement underpins a variety of quantum-enhanced communication, sensing, and computing capabilities. Entanglement-assisted communication (EACOMM) leverages entanglement pre-shared by communication parties to boost the rate of classical information transmission. Pioneering theory works showed that EACOMM can enable a communication rate well beyond the ultimate classical capacity of optical communications, but an experimental demonstration of any EACOMM advantage remains elusive. Here, we report the implementation of EACOMM surpassing the classical capacity over lossy and noisy bosonic chann…
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived assuming an unlimited amount of shared entanglement per channel use. In this paper, bounds are derived on the minimum amount of entanglement required per use of a channel, in order to asymptotically achieve the capacity. This is achieved by introducing a class of entanglement-assisted quantum codes. Codes for classes of qubit channels are shown to achieve t…
Inria（法国国家信息与自动化研究所）；ENS de Lyon（里昂高等师范学院）；UCBL（里昂第一大学）；LIP（计算机科学实验室）；School of Mathematics and Statistics, Wuhan University（武汉大学数学与统计学院）；Wuhan Institute of Quantum Technology（武汉量子技术研究院）；Department of Mathematical Sciences, Chalmers University of Technology（查尔姆斯理工大学数学科学系）；Wallenberg Centre for Quantum Technology, Chalmers University of Technology（查尔姆斯理工大学瓦伦伯格量子技术中心）
The entanglement-assisted classical capacity of a noisy quantum channel is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that this capacity is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs $ρ$, of the entropy of the channel input plus the entropy of the channel output minus their joint en…
We experimentally demonstrate the achievement of the entanglement assisted capacity for classical information transmission over a depolarizing channel. The implementation is based on the generation and local manipulation of 2-qubit Bell states, which are finally measured at the receiver by a complete Bell state analysis. The depolarizing channel is realized by introducing quantum noise in a controlled way on one of the two qubits. This work demonstrates the achievement of the maximum allowed amount of information that can be shared in the presence of noise and the highest reported value in the…
We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error correcting codes, thus allowing us to ``quantize'' all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement,…
Quantum superdense coding protocols enhance channel capacity by using shared quantum entanglement between two users. The channel capacity can be as high as 2 when one uses entangled qubits. However, this limit can be surpassed by using high-dimensional entanglement. We report an experiment that exceeds the limit using high-quality entangled ququarts with fidelities up to 0.98, demonstrating a channel capacity of $2.09\pm0.01$. The measured channel capacity is also higher than that obtained when transmitting only one ququart. We use the setup to transmit a five-color image with a fidelity of 0.…
I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal {\it a priori} probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding $χ^{*}$ satisfies $E_{R}(ρ)\leq χ^{*}\leq E_{R}(ρ)+\log_{2}d$, where $E_{R}(ρ)$ is the relative entropy of entanglement of the shared entangled state.
We introduce a new protocol, the channel-state coding protocol, to quantum Shannon theory. This protocol generates entanglement between a sender and receiver by coding for a noisy quantum channel with the aid of a noisy shared state. The mother and father protocols arise as special cases of the channel-state coding protocol, where the channel is noiseless or the state is a noiseless maximally entangled state, respectively. The channel-state coding protocol paves the way for formulating entanglement-assisted quantum error-correcting codes that are robust to noise in shared entanglement. Finally…
We present a full experimental characterization of continuous variable quantum communication channels established by shared entanglement together with local operations and classical communication. The resulting teleportation channel was fully characterized by measuring all elements of the covariance matrix of the shared two-mode squeezed Gaussian state. From the experimental data we determined the lower bound to the quantum channel capacity, the teleportation fidelity of coherent states and the logarithmic negativity and the purity of the shared state. Additionally, a positive secret key rate …
We give a capacity formula for the classical information transmission over a noisy quantum channel, with separable encoding by the sender and limited resources provided by the receiver's pre-shared ancilla. Instead of a pure state, we consider the signal-ancilla pair in a mixed state, purified by a "witness". Thus, the signal-witness correlation limits the resource available from the signal-ancilla correlation. Our formula characterizes the utility of different forms of resources, including noisy or limited entanglement assistance, for classical communication. With separable encoding, the send…
The information capacities and ``distillability'' of a quantum channel are studied in the presence of auxiliary resources. These include prior entanglement shared between the sender and receiver and free classical bits of forward and backward communication. Inequalities and trade-off curves are derived. In particular an alternative proof is given that in the absence of feedback and shared entanglement, forward classical communication does not increase the quantum capacity of a channel.
We present a method of determining important properties of a shared bipartite quantum state, within the ``distant labs'' paradigm, using \emph{only} local operations and classical communication (LOCC). We apply this procedure to spectrum estimation of shared states, and locally implementable structural physical approximations to incompletely positive maps. This procedure can also be applied to the estimation of channel capacity and measures of entanglement.
