English
Related papers

Related papers: On Strong Converse Theorems for Quantum Hypothesis…

200 papers

We present an information theoretic proof of the nonsignalling multiprover parallel repetition theorem, a recent extension of its two-prover variant that underlies many hardness of approximation results. The original proofs used de Finetti…

Information Theory · Computer Science 2019-02-01 Himanshu Tyagi , Shun Watanabe

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede's…

Quantum Physics · Physics 2007-05-23 R. Ahlswede , A. Winter

A fundamental tool to prove inner bounds in classical network information theory is the so-called conditional joint typicality lemma. In addition to the lemma, one often uses unions and intersections of typical sets in the inner bound…

Quantum Physics · Physics 2020-12-25 Pranab Sen

A well-known technique in estimating probabilities of rare events in general and in information theory in particular (used, e.g., in the sphere-packing bound), is that of finding a reference probability measure under which the event of…

Information Theory · Computer Science 2014-12-23 Rami Atar , Neri Merhav

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…

Quantum Physics · Physics 2024-10-15 Aadil Oufkir , Yongsheng Yao , Mario Berta

The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during the last period, when a number of direct quantum coding theorems was discovered. To considerable extent…

Quantum Physics · Physics 2007-05-23 A. S. Holevo

In terms of the Dirac representation of sample mean and the weak convergence of empirical distributions that holds almost surely, we construct a new proof for a strong law of large numbers of Kolmogorov's type with i.i.d. random variables…

Probability · Mathematics 2020-09-02 Yu-Lin Chou

The R\'enyi information measures are characterized in terms of their Shannon counterparts, and properties of the former are recovered from first principle via the associated properties of the latter. Motivated by this characterization, a…

Information Theory · Computer Science 2016-03-14 Ofer Shayevitz

Detecting the presence of multiple incoherent sources is a fundamental and challenging task for quantum imaging, especially within sub-Rayleigh region. In this paper, the discrimination of one-versus-two point-like incoherent sources in…

Quantum Physics · Physics 2024-11-06 Jian-Dong Zhang , Mei-Ming Zhang , Chuang Li , Shuai Wang

We explore the classical communication over quantum channels with one sender and two receivers, or with two senders and one receiver, First, for the quantum broadcast channel (QBC) and the quantum multi-access channel (QMAC), we study the…

Quantum Physics · Physics 2017-12-18 Wei Xie , Xin Wang , Runyao Duan

The ultimate limits of quantum state discrimination are often thought to be captured by asymptotic bounds that restrict the achievable error probabilities, notably the quantum Chernoff and Hoeffding bounds. Here we study hypothesis testing…

Quantum Physics · Physics 2025-12-10 Kaiyuan Ji , Bartosz Regula

We prove a lower bound on the relative entropy between two finite-dimensional states in terms of their entropy difference and the dimension of the underlying space. The inequality is tight in the sense that equality can be attained for any…

Quantum Physics · Physics 2015-03-16 David Reeb , Michael M. Wolf

We consider the $k$-user successive refinement problem with causal decoder side information and derive an exponential strong converse theorem. The rate-distortion region for the problem can be derived as a straightforward extension of the…

Information Theory · Computer Science 2019-05-22 Lin Zhou , Alfred Hero

The quantum dichotomies problem asks at what rate one pair of quantum states can be approximately mapped into another pair of quantum states. In the many copy limit and for vanishing error, the optimal rate is known to be given by the ratio…

Quantum Physics · Physics 2025-04-03 Mario Berta , Yongsheng Yao

Channel simulation is to simulate a noisy channel using noiseless channels with unlimited shared randomness. This can be interpreted as the reverse problem to Shannon's noisy coding theorem. In contrast to previous works, our approach…

Information Theory · Computer Science 2025-06-06 Shi-Bing Li , Ke Li , Lei Yu

We consider the problem of source compression under three different scenarios in the one-shot (non- asymptotic) regime. To be specific, we prove one-shot achievability and converse bounds on the coding rates for distributed source coding,…

Information Theory · Computer Science 2015-12-11 Naqueeb Ahmad Warsi

Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the…

Information Theory · Computer Science 2016-04-07 Gonzalo Vazquez-Vilar , Adrià Tauste Campo , Albert Guillén i Fàbregas , Alfonso Martinez

We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…

Quantum Physics · Physics 2015-06-23 Boaz Tamir , Eliahu Cohen , Avner Priel

This paper proposes a framework for semantic hypothesis testing tailored to imaging inverse problems. Modern imaging methods struggle to support hypothesis testing, a core component of the scientific method that is essential for the…

Machine Learning · Statistics 2025-05-29 Yiming Xi , Konstantinos Zygalakis , Marcelo Pereyra

We study the properties of output distributions of noisy, random circuits. We obtain upper and lower bounds on the expected distance of the output distribution from the "useless" uniform distribution. These bounds are tight with respect to…

‹ Prev 1 4 5 6 7 8 10 Next ›