Universality and optimality of programmable quantum processors

Details Universality and optimality of programmable quantum processors Universality and optimality of programmable quantum processors

2006-12-28

arxiv.org/abs/quant-ph/0612218v1

Acta Phys.Hung. B 26, 277-291 (2006)

Physics

Quantum Physics

9 pages

Scientific paper

10.1556/APH.26.2006.3-4.8

We analyze and compare the optimality of approximate and probabilistic universal programmable quantum processors. We define several characteristics how to quantify the optimality and we study in detail performance of three types of programmable quantum processors based on (1) the C-NOT gate, (2) the SWAP operation, and (3) the model of the quantum information distributor - the QID processor. We show under which conditions the measurement assisted QID processor is optimal. We also investigate optimality of the so-called U-processors and we also compare the optimal approximative implementation of U(1) qubit rotations with the known probabilistic implementation as introduced by Vidal, Masanes and Cirac [ {\em Phys. Rev. Lett.} {\bf 88}, 047905 (2002)].

Affiliated with

Also associated with

No associations

Rating

Universality and optimality of programmable quantum processors 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 Universality and optimality of programmable quantum processors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universality and optimality of programmable quantum processors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-383068