Quantum computation with classical light: Implementation of the Deutsch–Jozsa algorithm

•An implementation of the Deutsch–Jozsa algorithm using classical optics is proposed.•Constant and certain balanced functions can be encoded and distinguished efficiently.•The encoding and the detection process does not require to access single path qubits.•While the scheme might be scalable in principle, it might not be in practice.•We suggest a generalisation of the Deutsch–Jozsa algorithm and its implementation.

We propose an optical implementation of the Deutsch–Jozsa Algorithm using classical light in a binary decision-tree scheme. Our approach uses a ring cavity and linear optical devices in order to efficiently query the oracle functional values. In addition, we take advantage of the intrinsic Fourier transforming properties of a lens to read out whether the function given by the oracle is balanced or constant.