Probabilistic programmable quantum processors with multiple copies of program states

Journal Article · Tue Mar 01 00:00:00 EST 2005 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.71.032306· OSTI ID:20650344

Brazier, Adam ^[1]; Buzek, Vladimir ^[2]; Knight, Peter L ^[1]

---

1. Optics Section, Blackett Laboratory, Imperial College, London SW7 2BW (United Kingdom)
2. Research Center for Quantum Information, Institute of Physics, Slovak Academy of Sciences, Dubravska cesta 9, 845 11 Bratislava (Slovakia)

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.

• OSTI ID: 20650344
• Journal Information: Physical Review. A, Vol. 71, Issue 3; Other Information: DOI: 10.1103/PhysRevA.71.032306; (c) 2005 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
CORRELATIONS
ENERGY LEVELS
INFORMATION THEORY
PROBABILISTIC ESTIMATION
PROBABILITY
QUANTUM MECHANICS
TRANSFORMATIONS
U-1 GROUPS