Related papers: Accessible versus Holevo Information for a Binary …
In this paper a numerical method is presented, which finds a lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have a variational distance not greater than a known…
For a pair of incompatible quantum measurements, the total uncertainty can be bounded by a state-independent constant. However, such a bound can be violated if the quantum system is entangled with another quantum system (called memory); the…
Classical probabilistic models of (noisy) quantum systems are not only relevant for understanding the non-classical features of quantum mechanics, but they are also useful for determining the possible advantage of using quantum resources…
Quantum information, though not precisely defined, is a fundamental concept of quantum information theory which predicts many fascinating phenomena and provides new physical resources. A basic problem is to recognize the features of quantum…
The processing of quantum information is limited by fundamental physical constraints on how information can be encoded, transmitted, and extracted. In particular, the non-orthogonality of quantum states limits their distinguishability, and…
A Holevo measure is used to discuss how much information about a given POVM on system $a$ is present in another system $b$, and how this influences the presence or absence of information about a different POVM on $a$ in a third system $c$.…
The Holevo bound is a bound on the mutual information for a given quantum encoding. In 1996 Schumacher, Westmoreland and Wootters [Schumacher, Westmoreland and Wootters, Phys. Rev. Lett. 76, 3452 (1996)] derived a bound which reduces to the…
What would be the consequences if there were fundamental limits to our ability to experimentally explore the world? In this work we seriously consider this question. We assume the existence of statements whose truth value is not…
We present a new notion $R_\ell$ of higher-order common information, which quantifies the information that $\ell\geq 2$ arbitrarily distributed random variables have in common. We provide analytical lower bounds on $R_3$ and $R_4$ for…
Random access coding is an information task that has been extensively studied and found many applications in quantum information. In this scenario, Alice receives an $n$-bit string $x$, and wishes to encode $x$ into a quantum state…
Around the turn of the century, Shor formulated his well-known and still-open conjecture stating that the accessible information of any quantum dichotomy, that is the maximum amount of classical information that can be decoded from a binary…
The entropy of the Gram matrix of a joint purification of an ensemble of K mixed states yields an upper bound for the Holevo information Chi of the ensemble. In this work we combine geometrical and probabilistic aspects of the ensemble in…
We present a generalization of the Holevo theorem by means of distances used in the definition of distinguishability of states, showing that each one leads to an alternative Holevo theorem. This result involves two quantities: the…
We show that information gain in a qubit measurement is optimal under a Von Neumann measurement. For an initially mixed apparatus kept in touch with a qubit, the conditions for achieving the equality sign of Holevo bound on the information…
We consider the problem of compression of the quantum information carried by ensemble of mixed states. We prove that for arbitrary coding schemes the least number of qubits needed to convey the signal states asymptotically faithfully is…
We investigate how special relativity influences the transmission of classical information through quantum channels by evaluating the Holevo bound when the sender and the receiver are in (relativistic) relative motion. By using the spin…
We present a family of easily computable upper bounds for the Holevo quantity of ensemble of quantum states depending on a reference state as a free parameter. These upper bounds are obtained by combining probabilistic and metric…
We show how the fundamental entropic inequality proved recently in [arXiv:2408.15306] can be applied to obtain a useful relation for the Holevo quantity of discrete and continuous ensembles of quantum states. This relation gives a tight…
One of the main notions of information theory is the notion of mutual information in two messages (two random variables in Shannon information theory or two binary strings in algorithmic information theory). The mutual information in $x$…
We investigate bounds in the transmission of classical information through quantum systems. Our focus lies in the generalized Holevo theorem, which provides a single-letter Holevo-like inequality from arbitrary quantum distance measures.…