When only two thirds of the entanglement can be distilled

We provide an example of distillable bipartite mixed state such that, even in the asymptotic limit, more pure-state entanglement is required to create it than can be distilled from it. Thus, we show that the irreversibility in the processes of formation and distillation of bipartite states, recently proved in [G. Vidal, J.I. Cirac, Phys. Rev. Lett. 86, (2001) 5803-5806], is not limited to bound-entangled states.Comment: 4 pages, revtex, 1 figur

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

A method of enciphering quantum states

In this paper, we propose a method of enciphering quantum states of two-state systems (qubits) for sending them in secrecy without entangled qubits shared by two legitimate users (Alice and Bob). This method has the following two properties. First, even if an eavesdropper (Eve) steals qubits, she can extract information from them with certain probability at most. Second, Alice and Bob can confirm that the qubits are transmitted between them correctly by measuring a signature. If Eve measures m qubits one by one from n enciphered qubits and sends alternative ones (the Intercept/Resend attack), a probability that Alice and Bob do not notice Eve's action is equal to (3/4)^m or less. Passwords for decryption and the signature are given by classical binary strings and they are disclosed through a public channel. Enciphering classical information by this method is equivalent to the one-time pad method with distributing a classical key (random binary string) by the BB84 protocol. If Eve takes away qubits, Alice and Bob lose the original quantum information. If we apply our method to a state in iteration, Eve's success probability decreases exponentially. We cannot examine security against the case that Eve makes an attack with using entanglement. This remains to be solved in the future.Comment: 21 pages, Latex2e, 10 epsf figures. v2: 22 pages, added two references, several clarifying sentences are added in Sec. 5, typos corrected, a new proof is provided in Appendix A and it is shorter than the old one. v3: 23 pages, one section is adde

Quantum communication without alignment using multiple-qubit single-photon states

We propose a scheme for encoding logical qubits in a subspace protected against collective rotations around the propagation axis using the polarization and transverse spatial degrees of freedom of single photons. This encoding allows for quantum key distribution without the need of a shared reference frame. We present methods to generate entangled states of two logical qubits using present day down-conversion sources and linear optics, and show that the application of these entangled logical states to quantum information schemes allows for alignment-free tests of Bell's inequalities, quantum dense coding and quantum teleportation

Irreversibility in asymptotic manipulations of entanglement

We show that the process of entanglement distillation is irreversible by showing that the entanglement cost of a bound entangled state is finite. Such irreversibility remains even if extra pure entanglement is loaned to assist the distillation process.Comment: RevTex, 3 pages, no figures Result on indistillability of PPT states under pure entanglement catalytic LOCC adde

Remote State Preparation

Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be transmitted. We show that the asymptotic classical communication cost of RSP is one bit per qubit - half that of teleportation - and becomes even less when transmitting part of a known entangled state. We explore the tradeoff between entanglement and classical communication required for RSP, and discuss RSP capacities of general quantum channels.Comment: 4 pages including 1 epsf figure; v3 has an additional author and discusses relation to work of Devetak and Berger (quant-ph/0102123); v4 improves low-entanglement protocols without back communication to perform as well as low-entanglement protocols with back communication; v5 (journal version) has a few small change

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

Factoring in a Dissipative Quantum Computer

We describe an array of quantum gates implementing Shor's algorithm for prime factorization in a quantum computer. The array includes a circuit for modular exponentiation with several subcomponents (such as controlled multipliers, adders, etc) which are described in terms of elementary Toffoli gates. We present a simple analysis of the impact of losses and decoherence on the performance of this quantum factoring circuit. For that purpose, we simulate a quantum computer which is running the program to factor N = 15 while interacting with a dissipative environment. As a consequence of this interaction randomly selected qubits may spontaneously decay. Using the results of our numerical simulations we analyze the efficiency of some simple error correction techniques.Comment: plain tex, 18 pages, 8 postscript figure

Quantum cryptography with squeezed states

A quantum key distribution scheme based on the use of displaced squeezed vacuum states is presented. The states are squeezed in one of two field quadrature components, and the value of the squeezed component is used to encode a character from an alphabet. The uncertainty relation between quadrature components prevents an eavesdropper from determining both with enough precision to determine the character being sent. Losses degrade the performance of this scheme, but it is possible to use phase-sensitive amplifiers to boost the signal and partially compensate for their effect.Comment: 15 pages, no figure