Probabilistic programmable quantum processors
Vladimír Bužek, Mário Ziman, Mark S. Hillery
Abstract We analyze how to improve performance of probabilistic programmable quantum processors. We show how the probability of success of the probabilistic processor can be enhanced by using the processor in loops. In addition, we show that an arbitrary SU(2) transformations of qubits can be encoded in program state of a universal programmable probabilistic quantum processor. The probability of success of this processor can be enhanced by a systematic correction of errors via conditional loops. Finally, we show that all our results can be generalized also for qudits.
Fortschritte der Physik•Oct 11, 2004•3 citations