Rapid solution of problems by quantum computation

The primary paper for the Deutsch–Jozsa row of the complexity table. The algorithm decides, with one quantum query, whether a promised Boolean function is constant or balanced. The exponential comparison is with deterministic classical algorithms, which need 2 to the n minus 1, plus one, queries in the worst case. It is not an exponential separation from bounded-error classical sampling. This library does not yet have an algorithm page for the result.