The Parity Bit in Quantum Cryptography

An $n$-bit string is encoded as a sequence of non-orthogonal quantum states. The parity bit of that $n$-bit string is described by one of two density matrices, $\rho_0^{(n)}$ and $\rho_1^{(n)}$, both in a Hilbert space of dimension $2^n$. In order to derive the parity bit the receiver must distinguish between the two density matrices, e.g., in terms of optimal mutual information. In this paper we find the measurement which provides the optimal mutual information about the parity bit and calculate that information. We prove that this information decreases exponentially with the length of the string in the case where the single bit states are almost fully overlapping. We believe this result will be useful in proving the ultimate security of quantum crytography in the presence of noise.Comment: 19 pages, RevTe

Negative entropy and information in quantum mechanics

A framework for a quantum mechanical information theory is introduced that is based entirely on density operators, and gives rise to a unified description of classical correlation and quantum entanglement. Unlike in classical (Shannon) information theory, quantum (von Neumann) conditional entropies can be negative when considering quantum entangled systems, a fact related to quantum non-separability. The possibility that negative (virtual) information can be carried by entangled particles suggests a consistent interpretation of quantum informational processes.Comment: 4 pages RevTeX, 2 figures. Expanded discussion of quantum teleportation and superdense coding, and minor corrections. To appear in Phys. Rev. Let

A Universal Two--Bit Gate for Quantum Computation

We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425}, 73 (1989)] as a network consisting of replicas of a single two--bit gate.Comment: 3 pages, RevTeX, two figures in a uuencoded fil

Secure Key Distribution by Swapping Quantum Entanglement

We report two key distribution schemes achieved by swapping quantum entanglement. Using two Bell states, two bits of secret key can be shared between two distant parties that play symmetric and equal roles. We also address eavesdropping attacks against the schemes.Comment: 4 pages, 2 figures, 3 tables. The revised version will appear in Phys. Rev.

Entanglement Swapping Chains for General Pure States

We consider entanglement swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalised Bell measurements with the result that the two end parties end up sharing a entangled state which can be converted into maximally entangled states. We obtain an expression for the average amount of maximal entanglement concentrated in such a scheme and show that in a certain reasonably broad class of cases this scheme is provably optimal and that, in these cases, the amount of entanglement concentrated between the two ends is equal to that which could be concentrated from the weakest link in the chain.Comment: 18 pages, 5 figure

On entanglement-assisted classical capacity

This paper is essentially a lecture from the author's course on quantum information theory, which is devoted to the result of C. H. Bennett, P. W. Shor, J. A. Smolin and A. V. Thapliyal (quant-ph/0106052) concerning entanglement-assisted classical capacity of a quantum channel. A modified proof of this result is given and relation between entanglement-assisted and unassisted classical capacities is discussed.Comment: 10 pages, LATE

LDC lending after the crisis

Debts, External ; Financial crises ; Developing countries ; Loans, Foreign

Scaling Laws for Non-Intercommuting Cosmic String Networks

We study the evolution of non-interacting and entangled cosmic string networks in the context of the velocity-dependent one-scale model. Such networks may be formed in several contexts, including brane inflation. We show that the frozen network solution $L\propto a$, although generic, is only a transient one, and that the asymptotic solution is still $L\propto t$ as in the case of ordinary (intercommuting) strings, although in the present context the universe will usually be string-dominated. Thus the behaviour of two strings when they cross does not seem to affect their scaling laws, but only their densities relative to the background.Comment: Phys. Rev. D (in press); v2: final published version (references added, typos corrected