Related papers: Coding theorems for compound problems via quantum …
This work investigates binary hypothesis testing between $H_0\sim P_0$ and $H_1\sim P_1$ in the finite-sample regime under asymmetric error constraints. By employing the ``reverse" R\'enyi divergence, we derive novel non-asymptotic bounds…
We extend the recent proof of the Generalized Quantum Stein's Lemma by Hayashi and Yamasaki [arXiv:2408.02722] to classical-quantum (c-q) channels. We analyze the composite hypothesis testing problem of testing a c-q channel…
Quantum generalizations of R\'enyi's entropies are a useful tool to describe a variety of operational tasks in quantum information processing. Two families of such generalizations turn out to be particularly useful: the Petz quantum R\'enyi…
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…
In a certain sense we generalize the recently introduced and extensively studied notion called quantum R\'enyi divergence (in another name, sandwiched R\'enyi relative entropy) and describe the structures of corresponding symmetries. More…
We study the Hoeffding regime of composite quantum hypothesis testing, in which each hypothesis is specified by a sequence of sets of quantum states. We establish quantum Hoeffding bounds under a set of structural assumptions, orthogonal to…
Quantum entanglement is one essential element to characterize many-body quantum systems. However, the entanglement measures are mostly discussed in Hermitian systems. Here, we propose a natural extension of entanglement and R\'enyi…
We extend quantum Stein's lemma in asymmetric quantum hypothesis testing to composite null and alternative hypotheses. As our main result, we show that the asymptotic error exponent for testing convex combinations of quantum states…
We obtain two new additivity results of quantum channels. The first one is the additivity of the channel R\'enyi information associated with the sandwiched R\'enyi divergence of order $\alpha\in[\frac{1}{2},1)$. To prove this, we introduce…
We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users…
R\'enyi and Augustin information are generalizations of mutual information defined via the R\'enyi divergence, playing a significant role in evaluating the performance of information processing tasks by virtue of its connection to the error…
The quantum trajectory sensing problem seeks quantum sensor states which enable the trajectories of incident particles to be distinguished using a single measurement. For an $n$-qubit sensor state to unambiguously discriminate a set of…
Baranyai's theorem is a well-known theorem in the theory of hypergraphs. A corollary of this theorem says that one can partition the family of all $u$-subsets of an $n$-element set into ${n-1\choose u-1}$ sub-families such that each…
The R\'enyi and Shannon entropies are information-theoretic measures which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation.…
We propose a method for universal fault-tolerant quantum computation using concatenated quantum error correcting codes. Namely, other than computational basis state preparation as required by the DiVincenzo criteria [1], our scheme requires…
Quantum coherence is one of the most important resources in quantum information. Indeed, preventing the loss of coherence is one of the most important technical challenges obstructing the development of large-scale quantum computers.…
We provide the sandwiched R\'enyi divergence of order $\alpha\in(\frac{1}{2},1)$, as well as its induced quantum information quantities, with an operational interpretation in the characterization of the exact strong converse exponents of…
Quantum codes are subspaces of the state space of a quantum system that are used to protect quantum information. Some common classes of quantum codes are stabilizer (or additive) codes, non-stabilizer (or non-additive) codes obtained from…
Quantum computers herald the arrival of a new era in which previously intractable computational problems will be solved efficiently. However, quantum technology is held down by decoherence, a phenomenon that is omnipresent in the quantum…
Our capacity to process information depends on the computational power at our disposal. Information theory captures our ability to distinguish states or communicate messages when it is unconstrained with unrivaled beauty and elegance. For…