OAI/Computability/QuantumFactoring/SuppliedDivisorCircuit.lean
16 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.ExactQuantumFactoring.Primality.rootSearch_ltline 17 - lemma
OAI.ExactQuantumFactoring.Primality.boundedRoot_ltline 29 - def
OAI.ExactQuantumFactoring.BitArithmetic.firstProperNetline 36 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.firstProperNet_valueline 41 - def
OAI.ExactQuantumFactoring.BitArithmetic.evenOnline 52 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.evenOn_valueline 54 - def
OAI.ExactQuantumFactoring.BitArithmetic.candidateOnline 60 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.candidateOn_valueline 62 - def
OAI.ExactQuantumFactoring.BitArithmetic.rootOnline 75 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.rootOn_valueline 78 - def
OAI.ExactQuantumFactoring.BitArithmetic.rootsOnline 87 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.rootsOn_valueline 89 - def
OAI.ExactQuantumFactoring.BitArithmetic.ordersOnline 97 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.ordersOn_valueline 100 - def
OAI.ExactQuantumFactoring.BitArithmetic.suppliedOnline 111 - theorem
OAI.ExactQuantumFactoring.BitArithmetic.suppliedOn_valueline 118Source documentation
The actual even/root/order implementation. No factorization information is used in this decoder, and all loops are fixed by n and the number of slots.
theorem suppliedOn_value {k n : ℕ} (hn : 0<n) (m : BooleanNetwork k (n+1)) (ars : List (BooleanNetwork k (n+1) × BooleanNetwork k (n+1))) (x : Basis k) (hm : 2≤(bitsValue (m.eval x)).toNat) (hb : (bitsValue (m.eval x)).toNat<2^n) : (bitsValue ((suppliedOn n m ars).eval x)).toNat=suppliedDivisor (bitsValue (m.eval x)).toNat n (ars.map (fun ar => ((bitsValue (ar.1.eval x)).toNat,(bitsValue (ar.2.eval x)).toNat))) := by …Mentions: OAI.ExactQuantumFactoring.BooleanNetwork, OAI.ExactQuantumFactoring.Basis, OAI.ExactQuantumFactoring.bitsValue, OAI.ExactQuantumFactoring.BitArithmetic.suppliedOn, OAI.ExactQuantumFactoring.suppliedDivisor