Related papers: Capacities of Quantum Erasure Channels
Quantum capacity, as the ultimate transmission rate of quantum communication, is characterized by regularized coherent information. In this work, we reformulate approximations of the quantum capacity by operator space norms and give both…
The applications of the general formulae of channel capacity developed in the quantum information theory to evaluation of information transmission capacity of optical channel are interesting subjects. In this review paper, we will point out…
Transmission of classical information using quantum objects such as polarized photons is studied. The classical (Shannon) channel capacity and its relation to quantum (von Neumann) channel capacity is investigated for various receiver…
We introduce various measures of forward classical communication for bipartite quantum channels. Since a point-to-point channel is a special case of a bipartite channel, the measures reduce to measures of classical communication for…
Using the axiomatic definition of the coherence measure, such as the $l_{1}$ norm and the relative entropy, we study the phenomena of two-qubit system quantum coherence through quantum channels where successive uses of the channels are…
Fundamental limits on communication rates over quantum channels are given by mathematical expressions involving entropic formulas. Often, it is unclear if these expressions are computable. This thesis describes contributions to the study 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…
Quantum channels are known to provide qualitatively better information transfer capacities over their classical counterparts. Examples include quantum cryptography, quantum dense coding, and quantum teleportation. This is a short review on…
There exist memoryless zero-capacity quantum channels that when used jointly result in the channel with positive capacity. This phenomenon is called superactivation. Making use of Parrondo's paradox, we exhibit examples of…
We provide lower and upper bounds on the information transmission capacity of one single use of a classical-quantum channel. The lower bound is expressed in terms of the Hoeffding capacity, that we define similarly to the Holevo capacity,…
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…
With the rapid deployment of quantum computers and quantum satellites, there is a pressing need to design and deploy quantum and hybrid classical-quantum networks capable of exchanging classical information. In this context, we conduct the…
We introduce the concept of quasi-inverse of quantum and classical channels, prove general properties of these inverses and determine them for a large class of channels acting in an arbitrary finite dimension. Therefore we extend the…
The quantum capacity of a pure quantum channel and that of classical-quantum-classical channel are discussed in detail based on the fully quantum mechanical mutual entropy. It is proved that the quantum capacity generalizes the so-called…
The maximal amount of information which is reliably transmitted over two uses of general Pauli channels with memory is proven to be achieved by maximally entangled states beyond some memory threshold. In particular, this proves a conjecture…
Is there a meaningful quantum counterpart to public communication? We argue that the symmetric-side channel -- which distributes quantum information symmetrically between the receiver and the environment -- is a good candidate for a notion…
Two new classes of quantum channels, which we call more capable and less noisy, are introduced. The more capable class consists of channels such that the quantum capacities of the complementary channels to the environments are zero. The…
The deletion channel is the simplest point-to-point communication channel that models lack of synchronization. Despite significant effort, little is known about its capacity, and even less about optimal coding schemes. In this paper we…
The computational problem of distinguishing two quantum channels is central to quantum computing. It is a generalization of the well-known satisfiability problem from classical to quantum computation. This problem is shown to be…
The aim of this work is to study the zero-error capacity of pure-state classical-quantum channels in the setting of list decoding. We provide an achievability bound for list-size two and a converse bound holding for every fixed list size.…