Improving performance of probabilistic programmable quantum processors

Abstract

We present a systematic analysis 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 non-unitary transformations on qubits. In addtion, 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. 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.

8 pages, 0 figures

References in corpus (11)

• Reliable Quantum Computers
• Quantum Networks for Elementary Arithmetic Operations
• Universal Quantum Estimator
• Direct estimations of linear and non-linear functionals of a quantum state
• Programmable quantum gate arrays
• Quantum information distributors: Quantum network for symmetric and asymmetric cloning in arbitrary dimension and continuous limit
• Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
• Quantum multimeters: A programmable state discriminator
• Probabilistic implementation of universal quantum processors
• A quantum gate array can be programmed to evaluate the expectation value of any operator
• Implementation of quantum maps by programmable quantum processors

Cited by in corpus (14)

• Quantum cloning
• Approximate programmable quantum processors
• Realization of POVMs using measurement-assisted programmable quantum processors
• Optimal universal programmable detectors for unambiguous discrimination
• Increasing efficiency of a linear-optical quantum gate using an electronic feed forward
• Experimental realization of programmable quantum gate
• Probabilistic programmable quantum processors with multiple copies of program state
• Optimality of programmable quantum measurements
• Programmable Quantum Networks with Pure States
• Fidelity of dynamical maps
• Application of quantum algorithms to the study of permutations and group automorphisms
• Probabilistic implementation of universal Hadamard and Unitary gates
• Robustness of optimal probabilistic storage and retrieval of unitary channels to noise
• Quantum Advantage in Storage and Retrieval of Isometry Channels