Related papers: Extending additivity from symmetric to asymmetric …
The chain rule for the classical relative entropy ensures that the relative entropy between probability distributions on multipartite systems can be decomposed into a sum of relative entropies of suitably chosen conditional distributions on…
The Poltyrev bound provides a very tight upper bound on the decoding error probability when using binary linear codes for transmission over the binary symmetric channel and the additive white Gaussian noise channel, making use of the code's…
Hastings disproved additivity conjecture for minimum output entropy by using random unitary channels. In this note, we employ his approach to show that minimum output $p-$R\'{e}nyi entropy is non-additive for $p\in(0,p_0)\cup(1-p_0,1)$…
In this work we present a computation paradigm based on a concurrent and incremental construction of proof nets (de-sequentialized or graphical proofs) of the pure multiplicative and additive fragment of Linear Logic, a resources conscious…
It is known that random quantum channels exhibit significant violations of multiplicativity of maximum output p-norms for any p>1. In this work, we show that a weaker variant of multiplicativity nevertheless holds for these channels. For…
Formalism of discrete noncommutative Fourier transform is developed and applied to the study of Weyl-covariant channels. We then extend a result in quant-ph/0509126 concerning a bound of the maximal output 2-norm of a Weyl-covariant…
We consider upper bounds on the error probability in channel coding. We derive an improved maximum-likelihood union bound, which takes into account events where the likelihood of the correct codeword is tied with that of some competitors.…
A simple lemma is derived that allows to transform a general scalar (non-Gaussian, non-additive) continuous-alphabet channel as well as a general multiple-access channel into a modulo-additive noise channel. While in general the…
This work is devoted to dissipative extension theory for dissipative linear relations. We give a self-consistent theory of extensions by generalizing the theory on symmetric extensions of symmetric operators. Several results on the…
Recently, King and Ruskai [1] conjectured that the maximal p-norm of the Werner--Holevo channel is multiplicative for all $1\le p \le 2$. In this paper we prove this conjecture. Our proof relies on certain convexity and monotonicity…
We introduce a new framework for quantum channel discrimination in an adversarial setting, where the tester plays against an adversary. We show that in asymmetric hypothesis testing, the optimal type-II error exponent is precisely…
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an…
We address the question of the multiplicativity of the maximal p-norm output purities of bosonic Gaussian channels under Gaussian inputs. We focus on general Gaussian channels resulting from the reduction of unitary dynamics in larger…
We prove a general extension theorem for holomorphic line bundles on reduced complex spaces, equipped with singular hermitian metrics, whose curvature currents can be extended as positive, closed currents. The result has applications to…
After recalling definition, monotonicity, concavity, and continuity of a channel's entropy with respect to a state (finite dimensional cases only), I introduce the roof property, a convex analytic tool, and show its use in treating an…
We consider the discrete memoryless asymmetric broadcast channels. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this exponent…
Recent literature in the last Maximum Entropy workshop introduced an analogy between cumulative probability distributions and normalized utility functions. Based on this analogy, a utility density function can de defined as the derivative…
For any given channel $W$ with classical inputs and possibly quantum outputs, a dual classical-input channel $W^\perp$ can be defined by embedding the original into a channel $\mathcal N$ with quantum inputs and outputs. Here we give new…
We investigate the performance of parallel and adaptive quantum channel discrimination strategies for a finite number of channel uses. It has recently been shown that, in the asymmetric setting with asymptotically vanishing type I error…
The goal of this note is to show that Hastings' counterexample to the additivity of minimal output von Neumann entropy can be readily deduced from a sharp version of Dvoretzky's theorem on almost spherical sections of convex bodies.