Related papers: Exponents for classical-quantum channel simulation…
Compressive sensing is used to perform high-dimensional quantum channel estimation with classical light. As an example, we perform a numerical simulation for the case of a three-dimensional classically non-separable state that is propagated…
Consider the asymmetric broadcast channel with a random superposition codebook, which may be comprised of constant composition or \iid codewords. By applying Forney's optimal decoder for individual messages and the message pair for the…
Quantum entropy inequalities are studied. Some quantum entropy inequalities are obtained by several methods. For entanglement breaking channel, we show that the entanglement-assisted classical capacity is upper bounded by $\log d$. A…
This paper investigates achievable information rates and error exponents of mismatched decoding when the channel belongs to the class of channels that are close to the decoding metric in terms of relative entropy. For both discrete- and…
Entanglement-assisted classical communication (EACC) aims to enhance communication systems using entanglement as an additional resource. However, there is a scarcity of explicit protocols designed for finite transmission scenarios, which…
Finding the optimal encoding strategies can be challenging for communication using quantum channels, as classical and quantum capacities may be superadditive. Entanglement assistance can often simplify this task, as the…
This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) channel codes are used. The exponents, established herein, are…
The design of error-correcting codes used in modern communications relies on information theory to quantify the capacity of a noisy channel to send information [1]. This capacity can be expressed using the mutual information between input…
We provide the sandwiched R\'enyi divergence of order $\alpha\in(\frac{1}{2},1)$, as well as its induced quantum information quantities, with an operational interpretation in the characterization of the exact strong converse exponents of…
Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this Paper, we study…
Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely many values by probing a quantum channel while remaining…
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…
We study the robustness of quantum computers under the influence of errors modelled by strictly contractive channels. A channel $T$ is defined to be strictly contractive if, for any pair of density operators $\rho,\sigma$ in its domain, $\|…
Quantum error correction assisted by entanglement helps to transmit the encoded qudits through quantum channels with some of them being noiseless. Here we consider a more realistic scheme for experiments what we called as partial-noisy…
The capacity of a classical-quantum channel (or in other words the classical capacity of a quantum channel) is considered in the most general setting, where no structural assumptions such as the stationary memoryless property are made on a…
We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…
We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves…
In the simple quantum hypothesis testing problem, upper bound with asymmetric setting is shown by using a quite useful inequality by Audenaert et al, quant-ph/0610027, which was originally invented for symmetric setting. Using this upper…
Within the simultaneous message passing model of communication complexity, under a public-coin assumption, we derive the minimum achievable worst-case error probability of a classical fingerprinting protocol with one-sided error. We then…
Here we write in a unified fashion (using "R(P, Q, D)") the random coding exponents in channel coding and lossy source coding. We derive their explicit forms and show, that, for a given random codebook distribution Q, the channel decoding…