6.9. QuantumBlockEncoding/GrayBasis.lean
8 explicit public declarations, in source order.
Plain-English reading. This definition gives the library's named construction or computation for “twist”.
Formal status. Compiled declaration in the default ASPBE import surface; its kind and displayed Lean type determine how it may be used.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. def.
Source: QuantumBlockEncoding/GrayBasis.lean:9. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition6.9.1●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.GrayBasis.twist[complete]
-
QuantumBlockEncoding.GrayBasis.twist[complete]
-
defdefined in QuantumBlockEncoding/GrayBasis.leancomplete
def QuantumBlockEncoding.GrayBasis.twist (n : ℕ) : Equiv.Perm (Fin (2 ^ n) × Fin 2)
def QuantumBlockEncoding.GrayBasis.twist (n : ℕ) : Equiv.Perm (Fin (2 ^ n) × Fin 2)
Plain-English reading. This definition gives the library's named construction or computation for “equiv”.
Formal status. Compiled declaration in the default ASPBE import surface; its kind and displayed Lean type determine how it may be used.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. def.
Source: QuantumBlockEncoding/GrayBasis.lean:15. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition6.9.2●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.GrayBasis.equiv[complete]
-
QuantumBlockEncoding.GrayBasis.equiv[complete]
-
defdefined in QuantumBlockEncoding/GrayBasis.leancomplete
def QuantumBlockEncoding.GrayBasis.equiv (n : ℕ) : Fin (2 ^ n) ≃ QuantumBlockEncoding.PrimitiveBasis n
def QuantumBlockEncoding.GrayBasis.equiv (n : ℕ) : Fin (2 ^ n) ≃ QuantumBlockEncoding.PrimitiveBasis n
Plain-English reading. This definition gives the library's named construction or computation for “head bit”.
Formal status. Compiled declaration in the default ASPBE import surface; its kind and displayed Lean type determine how it may be used.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. def.
Source: QuantumBlockEncoding/GrayBasis.lean:24. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Definition6.9.3●1 definition
Associated Lean declarations
-
QuantumBlockEncoding.GrayBasis.headBit[complete]
-
QuantumBlockEncoding.GrayBasis.headBit[complete]
-
defdefined in QuantumBlockEncoding/GrayBasis.leancomplete
def QuantumBlockEncoding.GrayBasis.headBit (index : ℕ) : Fin 2
def QuantumBlockEncoding.GrayBasis.headBit (index : ℕ) : Fin 2
Plain-English reading. Lean checks the proposition indexed as “equiv head”; the hypotheses and conclusion in the code panel fix its exact scope.
Formal status. Compiled theorem in the default ASPBE import surface; the displayed Lean signature is the authoritative claim.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/GrayBasis.lean:28. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem6.9.4●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/GrayBasis.leancomplete
theorem QuantumBlockEncoding.GrayBasis.equiv_head (n : ℕ) (index : Fin (2 ^ (n + 1))) : (QuantumBlockEncoding.GrayBasis.equiv (n + 1)) index 0 = QuantumBlockEncoding.GrayBasis.headBit ↑index
theorem QuantumBlockEncoding.GrayBasis.equiv_head (n : ℕ) (index : Fin (2 ^ (n + 1))) : (QuantumBlockEncoding.GrayBasis.equiv (n + 1)) index 0 = QuantumBlockEncoding.GrayBasis.headBit ↑index
Plain-English reading. Lean checks the proposition indexed as “equiv tail”; the hypotheses and conclusion in the code panel fix its exact scope.
Formal status. Compiled theorem in the default ASPBE import surface; the displayed Lean signature is the authoritative claim.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/GrayBasis.lean:31. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem6.9.5●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/GrayBasis.leancomplete
theorem QuantumBlockEncoding.GrayBasis.equiv_tail (n : ℕ) (index : Fin (2 ^ (n + 1))) (wire : Fin n) : (QuantumBlockEncoding.GrayBasis.equiv (n + 1)) index wire.succ = (QuantumBlockEncoding.GrayBasis.equiv n) ⟨↑index / 2, ⋯⟩ wire
theorem QuantumBlockEncoding.GrayBasis.equiv_tail (n : ℕ) (index : Fin (2 ^ (n + 1))) (wire : Fin n) : (QuantumBlockEncoding.GrayBasis.equiv (n + 1)) index wire.succ = (QuantumBlockEncoding.GrayBasis.equiv n) ⟨↑index / 2, ⋯⟩ wire
Plain-English reading. Lean checks the proposition indexed as “head bit even”; the hypotheses and conclusion in the code panel fix its exact scope.
Formal status. Compiled theorem in the default ASPBE import surface; the displayed Lean signature is the authoritative claim.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/GrayBasis.lean:37. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem6.9.6●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/GrayBasis.leancomplete
theorem QuantumBlockEncoding.GrayBasis.headBit_even (index : ℕ) (even : index % 2 = 0) : QuantumBlockEncoding.GrayBasis.headBit (index + 1) = QuantumBlockEncoding.flipBit (QuantumBlockEncoding.GrayBasis.headBit index)
theorem QuantumBlockEncoding.GrayBasis.headBit_even (index : ℕ) (even : index % 2 = 0) : QuantumBlockEncoding.GrayBasis.headBit (index + 1) = QuantumBlockEncoding.flipBit (QuantumBlockEncoding.GrayBasis.headBit index)
Plain-English reading. Lean checks the proposition indexed as “head bit odd”; the hypotheses and conclusion in the code panel fix its exact scope.
Formal status. Compiled theorem in the default ASPBE import surface; the displayed Lean signature is the authoritative claim.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. The source declaration has no docstring. The reader cue above is generated from its kind and name and does not replace the Lean signature.
Declaration kind. theorem.
Source: QuantumBlockEncoding/GrayBasis.lean:44. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem6.9.7●1 theorem
Associated Lean declarations
-
theoremdefined in QuantumBlockEncoding/GrayBasis.leancomplete
theorem QuantumBlockEncoding.GrayBasis.headBit_odd (index : ℕ) (odd : index % 2 = 1) : QuantumBlockEncoding.GrayBasis.headBit (index + 1) = QuantumBlockEncoding.GrayBasis.headBit index
theorem QuantumBlockEncoding.GrayBasis.headBit_odd (index : ℕ) (odd : index % 2 = 1) : QuantumBlockEncoding.GrayBasis.headBit (index + 1) = QuantumBlockEncoding.GrayBasis.headBit index
Plain-English reading. Lean checks the proposition indexed as “adjacent”; the hypotheses and conclusion in the code panel fix its exact scope. Numerically adjacent Gray labels differ by exactly one physical X action.
Formal status. Compiled theorem in the default ASPBE import surface; the displayed Lean signature is the authoritative claim.
Why it is in this chapter. Circuit and register semantics, reusable tensor-train and matrix constructions, and explicit exact-real storage-cost refinements. Each declaration's hypotheses and conclusion fix its certified scope.
Technical source note. Numerically adjacent Gray labels differ by exactly one physical X action.
Declaration kind. theorem.
Source: QuantumBlockEncoding/GrayBasis.lean:55. A commit-pinned external link is added by the publication build when the source exists at the published ref.
Lean code for Theorem6.9.8●1 theorem
Associated Lean declarations
-
QuantumBlockEncoding.GrayBasis.adjacent[complete]
-
QuantumBlockEncoding.GrayBasis.adjacent[complete]
-
theoremdefined in QuantumBlockEncoding/GrayBasis.leancomplete
theorem QuantumBlockEncoding.GrayBasis.adjacent {n : ℕ} (first second : Fin (2 ^ n)) (next : ↑first + 1 = ↑second) : ∃ target, (QuantumBlockEncoding.GrayBasis.equiv n) second = QuantumBlockEncoding.xBasisAction target ((QuantumBlockEncoding.GrayBasis.equiv n) first)
theorem QuantumBlockEncoding.GrayBasis.adjacent {n : ℕ} (first second : Fin (2 ^ n)) (next : ↑first + 1 = ↑second) : ∃ target, (QuantumBlockEncoding.GrayBasis.equiv n) second = QuantumBlockEncoding.xBasisAction target ((QuantumBlockEncoding.GrayBasis.equiv n) first)
Numerically adjacent Gray labels differ by exactly one physical X action.