Probabilistic implementation of universal quantum processors
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F02%3A00007535" target="_blank" >RIV/00216224:14330/02:00007535 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Probabilistic implementation of universal quantum processors
Original language description
We present a probabilistic quantum processor for qudits. 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 the dimension $N$ with a certain probability. If the operation is unitary, the probability is in general $1/N^2$, 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BE - Theoretical physics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F98%2F0369" target="_blank" >GA201/98/0369: Informatics as the third methodology</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2002
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Physical Review A
ISSN
1050-2947
e-ISSN
—
Volume of the periodical
65
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
7
Pages from-to
"022301-1"-"022301-7"
UT code for WoS article
—
EID of the result in the Scopus database
—