Prof Vlatko Vedral FInstP

Abstract:

We propose an entanglement concentration scheme which uses only the effects of quantum statistics of indistinguishable particles. This establishes the fact that useful quantum information processing can be accomplished by quantum statistics alone. Because of the basis independence of statistical effects, our protocol requires less knowledge of the initial state than most entanglement concentration schemes. Moreover, no explicit controlled operation is required at any stage.

Abstract:

A comparison of the query complexity analysis of quantum algorithms was presented. Two different ways of representing a permutation in terms of a black box quantum oracle were provided. A simple promise problem that minimal quantum oracles could solve faster that the classical oracles was discussed. Results showed that the possibility of efficiently solving nonautomorphic graph isomorphism (NAGI) could be excluded by simulating a simpler oracle using standard oracle for a one-to-one function. © Oxford University Press 2002.

Abstract:

A scheme for demonstrating entanglement swapping using trapped Bose-Einstein condensates was presented. The swapping was accomplished by detection of the total number of atoms leaking out of two adjacent traps. The scheme was capable of being used for concentrating the entanglement shared between two parties in the form of entangled condensates.