Related papers: Zero-entropy encoders and simultaneous decoders in…
In [1], it is shown that the simultaneous identification capacity region for the discrete, memoryless, classical-quantum multiple access channel is equal to the transmission capacity region for codes using a deterministic encoding scheme.…
Identification over quantum broadcast channels is considered. As opposed to the information transmission task, the decoder only identifies whether a message of his choosing was sent or not. This relaxation allows for a double-exponential…
We study the problem of decoding classical information encoded on quantum states at the output of a quantum channel, with particular focus on increasing the communication rates towards the maximum allowed by Quantum Mechanics. After a brief…
In this thesis we analyse the type of states and ensembles which achieve the capacity for certain quantum channels carrying classical information. We first concentrate on the product-state capacity of a particular quantum channel, that is,…
This paper is on identification of classical information by the use of quantum channels. We focus on simultaneous ID codes which use measurements being useful to identify an arbitrary message. We give a direct and a converse part of the…
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 show the equivalence of two different notions of quantum channel capacity: that which uses the entanglement fidelity as its criterion of success in transmission, and that which uses the minimum fidelity of pure states in a subspace of…
In this paper we address the issue of universal or robust communication over quantum channels. Specifically, we consider memoryless communication scenario with channel uncertainty which is an analog of compound channel in classical…
Most coding theorems in quantum Shannon theory can be proven using the decoupling technique: to send data through a channel, one guarantees that the environment gets no information about it; Uhlmann's theorem then ensures that the receiver…
A fully general strong converse for channel coding states that when the rate of sending classical information exceeds the capacity of a quantum channel, the probability of correctly decoding goes to zero exponentially in the number of…
We study the identification capacity of classical-quantum channels ("cq-channels"), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification…
We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical-quantum (cq) channels and "quantum fingerprinting".…
A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…
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.…
Here, we study the capacity of a quantum channel, assuming linear optical encoding, as a function of available photons and optical modes. First, we observe that substantial improvement is made possible by not restricting ourselves to a…
Entanglement is known to significantly improve the performance (separately) of communication and detection schemes that utilize quantum resources. This work explores the simultaneous utility of quantum entanglement for (joint) communication…
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…
We study an analog of the well-known Gel'fand Pinsker Channel which uses quantum states for the transmission of the data. We consider the case where both the sender's inputs to the channel and the channel states are to be taken from a…
Bennett et al. showed that allowing shared entanglement between a sender and receiver before communication begins dramatically simplifies the theory of quantum channels, and these results suggest that it would be worthwhile to study other…
Motivated by applications of biometric identification and content identification systems, we consider the problem of random coding for channels, where each codeword undergoes lossy compression (vector quantization), and where the decoder…