On Strong Converse Theorems for Quantum Hypothesis Testing and Channel Coding
- URL: http://arxiv.org/abs/2403.13584v1
- Date: Wed, 20 Mar 2024 13:34:23 GMT
- Title: On Strong Converse Theorems for Quantum Hypothesis Testing and Channel Coding
- Authors: Hao-Chung Cheng, Li Gao,
- Abstract summary: Strong converse theorems refer to the study of impossibility results in information theory.
Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing.
We show that the variational expression of measured R'enyi divergences is a direct consequence of H"older's inequality.
- Score: 16.207627554776916
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which servers as a primitive tool for establishing a variety of tight strong converse theorems in quantum information theory. In this short note, we demonstrate an alternative one-line proof for this bound via the variational expression of measured R\'enyi divergences [Lett. Math. Phys, 107(12), 2017]. Then, we show that the variational expression is a direct consequence of H\"older's inequality.
Related papers
- Machine Learning of the Prime Distribution [49.84018914962972]
We provide a theoretical argument explaining the experimental observations of Yang-Hui He about the learnability of primes.
We also posit that the ErdHos-Kac law would very unlikely be discovered by current machine learning techniques.
arXiv Detail & Related papers (2024-03-19T09:47:54Z) - Connecting classical finite exchangeability to quantum theory [69.62715388742298]
Exchangeability is a fundamental concept in probability theory and statistics.
We show how a de Finetti-like representation theorem for finitely exchangeable sequences requires a mathematical representation which is formally equivalent to quantum theory.
arXiv Detail & Related papers (2023-06-06T17:15:19Z) - Limit theorems for Quantum Trajectories [0.0]
We prove Law of Large Numbers (LLN), Functional Central Limit Theorem, Law of Iterated Logarithm and Moderate Deviation Principle.
Proof of the LLN is based on Birkhoff's ergodic theorem and an analysis of harmonic functions.
The other theorems are proved using martingale approximation of empirical sums.
arXiv Detail & Related papers (2023-02-13T08:57:57Z) - Generalized Gleason theorem and finite amount of information for the
context [0.0]
Quantum processes cannot be reduced to classical processes without specifying the context in the description of a measurement procedure.
We consider a class of hidden variable theories by assuming that the amount of information about the measurement context is finite.
arXiv Detail & Related papers (2022-06-23T16:55:50Z) - Correspondence Between the Energy Equipartition Theorem in Classical
Mechanics and its Phase-Space Formulation in Quantum Mechanics [62.997667081978825]
In quantum mechanics, the energy per degree of freedom is not equally distributed.
We show that in the high-temperature regime, the classical result is recovered.
arXiv Detail & Related papers (2022-05-24T20:51:03Z) - Monotonicity versions of Epstein's Concavity Theorem and related
inequalities [3.42658286826597]
Many trace inequalities can be expressed either as concavity/ entropy theorems or as monotonicity theorems.
A classic example is the joint convexity of the quantum entropy is equivalent to the Data Processing Inequality.
arXiv Detail & Related papers (2022-05-04T22:08:37Z) - Incompatibility of observables, channels and instruments in information
theories [68.8204255655161]
We study the notion of compatibility for tests of an operational probabilistic theory.
We show that a theory admits of incompatible tests if and only if some information cannot be extracted without disturbance.
arXiv Detail & Related papers (2022-04-17T08:44:29Z) - Why we should interpret density matrices as moment matrices: the case of
(in)distinguishable particles and the emergence of classical reality [69.62715388742298]
We introduce a formulation of quantum theory (QT) as a general probabilistic theory but expressed via quasi-expectation operators (QEOs)
We will show that QT for both distinguishable and indistinguishable particles can be formulated in this way.
We will show that finitely exchangeable probabilities for a classical dice are as weird as QT.
arXiv Detail & Related papers (2022-03-08T14:47:39Z) - Theorems motivated by foundations of quantum mechanics and some of their
applications [0.0]
This paper provides theorems aimed at shedding light on issues in the foundations of quantum mechanics.
theorems can be used to propose new interpretations to the theory, or to better understand, evaluate and improve current interpretations.
arXiv Detail & Related papers (2022-02-02T21:55:57Z) - A refinement of Reznick's Positivstellensatz with applications to
quantum information theory [72.8349503901712]
In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares.
Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
arXiv Detail & Related papers (2019-09-04T11:46:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.