Documentation

MIPRE.Background.QLD.PauliBasis

The point measurement and the Pauli basis reading, on one party #

The repaired proof of lem:qld-exact-paulis needs the strategy's (Point, W) measurement to be close to the low-degree reading of its (Pauli, W) answer on the same party: the Pauli basis answer does not depend on the sampled point, which is what lets Schwartz--Zippel be applied to a uniform point independent of the operators.

Both inputs are items of lem:qld-win-implications, and both are cross-party: the point measurements of the two players agree (item_consistency at the type (Point, W)), and Alice's point answer agrees with the evaluation at the sampled point of the low-degree encoding of Bob's Pauli basis answer (item_pauli_consistency). They share Alice's family, so the triangle inequality of BipartiteModel.swap_stateSqNorm_sub_le leaves a statement about Bob alone, at four times the error: 688 ε.

Nothing here is padded: this is the bare strategy, and its reading on the expanded state, which is the statement the mass argument of MIPRE/Background/QLD/Multilinear.lean consumes.

Stated in a bipartite model #

Stated in a bipartite model (Phase 5 of planning/mipco-track.md). The strategy is a pair of families of POVMs in the two players' algebras of a bipartite model M, Bob's squared state norm ‖stateVecB ψ Y‖² is M.swap.stateSqNorm Y, and the expanded state is the register model M.reg (Anc F m). A hatted measurement is a convolution of a family of the player's algebra with a projective family of the register, ∑_{a + b = c} smulKron (Z a) (T b) (register outer, conv), and the shared register factor drops out of a same-party deviation exactly (sum_normSq_stateVecB_conv_eq), by the two-sided factorization of Born probabilities of the extended model (BipartiteModel.swap_stateSqNorm_expand_smulKron_one). The hatted Pauli basis measurement hatPauli is a POVM in the register's matrices over the player's algebra.

A common register factor drops out of a same-party deviation #

def MIPRE.conv {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} {C : Type u_3} [Fintype C] [DecidableEq C] [AddCommGroup C] (Z : C → R) (T : C → Matrix α α ℂ) (c : C) :
Matrix α α R

The convolution of a family of the player's algebra with one on a register: the shape every hatted measurement has, X̂_c = ∑_{a + b = c} X_a ⊗ T_b, as a matrix over the player's algebra on the register (register outer).

