Uniformity bridge — a family serialized by a word RAM on raw prefixes is a uniform resource family
ProvedTwoFoldOPI.uniformFamily_of_RAMSerializableFLet assign a concrete quantum program to every instance of Theorem 7.4. Suppose a polynomial-time word-RAM algorithm computes a function such that, on the zero-padded prefix of the instance encoding,
- outputs
truefollowed by the canonical serialization of when and ; - outputs otherwise.
Then there is a UniformResourceFamily over the instances, with encoding and size parameter , whose programs are exactly . That is, there are one public bit program (no coins, no oracle queries) and one polynomial such that, on the bare encoding with no end marker, the bit program halts successfully with output , within steps and visited cells.
This reduces the uniformity requirement of Theorem 7.4 to programming its classical constructor on the word RAM. That constructor has to read the instance encoding anyway, so recognising when a prefix is long enough adds little.
Formalization Note. The hypothesis is TwoFoldOPI.RAMSerializableF construct. The conclusion fixes the family's construct field to the given function.
import Mathlib import Definitions.Def_QAlgorithms_Defs_OPIUniformity import Definitions.Def_TwoFoldOPI_Input import Definitions.Def_TwoFoldOPI_RAMSerializableF
namespace TwoFoldOPI
open QAlgorithms.OPI
theorem uniformFamily_of_RAMSerializableF (construct : Input → PackedMembershipProgram)
(h : RAMSerializableF construct) :
∃ A : UniformResourceFamily Input Input.encode Input.scale, A.construct = construct := by
sorry
end TwoFoldOPI