Holevo's Theorem Research Articles

Generalized Holevo theorem and distinguishability notions

We present a generalization of the Holevo theorem through distance measures between quantum states, showing that each of these leads to an alternative Holevo theorem. This result involves two quantities: the distance-based Holevo quantity and the generalized accessible information Id. Additionally, we consider three distinguishability notions relevant to quantum cryptography, applying the resulting new inequalities to qubits ensembles. For some well-known distinguishability notion, we show that for any ensemble of two qubits the generalized quantities—Id and —are equal. On the other hand, by using a paradigmatic example, we show that the quantities corresponding to the Bures distance captures not only the non-commutativity of the ensemble but also its purity.

Inner privacy of conscious experiences and quantum information

The human mind is constituted by inner, subjective, private, first-person conscious experiences that cannot be measured with physical devices or observed from an external, objective, public, third-person perspective. The qualitative, phenomenal nature of conscious experiences also cannot be communicated to others in the form of a message composed of classical bits of information. Because in a classical world everything physical is observable and communicable, it is a daunting task to explain how an empirically unobservable, incommunicable consciousness could have any physical substrates such as neurons composed of biochemical molecules, water, and electrolytes. The challenges encountered by classical physics are exemplified by a number of thought experiments including the inverted qualia argument, the private language argument, the beetle in the box argument and the knowledge argument. These thought experiments, however, do not imply that our consciousness is nonphysical and our introspective conscious testimonies are untrustworthy. The principles of classical physics have been superseded by modern quantum physics, which contains two fundamentally different kinds of physical objects: unobservable quantum state vectors, which define what physically exists, and quantum operators (observables), which define what can physically be observed. Identifying consciousness with the unobservable quantum information contained by quantum physical brain states allows for application of quantum information theorems to resolve possible paradoxes created by the inner privacy of conscious experiences, and explains how the observable brain is constructed by accessible bits of classical information that are bound by Holevo's theorem and extracted from the physically existing quantum brain upon measurement with physical devices.

Minimax quantum state estimation under Bregman divergence

We investigate minimax estimators for quantum state tomography under general Bregman divergences. First, generalizing the work of Koyama et al. [Entropy 19, 618 (2017)] for relative entropy, we find that given any estimator for a quantum state, there always exists a sequence of Bayes estimators that asymptotically perform at least as well as the given estimator, on any state. Second, we show that there always exists a sequence of priors for which the corresponding sequence of Bayes estimators is asymptotically minimax (i.e. it minimizes the worst-case risk). Third, by re-formulating Holevo's theorem for the covariant state estimation problem in terms of estimators, we find that there exists a covariant measurement that is, in fact, minimax (i.e. it minimizes the worst-case risk). Moreover, we find that a measurement that is covariant only under a unitary 2-design is also minimax. Lastly, in an attempt to understand the problem of finding minimax measurements for general state estimation, we study the qubit case in detail and find that every spherical 2-design is a minimax measurement.

Holevo-type bounds for general quantum system

We consider an arbitrary von Neumann algebra with a finite trace as mathematical setup for a general quantum system. Three measures of dependence of states on measurements are presented. We indicate estimates of the mutual information, the function measure and the fidelity In particular we present extended Holevo theorem for the accessible information and the upper bound of generalized Kullback–Leibler divergence.

Analysis on Security Loophole of Two-Step Efficient Quantum Dialogue with Three-Particle Entangled W State

Very recently, Yin and Tang proposed a two-step efficient quantum dialogue (QD) protocol with three-particle entangled W state (Yin and Tang Int. J. Theor. Phys. 53, 2760 2014). In this Letter, the security loophole named information leakage, i.e., anybody else can elicit partial information of secret messages without any active attack, is discovered and deduced in detail. Furthermore, the essence of information leakage is studied from the viewpoint of Holevo theorem.

Properties of subentropy

Subentropy is an entropy-like quantity that arises in quantum information theory; for example, it provides a tight lower bound on the accessible information for pure state ensembles, dual to the von Neumann entropy upper bound in Holevo's theorem. Here we establish a series of properties of subentropy, paralleling the well-developed analogous theory for von Neumann entropy. Further, we show that subentropy is a lower bound for min-entropy. We introduce a notion of conditional subentropy and show that it can be used to provide an upper bound for the guessing probability of any classical-quantum state of two qubits; we conjecture that the bound applies also in higher dimensions. Finally, we give an operational interpretation of subentropy within classical information theory.

Applications of single-qubit rotations in quantum public-key cryptography

We discuss cryptographic applications of single-qubit rotations from the perspective of trapdoor one-way functions and public-key encryption. In particular, we present an asymmetric cryptosystem whose security relies on fundamental principles of quantum physics. A quantum public key is used for the encryption of messages while decryption is possible by means of a classical private key only. The trapdoor one-way function underlying the proposed cryptosystem maps integer numbers to quantum states of a qubit and its inversion can be infeasible by virtue of the Holevo's theorem.

Quantum Communication Complexity

Can quantum communication be more efficient than its classical counterpart? Holevo's theorem rules out the possibility of communicating more than n bits of classical information by the transmission of n quantum bits—unless the two parties are entangled, in which case twice as many classical bits can be communicated but no more. In apparent contradiction, there are distributed computational tasks for which quantum communication cannot be simulated efficiently by classical means. In some cases, the effect of transmitting quantum bits cannot be achieved classically short of transmitting an exponentially larger number of bits. In a similar vein, can entanglement be used to save on classical communication? It is well known that entanglement on its own is useless for the transmission of information. Yet, there are distributed tasks that cannot be accomplished at all in a classical world when communication is not allowed, but that become possible if the non-communicating parties share prior entanglement. This leads to the question of how expensive it is, in terms of classical communication, to provide an exact simulation of the spooky power of entanglement.

Dense quantum coding and quantum finite automata

We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from the original m bits can be recovered with good probability. We show that nontrivial quantum codes exist that have no classical counterparts. On the other hand, we show that quantum encoding cannot save more than a logarithmic additive factor over the best classical encoding. The proof is based on an entropy coalescence principle that is obtained by viewing Holevo's theorem from a new perspective.In the existing implementations of quantum computing, qubits are a very expensive resource. Moreover, it is difficult to reinitialize existing bits during the computation. In particular, reinitialization is impossible in NMR quantum computing, which is perhaps the most advanced implementation of quantum computing at the moment. This motivates the study of quantum computation with restricted memory and no reinitialization, that is, of quantum finite automata. It was known that there are languages that are recognized by quantum finite automata with sizes exponentially smaller than those of corresponding classical automata. Here, we apply our technique to show the surprising result that there are languages for which quantum finite automata take exponentially more states than those of corresponding classical automata.

Quantum key distribution in the Holevo limit.

A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, E, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is E < or = 1. The problem addressed here is whether the limit E = 1 can be achieved. It is showed that it can be done by splitting the secret bits between several qubits and forcing Eve to have only a sequential access to the qubits, as proposed by Goldenberg and Vaidman. A protocol with E = 1 based on polarized photons and in which Bob's state discrimination can be implemented with linear optical elements is presented.

Universal quantum limits on single-channel information, entropy, and heat flow

We show that the recently discovered universal upper bound on the thermal conductance of a single channel comprising particles obeying arbitrary fractional statistics is in fact a consequence of a more general universal upper bound, involving the averaged entropy and energy currents of a single channel connecting heat reservoirs with arbitrary temperatures and chemical potentials. The latter upper bound in turn leads, via Holevo's theorem, to a universal (i.e., statistics independent) upper bound on the optimum capacity for classical information transmission down a single, wideband quantum channel.