OAI/Computability/QuantumFactoring/CleanTranslation.lean
3 declarations, 0 contain sorry, 0 declared as axioms
- def
OAI.ExactQuantumFactoring.ControlledTranslation.circuitline 16Source documentation
The clean finite-gate controlled-shift implementation derived from its forward and inverse verified combinational networks.
def circuit {p b : ℕ} (δ : BooleanNetwork p b) : List (Instruction ((p+b)+(p+b)+(δ.net.count+158*b+6))) := …Mentions: OAI.ExactQuantumFactoring.BooleanNetwork, OAI.ExactQuantumFactoring.Instruction
- lemma
OAI.ExactQuantumFactoring.ControlledTranslation.circuit_basisline 21 - lemma
OAI.ExactQuantumFactoring.ControlledTranslation.circuit_lengthline 28