We prove a no-broadcasting theorem for the Holevo information of a noncommuting ensemble stating that no operation can generate a bipartite ensemble such that both copies have the same information as the original. We argue that upper bounds on the average information over both copies imply lower bounds on the quantum capacity required to send the ensemble without information loss. This is because a channel with zero quantum capacity has a unitary extension transferring at least as much information to its environment as it transfers to the output. For an ensemble being the time orbit of a pure state under a Hamiltonian evolution, we derive such a bound on the required quantum capacity in terms of properties of the input and output energy distribution. Moreover, we discuss relations between the broadcasting problem and entropy power inequalities. The broadcasting problem arises when a signal should be transmitted by a time-invariant device such that the outgoing signal has the same timing information as the incoming signal had. Based on previous results we argue that this establishes a link between quantum information theory and the theory of low power computing because the loss of timing information implies loss of free energy.
We prove a no-broadcasting theorem for the Holevo information of a noncommuting ensemble stating that no operation can generate a bipartite ensemble such that both copies have the same information as the original. We argue that upper bounds on the average information over both copies imply lower bounds on the quantum capacity required to send the ensemble without information loss. This is because a channel with zero quantum capacity has a unitary extension transferring at least as much information to its environment as it transfers to the output. For an ensemble being the time orbit of a pure state under a Hamiltonian evolution, we derive such a bound on the required quantum capacity in terms of properties of the input and output energy distribution. Moreover, we discuss relations between the broadcasting problem and entropy power inequalities. The broadcasting problem arises when a signal should be transmitted by a time-invariant device such that the outgoing signal has the same timing information as the incoming signal had. Based on previous results we argue that this establishes a link between quantum information theory and the theory of low power computing because the loss of timing information implies loss of free energy.
The optimal rate at which information can be sent through a quantum channel when the transmitted signal must simultaneously carry some minimum amount of energy is characterized. To do so, we introduce the quantum-classical analog of the capacity-power function, and we generalize results in classical information theory for transmitting classical information through noisy channels. We show that the capacity-power function for a classical-quantum channel, for both unassisted and private protocol, is concave, and we also prove additivity for unentangled and uncorrelated ensembles of input signals for such channels. This implies that we do not need regularized formulas for calculation. We show that these properties also hold for all noiseless channels when we restrict the set of input states to be pure quantum states. For general channels, we geometrically prove that the capacity-power function is piecewise concave, with further support from numerical simulations. Further, we connect channel capacity to properties of random quantum states. In particular, we obtain analytical expressions for the capacity-power function for the case of noiseless channels using properties of random quantum states under an energy constraint and concentration phenomena in large Hilbert spaces.
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 systems responsible for those phenomena. One of these important features is that non-commuting quantum states cannot be broadcast: two copies cannot be obtained out of a single copy, not even reproduced marginally on separate systems. We focus on the difference in information content between one copy and two copies, which is a basic manifestation of the gap between quantum and classical information. We show that if the chosen information measure is the Holevo quantity, the difference between the information content of one copy and two copies is zero if and only if the states can be broadcast. We propose a new approach in defining measures of quantumness of ensembles based on the difference in information content between the original ensemble and the ensemble of duplicated states. We comment on the permanence property of quantum states and the recently introduced superbroadcasting operation. We also provide an appendix where we discuss the status of quantum information in quantum physics, based on the so-called isomorphism principle.
Previous work on the classical information capacities of bosonic channels has established the capacity of the single-user pure-loss channel, bounded the capacity of the single-user thermal-noise channel, and bounded the capacity region of the multiple-access channel. The latter is a multiple-user scenario in which several transmitters seek to simultaneously and independently communicate to a single receiver. We study the capacity region of the bosonic broadcast channel, in which a single transmitter seeks to simultaneously and independently communicate to two different receivers. It is known that the tightest available lower bound on the capacity of the single-user thermal-noise channel is that channel's capacity if, as conjectured, the minimum von Neumann entropy at the output of a bosonic channel with additive thermal noise occurs for coherent-state inputs. Evidence in support of this minimum output entropy conjecture has been accumulated, but a rigorous proof has not been obtained. We propose a minimum output entropy conjecture that, if proved to be correct, will establish that the capacity region of the bosonic broadcast channel equals the inner bound achieved using a coherent-state encoding and optimum detection. We provide some evidence that supports this conjecture, but again a full proof is not available.
Quantum channels, also called quantum operations, are linear, trace preserving and completely positive transformations in the space of quantum states. Such operations describe discrete time evolution of an open quantum system interacting with an environment. The thesis contains an analysis of properties of quantum channels and different entropies used to quantify the decoherence introduced into the system by a given operation. Part I of the thesis provides a general introduction to the subject. In Part II, the action of a quantum channel is treated as a process of preparation of a quantum ensemble. The Holevo information associated with this ensemble is shown to be bounded by the entropy exchanged during the preparation process between the initial state and the environment. A relation between the Holevo information and the entropy of an auxiliary matrix consisting of square root fidelities between the elements of the ensemble is proved in some special cases. Weaker bounds on the Holevo information are also established. The entropy of a channel, also called the map entropy, is defined as the entropy of the state corresponding to the channel by the Jamiolkowski isomorphism. In Part III of the thesis, the additivity of the entropy of a channel is proved. The minimal output entropy, which is difficult to compute, is estimated by an entropy of a channel which is much easier to obtain. A class of quantum channels is specified, for which additivity of channel capacity is conjectured. The last part of the thesis contains characterization of Davies channels, which correspond to an interaction of a state with a thermal reservoir in the week coupling limit, under the condition of quantum detailed balance and independence of rotational and dissipative evolutions. The Davies channels are characterized for one-qubit and one-qutrit systems.
The resource theory of coherence quantifies the quantum properties of states and their role in quantum information processing. Extending coherence theory to ensembles, the natural objects in quantum communication, remains an active research direction, with their operational potential still being explored. In this work, we establish a maximally coherent ensemble in every finite dimension: the continuous ensemble of pure states distributed according to the normalized Haar measure attains the tight upper bound on basis-free relative entropy ensemble coherence. We then prove that ensemble coherence bounds the effective informational advantage of postselective measurements over the Holevo quantity for two equiprobable pure states. Finally, for the qubit B92 QKD protocol, we show that the coherence of Alice's ensemble upper-bounds the secret key rate in the asymptotic regime. These results give ensemble coherence a quantitative operational meaning in quantum communication and cryptography
Characterizing information-carrying capacities of bosonic communication channels is of significant practical interest. For thermal noise channels, using coherent (product) states yields an achievable rate for classical communication which is conjectured to be optimal. However, it is not known whether coding strategies using entanglement may perform better. Here we discuss upper bounds on classical capacities of thermal noise channels. These imply that coherent-state coding is close to optimal. Our main tool is a quantum analog of the entropy power inequality introduced Shannon. It gives a lower bound on the output von Neumann entropy when two independent signals combine at a beamsplitter.