logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Probabilistic programmable quantum processors

delete2004-10-11
delete4
PRE
AI
B
Buzek, V *
M
Mário Ziman
M
Mark Hillery
DOI：10.1002/prop.200410175delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We analyze how to improve performance of probabilistic programmable quantum processors. 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 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. (C) 2004 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Keywords:
GATE ARRAYS

Journal

F
Fortschritte der Physik-Progress of Physics
IF:
7.8
Papers:
2.0K
Citations:
3.6K

Organization

No organization information available