Physics – Quantum Physics
Scientific paper
2001-09-28
Physics
Quantum Physics
4 pages; references corrected and added; shortened to fit 4-page format
Scientific paper
10.1103/PhysRevA.65.030302
Recently, a lot of attention has been devoted to finding physically realisable operations that realise as closely as possible certain desired transformations between quantum states, e.g. quantum cloning, teleportation, quantum gates, etc. Mathematically, this problem boils down to finding a completely positive trace-preserving (CPTP) linear map that maximizes the (mean) fidelity between the map itself and the desired transformation. In this note we want to draw attention to the fact that this problem belongs to the class of so-called semidefinite programming (SDP) problems. As SDP problems are convex, it immediately follows that they do not suffer from local optima. Furthermore, this implies that the numerical optimization of the CPTP map can, and should, be done using methods from the well-established SDP field, as these methods exploit convexity and are guaranteed to converge to the real solution. Finally, we show how the duality inherent to convex and SDP problems can be exploited to prove analytically the optimality of a proposed solution. We give an example of how to apply this proof method by proving the optimality of Hardy and Song's proposed solution for the universal qubit $\theta$-shifter (quant-ph/0102100).
Audenaert Koenraad
Moor Bart de
No associations
LandOfFree
Optimizing Completely Positive Maps using Semidefinite Programming 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 Optimizing Completely Positive Maps using Semidefinite Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimizing Completely Positive Maps using Semidefinite Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-155408