Equations
Instances For
    theorem MIPRE.conjTranspose_conv_mul_conv {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} {C : Type u_3} [Fintype α] [DecidableEq α] [Fintype C] [DecidableEq C] [AddCommGroup C] [StarRing R] [StarModule ℂ R] (Z : C → R) {T : C → Matrix α α ℂ} (hT : IsPVM T) (c : C) :
    star (conv Z T c) * conv Z T c = conv (fun (a : C) => star (Z a) * Z a) T c

    Against a projective register family the cross terms of X̂⋆ X̂ vanish: the register outcome determines the other one.

    theorem MIPRE.sum_conv {R : Type u_1} [Ring R] [Algebra ℂ R] {α : Type u_2} {C : Type u_3} [Fintype α] [DecidableEq α] [Fintype C] [DecidableEq C] [AddCommGroup C] (Z : C → R) {T : C → Matrix α α ℂ} (hT : IsPVM T) :
    ∑ c : C, conv Z T c = smulKron (∑ a : C, Z a) 1

    Summing a convolution over the outcome frees the register factor.

    theorem MIPRE.POVM.map_kron_map {dB : Type u_1} {anc' : Type u_2} [Fintype dB] [DecidableEq dB] [Fintype anc'] [DecidableEq anc'] {ι : Type u_3} {κ : Type u_4} {ι' : Type u_5} {κ' : Type u_6} [Fintype ι] [DecidableEq ι] [Fintype κ] [DecidableEq κ] [Fintype ι'] [DecidableEq ι'] [Fintype κ'] [DecidableEq κ'] (Y : POVM ι dB) (P : POVM κ anc') (f : ι → ι') (g : κ → κ') :
    map (fun (p : ι × κ) => (f p.1, g p.2)) (Y.kron P) = (map f Y).kron (map g P)

    The Kronecker product of two coarse-grainings is the coarse-graining of the product, along the product map on the outcomes.

    theorem MIPRE.sum_normSq_stateVecB_conv_eq {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] [StarModule ℂ ℬ] {α : Type u_4} {β : Type u_5} {C : Type u_6} [Fintype α] [DecidableEq α] [Fintype β] [DecidableEq β] [Fintype C] [DecidableEq C] [AddCommGroup C] (M : BipartiteModel 𝒞 𝒜 ℬ) {e : α × β → ℂ} (he : ‖evec e‖ = 1) (Z : C → ℬ) {T : C → Matrix β β ℂ} (hT : IsPVM T) :
    ∑ c : C, (M.expand e).swap.stateSqNorm (conv Z T c) = ∑ a : C, M.swap.stateSqNorm (Z a)

    The transfer: on an extension of a model by registers in a unit vector, the second player's same-party deviation of two convolutions with a common projective register family is the deviation of the two families themselves.

    theorem MIPRE.QLD.sum_normSq_point_sub_pauli_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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {ε : ℝ} (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (W : Bas) :
    ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ o : F, M.swap.stateSqNorm ((POVMIn.map rdVal (PB (Content.question hm c (Ty.point W)))).op o - (POVMIn.map (rdPauli (c.pt W)) (PB (Content.question hm c (Ty.pauli W)))).op o) ≤ 688 * ε

    The point measurement and the Pauli basis reading agree on Bob's side, on average over the verifier's content and at 688 ε: the two cross-party items of lem:qld-win-implications share Alice's point measurement, so the triangle inequality removes it.

    The Pauli basis measurement, indexed by cube data #

    def MIPRE.QLD.rdPauliVec {F : Type u_1} [Field F] {m d : ℕ} :
    Answer F m d → Anc F m

    The cube data a (Pauli, W) answer reports; zero on an ill-formatted answer.

    Equations
    Instances For
      theorem MIPRE.QLD.rdPauli_eq_dotF {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] (u : LIDT.Point F m) (a : Answer F m d) :

      The low-degree reading at a point is the pairing of the cube data with the point's indicator vector.

      theorem MIPRE.QLD.dotF_add_left {F : Type u_1} [Field F] {m : ℕ} (a b v : Anc F m) :
      Weyl.dotF (a + b) v = Weyl.dotF a v + Weyl.dotF b v
      noncomputable def MIPRE.QLD.weylPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) :
      POVM (Anc F m) (Anc F m)

      The ancilla's Weyl measurement, whose outcomes are the cube data themselves: the syndrome measurements are its coarse-grainings.

      Equations
      Instances For
        theorem MIPRE.QLD.weylPOVM_mats {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) (e : Anc F m) :
        ↑((weylPOVM W).mats e) = Weyl.proj (weylOf W) e
        theorem MIPRE.QLD.isPVM_weylPOVM {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] (W : Bas) :
        IsPVM fun (e : Anc F m) => ↑((weylPOVM W).mats e)

        The ancilla's Weyl measurement is projective.

        theorem MIPRE.QLD.synOfPOVM_eq_map {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m : ℕ} [NeZero m] {C : Type u_5} [Fintype C] [DecidableEq C] (W : Bas) (φ : Anc F m → C) :

        Every syndrome measurement is a coarse-graining of it.

        noncomputable def MIPRE.QLD.hatPauli {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_5} [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) :
        POVMIn (Anc F m) (Matrix (Anc F m) (Anc F m) R)

        The Pauli basis measurement convolved with the ancilla's Weyl measurement: a POVM in the register's matrices over the player's algebra, whose outcomes are cube data and which, crucially, does not depend on any sampled point.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For
          theorem MIPRE.QLD.hatPauli_map {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_5} [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) :
          POVMIn.map (fun (k : (Fin m → Bool) → F) => Weyl.dotF k (LowDegree.indVec u)) (hatPauli P W) = POVMIn.map (fun (p : F × F) => p.1 + p.2) (kronIn (POVMIn.map (rdPauli u) (P (Question.pauli W))) (synPOVM W u) ⋯)

          Reading it at a point is the hatted Pauli basis measurement at that point. The pairing is additive, so coarse-graining commutes with the convolution.

          Substituting one family for another inside an agreement #

          theorem MIPRE.QLD.abs_bornProb_le {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {T : 𝒜} (hT : star T = T) (D : ℬ) :
          |M.bornProb T D| ≤ M.snorm (M.πA T) * M.snorm (M.πB D)

          Cauchy--Schwarz for a Born probability with a self-adjoint first factor.

          theorem MIPRE.QLD.abs_sum_bornProb_le {𝒞 : Type u_2} {𝒜 : Type u_3} {ℬ : Type u_4} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] {C : Type u_5} [Fintype C] {M : BipartiteModel 𝒞 𝒜 ℬ} (hM : ‖M.ψ‖ = 1) {T : C → 𝒜} (hT : IsPVMIn T) (D : C → ℬ) :
          |∑ c : C, M.bornProb (T c) (D c)| ≤ √(∑ c : C, M.swap.stateSqNorm (D c))

          The substitution estimate. Against a projective family of one player, an agreement with a family of the other is bounded by the root of that family's total weight: the projective family's own weights sum to one, so one Cauchy--Schwarz over the outcomes leaves only the other root. This is what pays for replacing one measurement by another inside the helper's agreement.

          The same statement on the expanded state #

          theorem MIPRE.QLD.hatPtPOVM_mats_eq_conv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_5} [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) (a : F) :
          (hatPtPOVM P W u).op a = conv (fun (o : F) => (POVMIn.map rdVal (P (Question.point W u))).op o) (fun (b : F) => ↑((synPOVM W u).mats b)) a

          The convolution shape of a hatted point measurement: the party's own reading tensored with the ancilla's syndrome measurement, summed along the sum of outcomes.

          theorem MIPRE.QLD.hatPauliPOVM_mats_eq_conv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {m d : ℕ} [NeZero m] {R : Type u_5} [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) (a : F) :
          (POVMIn.map (fun (p : F × F) => p.1 + p.2) (kronIn (POVMIn.map (rdPauli u) (P (Question.pauli W))) (synPOVM W u) ⋯)).op a = conv (fun (o : F) => (POVMIn.map (rdPauli u) (P (Question.pauli W))).op o) (fun (b : F) => ↑((synPOVM W u).mats b)) a

          The same shape for the Pauli basis answer read at the point.

          theorem MIPRE.QLD.sum_normSq_hat_point_sub_pauli_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 ℬ] {hm : m ∣ Fintype.card F} {M : BipartiteModel 𝒞 𝒜 ℬ} {PA : Question F m → POVMIn (Answer F m d) 𝒜} {PB : Question F m → POVMIn (Answer F m d) ℬ} {ε : ℝ} [StarModule ℂ ℬ] [StarProper ℬ] (hM : ‖M.ψ‖ = 1) (hfail : 1 - M.povmValue (qldGame hm) PA PB ≤ ε) (W : Bas) :
          ∑ c : Content F m, (↑(Fintype.card (Content F m)))⁻¹ * ∑ a : F, (M.reg (Anc F m)).swap.stateSqNorm ((hatPtPOVM PB W (c.pt W)).op a - (POVMIn.map (fun (p : F × F) => p.1 + p.2) (kronIn (POVMIn.map (rdPauli (c.pt W)) (PB (Question.pauli W))) (synPOVM W (c.pt W)) ⋯)).op a) ≤ 688 * ε

          The same-party closeness, on the expanded state. The hatted point measurement and the hatted Pauli basis reading differ, on Bob's side of the register model, by what the bare measurements differ by: the shared register factor drops out exactly, so the constant is unchanged.