Quantum and CircuitsReading edition

AffineOutput: 14 declarations

Reading tools
Reading libraryFind statementsInspect Lean
Switch work

Saved reading

Read side by side

Verification statements describe the retained edition and its recorded evidence. This HTML presentation adds no Lean execution or proof review.

Start reading

Resources & source

Original TeX with line links · Download TeX

The wording and mathematics follow the retained manuscript. This reading format does not add a proof review or extend Lean coverage.

Skip contents and start reading

AffineOutput: 14 declarations

L094 restores_append

Source. CircuitObstructions/AffineOutput.lean:12
Block. 02 Axioms. propext

CircuitObstructions.restores_append {X W : Type} [DecidableEq W] (e : CircuitObstructions.Boundary X W)
  (c d : CircuitObstructions.Circuit W) (f g : X → Bool) (hc : CircuitObstructions.Restores e c f)
  (hd : CircuitObstructions.Restores e d g) : CircuitObstructions.Restores e (c ++ d) fun x => f x ^^ g x

L095 canonical_target_not

Source. CircuitObstructions/AffineOutput.lean:20
Block. 02 Axioms. propext, Quot.sound

CircuitObstructions.canonical_target_not (n a : Nat) (x : Fin n → Bool) (b : Bool) :
  (CircuitObstructions.Gate.not (CircuitObstructions.canonicalBoundary n a).target).eval
      ((CircuitObstructions.canonicalBoundary n a).encode x b) =
    (CircuitObstructions.canonicalBoundary n a).encode x (b ^^ true)
L096 canonical_input_to_target

Source. CircuitObstructions/AffineOutput.lean:34
Block. 02 Axioms. propext, Quot.sound

CircuitObstructions.canonical_input_to_target (n a : Nat) (i : Fin n) (x : Fin n → Bool) (b : Bool) :
  (CircuitObstructions.inputToTarget n a i).eval ((CircuitObstructions.canonicalBoundary n a).encode x b) =
    (CircuitObstructions.canonicalBoundary n a).encode x (b ^^ x i)
L097 affine_restored_exists

Source. CircuitObstructions/AffineOutput.lean:45
Block. 02 Axioms. propext, Quot.sound

CircuitObstructions.affine_restored_exists (n a : Nat) (g : CircuitObstructions.BFun n)
  (hg : CircuitObstructions.DegreeLE 1 g) :
  ∃ d,
    CircuitObstructions.toffoliCount d = 0 ∧
      CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) d g
L098 betaStar_exists

Source. CircuitObstructions/AffineOutput.lean:76
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_exists {n : Nat} (f : CircuitObstructions.BFun n) :
  ∃ r, CircuitObstructions.AffineSafeDegreeLE f r ∧ ∀ (k : Nat), CircuitObstructions.AffineSafeDegreeLE f k → r ≤ k
L099 betaStar_spec

Source. CircuitObstructions/AffineOutput.lean:85
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_spec {n : Nat} (f : CircuitObstructions.BFun n) :
  CircuitObstructions.AffineSafeDegreeLE f (CircuitObstructions.betaStar f)
L100 betaStar_le_of_bound

Source. CircuitObstructions/AffineOutput.lean:88
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_le_of_bound {n d : Nat} {f : CircuitObstructions.BFun n}
  (h : CircuitObstructions.AffineSafeDegreeLE f d) : CircuitObstructions.betaStar f ≤ d
L101 betaStar_le_inputs

Source. CircuitObstructions/AffineOutput.lean:92
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_le_inputs {n : Nat} (f : CircuitObstructions.BFun n) : CircuitObstructions.betaStar f ≤ n
L102 beta_le_betaStar

Source. CircuitObstructions/AffineOutput.lean:97
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.beta_le_betaStar {n : Nat} (f : CircuitObstructions.BFun n) :
  CircuitObstructions.beta f ≤ CircuitObstructions.betaStar f
L103 betaStar_le_half_toffoliCount

Source. CircuitObstructions/AffineOutput.lean:101
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_le_half_toffoliCount (n a : Nat)
  (c : CircuitObstructions.Circuit (CircuitObstructions.CanonicalWire n a)) (f : CircuitObstructions.BFun n)
  (hR : CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) c f) :
  CircuitObstructions.betaStar f ≤ (CircuitObstructions.toffoliCount c + 1) / 2 + 1
L104 betaStar_restoration_bound

Source. CircuitObstructions/AffineOutput.lean:112
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.betaStar_restoration_bound (n a : Nat)
  (c : CircuitObstructions.Circuit (CircuitObstructions.CanonicalWire n a)) (f : CircuitObstructions.BFun n)
  (hR : CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) c f) :
  2 * CircuitObstructions.betaStar f ≤ CircuitObstructions.toffoliCount c + 3
L105 toffoliCount_ge_two_betaStar_sub_three

Source. CircuitObstructions/AffineOutput.lean:119
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.toffoliCount_ge_two_betaStar_sub_three (n a : Nat)
  (c : CircuitObstructions.Circuit (CircuitObstructions.CanonicalWire n a)) (f : CircuitObstructions.BFun n)
  (hR : CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) c f) :
  2 * CircuitObstructions.betaStar f - 3 ≤ CircuitObstructions.toffoliCount c
L106 canonical_restored_output_degree

Source. CircuitObstructions/AffineOutput.lean:126
Block. 02 Axioms. propext, Quot.sound

CircuitObstructions.canonical_restored_output_degree (n a : Nat)
  (c : CircuitObstructions.Circuit (CircuitObstructions.CanonicalWire n a)) (f : CircuitObstructions.BFun n)
  (hR : CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) c f) :
  CircuitObstructions.DegreeLE (CircuitObstructions.toffoliCount c + 1) f
L107 restored_degree_and_cover_bound

Source. CircuitObstructions/AffineOutput.lean:140
Block. 02 Axioms. propext, Classical.choice, Quot.sound

CircuitObstructions.restored_degree_and_cover_bound (n a : Nat)
  (c : CircuitObstructions.Circuit (CircuitObstructions.CanonicalWire n a)) (f : CircuitObstructions.BFun n)
  (hR : CircuitObstructions.Restores (CircuitObstructions.canonicalBoundary n a) c f) :
  CircuitObstructions.DegreeLE (CircuitObstructions.toffoliCount c + 1) f ∧
    2 * CircuitObstructions.betaStar f ≤ CircuitObstructions.toffoliCount c + 3
Source and conversion record

Source SHA-256: 36eb83548efd74b42264ab400e359c2de20c701b436b132b8b2859312d2dcdba

Unsupported prose commands stop the build. The mathematical expression sequence is checked against the source, with manuscript macros expanded for display.

Conversion records

Notation in Quantum and Circuits

Look up a symbol without leaving this chapter. Select text before opening help to search for it.

Search this work’s notation.

    Symbols can have different meanings in different passages. Read each result in its own context.

    Open the full notation index