Quantum-Inspired Combinatorial Search, Abductive Intuition and Computationally Verified Breakthrough Monograph Engineering: chapter answers
Three popular sentences dominate talk about original research: quantum computers try every possibility at once, so "quantum inspiration" means faster exhaustive search; the intuition of genius cannot be learned, so Ramanujan-style conjectures come from inspiration alone; and the more distant an analogy, the better the idea. This book refutes each sentence or draws its boundary. After checking the original papers it corrects its own blueprint: the quantum speedup for unstructured search is only a square root and is proved unbeatable; the advantage of eight orders of magnitude reported for a ha…
DOI pending · monograph page goes live after publication · 5DL-B-364 · 中文版
- Chapter 1 · The Square-Root Wall: a Classical Simulation of Amplitude Amplification and the Lower Bound for Unstructured Search
The classical cost of unstructured search is proportional to N and the quantum cost is proportional to √N. These are proved upper and lower bounds, not a temporary engineering gap. Program p11 simulated the amplitudes r… - Chapter 2 · Annealing, Restarts and the Metropolis Rule: Classical Recipes for Escaping Local Optima
Chapter 2 compares greedy descent, random restarts and annealing on a frustrated spin glass: greedy descent stalls at a hit rate of 0.060, random restarts rise to 0.985 with the budget, and several short anneals do as w… - Chapter 3 · The Burden of Proof for a Speedup: Time to Solution, Scaling Laws and Dequantisation
The time to solution turns a hit rate into hours: a method that succeeds with probability 0.01 must be repeated 458.2 times for 99 % confidence. A constant-factor advantage does not change with size, while a slightly wo… - Chapter 4 · Amplifying Samples by Value: Importance Sampling and Upper Confidence Bounds
Classical statistics has two mature ways of amplifying samples by value. Importance sampling switches to a distribution aimed at the target and corrects with weights: in estimating a normal tail probability, a shift of… - Chapter 5 · Shared Structure: Spectral Fingerprints, Exhaustive Mappings and the Typicality of Combinations
Structural similarity and verbal similarity are different things. Heat conduction and the circuit have identical singular values and a spectral distance of 0.0000 while sharing no words; the kitchen scene shares words a… - Chapter 6 · A Pipeline for Ramanujan-Style Conjectures: Abundant Generation, Exhaustive Refutation and Exact Bounds
Chapter 6 builds a pipeline for Ramanujan-style conjectures: Euler-type candidates from a template are refuted at a rate of 0.9970, and the Pólya conjecture survives every small check although its smallest counterexampl… - Chapter 7 · Following the Natural Joints and Reasoning to Hypotheses: Cook Ding, Shen Kuo, Peirce and Hardy
Chapter 7 examines Cook Ding in the Zhuangzi, Shen Kuo's rule for stacked piles, Peirce on abduction and one sentence of Hardy, and checks Shen Kuo's correction on 27,000 piles. - Chapter 8 · Closing the Empirical Loop: Standard Operating Templates and Checker Specification
Chapter 8 supplies a weekly ledger of original propositions, an optimisation log, the checker specification of the distilled Remote-Analogy Conjecture Refutation Pipeline and pre-registered tests. Marked boxes separate…
Illustrative model calculation, not a live quote