corner
corner

Phys. Rev. A 73, 022345 (2006) [7 pages]

Approximate programmable quantum processors

Download: PDF (106 kB) Buy this article Export: BibTeX or EndNote (RIS)

Mark Hillery1,2, Mário Ziman2,3, and Vladimír Bužek2,4
1Department of Physics, Hunter College of CUNY, 695 Park Avenue, New York, New York 10021, USA
2Research Center for Quantum Information, Slovak Academy of Sciences, 845 11 Bratislava, Slovakia
3Quniverse, Líščie údolie 116, 841 04 Bratislava, Slovakia
4Abteilung für Quantenphysik, Universität Ulm, 89069 Ulm, Germany

Received 13 October 2005; published 24 February 2006

A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor to approximate a set of unitary operators to a specified level of precision. We measure how well an operation is performed by the process fidelity between the desired operation and the operation produced by the processor. We show how to find the program for a given processor that produces the best approximation of a particular unitary operation. We also place bounds on the dimension of the program space that is necessary to approximate a set of unitary operators to a specified level of precision.

© 2006 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevA.73.022345
DOI:
10.1103/PhysRevA.73.022345
PACS:
03.67.Lx, 03.65.Ta