Related papers: Entanglement Transmission over Arbitrarily Varying…
We study the arbitrarily varying relay channel, and establish the cutset bound and partial decode-forward bound on the random code capacity. We further determine the random code capacity for special cases. Then, we consider conditions under…
In this paper, we calculate the entanglement-assisted classical information capacity of amplitude damping channel and compare it with the particular mutual information which is considered as the entanglement-assisted classical information…
We provide a versatile upper bound on the number of maximally entangled qubits, or private bits, shared by two parties via a generic adaptive communication protocol over a quantum network when the use of classical communication is not…
Entanglement indcued non--additivity of classical communication capacity in networks consisting of quantum channels is considered. Communication lattices consisiting of butterfly-type entanglement breaking channels augmented, with some…
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of…
The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be sent via a single use of the channel. Prevedel et al. (PRL 106, 110505 (2011)) recently…
The capacity of a channel is known to be equivalent to the highest rate at which it can generate entanglement. Analogous to entanglement, the notion of a causality measure characterises the temporal aspect of quantum correlations. Despite…
We investigate prepare-and-measure scenarios in which a sender and a receiver use entanglement to send quantum information over a channel with limited capacity. We formalise this framework, identify its basic properties and provide…
Quantum state can be teleported to a remote site by only local measurement and classical communication if the prior Einstein-Podolsky-Rosen quantum channel is available between the sender and the receiver. Those quantum channels shared by…
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…
We analyze a task in which classical and quantum messages are simultaneously communicated via a noisy quantum channel, assisted with a limited amount of shared entanglement. We derive direct and converse bounds for the one-shot capacity…
We extend the model of Ancilla Driven Quantum Computation (ADQC) by considering gates with arbitrary entangling power. By giving up stepwise determinism, universal QC can still be achieved through a variable length sequence of single qubit…
Using random Gaussian vectors and an information-uncertainty relation, we give a proof that the coherent information is an achievable rate for entanglement transmission through a noisy quantum channel. The codes are random subspaces…
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…
We show that a quantum clock cannot be teleported without prior synchronization between sender and receiver: every protocol using a finite amount of entanglement and an arbitrary number of rounds of classical communication will necessarily…
The arbitrarily varying channel (AVC) is a conservative way of modeling an unknown interference, and the corresponding capacity results are pessimistic. We reconsider the Gaussian AVC by relaxing the classical model and thereby weakening…
Current advancements in communication equipment demand the investigation of classical information transfer over quantum channels, by encompassing realistic scenarios in finite dimensions. To address this issue, we develop a framework for…
Entanglement-assisted communication over a random-parameter quantum channel with either causal or non-causal channel side information (CSI) at the encoder is considered. This describes a scenario where the quantum channel depends on the…
An important distinction in our understanding of capacities of classical versus quantum channels is marked by the following question: is there an algorithm which can compute (or even efficiently compute) the capacity? While there is…
We consider the arbitrarily varying Gaussian relay channel with sender frequency division. We determine the random code capacity, and establish lower and upper bounds on the deterministic code capacity. It is observed that when the channel…