A generalization of Deutch-Jozsa algorithm

Quantum Computation is seen as an alternative paradigm for computing as the physical implentations for the basic information unit, the binary digit, approach the atomic level. As the laws of quantum mechanics take over at this level, quantum phenomena such as superposition, the ensuing parallelism and entanglement can be harnessed to offer faster algorithms. Deutch- Jozsa was the first problem for such an algorithm was exhibited that was provably faster than any deterministic classical algorithm. Here we make an attempt at a generalization of this algorithm, hoping that it could lead to similar generalizations for other quantum algorithms.

Autorentext

Elton Ballhysa has completed his M.Sc thesis on the subject of Quantum Computation. His research interests include Theory of Computation, Cognitive Science and Artificial Intelligence