Related papers: Accessible versus Holevo Information for a Binary …
Hybrid systems - more precisely, their mathematical models - can exhibit behaviors, like Zeno behaviors, that are absent in purely discrete or purely continuous systems. First, we observe that, in this context, the usual definition of…
We consider the scenario in which Alice transmits private classical messages to Bob via a classical-quantum channel, part of whose output is intercepted by an eavesdropper, Eve. We prove the existence of a universal coding scheme under…
We introduce the informational correlation $E^{AB}$ between two interacting quantum subsystems $A$ and $B$ of a quantum system as the number of arbitrary parameters $\varphi_i$ of a unitary transformation $U^A$ (locally performed on the…
Markov decision processes model systems subject to nondeterministic and probabilistic uncertainty. A plethora of verification techniques addresses variations of reachability properties, such as: Is there a scheduler resolving the…
Quantum technology is progressing towards fast quantum control over systems interacting with small environments. Hence such technologies are operating in a regime where the environment remembers the system's past, and the applicability of…
In a Letter, Cabello proposed a quantum key distribution (QKD) Protocol which attended to Holevo limit. In this comment, we show that Eve could use a simple plan to distinguish among quantum keys, without being detected by Alice and Bob. In…
Quantum information distribution in a tripartite state plays a fundamental role in quantum information processes. Here we investigate how a bipartite unitary transformation $U_{AB}$ redistributes the quantum mutual information with the…
We imagine an experiment on an unknown quantum mechanical system in which the system is prepared in various ways and a range of measurements are performed. For each measurement M and preparation rho the experimenter can determine, given…
The following problem is considered: given a joint distribution $P_{XY}$ and an event $E$, bound $P_{XY}(E)$ in terms of $P_XP_Y(E)$ (where $P_XP_Y$ is the product of the marginals of $P_{XY}$) and a measure of dependence of $X$ and $Y$.…
Binary quantum information can be fault tolerantly encoded in states defined in infinite dimensional Hilbert spaces. Such states define a computational basis, and permit a perfect equivalence between continuous and discrete universal…
The assumption that detection and/or state-preparation devices used for continuous-variable quantum key distribution (CV-QKD) are beyond influence of potential eavesdroppers leads to a significant performance enhancement in terms of…
We present numerical results on the capacities of two-qubit unitary operations for creating entanglement and increasing the Holevo information of an ensemble. In all cases tested, the maximum values calculated for the capacities based on…
We say that two (or more) state assignments for one and the same quantum system are compatible if they could represent the assignments of observers with differing information about the system. A criterion for compatibility was proposed in…
By combining a bound on the absolute value of the difference of mutual information between two joint probablity distributions with a fixed variational distance, and a bound on the probability of a maximal deviation in variational distance…
Partial information decomposition (PID) of the multivariate mutual information describes the distinct ways in which a set of source variables contains information about a target variable. The groundbreaking work of Williams and Beer has…
The coherent superposition of quantum states is an important resource for quantum information processing which distinguishes quantum dynamics and information from their classical counterparts. In this article we determine the coherence…
Unconditionally secure non-relativistic bit commitment is known to be impossible in both the classical and the quantum worlds. But when committing to a string of n bits at once, how far can we stretch the quantum limits? In this paper, we…
We define the information threshold as the point of maximum curvature in the prior vs. posterior Bayesian curve, both of which are described as a function of the true positive and negative rates of the classification system in question. The…
We formulate and analyze the compound information bottleneck programming. In this problem, a Markov chain $ \mathsf{X} \rightarrow \mathsf{Y} \rightarrow \mathsf{Z} $ is assumed with fixed marginal distributions $\mathsf{P}_{\mathsf{X}}$…
The data for many classification problems, such as pattern and speech recognition, follow mixture distributions. To quantify the optimum performance for classification tasks, the Shannon mutual information is a natural information-theoretic…