关于「加速的举证责任:求解时间、标度律与去量子化」,《量子启发与猜想证伪》给出的定量结论是什么?
结论:求解时间把命中率换成钟点:成功率 0.01 的方法要重复 458.2 次才有 99 % 把握。常数倍优势不随规模变化;标度律稍差一点,规模一大,10 的 8 次方倍领先也会被吞掉。一千个没有真实加速的实例里,挑出表现好的 241 个,中位数就从 1.036 变成 2.893。去量子化说明,按平方抽样这一输入假设本身就携带了大部分「加速」,经典算法同样能用。
数据口径:书中参数为示意,全部计算由书中程序生成。 本书不构成投资、学术评审或量子硬件方面的建议。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.01, 1.036, 10, 2.893, 241, 458.2
| A. repetitions for 99 % confidence, TTS99 / t_run | |
| p | 0.001: 4,602.9 |
| p | 0.01 : 458.2 |
| p | 0.1 : 43.7 |
| p | 0.5 : 6.6 |
| p | 0.9 : 2.0 |
| p | 0.99 : 1.0 |
| B. log10 TTS = log10 a + b n (illustrative solvers) | |
| n SA/dev heuristic/dev SA/dev-worse-slope | |
| 200 | 1e+08 1e+00 4e+07 |
| 945 | 1e+08 1e+00 1e+06 |
| 2,000 | 1e+08 1e+00 1e+04 |
| 4,000 | 1e+08 1e+00 1e+00 |
| 6,000 | 1e+08 1e+00 1e-04 |
| C. 1,000 instances, true speedup ratio | 1 on every instance |
| median ratio, all instances | 1.036 |
| median ratio, the 241 'fast' ones 2.893 | |
| median ratio, top 100 by ratio | 4.359 |
| share of instances with ratio > 1 | 0.519 |
查看完整验算程序
# Chapter 3. p31: what a speedup claim must show (time-to-solution).
# A. TTS99 = t_run * ln(1 - 0.99) / ln(1 - p): runs needed for 99 %
# confidence when one run succeeds with probability p.
# B. Constant factor versus scaling: two illustrative solvers with
# TTS = a * 10^(b n). A fixed factor of 10^8 (the order reported by
# Denchev et al. 2016 against single-core annealing on crafted
# instances) never changes the exponent b. The same paper notes that
# other classical heuristics solve most of those instances about as
# fast as the device, i.e. same b, similar a. Made-up parameters.
# C. Selection bias: 1,000 synthetic instances with NO true speedup
# (log10 ratio ~ Normal(0, 0.4), fixed seed). Reporting only a chosen
# subset manufactures an apparent speedup; Ronnow et al. 2014 warn
# against exactly this. Classical arithmetic and simulation only.
import math
import random
import statistics
def r99(p):
return math.log(0.01) / math.log(1.0 - p)
if __name__ == "__main__":
print("A. repetitions for 99 % confidence, TTS99 / t_run")
for p in (0.001, 0.01, 0.1, 0.5, 0.9, 0.99):
print(" p = {:<5}: {:>9,.1f}".format(p, max(1.0, r99(p))))
print("B. log10 TTS = log10 a + b n (illustrative solvers)")
sa = (0.0, 0.010) # single-core annealing
dev = (-8.0, 0.010) # 10^8 faster, same exponent
heur = (-8.0, 0.010) # classical heuristic, same exponent
alt = (-8.0, 0.012) # 10^8 faster but worse exponent
print(" n SA/dev heuristic/dev SA/dev-worse-slope")
for n in (200, 945, 2000, 4000, 6000):
def lt(s):
return s[0] + s[1] * n
print(" {:>5,} {:>7.0e} {:>13.0e} {:>15.0e}".format(
n, 10 ** (lt(sa) - lt(dev)), 10 ** (lt(heur) - lt(dev)),
10 ** (lt(sa) - lt(alt))))
print("C. 1,000 instances, true speedup ratio = 1 on every instance")
rng = random.Random(20261120)
logs = [rng.gauss(0.0, 0.4) for _ in range(1000)]
allmed = 10 ** statistics.median(logs)
picked = [x for x in logs if x > 0.3]
hardest = sorted(logs)[-100:]
print(" median ratio, all instances {:.3f}".format(allmed))
print(" median ratio, the {} 'fast' ones {:.3f}".format(
len(picked), 10 ** statistics.median(picked)))
print(" median ratio, top 100 by ratio {:.3f}".format(
10 ** statistics.median(hardest)))
share = len([x for x in logs if x > 0]) / len(logs)
print(" share of instances with ratio > 1: {:.3f}".format(share))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《量子启发式组合寻优、拉马努金式直觉猜想与突破性著作推演母典》第 3 章「加速的举证责任:求解时间、标度律与去量子化」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-364 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026364,
author = {Fan, Yafu},
title = {Quantum-Inspired Combinatorial Search, Abductive Intuition and Computationally Verified Breakthrough Monograph Engineering},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}