Ancilla-assisted sequential approximation of nonlocal unitary operations

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Slightly improved version as published in Phys. Rev. A

Scientific paper

10.1103/PhysRevA.84.032323

We consider the recently proposed "no-go" theorem of Lamata et al [Phys. Rev. Lett. 101, 180506 (2008)] on the impossibility of sequential implementation of global unitary operations with the aid of an itinerant ancillary system and view the claim within the language of Kraus representation. By virtue of an extremely useful tool for analyzing entanglement properties of quantum operations, namely, operator-Schmidt decomposition, we provide alternative proof to the "no-go" theorem and also study the role of initial correlations between the qubits and ancilla in sequential preparation of unitary entanglers. Despite the negative response from the "no-go" theorem, we demonstrate explicitly how the matrix-product operator(MPO) formalism provides a flexible structure to develop protocols for sequential implementation of such entanglers with an optimal fidelity. The proposed numerical technique, that we call variational matrix-product operator (VMPO), offers a computationally efficient tool for characterizing the "globalness" and entangling capabilities of nonlocal unitary operations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Ancilla-assisted sequential approximation of nonlocal unitary operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Ancilla-assisted sequential approximation of nonlocal unitary operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ancilla-assisted sequential approximation of nonlocal unitary operations will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-16652

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.