arXiv subjects
Publications and source records attributed to V. Vedral.
We investigate asymptotic distillation of entanglement in the presence of an unlimited amount of bound entanglement for bi-partite systems. We show that the distillability is still bounded by the relative entropy of entanglement. This offers a strong support to the fact that bound entanglement does not improve distillation of entanglement.
We investigate the purification of entangled states by local actions using a variant of entanglement swapping. We show that there exists a measure of entanglement which is conserved in this type of purification procedure.
A quantum telecloning process combining quantum teleportation and optimal quantum cloning from one input to M outputs is presented. The scheme relies on the establishment of particular multiparticle entangled states, which function as multiuser quantum information channels. The entanglement structure of these states is analyzed and shown to be crucial for this type of information processing.
Purification schemes for multi-particle entangled states cannot be treated as straightforward extensions of those for two particles because of the lack of symmetry they possess. We propose purification protocols for a wide range of mixed entangled states of many particles. These are useful for understanding entanglement, and will be of practical significance in multi-user cryptographic schemes or distributed quantum computation and communication. We show that operating locally on multi-particle entangled states directly is more efficient than relying on two-particle purification.
Quantum information processing rests on our ability to manipulate quantum superpositions through coherent unitary transformations. In reality the quantum information processor (a linear ion trap, or cavity qed implementation for example) exists in a dissipative environment. Dephasing, and other technical sources of noise, as well as more fundamental sources of dissipation severely restrict quantum processing capabilities. The strength of the coherent coupling needed to implement quantum logic is not always independent of dissipation. The limitations these dissipative influences present will be described and the need for efficient error correction noted. Even if long and involved quantum computations turn out to be hard to realize, one can perform interesting manipulations of entanglement involving only a few gates and qubits, of which we give examples. Quantum communication also involves manipulations of entanglement which are simpler to implement than elaborate computations. We briefly analyse the notion of the capacity of a quantum communication channel.
We generalize previously proposed conditions each measure of entanglement has to satisfy. We present a class of entanglement measures that satisfy these conditions and show that the Quantum Relative Entropy and Bures Metric generate two measures of this class. We calculate the measures of entanglement for a number of mixed two spin 1/2 systems using the Quantum Relative Entropy, and provide an efficient numerical method to obtain the measures of entanglement in this case. In addition, we prove a number of properties of our entanglement measure which have important physical implications. We briefly explain the statistical basis of our measure of entanglement in the case of the Quantum Relative Entropy. We then argue that our entanglement measure determines an upper bound to the number of singlets that can be obtained by any purification procedure and that distillable entanglement is in general smaller than the entanglement of creation.
We argue from the point of view of statistical inference that the quantum relative entropy is a good measure for distinguishing between two quantum states (or two classes of quantum states) described by density matrices. We extend this notion to describe the amount of entanglement between two quantum systems from a statistical point of view. Our measure is independent of the number of entangled systems and their dimensionality.
We generalize the procedure of entanglement swapping to obtain a scheme for manipulating entanglement in multiparticle systems. We describe how this scheme allows to establish multiparticle entanglement between particles belonging to distant users in a communication network through a prior distribution of singlets followed by only local measurements. We show that this scheme can be regarded as a method of generating entangled states of many particles and compare it with existing schemes using simple quantum computational networks. We highlight the practical advantages of using a series of entanglement swappings during the distribution of entangled particles between two parties. Applications of multiparticle entangled states in cryptographic conferencing and in reading messages from more than one source through a single measurement are also described.
We present conditions every measure of entanglement has to satisfy and construct a whole class of 'good' entanglement measures. The generalization of our class of entanglement measures to more than two particles is straightforward. We present a measure which has a statistical operational basis that might enable experimental determination of the quantitative degree of entanglement.
We show that inseparability of quantum states can be partially broadcasted (copied, cloned) with the help of local operations, i.e. distant parties sharing an entangled pair of spin 1/2 states can generate two pairs of partially nonlocally entangled states using only local operations. This procedure can be viewed as an inversion of quantum purification procedures.
We present a quantum error correcting code that is invariant under the conditional time evolution between spontaneous emissions and which can correct for one general error. The code presented here generalizes previous error correction codes in that not all errors lead to different error syndromes. This idea may lead to shorter codes than previously expected.
We consider the effects of local interactions upon quantum mechanically entangled systems. In particular we demonstrate that non-local correlations cannot increase through local operations on any of the subsystems, but that through the use of quantum error correction methods, correlations can be maintained. We provide two mathematical proofs that local general measurements cannot increase correlations, and also derive general conditions for quantum error correcting codes. Using these we show that local quantum error correction can preserve nonlocal features of entangled quantum systems. We also demonstrate these results by use of specific examples employing correlated optical cavities interacting locally with resonant atoms. By way of counter example, we also describe a mechanism by which correlations can be increased, which demonstrates the need for it non-local interactions.
In this paper we show how the fault--tolerant error correction scheme recently proposed by DiVincenzo and Shor may be improved. Our scheme, unlike the earlier one, can also deal with a single error that might occur {\em during} the gate operations that are required for the implementation of the error correction and not only in--between the gates and hence presents an improvement towards enabling error correction and with it the practical possibility of some more involved quantum computations, such as e.g. factorization of large numbers.
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shor's quantum factorising algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorised.