OAI/Computability/QuantumFactoring/RawTrialDecoder.lean
7 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.ExactQuantumFactoring.OrderTrial.rawAcceptNetline 21Source documentation
Exact ordinary trial decoder, including the sampler's full workspace test, continued-fraction reconstruction, arithmetic validation, and all three retained coin tests. Its inputs are actual retained raw bits.
def rawAcceptNet {k u s n : ℕ} (a m : BooleanNetwork k u) (r : BooleanNetwork k (rawWidth u s n)) : BooleanNetwork k 1 := …Mentions: OAI.ExactQuantumFactoring.BooleanNetwork, OAI.ExactQuantumFactoring.OrderTrial.rawWidth
- lemma
OAI.ExactQuantumFactoring.OrderTrial.rawAcceptNet_valueline 28 - def
OAI.ExactQuantumFactoring.OrderTrial.trialValueNetline 50 - lemma
OAI.ExactQuantumFactoring.OrderTrial.trialValueNet_valueline 54 - lemma
OAI.ExactQuantumFactoring.OrderTrial.trialResult_getD_ltline 68 - def
OAI.ExactQuantumFactoring.OrderTrial.trialSmallValueNetline 80Source documentation
Only VALID ordinary candidates are narrowed to n bits. This does not apply to the separately completed rare guess, whose whole transition word is kept.
def trialSmallValueNet {k u s n : ℕ} (a m : BooleanNetwork k u) (r : BooleanNetwork k (rawWidth u s n)) : BooleanNetwork k n := …Mentions: OAI.ExactQuantumFactoring.BooleanNetwork, OAI.ExactQuantumFactoring.OrderTrial.rawWidth
- lemma
OAI.ExactQuantumFactoring.OrderTrial.trialSmallValueNet_valueline 83