Bernstein-Vazirani 1993 hidden-string in 1 quantum query vs n classical

Layer 1 — Physicsin the quantum-computing subtree

Bernstein-Vazirani 1993 (STOC 1993, refined paper SIAM J. Comput. 26:1411) refined the Deutsch-Jozsa problem to a learning task. Promise: the oracle computes f_s(x) = s·x mod 2 for some unknown n-bit string s; goal is to learn s with…

Related concepts

Bernstein-Vazirani quantum speedup = n (linear in problem size)

Explore Bernstein-Vazirani 1993 hidden-string in 1 quantum query vs n classical on the interactive knowledge graph →