Probabilistic programmable quantum processors with multiple copies of program state

Abstract

We examine the execution of general U(1) transformations on programmable quantum processors. We show that, with only the minimal assumption of availability of copies of the one-qubit program state, that the apparent advantage of existing schemes proposed by G.Vidal it et al. [Phys. Rev. Lett. 88, 047905 (2002)] and M.Hillery et al. [Phys. Rev. A. 65, 022301 (2003)] to execute a general U(1) transformation with greater probability using complex program states appears not to hold.

8 pages, 5 figures

References in corpus (1)

• Improving performance of probabilistic programmable quantum processors

Cited by in corpus (12)

• Asymptotic teleportation scheme as a universal programmable quantum processor
• Quantum teleportation scheme by selecting one of multiple output ports
• Optimal universal programming of unitary gates
• Realization of POVMs using measurement-assisted programmable quantum processors
• Optimal quantum-programmable projective measurement with linear optics
• Resource Quantification for the No-Programming Theorem
• Optimal universal programmable detectors for unambiguous discrimination
• Experimental realization of programmable quantum gate
• Quantum-enhanced learning of rotations about an unknown direction
• Quantum Machines
• Representation matching for delegated quantum computing
• Quantum Advantage in Storage and Retrieval of Isometry Channels