| HILLERY, Mark, Vladimír BŮŽEK a Mario ZIMAN. Probabilistic implementation of universal quantum processors. Physical Review A (Atomic, Molecular, and Optical Physics). roč. 65, 02/01/2002, s. 022301-1; 022301-7, 7 s. ISSN 1094-1622. 2002. |
Další formáty:
BibTeX
LaTeX
RIS
@article{490054,
author = {Hillery, Mark and Bůžek, Vladimír and Ziman, Mario},
article_number = {02/01/2002},
keywords = {Quantum Computing; Quantum Processors},
language = {eng},
issn = {1094-1622},
journal = {Physical Review A (Atomic, Molecular, and Optical Physics)},
title = {Probabilistic implementation of universal quantum processors},
url = {http://link.aps.org/abstract/PRA/v65/e022301},
volume = {65},
year = {2002}
}
TY - JOUR
ID - 490054
AU - Hillery, Mark - Bůžek, Vladimír - Ziman, Mario
PY - 2002
TI - Probabilistic implementation of universal quantum processors
JF - Physical Review A (Atomic, Molecular, and Optical Physics)
VL - 65
IS - 02/01/2002
SP - 022301-1; 022301-7
EP - 022301-1; 022301-7
SN - 10941622
KW - Quantum Computing
KW - Quantum Processors
UR - http://link.aps.org/abstract/PRA/v65/e022301
L2 - http://link.aps.org/abstract/PRA/v65/e022301
N2 - We present a probabilistic quantum processor for qudits on a single qudit of dimension N. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is encoded. This program is applied to the data register. The processor can perform any operation on a single qudit of dimension N with a certain probability. For a general unitary operation, the probability is 1/N2, but for more restricted sets of operators the probability can be higher. In fact, this probability can be independent of the dimension of the qudit Hilbert space of the qudit under some conditions.
ER -
HILLERY, Mark, Vladimír BŮŽEK a Mario ZIMAN. Probabilistic implementation of universal quantum processors. \textit{Physical Review A (Atomic, Molecular, and Optical Physics)}. roč.~65, 02/01/2002, s.~022301-1; 022301-7, 7 s. ISSN~1094-1622. 2002.
|
