Bad Qubits — Learn Quantum by Doing

Multiple choice

For an n-bit function promised to be constant or balanced, how many oracle queries does the Deutsch-Jozsa algorithm need to decide which, compared with the classical worst case?

Both need exactly 1 query
Classical worst case needs n queries; Deutsch-Jozsa needs exactly n
Classical worst case needs 2^(n-1)+1 queries; Deutsch-Jozsa needs exactly 1
Classical worst case needs 1 query; Deutsch-Jozsa needs 2^(n-1)+1