相关论文: Accessible versus Holevo Information for a Binary …
The uncertainty principle is the most important feature of quantum mechanics, which can be called the heart of quantum mechanics. This principle sets a lower bound on the uncertainties of two incompatible measurement. In quantum information…
Mutual information (MI) is a fundamental quantity in information theory and machine learning. However, direct estimation of MI is intractable, even if the true joint probability density for the variables of interest is known, as it involves…
This paper studies an information-theoretic one-shot variable-length secret key agreement problem with public discussion. Let $X$ and $Y$ be jointly distributed random variables, each taking values in some measurable space. Alice and Bob…
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However,…
The definition of accessible coherence is proposed. Through local measurement on the other subsystem and one way classical communication, a subsystem can access more coherence than the coherence of its density matrix. Based on the local…
A quantum ensemble $\{(p_x, \rho_x)\}$ is a set of quantum states each occurring randomly with a given probability. Quantum ensembles are necessary to describe situations with incomplete a priori information, such as the output of a…
In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is…
We highlight an information-theoretic meaning of quantum discord as the gap between the ac- cessible information and the Holevo bound in the framework of ensemble of quantum states. This complementary relationship implies that a large…
The Holevo bound is a keystone in many applications of quantum information theory. We propose "weak maximal Holevo quantity" with weak measurements as the generalization of the standard Holevo quantity which is defined as the optimal…
Modern applications of AI involve training and deploying machine learning models across heterogeneous and potentially massive environments. Emerging diversity of data not only brings about new possibilities to advance AI systems, but also…
If the conditional information of a classical probability distribution of three random variables is zero, then it obeys a Markov chain condition. If the conditional information is close to zero, then it is known that the distance (minimum…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
In this paper we introduce the concept of quantum private channel within the continuous variables framework (CVPQC) and investigate its properties. In terms of CVPQC we naturally define a "maximally" mixed state in phase space together with…
The notion of divergence information of an ensemble of probability distributions was introduced by Jain, Radhakrishnan, and Sen in the context of the ``substate theorem''. Since then, divergence has been recognized as a more natural measure…
In a recent paper \cite{Redei-Jing2026} the notion of conditional $p$-inaccessibility of a decision based on utility maximization was defined and examples of conditionally $p$-inaccessible decisions were given. The conditional…
Locally accessible information is a useful information-theoretic physical quantity of an ensemble of multiparty quantum states. We find it has properties akin to quantum as well as classical correlations of single multiparty quantum states.…
Reshef et al. recently proposed a new statistical measure, the "maximal information coefficient" (MIC), for quantifying arbitrary dependencies between pairs of stochastic quantities. MIC is based on mutual information, a fundamental…
In order to be practically useful, quantum cryptography must not only provide a guarantee of secrecy, but it must provide this guarantee with a useful, sufficiently large throughput value. The standard result of generalized privacy…
This note will introduce some notation and definitions for information theoretic quantities in the context of quantum systems, such as (conditional) entropy and (conditional) mutual information. We will employ the natural C*-algebra…
We propose a new framework for reasoning about information in complex systems. Our foundation is based on a variational extension of Shannon's information theory that takes into account the modeling power and computational constraints of…