Documentation

MIPRE.Background.QLD.Chain

The pulling chain's index algebra, and its first displays #

lem:qld-pauli-selfcons is proved by a chain of eleven displays that ends at

sum_{g,h,g',h' : g - g_h = g' - g_h', (cd(g) - h) . u-tilde = a}
  ((S-hat^W_g)_{A A'} (x) (tau^W_h)_{A''}) . ((S-hat^W_g')_{B B'} (x) (tau^W_h')_{B''})

and concludes by the observation that this expression is symmetric between (g, h) and (g', h'), so that the analogous derivation starting from Bob's exact Pauli measurement reaches the same place, and the two are therefore close to each other. That observation is the whole reason the lemma holds, and the reason it is not obvious is that the two conditions cutting out the index set look asymmetric: the second mentions both pairs, but the first mentions only g and h.

The paper's sentence is that the conditions (cd(g) - h) . u-tilde = a and g - g_h = g' - g_h' are together equivalent to (cd(g') - h') . u-tilde = a and g - g_h = g' - g_h'. This file is that sentence, together with the rewriting of the exact Pauli measurement over the same index set (eq:qld-pulling-2 and eq:qld-pulling-2b), the chain's Schwartz--Zippel step, and the chain's first displays, eq:qld-pulling-0 to eq:qld-pulling-3b, each of which concerns one simultaneous pair measurement. The displays that compare the two players' pair measurements on the physical state, from eq:qld-pulling-4 on, are in MIPRE/Background/QLD/ChainPhysical.lean.

Subtraction is written as addition throughout, the field having characteristic two.

