超越2的幂次调度的量子振幅估计
Quantum amplitude estimation beyond power-of-two schedules
- Unitary Foundation
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
该研究提出了一种超越2的幂次调度的量子振幅估计方法，通过替换后处理方式和采用几何阶梯，实现了比现有自适应及非自适应基准更优的查询与深度复杂度，达到了接近Cramér-Rao极限的性能。
AI中文摘要：
非自适应量子振幅估计（QAE）预先确定其Grover深度，因此每个量子电路都可以并行运行，但迄今为止它需要的查询数比最佳自适应方法更多。我们表明，这种差距主要来自两个传统选择：基于子空间的后处理和2的幂次深度阶梯。我们用精确的最大似然估计（每批估计进行一次矩阵乘法）取代前者，用比率r≈1.45的几何阶梯取代后者。最终得到一种完全并行的确定性调度估计器，在目标误差为3.5×10⁻³至10⁻⁶时，95%置信度下的总查询复杂度为2.8-3.1/ε。这与最佳基准自适应方法chebAE的平均情况复杂度在统计不确定性范围内匹配（在所有测试规模下的点估计均更低），比其观测到的最大复杂度快1.6倍，且最大序列深度仅为0.21/ε，而chebAE的最大序列深度为2.9/ε。与最佳非自适应基准csAE相比，在95%置信度下常数提升了30-35%，在99%置信度下提升了1.5-1.7倍。最优比率有简单的来源：加倍是数据仍能区分相邻候选值的最快深度增长，因此2的幂次阶梯处于混淆边缘，必须通过额外采样来换取可靠性；稍密集的阶梯会对每个尺度进行冗余检查。误差概率分析重现了测量的失败率并确定了最优值。该似然公式可直接扩展到噪声感知估计，对 capped 阶梯进行均匀缩放可覆盖深度受限区域，实现最优权衡M Nₜₒₜ≈(0.4-0.6)/ε²，与该调度的Cramér-Rao极限相差约1.1倍。
英文摘要：
Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adaptive methods. We show that most of this gap comes from two conventional choices: subspace-based post-processing and power-of-two depth ladders. We replace the first by the exact maximum-likelihood estimate, one matrix multiplication per batch of estimates, and the second by a geometric ladder with ratio $r \approx 1.45$. The result is a fully parallel, deterministic-schedule estimator with total query complexity $2.8$-$3.1/\varepsilon$ at 95% confidence for target errors from $3.5\times 10^{-3}$ to $10^{-6}$. This matches the average-case complexity of chebAE, the best benchmarked adaptive method, within statistical uncertainty (with the lower point estimate at every scale tested), beats its maximum-observed complexity by $1.6\times$, and needs a maximum sequential depth of only $0.21/\varepsilon$ against chebAE's $2.9/\varepsilon$. Relative to csAE, the best non-adaptive benchmark, the constants improve by 30-35% at 95% and $1.5$-$1.7\times$ at 99% confidence. The optimal ratio has a simple origin. Doubling is the fastest depth growth at which the data can still tell neighboring candidate values apart, so power-of-two ladders sit at the edge of confusion and must buy reliability with extra shots; a slightly denser ladder checks every scale redundantly. An error-probability analysis reproduces the measured failure rates and locates the optimum. The likelihood formulation extends directly to noise-aware estimation, and uniformly scaling the capped ladder covers the depth-limited regime, realizing the optimal trade-off $M N_{\mathrm{tot}} \approx (0.4$-$0.6)/\varepsilon^2$ within $\sim 1.1\times$ of the schedule's Cramér-Rao limit.
