Related papers: Coding for quantum channels with side information …
A quantum communication channel can be put to many uses: it can transmit classical information, private classical information, or quantum information. It can be used alone, with shared entanglement, or together with other channels. For each…
In communication networks many different channels must share a limited amount of resources. In order to allow for multiple simultaneous communications, multiple access techniques are routinely employed. With quantum communication, it is…
In classical information theory, channel capacity quantifies the maximum number of messages that can be reliably transmitted using shared information. An equivalent concept, termed uncommon information, represents the number of messages…
Entangled qubit can increase the capacity of quantum error correcting codes based on stabilizer codes. In addition, by using entanglement quantum stabilizer codes can be construct from classical linear codes that do not satisfy the…
Given an unknown quantum state distributed over two systems, we determine how much quantum communication is needed to transfer the full state to one system. This communication measures the "partial information" one system needs conditioned…
We show how entanglement-assisted codes can be constructed from arbitrary quantum codes by associating them with quantum codes for erasure channels. If a subset of physical qubits is correctable for an erasure error, then it naturally forms…
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a…
We consider the problem of trying to send a single classical bit through a noisy quantum channel when two transmissions through the channel are available as a resource. Classically, two transmissions add nothing to the receiver's capability…
This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted…
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 entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of…
Several relations between the Holevo capacity and the entanglement-assisted classical capacity of a quantum channel are proved, necessary and sufficient conditions for their coincidence are obtained. In particular, it is shown that these…
We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…
This paper considers the source coding problem with broadcast side information. The side information is sent to two receivers through a noisy broadcast channel. We provide an outer bound of the rate--distortion--bandwidth (RDB) quadruples…
Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the…
The goal of this paper is to provide a rigorous information-theoretic analysis of subnetworks of interference networks. We prove two coding theorems for the compound multiple-access channel with an arbitrary number of channel states. The…
The purpose of this work is to extend the result of previous papers quant-ph/9611023, quant-ph/9703013 to quantum channels with additive constraints onto the input signal, by showing that the capacity of such channel is equal to the…
We describe a quantum error correction scheme aimed at protecting a flow of quantum information over long distance communication. It is largely inspired by the theory of classical convolutional codes which are used in similar circumstances…