Probabilistic programmable quantum processors with multiple copies of program states
Authors:
- 9 March 2005
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 71 (3) , 032306
Abstract
We examine the execution of general transformations on programmable quantum processors. We show that, with only the minimal assumption of availability of copies of the -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 transformation with greater probability using complex program states appears not to hold.
Keywords
All Related Versions
This publication has 8 references indexed in Scilit:
- Improving the performance of probabilistic programmable quantum processorsPhysical Review A, 2004
- REALIZATION OF UNITARY MAPS VIA PROBABILISTIC PROGRAMMABLE QUANTUM PROCESSORSInternational Journal of Quantum Information, 2003
- Implementation of quantum maps by programmable quantum processorsPhysical Review A, 2002
- Storing Quantum Dynamics in Quantum States: A Stochastic Programmable GatePhysical Review Letters, 2002
- Probabilistic implementation of universal quantum processorsPhysical Review A, 2002
- Programmable Quantum Gate ArraysFortschritte der Physik, 2001
- Reliable quantum computersProceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998
- Programmable Quantum Gate ArraysPhysical Review Letters, 1997