Related papers: Convergence Properties of Good Quantum Codes for C…
We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of…
We study various super-activation effects in the following zero-error communication scenario: One sender wants to send classical or quantum information through a noisy quantum channel to one receiver with zero probability of error. First we…
The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analogue of the…
We consider the process consisting of preparation, transmission through a quantum channel, and subsequent measurement of quantum states. The communication complexity of the channel is the minimal amount of classical communication required…
In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…
Polar codes are the first capacity achieving and efficiently implementable codes for classical communication. Recently they have also been generalized to communication over classical-quantum and quantum channels. In this work we present our…
This report surveys quantum error-correcting codes. As Preskill claimed, 21st century would be the golden age of quantum error correction. Quantum channels behave differently from classical channels, so researchers face difficulties in…
We prove a one-shot "minimax" converse bound for quantum channel coding assisted by positive partial transpose channels between sender and receiver. The bound is similar in spirit to the converse by Polyanskiy, Poor, and Verdu [IEEE Trans.…
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can…
We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…
Holevo, Schumacher, and Westmoreland's coding theorem guarantees the existence of codes that are capacity-achieving for the task of sending classical data over a channel with classical inputs and quantum outputs. Although they demonstrated…
We analyse families of codes for classical data transmission over quantum channels that have both a vanishing probability of error and a code rate approaching capacity as the code length increases. To characterise the fundamental tradeoff…
We consider classical message transmission under entanglement assistance for compound memoryless and arbitrarily varying quantum channels. In both cases, we prove general coding theorems together with corresponding weak converse bounds. In…
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…
The transmission of classical information over a classical channel gave rise to the classical capacity theorem with the optimal rate in terms of the classical mutual information. Despite classical information being a subset of quantum…
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,…
The capability of a given channel to communicate information is, a priori, distinct from its capability to distribute shared randomness. In this article we define randomness distribution capacities of quantum channels assisted by forward,…
Optical communication channels are ultimately quantum-mechanical in nature, and we must therefore look beyond classical information theory to determine their communication capacity as well as to find efficient encoding and decoding schemes…