第 12 课 · Grover 搜索——几何、最优迭代与下界 · 模块二:算法主线

振幅放大的理论(本课高潮二)

  • 命题框(设定):$U|0\rangle|0\rangle = |\psi\rangle = \sqrt{p}\cdot|\mathrm{good}\rangle|0\rangle + \sqrt{1-p}\cdot|\mathrm{bad}\rangle|1\rangle = \sin\omega\cdot|g\rangle + \cos\omega\cdot|b\rangle$,$\omega = \arcsin\sqrt{p}$;实现的是 $|0,0\rangle \mapsto |\mathrm{good}\rangle|0\rangle$(以 $U$ 为子过程,非 $|\psi\rangle \mapsto |\mathrm{good}\rangle$)
  • 推导步骤(逐行):
    1. 两个反射:$U_S = 2|\psi\rangle\langle\psi| - I = U(2|0,0\rangle\langle 0,0| - I)U^\dagger$(会 $U$ 与 $U^\dagger$ 即可实现);$U_O = I - 2\Pi_g$(与 Grover 的 $U_O$ 只差整体符号)
    2. 算像:$U_S|g\rangle = 2\sqrt{p}\cdot|\psi\rangle - |g\rangle = (2p-1)|g\rangle + 2\sqrt{p(1-p)}\cdot|b\rangle$;$U_S|b\rangle = 2\sqrt{1-p}\cdot|\psi\rangle - |b\rangle = 2\sqrt{p(1-p)}\cdot|g\rangle + (1-2p)\cdot|b\rangle$
    3. 矩阵:$U_O = \begin{bmatrix}-1 & 0\\ 0 & 1\end{bmatrix}$;$U_S = \begin{bmatrix}2p-1 & 2\sqrt{p(1-p)}\\ 2\sqrt{p(1-p)} & 1-2p\end{bmatrix}$
    4. 合成(右乘 $\mathrm{diag}(-1, 1)$ = 第一列取反):$Q = U_S U_O = \begin{bmatrix}1-2p & 2\sqrt{p(1-p)}\\ -2\sqrt{p(1-p)} & 1-2p\end{bmatrix}$
    5. 旋转验证:$(1-2p)^2 + 4p(1-p) = 1 - 4p + 4p^2 + 4p - 4p^2 = 1$ ✓;倍角公式 $\cos 2\omega = 1 - 2p$、$\sin 2\omega = 2\sqrt{p(1-p)}$ → $Q = R(-2\omega)$
    6. 数值演算 $p = 1/4$:$1 - 2p = 1/2$、$2\sqrt{p(1-p)} = 2\cdot\sqrt{3/16} = \sqrt{3}/2$ → $Q = R(-60^\circ)$,$\omega = \arcsin(1/2) = 30^\circ$ ✓;小 $p$ 演算 $p = 0.01$:$\omega \approx \sqrt{p} = 0.1$ rad,每步转 $2\sqrt{p} \approx 0.2$ rad
  • 结果框:$Q|\phi(\alpha)\rangle = |\phi(\alpha+2\omega)\rangle$($|\phi(\alpha)\rangle = \sin\alpha\cdot|g\rangle + \cos\alpha\cdot|b\rangle$);$n = \pi/(4\omega) - 1/2 \approx \pi/(4\sqrt{p})$ → 成功率 $\ge 1-p$;重复 $O(\log(1/\delta))$ 次提升到 $1-\delta$;每次迭代需一次 $U$ 与一次 $U^\dagger$;Grover $= p = 1/N$、$\omega = \theta$ 的特例
类型definition-derivation(重点页)