Preprint
Sep 2026
Quantum Meta-Complexity Is All You Need: Characterizing One-Way Puzzles via Time-Bounded Kolmogorov Complexity
The polynomial-time coding theorem is isolated as the single load-bearing open conjecture of the time-bounded meta-complexity program, it is proved that it implies the full polynomial-time characterization, and why the classical derandomization proof resists quantization is analyzed.
Morteza Saberikamarposhti
· 0 citations