Theorem 7.8, p.107 — no native machine decides in time and charged space
OpenQuantumKtSoI.Supplement.theorem_7_8complexity-theorykolmogorov-complexityp2o-gran-per-chapterp2o-plan-bookp2o-strengthenedp2o-v1quantum-computing
For every rational and integer there is a rational with the following property. No native quantum machine decides in all-branch time and charged space at all sufficiently large lengths. Correctness is required only on the two promise sets.
The charged space of a branch (Definition 7.6) is
This is the gap lower bound at an exponential time bound for machines of polynomial charged space.
Formalization Note The gap problem uses the clipped thresholds of p.49.
Differences from the source:
- generalization: the glue routines are fixed once and for all by their p.24 properties → every admissible glue routine set G (hypothesis G.Admissible); descriptions, P_e and qKt are those of G; reason: the proofs use only the p.24 properties and the paper's routines are one admissible set; same as the published base items
- encoding: a machine of Definition 3.1 → a valid coded machine of the base mission (CodedMachine with Valid), halting on every branch by the floor of the stated deadline; reason: the base mission's representation of machines; halting within a time bound is all-branch and real deadlines are floors (p.22)
- reading: time O(2^{N^δ}) and charged space O(N^ς) in the hypothesis of a negative statement → for all real constants C₁, C₂: no machine with time C₁·2^{N^δ} and charged space C₂·N^ς; reason: p.49 and p.105: O(T) means CT for a constant C; excluding O(·) excludes every constant
Preamble
import Mathlib import Definitions.Def_QuantumKtSoI_qKt import Definitions.Def_QuantumKtSoI_Supplement_DecidesPromise import Definitions.Def_QuantumKtSoI_Supplement_GapMqKtP import Definitions.Def_QuantumKtSoI_Supplement_chargedSpace open Classical
Formal statement
namespace QuantumKtSoI.Supplement
/-- **Theorem 7.8** (Space-restricted gap lower bound; Myrisiotis, *Failure of Symmetry of Information for Quantum Computations*, STOC 2027 submission, held version sha256 6616571c…, p.107). For every rational
`γ ∈ (0,1)` and integer `ς ≥ 1`, there is a rational `δ_{ς,γ} > 0` such that no native quantum
machine decides `Gap-MqKtP[⌊N^γ⌋, N − 2]` in all-branch time `O(2^{N^{δ_{ς,γ}}})` and charged space
`O(N^ς)` at all sufficiently large lengths. Correctness is required only on the two promise sets.
**Formalization Note** The two `O(·)` bounds sit in the hypothesis of a negative statement, so the
statement excludes them for all constants `C₁, C₂`. Gap-MqKtP uses the clipped thresholds of p.49;
"decides in time" is the convention of p.49 (`DecidesPromise`); charged space is Definition 7.6
(`RunsInChargedSpace`). A native machine is a valid coded machine. `G` is any admissible glue
routine set (p.24). -/
theorem theorem_7_8 (G : GlueRoutines) (hG : G.Admissible) :
∀ γ : ℚ, 0 < γ → γ < 1 → ∀ ς : ℕ, 1 ≤ ς → ∃ δ : ℚ, 0 < δ ∧ ∀ C₁ C₂ : ℝ,
¬∃ A : CodedMachine, A.Valid ∧
DecidesPromise A
(GapMqKtPClip (fun x => (qKt G x [] : ℝ)) fun N => ⌊(N : ℝ) ^ (γ : ℝ)⌋₊).1
(GapMqKtPClip (fun x => (qKt G x [] : ℝ)) fun N => ⌊(N : ℝ) ^ (γ : ℝ)⌋₊).2
(fun N => C₁ * (2 : ℝ) ^ ((N : ℝ) ^ (δ : ℝ))) ∧
RunsInChargedSpace A.toMachine fun N => C₂ * (N : ℝ) ^ ς := by sorry
end QuantumKtSoI.Supplement
Source
Myrisiotis, Failure of Symmetry of Information for Quantum Computations, STOC 2027 submission (held version, sha256 6616571c…), Theorem 7.8, p.107; Definition 7.6, p.105