Generalization of the Deutsch algorithm using two qudits

Abstract

Deutsch's algorithm for two qubits (one control qubit plus one auxiliary qubit) is extended to two $d$-dimensional quantum systems or qudits for the case in which $d$ is equal to $2^n$, $n=1,2,...$ . This allows one to classify a certain oracle function by just one query, instead of the $2^{n-1}+1$ queries required by classical means. The given algorithm for two qudits also solves efficiently the Bernstein-Vazirani problem. Entanglement does not occur at any step of the computation.

LaTeX file, 7 pages

Cited by in corpus (1)

• Towards Large-Scale Quantum Computation