2003/11/25 by Mark Hillery, Mário Ziman, Mario Ziman +2 · 1 citation
Computer Science · Physics and Astronomy · #Algorithm #Artificial intelligence #Computer science #Neural Networks and Reservoir Computing #Physics #Probabilistic logic #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum computer #Quantum mechanics #Qubit #State (computer science) #Unitary state #quant-ph
paper · pdf · doi:10.1103/physreva.69.042311
published as Phys.Rev.A 69, 042311 (2004) · 8 pages, 0 figures
arxiv created 2003/11/25 · openalex publication_date 2004/04/16 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We present a systematic analysis of how one can improve performance of probabilistic programmable quantum processors. We generalize a simple Vidal-Masanes-Cirac processor that realizes U(1) rotations on a qubit with the phase of the rotation encoded in a state of the program register. 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 the same strategy can be utilized for a probabilistic implementation of nonunitary transformations on qubits. In addition, we show that an arbitrary SU(2) transformation 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. In particular, we show how to implement SU(N) rotations of qudits via programmable quantum processor and how the performance of the processor can be enhanced when it is used in loops.