Related papers: Zero-Error List Decoding for Classical-Quantum Cha…
The standard notion of a classical limit, represented schematically by $\hbar\rightarrow 0$, provides a method for approximating a quantum system by a classical one. In this work we explain why the standard classical limit fails when…
We define here a new kind of quantum channel capacity by extending the concept of zero-error capacity for a noisy quantum channel. The necessary requirement for which a quantum channel has zero-error capacity greater than zero is given.…
We define a new family of codes for symmetric classical-quantum channels and establish their optimality. To this end, we extend the classical notion of generalized perfect and quasi-perfect codes to channels defined over some finite…
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…
The present work continues investigation of the capacities of measurement (quantum-classical) channels in the most general setting, initiated in~\cite{HCT}. The proof of coding theorems is given for the classical capacity and…
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.…
List decoding for arbitrarily varying channels (AVCs) under state constraints is investigated. It is shown that rates within $\epsilon$ of the randomized coding capacity of AVCs with input-dependent state can be achieved under maximal error…
We study lower bounds on the optimal error probability in classical coding over classical-quantum channels at rates below the capacity, commonly termed quantum sphere-packing bounds. Winter and Dalai have derived such bounds for…
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…
The quantum capacity of a memoryless channel is often used as a single figure of merit to characterize its ability to transmit quantum information coherently. The capacity determines the maximal rate at which we can code reliably over…
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…
We consider the zero-error capacity of deletion channels. Specifically, we consider the setting where we choose a codebook ${\cal C}$ consisting of strings of $n$ bits, and our model of the channel corresponds to an adversary who may delete…
It is well known that quantum theory forbids the exact copying of an unknown quantum state. Therefore in broadcasting of classical information by a quantum channel an additional contribution to the error in the decoding is expected. We…
If a sender and a receiver lack precise knowledge about the communication line that connects them, designing a scheme to reliably transmit information becomes more challenging. This has been studied in classical and quantum information…
A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…
The quantum analog of the classical erasure channel provides a simple example of a channel whose asymptotic capacity for faithful transmission of intact quantum states, with and without the assistance of a two-way classical side channel,…
We define the quantum zero-error capacity, a new kind of classical capacity of a noisy quantum channel. Moreover, the necessary requirement for which a quantum channel has zero-error capacity greater than zero is also given.
The readout of a classical memory can be modelled as a problem of quantum channel discrimination, where a decoder retrieves information by distinguishing the different quantum channels encoded in each cell of the memory [S. Pirandola, Phys.…
We analyze the problem of zero-error communication through timing channels that can be interpreted as discrete-time queues with bounded waiting times. The channel model includes the following assumptions: 1) Time is slotted, 2) at most $ N…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…