Related papers: Generalized Perfect Codes for Symmetric Classical-…

Unambiguous unitary maps and unambiguous unitary quantum channels are introduced and some of their properties are derived. These properties ensure certain simple form for the measurements involved in realizing an unambiguous unitary quantum…

We construct a universal code for stationary and memoryless classical-quantum channel as a quantum version of the universal coding by Csisz\'{a}r and K\"{o}rner. Our code is constructed by the combination of irreducible representation, the…

We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This…

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…

Quantum applications transmit and receive data through quantum and classical communication channels. Channel capacity, the distance and the photon path between transmitting and receiving parties and the speed of the computation links play…

We present a proof for the quantum channel coding theorem which relies on the fact that a randomly chosen code space typically is highly suitable for quantum error correction. In this sense, the proof is close to Shannon's original…

We present a new achievable rate region for the two-user binary-input classical-quantum broadcast channel. The result is a generalization of the classical Marton-Gelfand-Pinsker region and is provably larger than the best previously known…

The dynamics of quantum systems are generally described by a family of quantum channels (linear, completely positive and trace preserving maps). In this note, we mainly study the range of all possible values of…

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…

Quantum communication is often investigated in scenarios where only the dimension of Hilbert space is known. However, assigning a precise dimension is often an approximation of what is actually a higher-dimensional process. Here, we…

It is conjectured that quantum computers are able to solve certain problems more quickly than any deterministic or probabilistic computer. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, it is a…

We present a new application of harmonic analysis to quantum information by constructing intriguing classes of quantum channels stemming from specific representations of multiplier algebras over locally compact groups $G$. Beginning with a…

We construct new polar coding schemes for the transmission of quantum or private classical information over arbitrary quantum channels. In the former case, our coding scheme achieves the symmetric coherent information and in the latter the…

A quantum channel models the interaction between the system we are interested in and its environment. Such a model can capture the main features of the interaction but because of the complexity of the environment we can not assume that it…

We introduce a convergent iterative algorithm for finding the optimal coding and decoding operations for an arbitrary noisy quantum channel. This algorithm does not require any error syndrome to be corrected completely, and hence also finds…

For a noisy quantum channel, a quantum error correcting code exists if and only if the joint higher rank numerical ranges associated with the error operators of the channel is non-empty. In this paper, geometric properties of the joint…

A general quantum noisy channel is analyzed, wherein the transmitted qubits may experience symmetry-breaking decoherence, along with memory effects. We find the optimal basis not to be fully entangled, but a combination of factorized and…

Unextendibility of quantum states and channels is inextricably linked to the no-cloning theorem of quantum mechanics, it has played an important role in understanding and quantifying entanglement, and more recently it has found applications…

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…

In our previous work, we presented the \emph{Hypothesis Testing Lemma}, a key tool that establishes sufficient conditions for the existence of good deterministic identification (DI) codes for memoryless channels with finite output, but…