Stated in a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The index algebra is unchanged. The chain's summand chainOp is, as mTildeAnc is, a matrix over the first algebra of the model of a SimulPair on the register Anc F m (register outer, smulKron). The displays eq:qld-pulling-0 to -3b are stated for a pair measurement on the first cut of the physical state (CutSimul N S K δ) and read in the physical model phys (Anc F m) F m d N K itself. The matrix route ran them on a regrouping mVec of the first cut's state that gives A'' to Alice --- whose model is the physical model --- and then carried them to the physical cut by an explicit lift (physLift, which regrouped the registers and appended Bob's pair); the first cut and the physical model share one state model, so here the chain's terms are elements of its algebra from the start, and nothing is lifted. The helper's near-identity nearId is the first cut's agreement operator, written physically by the reading lemmas cut1_πA, cut1_πB; the strategy's point measurements are read with the registers inert (physInert); the EPR switching of eq:qld-pulling-3a is the mirror identity of Alice's own pair in the physical state (physE_mirror_A); and the estimates about one state are stated in a state model (sum_snorm_sq_sub_mul, sum_snorm_sq_fiber_sandwich_subset_le).

The label a pair of outcomes carries #

def MIPRE.QLD.chainLabel {F : Type u_1} [Field F] {m d : ℕ} (g : LIDT.LowIndDegPoly) (h : Anc F m) :
Anc F m

The chain's label. cd(g) - h is the paper's difference of the pair outcome's cube data and the Weyl outcome; the chain's index set asks its pairing with the probe to be the measurement outcome.

Equations
Instances For
    def MIPRE.QLD.ChainCoupled {F : Type u_1} [Field F] {m d : ℕ} (g g' : LIDT.LowIndDegPoly) (h h' : Anc F m) :

    The chain's coupling condition. The paper's g - g_h = g' - g_{h'}, with g_h the low-degree encoding of h.

    Equations
    Instances For
      @[instance_reducible]
      noncomputable instance MIPRE.QLD.decidableChainCoupled {F : Type u_1} [Field F] [DecidableEq F] {m d : ℕ} (g g' : LIDT.LowIndDegPoly) (h h' : Anc F m) :
      Equations
      theorem MIPRE.QLD.chainCoupled_symm {F : Type u_1} [Field F] {m d : ℕ} {g g' : LIDT.LowIndDegPoly} {h h' : Anc F m} (hc : ChainCoupled g g' h h') :
      ChainCoupled g' g h' h

      The coupling is symmetric on its face, which is half of the display's symmetry.

      theorem MIPRE.QLD.chainLabel_eq_of_coupled {F : Type u_1} [Field F] {m d : ℕ} {g g' : LIDT.LowIndDegPoly} {h h' : Anc F m} (hc : ChainCoupled g g' h h') :

      Coupled pairs carry the same label, which is the other half. Evaluating the coupling at a cube point reads off the two labels there, the encoding of a cube datum being that datum on the cube.

      theorem MIPRE.QLD.dotF_chainLabel_eq_of_coupled {F : Type u_1} [Field F] {m d : ℕ} {g g' : LIDT.LowIndDegPoly} {h h' : Anc F m} (hc : ChainCoupled g g' h h') (v : Anc F m) :

      So the chain's last display is symmetric between the two pairs. Its index set is cut out by the coupling, symmetric on its face, and by a pairing condition read off one pair --- and the two readings agree, so it may be read off either. That is what lets the derivation starting from Bob's exact Pauli measurement reach the same expression as Alice's, and hence what makes lem:qld-pauli-selfcons conclude.

      The index set, and the exact Pauli measurement written over it #

      def MIPRE.QLD.chainIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} (v : Anc F m) (a : F) :

      The chain's index set at the probe v and the outcome a: the pairs whose label pairs with the probe to give a.

      Equations
      Instances For
        @[simp]
        theorem MIPRE.QLD.mem_chainIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {v : Anc F m} {a : F} {p : LIDT.LowIndDegPoly × Anc F m} :
        p ∈ chainIdx v a ↔ Weyl.dotF (chainLabel p.1 p.2) v = a
        theorem MIPRE.QLD.dotF_chainLabel_eq_iff {F : Type u_1} [Field F] [Algebra (ZMod 2) F] {m d : ℕ} (g : LIDT.LowIndDegPoly) (h v : Anc F m) (a : F) :

        In characteristic two the syndrome's condition and the label's are one condition.

        A reindexing, and the label filters #

        The chain's label filters are products, the label reading only the first pair. The reindexing fact before them is not the chain's: it is about matrices, a regrouping of the matrix route (SwapItemTwo.lean) still uses it, and it is kept here unchanged.

        theorem MIPRE.QLD.mulVec_comp_equiv {N : Type u_2} {N' : Type u_3} [Fintype N] [Fintype N'] [DecidableEq N] [DecidableEq N'] (e : N ≃ N') (v : N → ℂ) (A : Matrix N N ℂ) :
        ((Matrix.reindex e e) A).mulVec (v ∘ ⇑e.symm) = A.mulVec v ∘ ⇑e.symm

        A reindexing carries mulVec the way it carries the quadratic form.

        theorem MIPRE.QLD.sum_chainLabel_filter {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {ι : Type u_2} [Fintype ι] [DecidableEq ι] {A : Type u_3} [AddCommMonoid A] (v : Anc F m) (a : F) (f : (LIDT.LowIndDegPoly × Anc F m) × ι → A) :
        ∑ t : (LIDT.LowIndDegPoly × Anc F m) × ι with Weyl.dotF (chainLabel t.1.1 t.1.2) v = a, f t = ∑ p ∈ chainIdx v a, ∑ i : ι, f (p, i)

        The chain's three- and four-index label filters are products, the label reading only the first pair.

        The chain's endpoint index set, and its symmetry #

        Display eq:qld-pulling-12 is a sum over pairs of index pairs, one per party, coupled by g - g_h = g' - g_{h'} and cut out by the pairing condition on the first. Both parties' derivations end there, and that is only because the expression does not in fact depend on which party's pair the condition is read off.

        noncomputable def MIPRE.QLD.coupledIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} (v : Anc F m) (a : F) :

        The index set of eq:qld-pulling-12: coupled pairs, with the label read off the first.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          @[simp]
          theorem MIPRE.QLD.mem_coupledIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {v : Anc F m} {a : F} {q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m} :
          q ∈ coupledIdx v a ↔ ChainCoupled q.1.1 q.2.1 q.1.2 q.2.2 ∧ Weyl.dotF (chainLabel q.1.1 q.1.2) v = a
          theorem MIPRE.QLD.swap_mem_coupledIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {v : Anc F m} {a : F} {q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m} :

          The index set does not care which pair the label is read off. This is the paper's sentence: the conditions (cd(g) - h) . u-tilde = a and g - g_h = g' - g_{h'} are together equivalent to (cd(g') - h') . u-tilde = a and the same coupling.

          noncomputable def MIPRE.QLD.chainQShift {F : Type u_1} [Field F] {m d : ℕ} (u : LIDT.Point F m) (q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m) :
          F

          The outcome the chain's four-index pair carries, the paper's (g - g_h + g_h')(u).

          Equations
          Instances For

            eq:qld-pulling-12, Schwartz--Zippel #

            The chain's last display, and its only step that is not about operators: the constraint the chain carries is an equality of polynomial values at the sampled point, and passing to equality of the polynomials themselves discards only the tuples where distinct polynomials happen to agree there.

            theorem MIPRE.QLD.sum_uniform_chainCoupled_agree_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) {g g' : LIDT.LowIndDegPoly} {h h' : Anc F m} (hne : ¬ChainCoupled g g' h h') :
            (∑ u : LIDT.Point F m, uniform (LIDT.Point F m) u * if g.eval u + Weyl.dotF h (LowDegree.indVec u) = g'.eval u + Weyl.dotF h' (LowDegree.indVec u) then 1 else 0) ≤ ↑m * ↑d / ↑(Fintype.card F)

            Schwartz--Zippel for the chain's coupling. Two index pairs that are not coupled carry distinct polynomials, and distinct polynomials of individual degree at most d agree at a uniform point with probability at most md/q. The encoding of a Weyl outcome is multilinear, so adding it keeps the degree bound as long as d is at least one.

            theorem MIPRE.QLD.chainQShift_eq_iff {F : Type u_1} [Field F] [Algebra (ZMod 2) F] {m d : ℕ} (u : LIDT.Point F m) (q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m) :
            chainQShift u q = q.2.1.eval u ↔ q.1.1.eval u + Weyl.dotF q.1.2 (LowDegree.indVec u) = q.2.1.eval u + Weyl.dotF q.2.2 (LowDegree.indVec u)

            The chain's agreement condition, in the form Schwartz--Zippel reads. In characteristic two the shift the chain carries may be moved to the other side.

            theorem MIPRE.QLD.sum_filter_and {ι : Type u_2} [Fintype ι] [DecidableEq ι] (p r : ι → Prop) [DecidablePred p] [DecidablePred r] (f : ι → ℝ) :
            ∑ i : ι with r i ∧ p i, f i = ∑ i : ι with r i, if p i then f i else 0

            A version of Finset.filter bookkeeping the display needs: restricting a weighted sum to a subset of the index is the same as zeroing the weights outside it.

            theorem MIPRE.QLD.sum_uniform_chainCoupled_mass_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] (hd : 1 ≤ d) (w : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m → ℝ) (hw0 : ∀ (q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m), 0 ≤ w q) (hw : ∑ q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m, w q ≤ 1) :
            ∑ u : LIDT.Point F m, uniform (LIDT.Point F m) u * ∑ q : (LIDT.LowIndDegPoly × Anc F m) × LIDT.LowIndDegPoly × Anc F m with chainQShift u q = q.2.1.eval u ∧ ¬ChainCoupled q.1.1 q.2.1 q.1.2 q.2.2, w q ≤ ↑m * ↑d / ↑(Fintype.card F)

            Display eq:qld-pulling-12, as a bound on a weighted sum. The chain's constraint is an equality of polynomial values at the sampled point; passing to equality of the polynomials themselves discards only the tuples where distinct polynomials happen to agree there, and those carry at most md/q of the weight.

            Estimates about one state #

            Two facts about a single state that the chain's displays share, stated in a state model (MIPRE/Foundations/StateModel.lean): right-multiplying a projective measurement costs exactly the operator's deviation from the identity, and the chain's terms, grouped by the measurement outcome, have as summed squared norm a sum of sandwiches.

            theorem MIPRE.QLD.sum_snorm_sq_sub_mul {𝒞 : Type u_2} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) {Λ : Type u_3} [Fintype Λ] [DecidableEq Λ] {P : Λ → 𝒞} (hP : IsPVMIn P) (Y : 𝒞) :
            ∑ a : Λ, M.snorm (P a - P a * Y) ^ 2 = M.snorm (1 - Y) ^ 2

            Right-multiplying a projective measurement costs exactly the operator's deviation from the identity. Summed over the outcomes there is no cross term, so no factor of the outcome count appears --- which is what makes display eq:qld-pulling-1 free rather than lossy.

            theorem MIPRE.QLD.sum_snorm_sq_fiber_sandwich_subset_le {𝒞 : Type u_2} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) {ι : Type u_3} {C : Type u_4} [Fintype ι] [DecidableEq ι] [Fintype C] [DecidableEq C] {P : ι → 𝒞} (hP : IsPVMIn P) (W : ι → 𝒞) (c : ι → C) (D : Finset ι) {ε : ℝ} (hbound : ∑ i ∈ D, M.qform (star (W i) * P i * W i) ≤ ε) :
            ∑ a : C, M.snorm (∑ i ∈ D with c i = a, P i * W i) ^ 2 ≤ ε

            The outer shape both remaining displays share. Each is a bound on the summed squared norm of the chain's terms, grouped by the measurement outcome. Projectivity turns each group into a sum of sandwiches (snorm_sq_sum_proj_sandwich), the groups are the fibres of the outcome map, so the double sum is the single one over the index --- and what is left to bound is a sum of sandwiches with no outcome in it. The index may be a subset, which is what eq:qld-pulling-10 needs: it sums over the pairs whose outcomes disagree.

            theorem MIPRE.QLD.sum_snorm_sq_fiber_sandwich_le {𝒞 : Type u_2} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) {ι : Type u_3} {C : Type u_4} [Fintype ι] [DecidableEq ι] [Fintype C] [DecidableEq C] {P : ι → 𝒞} (hP : IsPVMIn P) (W : ι → 𝒞) (c : ι → C) {ε : ℝ} (hbound : ∑ i : ι, M.qform (star (W i) * P i * W i) ≤ ε) :
            ∑ a : C, M.snorm (∑ i : ι with c i = a, P i * W i) ^ 2 ≤ ε

            The case the first of the two displays uses, where the whole index is summed over.

            Two projective families of the two players, and fact:add-a-proj #

            theorem MIPRE.QLD.isPVMIn_πA_mul_πB {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {ι : Type u_5} {κ : Type u_6} [Fintype ι] [Fintype κ] {P : ι → 𝒜} {Q : κ → ℬ} (hP : IsPVMIn P) (hQ : IsPVMIn Q) :
            IsPVMIn fun (t : ι × κ) => M.πA (P t.1) * M.πB (Q t.2)

            A product of projective measurements of the two players is projective, indexed by the pairs of outcomes: the two families commute.

            theorem MIPRE.QLD.πB_sandwich {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (A : 𝒜) (Y B : ℬ) :
            star (M.πB B) * (M.πA A * M.πB Y) * M.πB B = M.πA A * M.πB (star B * Y * B)

            A second-player sandwich of a product of the two players' operators: the first player's factor is untouched.

            theorem MIPRE.QLD.sum_bornProb_sandwich_drop_le {𝒞 : Type u_2} {𝒜 : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [PartialOrder 𝒜] [StarOrderedRing 𝒜] {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {anc : Type u_6} {ι : Type u_7} {κ : Type u_8} [Fintype anc] [DecidableEq anc] [Fintype ι] [Fintype κ] (M : BipartiteModel 𝒞 𝒜 (Matrix anc anc R)) {S : ι → 𝒜} (hS : IsPVMIn S) (X : ι → 𝒜) {B : ι → R} (hBsa : ∀ (i : ι), star (B i) = B i) (hBidem : ∀ (i : ι), B i * B i = B i) {T : κ → Matrix anc anc ℂ} (hT : IsPVM T) :
            ∑ i : ι, ∑ x : κ, M.bornProb (star (X i) * S i * X i) (smulKron (B i) (T x)) ≤ ∑ i : ι, M.bornProb (star (X i) * S i * X i) 1

            Dropping the far party's sub-identity factor. Each of the chain's sandwiches carries, on the far party, a projector times a Weyl outcome; summed over the outcome those are at most the identity, so the whole sum is bounded by the near party's sandwiches alone. This is fact:add-a-proj in the form eq:qld-pulling-7 and eq:qld-pulling-11 consume it, for a second player whose algebra is the matrices over R on the register.

            theorem MIPRE.QLD.sum_bornProb_compHom_kron_le {𝒞 : Type u_2} {𝒜 : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [PartialOrder 𝒜] [StarOrderedRing 𝒜] {R : Type u_5} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] {anc : Type u_6} {α : Type u_7} {X : Type u_8} [Fintype anc] [DecidableEq anc] [Fintype α] [DecidableEq α] [Fintype X] (M : BipartiteModel 𝒞 𝒜 (Matrix (anc × α) (anc × α) R)) {A : 𝒜} (hA : 0 ≤ A) {B : X → Matrix α α R} (hBsa : ∀ (x : X), star (B x) = B x) (hB : ∀ (x : X), B x * B x = B x) {T : X → Matrix anc anc ℂ} (hT : IsPVM T) :
            ∑ x : X, M.bornProb A (compHom (smulKron (B x) (T x))) ≤ M.bornProb A 1

            The same, for a second player whose registers are a pair: the second player's algebra is the matrices over R on anc × α, the far party's factor a projection of α times a projective measurement of anc flattened onto the pair (compHom). The flattening is monotone, being a ⋆-homomorphism of star-ordered rings.

            The physical registers' operators #

            A player's physical registers are (A'', (Ea, A')) (PhysReg). Three kinds of operators of them occur in the chain: an operator X of (Ea, A') with the far half A'' inert, compHom (diagonal fun _ => X) --- the first player's operators of the first cut, read physically (cut1_πA); a matrix Q of scalars on the far half, compHom (smulKron 1 Q); and their products, compHom (smulKron X Q). These are the identities between them, over any ⋆-algebra.

            theorem MIPRE.QLD.smulKron_one_mul_diagonal {R : Type u_2} [Ring R] [Algebra ℂ R] {γ : Type u_3} [Fintype γ] [DecidableEq γ] (X : R) (Q : Matrix γ γ ℂ) :
            (smulKron 1 Q * Matrix.diagonal fun (x : γ) => X) = smulKron X Q

            (1 ⊗ Q)(X ⊗ 1) = X ⊗ Q.

            theorem MIPRE.QLD.diagonal_mul_smulKron {R : Type u_2} [Ring R] [Algebra ℂ R] {γ : Type u_3} [Fintype γ] [DecidableEq γ] (A X : R) (Q : Matrix γ γ ℂ) :
            (Matrix.diagonal fun (x : γ) => A) * smulKron X Q = smulKron (A * X) Q

            (A ⊗ 1)(X ⊗ Q) = AX ⊗ Q.

            theorem MIPRE.QLD.smulKron_mul_diagonal {R : Type u_2} [Ring R] [Algebra ℂ R] {γ : Type u_3} [Fintype γ] [DecidableEq γ] (X A : R) (Q : Matrix γ γ ℂ) :
            (smulKron X Q * Matrix.diagonal fun (x : γ) => A) = smulKron (X * A) Q

            (X ⊗ Q)(A ⊗ 1) = XA ⊗ Q.

            theorem MIPRE.QLD.smulKron_one_right {R : Type u_2} [Ring R] [Algebra ℂ R] {γ : Type u_3} [DecidableEq γ] (X : R) :
            smulKron X 1 = Matrix.diagonal fun (x : γ) => X

            X ⊗ 1 is the block-diagonal matrix of X.

            theorem MIPRE.QLD.compHom_diagonal_eq_liftRight {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} [Fintype γ] [DecidableEq γ] [Fintype α] [DecidableEq α] (X : Matrix α α R) :
            compHom (Matrix.diagonal fun (x : γ) => X) = liftRight X

            An operator of the inner register, with the outer one inert, is its right lift, a unital ⋆-homomorphism.

            theorem MIPRE.QLD.one_sub_compHom_diagonal {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} [Fintype γ] [DecidableEq γ] [Fintype α] [DecidableEq α] (X : Matrix α α R) :
            1 - compHom (Matrix.diagonal fun (x : γ) => X) = compHom (Matrix.diagonal fun (x : γ) => 1 - X)

            The identity minus an operator of the inner register is one of the inner register.

            theorem MIPRE.QLD.star_compHom_diagonal {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} [Fintype γ] [DecidableEq γ] [Fintype α] [DecidableEq α] (X : Matrix α α R) :
            star (compHom (Matrix.diagonal fun (x : γ) => X)) = compHom (Matrix.diagonal fun (x : γ) => star X)

            The adjoint of an operator of the inner register is one of the inner register.

            theorem MIPRE.QLD.compHom_diagonal_mul {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} [Fintype γ] [DecidableEq γ] [Fintype α] [DecidableEq α] (X Y : Matrix α α R) :
            compHom (Matrix.diagonal fun (x : γ) => X) * compHom (Matrix.diagonal fun (x : γ) => Y) = compHom (Matrix.diagonal fun (x : γ) => X * Y)

            Operators of the inner register multiply as they do there.

            theorem MIPRE.QLD.compHom_diagonal_diagonal {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} [Fintype γ] [DecidableEq γ] [Fintype α] [DecidableEq α] (X : R) :
            compHom (Matrix.diagonal fun (x : γ) => Matrix.diagonal fun (x : α) => X) = Matrix.diagonal fun (x : γ × α) => X

            An element on the diagonal of the pair of registers is one on the diagonal of each.

            theorem MIPRE.QLD.compHom_diagonal_compHom_diagonal_smulKron {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] {γ : Type u_3} {α : Type u_4} {η : Type u_5} [Fintype γ] [DecidableEq γ] [Fintype α] [Fintype η] [DecidableEq η] (X : R) (Q : Matrix α α ℂ) :
            compHom (Matrix.diagonal fun (x : γ) => compHom (Matrix.diagonal fun (x : η) => smulKron X Q)) = smulKron X (Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) 1 (Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) 1 Q))

            An operator of the near half, read on the three registers: X ⊗ Q on the innermost register α, with the two outer ones inert.

            The Weyl spectral projectors, and the hatted point measurement against one #

            theorem MIPRE.QLD.isPVM_proj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {w : (n → F) → Matrix (n → F) (n → F) ℂ} (hw : Weyl.IsWeylFamily w) :

            A Weyl family's spectral projectors are a projective measurement. The three facts are in Foundations one by one; this is them bundled.

            theorem MIPRE.QLD.isPVM_ptAtPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] {m d : ℕ} {R : Type u_2} [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {P : Question F m → POVMIn (Answer F m d) R} (hP : ∀ (q : Question F m), IsPVMIn (P q).op) (W : Bas) (u : LIDT.Point F m) :

            The point measurement read off a strategy is projective when the strategy's own is: it is a coarse-graining of it along the answer's value.

            theorem MIPRE.QLD.syn_mul_proj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {w : (n → F) → Matrix (n → F) (n → F) ℂ} (hw : Weyl.IsWeylFamily w) (v : n → F) (b : F) (h : n → F) :

            A syndrome projector meets a single spectral projector in that projector or in nothing. The syndrome is the fibre of the spectral family over the pairing, so the product keeps the one outcome exactly when it lies in the fibre.

            theorem MIPRE.QLD.hatMats_mul_proj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_2} [Ring R] [StarRing R] [Algebra ℂ R] [StarModule ℂ R] [PartialOrder R] [StarOrderedRing R] [StarProper R] (P : Question F m → POVMIn (Answer F m d) R) (W : Bas) (u : LIDT.Point F m) (c : F) (h : Anc F m) :

            Display eq:qld-pulling-3b. The chain's factor (M^{Point}_r)_A (x) (tau_h)_{A'} is the hatted point measurement itself, cut down by the Weyl outcome: M-hat^{u}_{c} times the projector at h keeps exactly the point outcome c - g_h(u), the syndrome factor selecting the one term of the convolution whose shift matches h. Over any ⋆-algebra, with the register outer.

            A single Weyl projector across the expanded state #

            theorem MIPRE.QLD.stateVec_hatVec_proj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (W : Bas) (h : Anc F m) :
            ((M.reg (Anc F m)).π ((M.reg (Anc F m)).πA (smulKron 1 (Weyl.proj (weylOf W) h)))) (M.reg (Anc F m)).ψ = ((M.reg (Anc F m)).π ((M.reg (Anc F m)).πB (smulKron 1 (Weyl.proj (weylOf W) h)))) (M.reg (Anc F m)).ψ

            A single Weyl spectral projector transports across the expanded state, exactly. The syndrome version is stateVec_hatVec_syn; the chain's display eq:qld-pulling-3a moves one projector, not a fibre of them.

            theorem MIPRE.QLD.xSqNorm_hatVec_proj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (W : Bas) (h : Anc F m) :
            (M.reg (Anc F m)).xSqNorm (smulKron 1 (Weyl.proj (weylOf W) h)) (smulKron 1 (Weyl.proj (weylOf W) h)) = 0

            The same, as the vanishing of a cross-party deviation.

            The chain's summand, on one pair measurement #

            noncomputable def MIPRE.QLD.SimulPair.chainOp {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (p : LIDT.LowIndDegPoly × Anc F m) :
            Matrix (Anc F m) (Anc F m) 𝒜'

            The chain's summand on one party: the pair measurement's W-marginal at g, tensored with the Weyl spectral projector at h on the register.

            Equations
            Instances For
              theorem MIPRE.QLD.mTildeAnc_eq_sum_chainIdx {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (v : Anc F m) (a : F) :
              P.mTildeAnc W v a = ∑ p ∈ chainIdx v a, P.chainOp W p

              Displays eq:qld-pulling-2 and eq:qld-pulling-2b: the exact Pauli measurement, indexed the chain's way. eq:tilde_M sums over the pair measurement's outcomes g with a syndrome projector attached; the chain sums over pairs (g, h) cut out by the pairing condition. The two are the same sum, because the syndrome projector is by definition the fibre of the spectral family over that pairing, and in characteristic two the shift the definition carries is the sum the chain's label is written with.

              theorem MIPRE.QLD.isPVM_chainOp {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} [StarModule ℂ 𝒜'] (P : SimulPair M S K ι δ) (W : Bas) :
              IsPVMIn fun (p : LIDT.LowIndDegPoly × Anc F m) => P.chainOp W p

              The chain's summands are a projective measurement in the pair (g, h): a marginal of a projective pair measurement, tensored with a Weyl spectral projector.

              theorem MIPRE.QLD.SimulPair.sum_poly_chainOp {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (h : Anc F m) :

              Summing the pair outcome out of the summand leaves the Weyl projector alone, the pair measurement's outcomes being complete. This is what eq:qld-pulling-9a inserts.

              theorem MIPRE.QLD.SimulPair.mTildeAnc_eq_sum {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (v : Anc F m) (a : F) :
              P.mTildeAnc W v a = ∑ g : LIDT.LowIndDegPoly, smulKron ((polyMarg P.SA W).op g) (Weyl.syn (weylOf W) v (Weyl.dotF (cubeData g) v + a))

              The exact Pauli measurement, expanded over the pair outcomes.

              theorem MIPRE.QLD.SimulPair.mTildeAnc_mul_kron {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (a : F) (g : LIDT.LowIndDegPoly) (b : F) :
              P.mTildeAnc W v a * smulKron ((polyMarg P.SA W).op g) (Weyl.syn (weylOf W) (LowDegree.indVec u) b) = ∑ h : Anc F m with Weyl.dotF h v = Weyl.dotF (cubeData g) v + a ∧ Weyl.dotF h (LowDegree.indVec u) = b, smulKron ((polyMarg P.SA W).op g) (Weyl.proj (weylOf W) h)

              Multiplying it by one of the near-identity's terms. The pair measurement's outcomes are orthogonal, so only the matching one survives, and syn_mul_syn collapses the two syndrome projectors onto the Weyl outcomes satisfying both conditions.

              theorem MIPRE.QLD.SimulPair.chainOp_eq_mul {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (p : LIDT.LowIndDegPoly × Anc F m) :
              P.chainOp W p = (Matrix.diagonal fun (x : Anc F m) => (polyMarg P.SA W).op p.1) * smulKron 1 (Weyl.proj (weylOf W) p.2)

              The chain's summand splits into the pair measurement's marginal and the Weyl outcome.

              noncomputable def MIPRE.QLD.SimulPair.chainShift {F : Type u_1} [Field F] {m d : ℕ} (u : LIDT.Point F m) (p : LIDT.LowIndDegPoly × Anc F m) :
              F

              The outcome the chain's index pair carries, the paper's (g - g_h)(u): the pair outcome's value at the sampled point, shifted by the Weyl outcome's own encoding there.

              Equations
              Instances For

                The Weyl projector across the pair measurement's model #

                theorem MIPRE.QLD.SimulPair.stateVec_ancProj {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (_P : SimulPair M S K ι δ) (W : Bas) (h : Anc F m) :
                (K.π (K.πA (ι.ΦA (smulKron 1 (Weyl.proj (weylOf W) h))))) K.ψ = (K.π (K.πB (ι.ΦB (smulKron 1 (Weyl.proj (weylOf W) h))))) K.ψ

                Display eq:qld-pulling-3a: the Weyl projector transports across the model of the pair measurement. The two halves of the register model's pair are maximally entangled and the projectors are symmetric (stateVec_hatVec_proj), and the embedding ι intertwines each player's operators and carries the state to the state.

                theorem MIPRE.QLD.SimulPair.sum_ancProj_mulVec {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (_P : SimulPair M S K ι δ) (W : Bas) :
                (K.π (∑ h : Anc F m, K.πA (ι.ΦA (smulKron 1 (Weyl.proj (weylOf W) h))) * K.πB (ι.ΦB (smulKron 1 (Weyl.proj (weylOf W) h))))) K.ψ = K.ψ

                Display eq:qld-pulling-4: the matched pairs of Weyl projectors leave the state alone. By the transport each matched pair acts as the projector on one side alone, and those sum to the identity.

                eq:qld-pulling-13, the chain's only Cauchy--Schwarz #

                The swap that completes eq:qld-pulling-10. It is stated on a SimulPair, in the model that pair's measurements live in, because that is where both placements of the point measurement are local: the one that sandwiches is the first party's own, the one that replaces it is the second party's. The mirror then makes it Bob's.

                theorem MIPRE.QLD.SimulPair.abs_sum_qform_ne_swap_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (u : LIDT.Point F m) {εu : ℝ} (hcons : ∑ a : F, K.xSqNorm (ι.ΦA (hatMats S.PA W u a)) (ι.ΦB (hatMats S.PB W u a)) ≤ εu) :
                |∑ q : LIDT.LowIndDegPoly × F with q.2 ≠ q.1.eval u, K.qform (K.πB (ι.ΦB (hatMats S.PB W u q.2)) * K.πA ((polyMarg P.SA W).op q.1)) - ∑ q : LIDT.LowIndDegPoly × F with q.2 ≠ q.1.eval u, K.qform (K.πA (ι.ΦA (hatMats S.PA W u q.2)) * K.πA ((polyMarg P.SA W).op q.1) * K.πA (ι.ΦA (hatMats S.PA W u q.2)))| ≤ 2 * √εu

                Display eq:qld-pulling-13: moving the sandwiching point measurement from the party that carries the pair measurement to the other one. The cost is twice the square root of the two placements' summed squared state distance, and no more: the pair measurement's outcomes are orthogonal, so summing the deviation over them leaves one copy rather than one per outcome.

                theorem MIPRE.QLD.SimulPair.sum_qform_ne_eq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) (W : Bas) (u : LIDT.Point F m) :
                ∑ q : LIDT.LowIndDegPoly × F with q.2 ≠ q.1.eval u, K.qform (K.πB (ι.ΦB (hatMats S.PB W u q.2)) * K.πA ((polyMarg P.SA W).op q.1)) = ∑ g : LIDT.LowIndDegPoly, K.bornProb ((polyMarg P.SA W).op g) (1 - ι.ΦB (hatMats S.PB W u (g.eval u)))

                The swapped side, read as a Born probability. Summing the other party's point measurement over the outcomes its own value excludes leaves the complement of that value.

                theorem MIPRE.QLD.SimulPair.sum_uniform_qform_ne_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {𝒞' : Type u_5} {𝒜' : Type u_6} {ℬ' : Type u_7} [Ring 𝒞'] [StarRing 𝒞'] [Algebra ℂ 𝒞'] [Ring 𝒜'] [StarRing 𝒜'] [Algebra ℂ 𝒜'] [Ring ℬ'] [StarRing ℬ'] [Algebra ℂ ℬ'] [PartialOrder 𝒜'] [StarOrderedRing 𝒜'] [PartialOrder ℬ'] [StarOrderedRing ℬ'] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {S : M.ProjStrat (qldGame hm)} {K : BipartiteModel 𝒞' 𝒜' ℬ'} {ι : (M.reg (Anc F m)).Embedding K} {δ : ℝ} (P : SimulPair M S K ι δ) {ε : ℝ} (hfail : 1 - S.value ≤ ε) (W : Bas) :
                ∑ u : LIDT.Point F m, uniform (LIDT.Point F m) u * ∑ q : LIDT.LowIndDegPoly × F with q.2 ≠ q.1.eval u, K.qform (K.πA (ι.ΦA (hatMats S.PA W u q.2)) * K.πA ((polyMarg P.SA W).op q.1) * K.πA (ι.ΦA (hatMats S.PA W u q.2))) ≤ δ + 2 * √(172 * ε)

                Display eq:qld-pulling-10, complete: the whole cost of moving the point measurement across and then dropping it is the helper's own delta_S plus twice the square root of the point measurements' cross-party deviation. The average over the sampled point goes inside the square root by Cauchy--Schwarz against the constant one.

                The chain's first displays, on the physical model #

                Displays eq:qld-pulling-0 to -3b concern one simultaneous pair measurement on the first cut of the physical state, and run in the physical model, which has the first cut's state: the exact Pauli measurement there is the first player's compHom (P.mTildeAnc …), on (A'', (Ea, A')).

                noncomputable def MIPRE.QLD.SimulPair.nearId {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) :
                Matrix (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) 𝒞

                The helper's near-identity, an element of the physical model's algebra: the agreement operator of the first cut, of Alice's pair-measurement marginals against Bob's expanded point measurements carried along ι₁, which is what lem:qld-helper bounds. The first cut and the physical model share their state model, so no regrouping is needed to read it physically.

                Equations
                • One or more equations did not get rendered due to their size.
                Instances For
                  theorem MIPRE.QLD.SimulPair.sum_snorm_sq_nearId {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) :
                  ∑ a : F, (phys (Anc F m) F m d N K).snorm ((phys (Anc F m) F m d N K).πA (compHom (mTildeAnc P W v a)) - (phys (Anc F m) F m d N K).πA (compHom (mTildeAnc P W v a)) * nearId P W u) ^ 2 = 1 - ∑ g : LIDT.LowIndDegPoly, (cut1 (Anc F m) F m d N K).bornProb ((polyMarg P.SA W).op g) ((ι₁ (Anc F m) F m d N K).ΦB (hatMats S.PB W u (g.eval u)))

                  Display eq:qld-pulling-1, as an identity. Inserting the near-identity costs exactly its own deficit on the state, with no loss at all.

                  theorem MIPRE.QLD.SimulPair.sum_uniform_snorm_sq_nearId_le {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) :
                  ∑ u : LIDT.Point F m, uniform (LIDT.Point F m) u * ∑ a : F, (phys (Anc F m) F m d N K).snorm ((phys (Anc F m) F m d N K).πA (compHom (mTildeAnc P W v a)) - (phys (Anc F m) F m d N K).πA (compHom (mTildeAnc P W v a)) * nearId P W u) ^ 2 ≤ δ

                  And its cost, which is item 1 of lem:qld-helper.

                  noncomputable def MIPRE.QLD.SimulPair.ptA {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (_P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) (k : F) :
                  Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) 𝒜

                  Alice's copy of the strategy's point measurement, on her physical registers, which it does not see.

                  Equations
                  Instances For
                    noncomputable def MIPRE.QLD.SimulPair.ptB {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (_P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) (k : F) :
                    Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) ℬ

                    Bob's, on his.

                    Equations
                    Instances For
                      theorem MIPRE.QLD.SimulPair.nearId_eq_sum {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) :
                      nearId P W u = ∑ g : LIDT.LowIndDegPoly, ∑ a' : F, (phys (Anc F m) F m d N K).πA (compHom (smulKron ((polyMarg P.SA W).op g) (Weyl.syn (weylOf W) (LowDegree.indVec u) (g.eval u + a')))) * (phys (Anc F m) F m d N K).πB (ptB P W u a')

                      The near-identity, expanded: on the physical model it is a sum of products of Alice's pair measurement and the syndrome on A'' against Bob's point measurement.

                      theorem MIPRE.QLD.SimulPair.aOp_mTildeAnc_mul_nearId {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (a : F) :
                      (phys (Anc F m) F m d N K).πA (compHom (mTildeAnc P W v a)) * nearId P W u = ∑ p ∈ chainIdx v a, (phys (Anc F m) F m d N K).πA (compHom (chainOp P W p)) * (phys (Anc F m) F m d N K).πB (ptB P W u (chainShift u p))

                      Display eq:qld-pulling-2b at the interface. Expanding both factors, the pair measurement's orthogonality picks out one outcome, syn_mul_syn fuses the two syndrome projectors, and the sum over Bob's point outcome collapses --- for each Weyl outcome h exactly one of them survives, namely (g - g_h)(u). What is left is a sum over the chain's own index set.

                      theorem MIPRE.QLD.SimulPair.sum_snorm_sq_insert_chain {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) {ε : ℝ} (hcons : ∑ k : F, (phys (Anc F m) F m d N K).xSqNorm (ptA P W u k) (ptB P W u k) ≤ ε) :
                      ∑ a : F, (phys (Anc F m) F m d N K).snorm (∑ p ∈ chainIdx v a, (phys (Anc F m) F m d N K).πA (compHom (chainOp P W p)) * ((1 - (phys (Anc F m) F m d N K).πA (ptA P W u (chainShift u p))) * (phys (Anc F m) F m d N K).πB (ptB P W u (chainShift u p)))) ^ 2 ≤ ε

                      Display eq:qld-pulling-3. Inserting Alice's copy of the point measurement beside each term of the chain costs the point measurements' own cross-consistency and nothing else. Two things hold the bound down: the chain's terms are a projective family in the pair (g, h), so the outcomes do not interfere (StateModel.snorm_sq_sum_orthogonal') and the fibres of the outcome map are seen only once (sum_snorm_sq_proj_comp_le, inside sum_snorm_sq_insert_le).

                      The chain's first four terms, and the three steps between them #

                      chainS names the terms displays eq:qld-pulling-0 to -3 run through, as elements of the physical model's algebra, and the three lemmas below are those displays read as bounds on consecutive deviations --- which is the form StateModel.sum_snorm_sq_chain_le consumes.

                      noncomputable def MIPRE.QLD.SimulPair.chainS {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) :
                      ℕ → F → Matrix (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) 𝒞

                      The chain's first four terms, on the physical model. eq:qld-pulling-0 through eq:qld-pulling-3: the exact Pauli measurement, that measurement times the near-identity, the same written over the chain's index, and the same with Alice's copy of the point measurement inserted.

                      Equations
                      Instances For
                        theorem MIPRE.QLD.SimulPair.chainS_one_eq_two {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) :
                        chainS P W v u 1 = chainS P W v u 2

                        Displays eq:qld-pulling-2 and -2b say the second and third terms are one.

                        theorem MIPRE.QLD.SimulPair.chainS_two_sub_three {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (a : F) :
                        chainS P W v u 2 a - chainS P W v u 3 a = ∑ p ∈ chainIdx v a, (phys (Anc F m) F m d N K).πA (compHom (chainOp P W p)) * ((1 - (phys (Anc F m) F m d N K).πA (ptA P W u (chainShift u p))) * (phys (Anc F m) F m d N K).πB (ptB P W u (chainShift u p)))

                        And the third and fourth differ by what eq:qld-pulling-3 bounds.

                        theorem MIPRE.QLD.SimulPair.sum_uniform_snorm_sq_chainS_zero_one {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) :
                        ∑ u : LIDT.Point F m, uniform (LIDT.Point F m) u * ∑ a : F, (phys (Anc F m) F m d N K).snorm (chainS P W v u 0 a - chainS P W v u 1 a) ^ 2 ≤ δ

                        Step 0 to 1 is eq:qld-pulling-1, at item 1 of lem:qld-helper's own constant.

                        theorem MIPRE.QLD.SimulPair.sum_snorm_sq_chainS_one_two {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) :
                        ∑ a : F, (phys (Anc F m) F m d N K).snorm (chainS P W v u 1 a - chainS P W v u 2 a) ^ 2 = 0

                        Step 1 to 2 is free, being displays eq:qld-pulling-2 and -2b, which are identities.

                        theorem MIPRE.QLD.SimulPair.sum_snorm_sq_chainS_two_three {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) {ε : ℝ} (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (hcons : ∑ k : F, (phys (Anc F m) F m d N K).xSqNorm (ptA P W u k) (ptB P W u k) ≤ ε) :
                        ∑ a : F, (phys (Anc F m) F m d N K).snorm (chainS P W v u 2 a - chainS P W v u 3 a) ^ 2 ≤ ε

                        Step 2 to 3 is eq:qld-pulling-3, the insertion.

                        Displays eq:qld-pulling-3a and -3b: Alice's own pair #

                        The physical model gives Alice both halves of her pair (A'', A'); on the physical state a Weyl projector on the near half acts as the same projector on the far half (physE_mirror_A), and once it is there Alice's copy of the point measurement and her hatted point measurement agree.

                        noncomputable def MIPRE.QLD.SimulPair.ancA {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (_P : CutSimul N S K δ) (W : Bas) (h : Anc F m) :
                        Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) 𝒜

                        Alice's Weyl spectral projector on the near half A' of her own pair.

                        Equations
                        • One or more equations did not get rendered due to their size.
                        Instances For
                          noncomputable def MIPRE.QLD.SimulPair.ancB {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (_P : CutSimul N S K δ) (W : Bas) (h : Anc F m) :
                          Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) 𝒜

                          The same projector on the far half A'', which the physical model also gives her.

                          Equations
                          Instances For
                            theorem MIPRE.QLD.SimulPair.ancProj_mulVec_mVec {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (h : Anc F m) :
                            ((phys (Anc F m) F m d N K).π ((phys (Anc F m) F m d N K).πA (ancA P W h))) (phys (Anc F m) F m d N K).ψ = ((phys (Anc F m) F m d N K).π ((phys (Anc F m) F m d N K).πA (ancB P W h))) (phys (Anc F m) F m d N K).ψ

                            Display eq:qld-pulling-3a on the physical state: the two halves of Alice's pair are maximally entangled and the projectors are symmetric.

                            noncomputable def MIPRE.QLD.SimulPair.hatA {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (_P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) (c : F) :
                            Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) 𝒜

                            Alice's hatted point measurement, on her physical registers: on (A, A'), with the padding and the far half inert.

                            Equations
                            Instances For
                              theorem MIPRE.QLD.SimulPair.ptA_mul_ancA {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) (c : F) (h : Anc F m) :
                              ptA P W u (c + Weyl.dotF h (LowDegree.indVec u)) * ancA P W h = hatA P W u c * ancA P W h

                              Display eq:qld-pulling-3b on Alice's physical registers.

                              theorem MIPRE.QLD.SimulPair.ancB_ptA_mulVec {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (u : LIDT.Point F m) (c : F) (h : Anc F m) (Y : Matrix (PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K) ℬ) :
                              ((phys (Anc F m) F m d N K).π ((phys (Anc F m) F m d N K).πA (ancB P W h * ptA P W u (c + Weyl.dotF h (LowDegree.indVec u))) * (phys (Anc F m) F m d N K).πB Y)) (phys (Anc F m) F m d N K).ψ = ((phys (Anc F m) F m d N K).π ((phys (Anc F m) F m d N K).πA (ancB P W h * hatA P W u c) * (phys (Anc F m) F m d N K).πB Y)) (phys (Anc F m) F m d N K).ψ

                              Displays eq:qld-pulling-3a and -3b together. Inserting Alice's own near half beside the far half the chain already carries changes nothing on the state, and once it is there the point measurement and the hatted point measurement agree.

                              noncomputable def MIPRE.QLD.SimulPair.chainS3b {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (a : F) :
                              Matrix (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) (PhysReg (Anc F m) F m d K × PhysReg (Anc F m) F m d K) 𝒞

                              Display eq:qld-pulling-3b's term: the chain's third term with Alice's own hatted point measurement in place of her copy of the point measurement.

                              Equations
                              • One or more equations did not get rendered due to their size.
                              Instances For
                                theorem MIPRE.QLD.SimulPair.chainS_three_mulVec {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] [StarModule ℂ 𝒜] [StarProper 𝒜] [StarModule ℂ ℬ] [StarProper ℬ] {hm : m ∣ Fintype.card F} {N : BipartiteModel 𝒞 𝒜 ℬ} {S : N.ProjStrat (qldGame hm)} {K : ℕ} {δ : ℝ} (P : CutSimul N S K δ) (W : Bas) (v : Anc F m) (u : LIDT.Point F m) (a : F) :
                                ((phys (Anc F m) F m d N K).π (chainS P W v u 3 a)) (phys (Anc F m) F m d N K).ψ = ((phys (Anc F m) F m d N K).π (chainS3b P W v u a)) (phys (Anc F m) F m d N K).ψ

                                Displays eq:qld-pulling-3a and -3b, on the chain's third term.