相关论文: On the Input-Degradedness and Input-Equivalence Be…
We present a general theory of comparison of quantum channels, concerning with the question of simulability or approximate simulability of a given quantum channel by allowed transformations of another given channel. We introduce a…
According to Blackwell's Theorem it is equivalent to compare channels by either a garbling order or optimal decision making. This equivalence does not hold anymore if also allowing pre-garbling, i. e. for the so-called Shannon-order (see…
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…
We study the problem of quantum channel discrimination between two channels with an adversary input party (a.k.a. a jammer). This setup interpolates between the best-case channel discrimination as studied by (Wang & Wilde, 2019) and the…
The $K$-receiver degraded broadcast channel with secrecy outside a bounded range is studied, in which a transmitter sends $K$ messages to $K$ receivers, and the channel quality gradually degrades from receiver $K$ to receiver 1. Each…
We consider a family of quantum channels characterized by the fact that certain (in general nonorthogonal) Pure states at the channel entrance are mapped to (tensor) Products of Pure states (PPP, hence "pcubed") at the complementary outputs…
Given two quantum channels, we examine the task of determining whether they are compatible - meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting…
We study the problem of simulating a two-user multiple-access channel (MAC) over a multiple access network of noiseless links. Two encoders observe independent and identically distributed (i.i.d.) copies of a source random variable each,…
We consider the problem of block-coded communication, where in each block, the channel law belongs to one of two disjoint sets. The decoder is aimed to decode only messages that have undergone a channel from one of the sets, and thus has to…
Channel simulation is an alternative to quantization and entropy coding for performing lossy source coding. Recently, channel simulation has gained significant traction in both the machine learning and information theory communities, as it…
Communication over a random-parameter quantum channel when the decoder is required to reconstruct the parameter sequence is considered. We study scenarios that include either strictly-causal, causal, or non-causal channel side information…
This paper considers a binary channel with deletions and insertions, where each input bit is transformed in one of the following ways: it is deleted with probability d, or an extra bit is added after it with probability i, or it is…
Necessary and sufficient conditions for approximation of a general channel by a general source are proved. For the special case in which the channel input is deterministic, which corresponds to source simulation, we prove a stronger…
There are a few obstacles, which bring about imperfect quantum teleportation of a continuous variable state, such as unavailability of maximally entangled two-mode squeezed states, inefficient detection and imperfect unitary transformation…
We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a…
The most unstable quantum states and elementary particles possess more than a single decay channel. At the same time, it is well known that typically the decay law is not simply exponential. Therefore, it is natural to ask how to spot the…
In this paper, we study the problem of simulating a DMC channel from another DMC channel under an average-case and an exact model. We present several achievability and infeasibility results, with tight characterizations in special cases. In…
We present an algorithm that, given a channel, determines if there is a distance for it such that the maximum likelihood decoder coincides with the minimum distance decoder. We also show that any metric, up to a decoding equivalence, can be…
In the problem of quantum channel certification, we have black box access to a quantum process and would like to decide if this process matches some predefined specification or is $\varepsilon$-far from this specification. The objective is…
We study the problem of synthesising a two-user broadcast channel using a common message, where each output terminal shares an independent source of randomness with the input terminal. This generalises two problems studied in the literature…