OAI/Computability/QuantumFactoring/NodeControlBounds.lean
20 declarations, 0 contain sorry, 0 declared as axioms
- lemma
OAI.ExactQuantumFactoring.BitArithmetic.properOn_countline 18 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.primeBoundline 31 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.guardBoundline 32 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.quotientBoundline 33 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.splitBoundline 34 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.nextBoundline 35 - def
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.stepBoundline 37 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.pending_countline 39 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.top_countline 40 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.divisor_countline 41 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.popped_countline 42 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.quotient_countline 44 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.isPrime_countline 47 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.isDone_countline 49 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.isProper_countline 51 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.split_countline 54 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.next_countline 60 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.emitted_countline 69 - lemma
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.failed_countline 73 - theorem
OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.step_countline 81Source documentation
Explicit polynomial-size bound for the full guarded one-step controller.
theorem step_count (s w : ℕ) : (step s w).net.count ≤ stepBound s w := by …
Mentions: OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.step, OAI.ExactQuantumFactoring.BitArithmetic.NodeCircuit.stepBound