Probabilistic programmable quantum processors with multiple copies of program states

Investor logo

Warning

This publication doesn't include Faculty of Arts. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

BRAZIER Adam BUŽEK Vladimír KNIGHT Peter L.

Year of publication 2005
Type Article in Periodical
Magazine / Source Physical Review A
MU Faculty or unit

Faculty of Informatics

Citation
Field Theoretical physics
Keywords quantum programmable processors; probabilistic quantum processors
Description 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 1-qubit program state, the apparent advantage of existing schemes proposed by G. Vidal 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.