NONLOCALITY IMPROVES DEUTSCH ALGORITHM

Abstract

We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered the use of entangled photon pairs to determine probabilistically two unknown functions. The usual Deutsch algorithm determines one unknown function and exhibits a two to one speed up in a certain computation on a quantum computer rather than on a classical computer. We found that the violation of Bell locality in the Hilbert space formalism of quantum theory predicts that the proposed probabilistic Deutsch algorithm for computing two unknown functions exhibits at least a 2 root 2(similar or equal to 2.83) to one speed up.