Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userEntanglement enhanced classical capacity of quantum communication channels with correlated noise in arbitrary dimensions
84
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
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.
rate research
Read More
We develop a model for a noisy communication channel in which the noise affecting consecutive transmissions is correlated. This model is motivated by fluctuating birefringence of fiber optic links. We analyze the role of entanglement of the input states in optimizing the classical capacity of such a channel. Assuming a general form of an ensemble for two consecutive transmissions, we derive tight bounds on the classical channel capacity depending on whether the input states used for communication are separable or entangled across different temporal slots. This result demonstrates that by an appropriate choice, the channel capacity may be notably enhanced by exploiting entanglement.
We present an experiment demonstrating entanglement-enhanced classical communication capacity of a quantum channel with correlated noise. The channel is modelled by a fiber optic link exhibiting random birefringence that fluctuates on a time scale much longer than the temporal separation between consecutive uses of the channel. In this setting, introducing entanglement between two photons travelling down the fiber allows one to encode reliably up to one bit of information into their joint polarization degree of freedom. When no quantum correlations between two separate uses of the channel are allowed, this capacity is reduced by a factor of more than three. We demonstrated this effect using a fiber-coupled source of entagled photon pairs based on spontaneous parametric down-conversion, and a linear-optics Bell state measurement.
Communication over a noisy quantum channel introduces errors in the transmission that must be corrected. A fundamental bound on quantum error correction is the quantum capacity, which quantifies the amount of quantum data that can be protected. We show theoretically that two quantum channels, each with a transmission capacity of zero, can have a nonzero capacity when used together. This unveils a rich structure in the theory of quantum communications, implying that the quantum capacity does not uniquely specify a channels ability for transmitting quantum information.
We prove a regularized formula for the secret key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity cite{DHW05RI}. This formula provides a new family protocol, the private father protocol, under the resource inequality framework that includes private classical communication it{without} secret key assistance as a child protocol.
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.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
