OAI/Computability/QuantumFactoring/ContinuedFractionCircuit.lean
18 declarations, 0 contain sorry, 0 declared as axioms
- abbrev
OAI.ExactQuantumFactoring.BitArithmetic.cfWidthline 16 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfHeadline 18 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfTailline 19 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfPline 20 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfQline 21 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfProductline 22 - def
OAI.ExactQuantumFactoring.BitArithmetic.cfCombineline 24 - def
OAI.ExactQuantumFactoring.BitArithmetic.convergentNetline 29 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfHead_evalline 35 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfTail_evalline 39 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfP_evalline 43 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfQ_evalline 46 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfProduct_valueline 50 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfCombine_valueline 56 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.convergentNet_valueline 79Source documentation
One recursive circuit is used once per Euclidean level; no exponential syntax duplication of earlier convergents.
lemma convergentNet_value {s w : ℕ} (k : ℕ) (hw : cfWidth s k ≤ w) (a b : Basis w) (ha : (bitsValue a).toNat<2^s) (hb : (bitsValue b).toNat<2^s) : ∃ p q : Basis w, (convergentNet w k).eval (Fin.append a b)=Fin.append p q ∧ ((bitsValue p).toNat,(bitsValue q).toNat)=convergentPair (bitsValue a).toNat (bitsValue b).toNat k := by …Mentions: OAI.ExactQuantumFactoring.BitArithmetic.cfWidth, OAI.ExactQuantumFactoring.Basis, OAI.ExactQuantumFactoring.bitsValue, OAI.ExactQuantumFactoring.BitArithmetic.convergentNet
- lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfProduct_countline 125 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.cfCombine_countline 132 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.convergentNet_countline 140