Deutsch-Jozsa quantum/classical query complexity exponential separation

Layer 1 — Physicsin the quantum-computing subtree

Exact closed-form query-complexity comparison. Quantum: Deutsch-Jozsa solves the constant-vs-balanced promise problem with exactly 1 oracle query for any n. Classical deterministic worst-case: to be sure the function is balanced and not…

Related concepts

Explore Deutsch-Jozsa quantum/classical query complexity exponential separation on the interactive knowledge graph →