Optimal Remote State Preparation

We prove that it is possible to remotely prepare an ensemble of non-commuting mixed states using communication equal to the Holevo information for this ensemble. This remote preparation scheme may be used to convert between different ensembles of mixed states in an asymptotically lossless way, analogous to concentration and dilution for entanglement.Comment: 4 pages, no figure

Lower bounds for communication capacities of two-qudit unitary operations

We show that entangling capacities based on the Jamiolkowski isomorphism may be used to place lower bounds on the communication capacities of arbitrary bipartite unitaries. Therefore, for these definitions, the relations which have been previously shown for two-qubit unitaries also hold for arbitrary dimensions. These results are closely related to the theory of the entanglement-assisted capacity of channels. We also present more general methods for producing ensembles for communication from initial states for entanglement creation.Comment: 9 pages, 2 figures, comments welcom

Quantum mutual information and the one-time pad

Alice and Bob share a correlated composite quantum system AB. If AB is used as the key for a one-time pad cryptographic system, we show that the maximum amount of information that Alice can send securely to Bob is the quantum mutual information of AB.Comment: 11 pages, LaTe

Quantum privacy and quantum coherence

We derive a simple relation between a quantum channel's capacity to convey coherent (quantum) information and its usefulness for quantum cryptography.Comment: 6 pages RevTex; two short comments added 7 October 199

Quantum data compression, quantum information generation, and the density-matrix renormalization group method

We have studied quantum data compression for finite quantum systems where the site density matrices are not independent, i.e., the density matrix cannot be given as direct product of site density matrices and the von Neumann entropy is not equal to the sum of site entropies. Using the density-matrix renormalization group (DMRG) method for the 1-d Hubbard model, we have shown that a simple relationship exists between the entropy of the left or right block and dimension of the Hilbert space of that block as well as of the superblock for any fixed accuracy. The information loss during the RG procedure has been investigated and a more rigorous control of the relative error has been proposed based on Kholevo's theory. Our results are also supported by the quantum chemistry version of DMRG applied to various molecules with system lengths up to 60 lattice sites. A sum rule which relates site entropies and the total information generated by the renormalization procedure has also been given which serves as an alternative test of convergence of the DMRG method.Comment: 8 pages, 7 figure

Nonorthogonal Quantum States Maximize Classical Information Capacity

I demonstrate that, rather unexpectedly, there exist noisy quantum channels for which the optimal classical information transmission rate is achieved only by signaling alphabets consisting of nonorthogonal quantum states.Comment: 5 pages, REVTeX, mild extension of results, much improved presentation, to appear in Physical Review Letter

Optimal dense coding with mixed state entanglement

I investigate dense coding with a general mixed state on the Hilbert space $C^{d}\otimes C^{d}$ shared between a sender and receiver. The following result is proved. When the sender prepares the signal states by mutually orthogonal unitary transformations with equal {\it a priori} probabilities, the capacity of dense coding is maximized. It is also proved that the optimal capacity of dense coding $\chi ^{*}$ satisfies $E_{R}(\rho)\leq \chi ^{*}\leq E_{R}(\rho )+\log_{2}d$, where $E_{R}(\rho)$ is the relative entropy of entanglement of the shared entangled state.Comment: Revised. To appear in J. Phys. A: Math. Gen. (Special Issue: Quantum Information and Computation). LaTeX2e (iopart.cls), 8 pages, no figure

Comment on "Probabilistic Quantum Memories"

This is a comment on two wrong Phys. Rev. Letters papers by C.A. Trugenberger. Trugenberger claimed that quantum registers could be used as exponentially large "associative" memories. We show that his scheme is no better than one where the quantum register is replaced with a classical one of equal size. We also point out that the Holevo bound and more recent bounds on "quantum random access codes" pretty much rule out powerful memories (for classical information) based on quantum states.Comment: REVTeX4, 1 page, published versio

Generalized compactness in linear spaces and its applications

The class of subsets of locally convex spaces called $\mu$-compact sets is considered. This class contains all compact sets as well as several noncompact sets widely used in applications. It is shown that many results well known for compact sets can be generalized to $\mu$-compact sets. Several examples are considered. The main result of the paper is a generalization to $\mu$-compact convex sets of the Vesterstrom-O'Brien theorem showing equivalence of the particular properties of a compact convex set (s.t. openness of the mixture map, openness of the barycenter map and of its restriction to maximal measures, continuity of a convex hull of any continuous function, continuity of a convex hull of any concave continuous function). It is shown that the Vesterstrom-O'Brien theorem does not hold for pointwise $\mu$-compact convex sets defined by the slight relaxing of the $\mu$-compactness condition. Applications of the obtained results to quantum information theory are considered.Comment: 27 pages, the minor corrections have been mad

Quantum linear amplifier enhanced by photon subtraction and addition

A deterministic quantum amplifier inevitably adds noise to an amplified signal due to the uncertainty principle in quantum physics. We here investigate how a quantum-noise-limited amplifier can be improved by additionally employing the photon subtraction, the photon addition, and a coherent superposition of the two, thereby making a probabilistic, heralded, quantum amplifier. We show that these operations can enhance the performance in amplifying a coherent state in terms of intensity gain, fidelity, and phase uncertainty. In particular, the photon subtraction turns out to be optimal for the fidelity and the phase concentration among these elementary operations, while the photon addition also provides a significant reduction in the phase uncertainty with the largest gain effect.Comment: published version, 7 pages, 9 figure