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

Entangled Mixed States and Local Purification

Linden, Massar and Popescu have recently given an optimization argument to show that a single two-qubit Werner state, or any other mixture of the maximally entangled Bell states, cannot be purified by local operations and classical communications. We generalise their result and give a simple explanation. In particular, we show that no purification scheme using local operations and classical communications can produce a pure singlet from any mixed state of two spin-1/2 particles. More generally, no such scheme can produce a maximally entangled state of any pair of finite-dimensional systems from a generic mixed state. We also show that the Werner states belong to a large class of states whose fidelity cannot be increased by such a scheme.Comment: 3 pages, Latex with Revtex. Small clarifications and reference adde

Unconditional security of coherent-state quantum key distribution with strong phase-reference pulse

We prove the unconditional security of a quantum key distribution protocol in which bit values are encoded in the phase of a weak coherent-state pulse relative to a strong reference pulse. In contrast to implementations in which a weak pulse is used as a substitute for a single-photon source, the achievable key rate is found to decrease only linearly with the transmission of the channel.Comment: 4 pages, 3 figure

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

Unconditional security at a low cost

By simulating four quantum key distribution (QKD) experiments and analyzing one decoy-state QKD experiment, we compare two data post-processing schemes based on security against individual attack by L\"{u}tkenhaus, and unconditional security analysis by Gottesman-Lo-L\"{u}tkenhaus-Preskill. Our results show that these two schemes yield close performances. Since the Holy Grail of QKD is its unconditional security, we conclude that one is better off considering unconditional security, rather than restricting to individual attacks.Comment: Accepted by International Conference on Quantum Foundation and Technology: Frontier and Future 2006 (ICQFT'06

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

On Multipartite Pure-State Entanglement

We show that pure states of multipartite quantum systems are multiseparable (i.e. give separable density matrices on tracing any party) if and only if they have a generalized Schmidt decomposition. Implications of this result for the quantification of multipartite pure-state entanglement are discussed. Further, as an application of the techniques used here, we show that any purification of a bipartite PPT bound entangled state is tri-inseparable, i.e. has none of its three bipartite partial traces separable.Comment: 8 Pages ReVTeX, 4 figures (eps); v2: Revised terminology, added two references and other minor changes; v3: Minor changes, added two references, added author's middle initial; v4: One footnote remove

Photon-number-solving Decoy State Quantum Key Distribution

In this paper, a photon-number-resolving decoy state quantum key distribution scheme is presented based on recent experimental advancements. A new upper bound on the fraction of counts caused by multiphoton pulses is given. This upper bound is independent of intensity of the decoy source, so that both the signal pulses and the decoy pulses can be used to generate the raw key after verified the security of the communication. This upper bound is also the lower bound on the fraction of counts caused by multiphoton pulses as long as faint coherent sources and high lossy channels are used. We show that Eve's coherent multiphoton pulse (CMP) attack is more efficient than symmetric individual (SI) attack when quantum bit error rate is small, so that CMP attack should be considered to ensure the security of the final key. finally, optimal intensity of laser source is presented which provides 23.9 km increase in the transmission distance. 03.67.DdComment: This is a detailed and extended version of quant-ph/0504221. In this paper, a detailed discussion of photon-number-resolving QKD scheme is presented. Moreover, the detailed discussion of coherent multiphoton pulse attack (CMP) is presented. 2 figures and some discussions are added. A detailed cauculation of the "new" upper bound 'is presente