Related papers: Discriminating idempotent quantum channels
Clarke and Barron have recently shown that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy of universal data compression in a parametric setting. We seek a possible analogue of…
A lower bound on the probability of decoding error of quantum communication channel is presented. The strong converse to the quantum channel coding theorem is shown immediately from the lower bound. It is the same as Arimoto's method exept…
We consider the problem of distinguishing, with minimum probability of error, two optical beam-splitter channels with unequal complex-valued reflectivities using general quantum probe states entangled over M signal and M' idler mode pairs…
We consider the problem of discriminating between two different states of a finite quantum system in the setting of large numbers of copies, and find a closed form expression for the asymptotic exponential rate at which the specified error…
We present a simple, dimension-independent criterion which guarantees that some quantum channel $\Phi$ is divisible, i.e. that there exists a non-trivial factorization $\Phi=\Phi_1\Phi_2$. The idea is to first define an "elementary" channel…
The sandwiched R\'enyi divergences of two finite-dimensional density operators quantify their asymptotic distinguishability in the strong converse domain. This establishes the sandwiched R\'enyi divergences as the operationally relevant…
There are different inequivalent ways to define the R\'enyi capacity of a channel for a fixed input distribution $P$. In a 1995 paper Csisz\'ar has shown that for classical discrete memoryless channels there is a distinguished such quantity…
The coexistence of quantum and classical signals over the same optical fiber with minimal degradation of the transmitted quantum information is critical for operating large-scale quantum networks over the existing communications…
We study blind fingerprinting, where the host sequence into which fingerprints are embedded is partially or completely unknown to the decoder. This problem relates to a multiuser version of the Gel'fand-Pinsker problem. The number of…
We study a variant of quantum hypothesis testing wherein an additional 'inconclusive' measurement outcome is added, allowing one to abstain from attempting to discriminate the hypotheses. The error probabilities are then conditioned on a…
We review in a unified way a recently proposed method to detect properties of unknown quantum channels and lower bounds to quantum capacities, without resorting to full quantum process tomography. The method is based on the preparation of a…
Quantum neural network architectures that have little-to-no inductive biases are known to face trainability and generalization issues. Inspired by a similar problem, recent breakthroughs in machine learning address this challenge by…
We provide a simple example that illustrates the advantage of adaptive over non-adaptive strategies for quantum channel discrimination. In particular, we give a pair of entanglement-breaking channels that can be perfectly discriminated by…
This paper considers error probabilities of random codes for memoryless channels in the fixed-rate regime. Random coding is a fundamental scheme to achieve the channel capacity and many studies have been conducted for the asymptotics of the…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…
We present the asymptotic analysis of the quantum two-port interferometer in the $n \rightarrow \infty$ limit of $n$ partially indistinguishable photons. Using the unitary-unitary duality between port and inner-mode degrees of freedom, the…
It is known that unambiguous discrimination among non-orthogonal but linearly independent quantum states is possible with a certain probability of success. Here, we consider a variant of that problem. Instead of discriminating among all of…
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher…
The standard quantum state discrimination problem can be understood as a communication scenario involving a sender and a receiver following these three steps: (i) the sender encodes information in pre-agreed quantum states, (ii) sends them…
We determine the exact error and strong converse exponent for entanglement-assisted classical-quantum channel simulation in worst case input purified distance. The error exponent is expressed as a single-letter formula optimized over…