English
Related papers

Related papers: Strong data processing inequalities and $\Phi$-Sob…

200 papers

We derive an approximate expression for mutual information in a broad class of discrete-time stationary channels with continuous input, under the constraint of vanishing input amplitude or power. The approximation describes the input by its…

Information Theory · Computer Science 2015-05-19 Lubomir Kostal

The goal of a denoising algorithm is to recover a signal from its noise-corrupted observations. Perfect recovery is seldom possible and performance is measured under a given single-letter fidelity criterion. For discrete signals corrupted…

Information Theory · Computer Science 2007-07-13 George Gemelos , Styrmir Sigurjonsson , Tsachy Weissman

We investigate the fundamental limits of reliable communication over multi-view channels, in which the channel output is comprised of a large number of independent noisy views of a transmitted symbol. We consider first the setting of…

Information Theory · Computer Science 2024-05-14 V. Arvind Rameshwar , Nir Weinberger

Let $\nu$ and $\mu$ be probability distributions on $\mathbb{R}^n$, and $\nu_s,\mu_s$ be their evolution under the heat flow, that is, the probability distributions resulting from convolving their density with the density of an isotropic…

Information Theory · Computer Science 2024-06-06 Bo'az Klartag , Or Ordentlich

Distributed approaches to secondary frequency control have become a way to address the need for more flexible control schemes in power networks with increasingly distributed generation. The distributed averaging proportional-integral (DAPI)…

Optimization and Control · Mathematics 2018-03-01 Hendrik Flamme , Emma Tegling , Henrik Sandberg

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the…

Quantum Physics · Physics 2017-12-06 Alexander Müller-Hermes , Daniel Stilck Franca , Michael M. Wolf

In classical information theory, the Doeblin coefficient of a classical channel provides an efficiently computable upper bound on the total-variation contraction coefficient of the channel, leading to what is known as a strong…

Quantum Physics · Physics 2026-05-27 Ian George , Christoph Hirche , Theshani Nuradha , Mark M. Wilde

We study quantum channels that are close to another channel with weakly additive Holevo information and derive upper bounds on their classical capacity. Examples of channels with weakly additive Holevo information are entanglement-breaking…

Quantum Physics · Physics 2020-08-25 Felix Leditzky , Eneet Kaur , Nilanjana Datta , Mark M. Wilde

We show that a sequence $\{\Phi_n\}$ of quantum channels strongly converges to a quantum channel $\Phi_0$ if and only if there exist a common environment for all the channels and a corresponding sequence $\{V_n\}$ of Stinespring isometries…

Quantum Physics · Physics 2020-09-01 M. E. Shirokov

Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources…

Quantum Physics · Physics 2020-03-16 Iman Marvian

The data processing inequality (DPI) is a scalar inequality satisfied by distinguishability measures on density matrices. For some distinguishability measures, saturation of the scalar DPI implies an operator equation relating the arguments…

Quantum Physics · Physics 2022-02-22 Sam Cree , Jonathan Sorce

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…

Quantum Physics · Physics 2025-01-09 Michael G. Jabbour , Nilanjana Datta

Similarity-sensitive entropy measures the uncertainty of a probability law relative to a similarity kernel that encodes the distinguishability between states. We develop a measure-theoretic treatment covering both finite similarity matrices…

Probability · Mathematics 2026-05-29 Joseph Samuel Miller

Discrete stochastic optimization considers the problem of minimizing (or maximizing) loss functions defined on discrete sets, where only noisy measurements of the loss functions are available. The discrete stochastic optimization problem is…

Optimization and Control · Mathematics 2013-11-04 Qi Wang

We study distributed similarity estimation of quantum channels (DSEC), a primitive for cross-platform verification where two remote quantum devices are compared by estimating the inner product of their Choi states. We show that the optimal…

Quantum Physics · Physics 2026-01-19 Congcong Zheng , Kun Wang , Xutao Yu , Ping Xu , Zaichen Zhang

We study the problem of strong coordination of the actions of two nodes $X$ and $Y$ that communicate over a discrete memoryless channel (DMC) such that the actions follow a prescribed joint probability distribution. We propose two novel…

Information Theory · Computer Science 2021-06-29 Sarah A. Obead , Badri N. Vellambi , Jörg Kliewer

This paper studies the basic question of whether a given channel $V$ can be dominated (in the precise sense of being more noisy) by a $q$-ary symmetric channel. The concept of "less noisy" relation between channels originated in network…

Information Theory · Computer Science 2018-12-04 Anuran Makur , Yury Polyanskiy

This paper considers a discrete time-Poisson noise channel which is used to model pulse-amplitude modulated optical communication with a direct-detection receiver. The goal of this paper is to obtain insights into the capacity and the…

Information Theory · Computer Science 2021-11-23 Luca Barletta , Alex Dytso

A generic qubit unitary operator affected by depolarizing noise is duplicated and inserted in a quantum switch process realizing a superposition of causal orders. The characterization of the resulting switched quantum channel is worked out…

Quantum Physics · Physics 2021-04-14 Francois Chapeau-Blondeau

We consider a new functional inequality controlling the rate of relative entropy decay for random walks, the interchange process and more general block-type dynamics for permutations. The inequality lies between the classical logarithmic…

Probability · Mathematics 2022-05-12 Alexandre Bristiel , Pietro Caputo