Day 591: Deutsch-Jozsa n-Qubit Generalization

Learning Objectives

• •Generalize the constant vs. balanced problem to n bits
• •Prove the classical lower bound of $2^{n-1}+1$ queries
• •Derive the complete Deutsch-Jozsa algorithm
• •Prove correctness via Hadamard transform properties
• •Understand the exponential quantum speedup
• •Recognize limitations of the algorithm in practice

Today's Schedule (7 hours)