Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntanglement may enhance the channel capacity in arbitrary dimensions
63
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider explicitly two examples of d-dimensional quantum channels with correlated noise and show that, in agreement with previous results on Pauli qubit channels, there are situations where maximally entangled input states achieve higher values of the output mutual information than product states. We obtain a strong dependence of this effect on the nature of the noise correlations as well as on the parity of the space dimension, and conjecture that when entanglement gives an advantage in terms of mutual information, maximally entangled states achieve the channel capacity.
rate research
Read More
We study the capacity of d-dimensional quantum channels with memory modeled by correlated noise. We show that, in agreement with previous results on Pauli qubit channels, there are situations where maximally entangled input states achieve higher values of mutual information than product states. Moreover, a strong dependence of this effect on the nature of the noise correlations as well as on the parity of the space dimension is found. We conjecture that when entanglement gives an advantage in terms of mutual information, maximally entangled states saturate the channel capacity.
We have found a quantum cloning machine that optimally duplicates the entanglement of a pair of $d$-dimensional quantum systems. It maximizes the entanglement of formation contained in the two copies of any maximally-entangled input state, while preserving the separability of unentangled input states. Moreover, it cannot increase the entanglement of formation of all isotropic states. For large $d$, the entanglement of formation of each clone tends to one half the entanglement of the input state, which corresponds to a classical behavior. Finally, we investigate a local entanglement cloner, which yields entangled clones with one fourth the input entanglement in the large-$d$ limit.
We give the trade-off curve showing the capacity of a quantum channel as a function of the amount of entanglement used by the sender and receiver for transmitting information. The endpoints of this curve are given by the Holevo-Schumacher-Westmoreland capacity formula and the entanglement-assisted capacity, which is the maximum over all input density matrices of the quantum mutual information. The proof we give is based on the Holevo-Schumacher-Westmoreland formula, and also gives a new and simpler proof for the entanglement-assisted capacity formula.
We introduce two generalizations of Kochen-Specker (KS) sets: projective KS sets and generalized KS sets. We then use projective KS sets to characterize all graphs for which the chromatic number is strictly larger than the quantum chromatic number. Here, the quantum chromatic number is defined via a nonlocal game based on graph coloring. We further show that from any graph with separation between these two quantities, one can construct a classical channel for which entanglement assistance increases the one-shot zero-error capacity. As an example, we exhibit a new family of classical channels with an exponential increase.
The amount of information transmissible through a communications channel is determined by the noise characteristics of the channel and by the quantities of available transmission resources. In classical information theory, the amount of transmissible information can be increased twice at most when the transmission resource (e.g. the code length, the bandwidth, the signal power) is doubled for fixed noise characteristics. In quantum information theory, however, the amount of information transmitted can increase even more than twice. We present a proof-of-principle demonstration of this super-additivity of classical capacity of a quantum channel by using the ternary symmetric states of a single photon, and by event selection from a weak coherent light source. We also show how the super-additive coding gain, even in a small code length, can boost the communication performance of conventional coding technique.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
