Answers are grounded in this paper and cite their sources.
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/N², 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.
No takes yet. Share an insight, caveat, or question.
Hillery et al. (2002) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: