Related papers: Fully Quantum Arbitrarily Varying Channels: Random…
We consider the problem of coding for quantum channels with side information that is available ahead of time at the transmitter but not at the receiver. We find a single-letter expression for the entanglement-assisted quantum capacity of…
We introduce a new quantum decoder based on a variant of the pretty good measurement, but defined via an alternative matrix quotient. We use this decoder to show new lower bounds on the error exponent both in the one-shot and asymptotic…
We propose a multi-mode modulation scheme for Continuous Variable (CV) quantum communications, which we call quantum pattern encoding. In this setting, classical information can be encoded into multi-mode patterns of discretely-modulated…
We consider the transmission of classical information over a quantum channel by two senders. The channel capacity region is shown to be a convex hull bound by the Von Neumann entropy and the conditional Von Neumann entropy. We discuss some…
Quantum information theory establishes the ultimate limits on communication and cryptography in terms of channel capacities for various types of information. The private capacity is particularly important because it quantifies achievable…
We study the problem of communication over a discrete arbitrarily varying channel (AVC) when a noisy version of the state is known non-causally at the encoder. The state is chosen by an adversary which knows the coding scheme. A…
We consider the problem of authenticated communication over a discrete arbitrarily varying channel where the legitimate parties are unaware of whether or not an adversary is present. When there is no adversary, the channel state always…
Several aspects of the problem of asynchronous point-to-point communication without feedback are developed when the source is highly intermittent. In the system model of interest, the codeword is transmitted at a random time within a…
We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the…
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the…
The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…
Every channel can be expressed as a convex combination of deterministic channels with each deterministic channel corresponding to one particular intrinsic state. Such convex combinations are in general not unique, each giving rise to a…
We study the Coulomb blockade in a chaotic cavity connected to a lead by a perfectly transmitting quantum channel. In contrast to the previous theories, we show that the quantum fluctuations of charge, resulting from the perfect…
As quantum key distribution networks grow in size and complexity, resource assignment has become increasingly important. In passive optical networks without wavelength conversion, we need to assign a full route between origin and…
Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the buffer. It has been shown that the upper-bound on the…
We determine the optimal rates of universal quantum codes for entanglement transmission and generation under channel uncertainty. In the simplest scenario the sender and receiver are provided merely with the information that the channel…
Shannon's channel coding theorem describes the maximum possible rate of reliable information transfer through a classical noisy communication channel. It, together with the source coding theorem, characterizes lossless channel communication…
We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…
We consider the problem of implementing two-party interactive quantum communication over noisy channels, a necessary endeavor if we wish to fully reap quantum advantages for communication. For an arbitrary protocol with $n$ messages,…
In this work we improve the quantum communication rates of various quantum channels of interest using permutation-invariant quantum codes. We focus in particular on parametrized families of quantum channels and aim to improve bounds on…