Documentation

MIPRE.Foundations.Sandwich

The sandwich of two approximately commuting projective measurements #

Two projective measurements {X_a} and {Z_b} on one party that approximately commute on a state cannot in general be measured jointly. The sandwich

R_{a,b} = Z_b X_a Z_b

always can: it is a POVM --- exactly, by projectivity of Z alone --- so its Naimark dilation is a genuine projective joint measurement, and the dilation's compression identity carries every Born-rule estimate about R to the dilated measurement unchanged.

What has to be proved is that the sandwich is approximately self-consistent across the two parties, and that is the content of one_sub_sum_bornProb_sand_le: a five-link chain from

sum_{a,b} <psi| R_{a,b} (x) R'_{a,b} |psi> to 1,

whose links are, in order, the two parties' commutators (each paid for by one Cauchy--Schwarz against a family of squared norms summing to at most one), the two parties' X-consistency collapsed by sum_a X'_a = Id, and the Z-consistency. The one thing the chain must not do is bound the q^2 outcome pairs one at a time: that would cost a factor q and the conclusion has to be q-independent. Every link here is therefore an estimate on a single operator product --- either a sum that telescopes exactly, or one Cauchy--Schwarz over the whole outcome set.

The statement carries an index iota with weights, because that is how it is used: the two measurements come from a question and the bound is an average over questions, and averaging a square root would otherwise need a second Jensen step.

The chain is proved once, for a bipartite model (BipartiteModel.one_sub_sum_bornProb_sand_le), and the matrix chain is its instance in the tensor-product model. The dilation that turns the sandwich into a projective joint measurement is a construction on the concrete registers here (exists_projective_joint).

Weighted Cauchy--Schwarz #

theorem MIPRE.sum_weighted_mul_le_sqrt {ι : Type u_1} [Fintype ι] (w u v : ι → ℝ) (hw : ∀ (i : ι), 0 ≤ w i) :
∑ i : ι, w i * (u i * v i) ≤ √(∑ i : ι, w i * u i ^ 2) * √(∑ i : ι, w i * v i ^ 2)

Cauchy--Schwarz against a weight. The one inequality the chain's square roots come from, and also the Jensen step that moves an average inside a square root (take v = 1).

theorem MIPRE.sum_weighted_sqrt_le {ι : Type u_1} [Fintype ι] (w f : ι → ℝ) (hw0 : ∀ (i : ι), 0 ≤ w i) (hw1 : ∑ i : ι, w i = 1) (hf : ∀ (i : ι), 0 ≤ f i) :
∑ i : ι, w i * √(f i) ≤ √(∑ i : ι, w i * f i)

Moving an average inside a square root. Cauchy--Schwarz against the constant one.

Sums over a product of the outcome set #

In a model #

The chain is proved once, for a bipartite model with the two parties' projective measurements in their algebras (BipartiteModel.one_sub_sum_bornProb_sand_le); the matrix statements further down are its instances in the tensor-product model. The sandwich itself is defined in any ring (sand), and is a POVM in any star-ordered one (POVMIn.sand).

theorem MIPRE.isIdempotentElem_sum_of_orth {R : Type u_1} {ι : Type u_2} [Ring R] [Fintype ι] [DecidableEq ι] {P : ι → R} (hidem : ∀ (i : ι), P i * P i = P i) (horth : ∀ (i j : ι), i ≠ j → P i * P j = 0) :
IsIdempotentElem (∑ i : ι, P i)

A sum of mutually orthogonal idempotents is idempotent.

theorem MIPRE.isStarProjection_sum_of_orth {R : Type u_1} {ι : Type u_2} [Ring R] [StarRing R] [Fintype ι] [DecidableEq ι] {P : ι → R} (hP : ∀ (i : ι), IsStarProjection (P i)) (horth : ∀ (i j : ι), i ≠ j → P i * P j = 0) :
IsStarProjection (∑ i : ι, P i)

A sum of mutually orthogonal star projections is a star projection.

def MIPRE.sand {A : Type u_1} {R : Type u_2} [Mul R] (X Z : A → R) (p : A × A) :
R

The sandwich R_{a,b} = Z_b X_a Z_b of two measurements.

Equations
Instances For
    theorem MIPRE.IsPVMIn.sand_eq_gram {A : Type u_1} {R : Type u_2} [Fintype A] [Ring R] [StarRing R] {X Z : A → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) (p : A × A) :
    sand X Z p = star (X p.1 * Z p.2) * (X p.1 * Z p.2)

    The sandwich is the Gram operator of the ordered product, which is where its positivity and its normalization both come from.

    theorem MIPRE.IsPVMIn.star_sand {A : Type u_1} {R : Type u_2} [Fintype A] [Ring R] [StarRing R] {X Z : A → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) (p : A × A) :
    star (sand X Z p) = sand X Z p
    theorem MIPRE.IsPVMIn.sum_sand {A : Type u_1} {R : Type u_2} [Fintype A] [Ring R] [StarRing R] {X Z : A → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) :
    ∑ p : A × A, sand X Z p = 1

    The sandwich is a POVM, exactly: only projectivity of Z and completeness of X are used, and no approximate commutation whatsoever.

    def MIPRE.POVMIn.sand {A : Type u_1} {R : Type u_2} [Fintype A] [Ring R] [StarRing R] [PartialOrder R] [StarOrderedRing R] {X Z : A → R} (hX : IsPVMIn X) (hZ : IsPVMIn Z) :
    POVMIn (A × A) R

    The sandwich, as a POVM in a star-ordered ring.

    Equations
    Instances For
      theorem MIPRE.StateModel.abs_qform_star_mul_le {𝒞 : Type u_1} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) (T T' : 𝒞) :
      |M.qform (star T * T')| ≤ M.snorm T * M.snorm T'

      Cauchy--Schwarz for the quadratic form: the form of a product, split onto the two vectors.

      theorem MIPRE.StateModel.snorm_le_one_of_isStarProjection {𝒞 : Type u_1} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] (M : StateModel 𝒞) (hψ : ‖M.ψ‖ = 1) {P : 𝒞} (hP : IsStarProjection P) :
      M.snorm P ≤ 1

      A projection is a contraction on a unit vector.

      theorem MIPRE.BipartiteModel.πA_mul_πB_mul {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (U U' : 𝒜) (V V' : ℬ) :
      M.πA U * M.πB V * (M.πA U' * M.πB V') = M.πA (U * U') * M.πB (V * V')

      Products of the two players' operators multiply factorwise.

      theorem MIPRE.BipartiteModel.star_πA_mul_πB {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (U : 𝒜) (V : ℬ) :
      star (M.πA U * M.πB V) = M.πA (star U) * M.πB (star V)

      The adjoint of a mixed product is the mixed product of the adjoints.

      theorem MIPRE.BipartiteModel.isStarProjection_πA_mul_πB {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {U : 𝒜} {V : ℬ} (hU : IsStarProjection U) (hV : IsStarProjection V) :

      A product of commuting star projections of the two players is a star projection.

      theorem MIPRE.BipartiteModel.abs_qform_πA_mul_πB_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (U : 𝒜) (V : ℬ) :
      |M.qform (M.πA U * M.πB V)| ≤ M.swap.stateNorm (star V) * M.stateNorm U

      Cauchy--Schwarz for a mixed product, with the deviation on the first player's side.

      theorem MIPRE.BipartiteModel.abs_qform_πA_mul_πB_le' {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (U : 𝒜) (V : ℬ) :
      |M.qform (M.πA U * M.πB V)| ≤ M.stateNorm (star U) * M.swap.stateNorm V

      Cauchy--Schwarz for a mixed product, with the deviation on the second player's side.

      theorem MIPRE.BipartiteModel.stateNorm_mul_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {P : 𝒜} (hP : M.Bnd (M.πA P) 1) (N : 𝒜) :
      M.stateNorm (P * N) ≤ M.stateNorm N

      A contraction in front costs nothing.

      theorem MIPRE.BipartiteModel.sum_stateSqNorm_of_isPVMIn {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (hψ : ‖M.ψ‖ = 1) {A : Type u_4} [Fintype A] {X : A → 𝒜} (hX : IsPVMIn X) :
      ∑ a : A, M.stateSqNorm (X a) = 1

      The squared norms of a projective measurement's vectors sum to one.

      theorem MIPRE.BipartiteModel.one_sub_sum_bornProb_eq {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) (hψ : ‖M.ψ‖ = 1) {A : Type u_4} [Fintype A] {X : A → 𝒜} {X' : A → ℬ} (hX : IsPVMIn X) (hX' : IsPVMIn X') :
      1 - ∑ a : A, M.bornProb (X a) (X' a) = (∑ a : A, M.xSqNorm (X a) (X' a)) / 2

      The consistency of two projective measurements, as a defect from one.

      The chain #

      theorem MIPRE.BipartiteModel.sum_stateSqNorm_ord {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X Z : A → 𝒜} (hψ : ‖M.ψ‖ = 1) (hX : IsPVMIn X) (hZ : IsPVMIn Z) :
      ∑ p : A × A, M.stateSqNorm (X p.1 * Z p.2) = 1

      The ordered products' squared norms sum to exactly one.

      theorem MIPRE.BipartiteModel.abs_link1_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X Z : A → 𝒜} (hZ : IsPVMIn Z) {S' : A × A → ℬ} (hS' : ∀ (p : A × A), star (S' p) = S' p) :
      |∑ p : A × A, M.qform (M.πA (sand X Z p) * M.πB (S' p)) - ∑ p : A × A, M.qform (M.πA (Z p.2 * X p.1) * M.πB (S' p))| ≤ √(∑ p : A × A, M.stateSqNorm (X p.1 * Z p.2 - Z p.2 * X p.1)) * √(∑ p : A × A, M.swap.stateSqNorm (S' p))

      Link 1: replacing each sandwich by the ordered product costs the first player's commutator.

      theorem MIPRE.BipartiteModel.abs_link2_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X Z : A → 𝒜} {X' Z' : A → ℬ} (hX : IsPVMIn X) (hZ : IsPVMIn Z) (hZ' : IsPVMIn Z') :
      |∑ p : A × A, M.qform (M.πA (Z p.2 * X p.1) * M.πB (sand X' Z' p)) - ∑ p : A × A, M.qform (M.πA (Z p.2 * X p.1) * M.πB (Z' p.2 * X' p.1))| ≤ √(∑ p : A × A, M.stateSqNorm (X p.1 * Z p.2)) * √(∑ p : A × A, M.swap.stateSqNorm (X' p.1 * Z' p.2 - Z' p.2 * X' p.1))

      Link 2: replacing the second player's sandwich by the ordered product costs the second player's commutator.

      theorem MIPRE.BipartiteModel.isStarProjection_diag {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {Z : A → 𝒜} {Z' : A → ℬ} [DecidableEq A] (hZ : IsPVMIn Z) (hZ' : IsPVMIn Z') :
      IsStarProjection (∑ b : A, M.πA (Z b) * M.πB (Z' b))

      The diagonal agreement operator of two projective measurements is a star projection.

      theorem MIPRE.BipartiteModel.isStarProjection_disag {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X : A → 𝒜} {X' : A → ℬ} [DecidableEq A] (hX : IsPVMIn X) (hX' : IsPVMIn X') :
      IsStarProjection (∑ a : A, M.πA (1 - X a) * M.πB (X' a))

      The disagreement operator of two projective measurements is a star projection.

      theorem MIPRE.BipartiteModel.qform_disag {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X : A → 𝒜} {X' : A → ℬ} [DecidableEq A] (hψ : ‖M.ψ‖ = 1) (hX : IsPVMIn X) (hX' : IsPVMIn X') :
      M.qform (∑ a : A, M.πA (1 - X a) * M.πB (X' a)) = (∑ a : A, M.xSqNorm (X a) (X' a)) / 2

      The disagreement operator's expectation is the consistency defect.

      theorem MIPRE.BipartiteModel.abs_link3_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {X Z : A → 𝒜} {X' Z' : A → ℬ} [DecidableEq A] (hψ : ‖M.ψ‖ = 1) (hX : IsPVMIn X) (hZ : IsPVMIn Z) (hX' : IsPVMIn X') (hZ' : IsPVMIn Z') :
      |∑ p : A × A, M.qform (M.πA (Z p.2 * X p.1) * M.πB (Z' p.2 * X' p.1)) - ∑ p : A × A, M.qform (M.πA (Z p.2) * M.πB (Z' p.2 * X' p.1))| ≤ √((∑ a : A, M.xSqNorm (X a) (X' a)) / 2)

      Link 3: dropping the first player's X-outcome costs the X-consistency, and nothing that depends on the number of outcomes: the whole outcome sum is one operator product.

      theorem MIPRE.BipartiteModel.link4_eq {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {Z : A → 𝒜} {X' Z' : A → ℬ} (hX' : IsPVMIn X') :
      ∑ p : A × A, M.qform (M.πA (Z p.2) * M.πB (Z' p.2 * X' p.1)) = ∑ b : A, M.qform (M.πA (Z b) * M.πB (Z' b))

      Link 4: the second player's X-outcome sums away, exactly.

      theorem MIPRE.BipartiteModel.link5_eq {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) {A : Type u_4} [Fintype A] {Z : A → 𝒜} {Z' : A → ℬ} (hψ : ‖M.ψ‖ = 1) (hZ : IsPVMIn Z) (hZ' : IsPVMIn Z') :
      ∑ b : A, M.qform (M.πA (Z b) * M.πB (Z' b)) = 1 - (∑ b : A, M.xSqNorm (Z b) (Z' b)) / 2

      Link 5: the Z-agreement is one minus half the Z-consistency defect.

      The chain, assembled #

      theorem MIPRE.BipartiteModel.one_sub_sum_bornProb_sand_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) [PartialOrder ℬ] [StarOrderedRing ℬ] {A : Type u_4} [Fintype A] [DecidableEq A] {ι : Type u_5} [Fintype ι] {w : ι → ℝ} (hw0 : ∀ (i : ι), 0 ≤ w i) (hw1 : ∑ i : ι, w i = 1) (hψ : ‖M.ψ‖ = 1) {X Z : ι → A → 𝒜} {X' Z' : ι → A → ℬ} (hX : ∀ (i : ι), IsPVMIn (X i)) (hZ : ∀ (i : ι), IsPVMIn (Z i)) (hX' : ∀ (i : ι), IsPVMIn (X' i)) (hZ' : ∀ (i : ι), IsPVMIn (Z' i)) {cA cB α β : ℝ} (hcA : ∑ i : ι, w i * ∑ p : A × A, M.stateSqNorm (X i p.1 * Z i p.2 - Z i p.2 * X i p.1) ≤ cA) (hcB : ∑ i : ι, w i * ∑ p : A × A, M.swap.stateSqNorm (X' i p.1 * Z' i p.2 - Z' i p.2 * X' i p.1) ≤ cB) (hα : ∑ i : ι, w i * ∑ a : A, M.xSqNorm (X i a) (X' i a) ≤ α) (hβ : ∑ i : ι, w i * ∑ b : A, M.xSqNorm (Z i b) (Z' i b) ≤ β) :
      1 - ∑ i : ι, w i * ∑ p : A × A, M.bornProb (sand (X i) (Z i) p) (sand (X' i) (Z' i) p) ≤ √cA + √cB + √(α / 2) + β / 2

      The sandwich of two approximately commuting projective measurements is approximately self-consistent across the two parties. The five links of the chain, added up. Every error term is q-independent: the two commutators enter under a square root through one Cauchy--Schwarz each, the X-consistency through a third, and the Z-consistency linearly.

      theorem MIPRE.BipartiteModel.sum_xSqNorm_map_le {𝒞 : Type u_1} {𝒜 : Type u_2} {ℬ : Type u_3} [Ring 𝒞] [StarRing 𝒞] [Algebra ℂ 𝒞] [Ring 𝒜] [StarRing 𝒜] [Algebra ℂ 𝒜] [Ring ℬ] [StarRing ℬ] [Algebra ℂ ℬ] (M : BipartiteModel 𝒞 𝒜 ℬ) [PartialOrder 𝒜] [StarOrderedRing 𝒜] [PartialOrder ℬ] [StarOrderedRing ℬ] (hψ : ‖M.ψ‖ = 1) {A : Type u_4} {C : Type u_5} [Fintype A] [DecidableEq A] [Fintype C] [DecidableEq C] (Q : POVMIn A 𝒜) (Q' : POVMIn A ℬ) (hQ : IsPVMIn Q.op) (hQ' : IsPVMIn Q'.op) (f : A → C) :
      ∑ v : C, M.xSqNorm ((POVMIn.map f Q).op v) ((POVMIn.map f Q').op v) ≤ ∑ a : A, M.xSqNorm (Q.op a) (Q'.op a)

      Coarse-graining two projective measurements the same way costs nothing. For projective families the summed deviation and the agreement determine each other exactly (one_sub_sum_bornProb_eq), and agreement can only increase under a common coarse-graining (sum_bornProb_le_map).

      Quadratic forms: Cauchy--Schwarz and the order #

      theorem MIPRE.inner_evec {N : Type u_1} [Fintype N] (u w : N → ℂ) :
      inner ℂ (evec u) (evec w) = star u ⬝ᵥ w
      theorem MIPRE.abs_qform_conjTranspose_mul_le {N : Type u_1} [Fintype N] (v : N → ℂ) (M P : Matrix N N ℂ) :

      Cauchy--Schwarz for a quadratic form. The one estimate the chain uses, in the shape the chain needs: the form of a product, split onto the two vectors.

      theorem MIPRE.proj_le_one {N : Type u_1} [Fintype N] [DecidableEq N] {P : Matrix N N ℂ} (hsa : P.conjTranspose = P) (hidem : P * P = P) :
      P ≤ 1

      A projection is bounded by the identity.

      theorem MIPRE.snorm_le_one_of_proj {N : Type u_1} [Fintype N] [DecidableEq N] {v : N → ℂ} (hv : ‖evec v‖ = 1) {P : Matrix N N ℂ} (hsa : P.conjTranspose = P) (hidem : P * P = P) :
      snorm v P ≤ 1

      A projection is a contraction on a unit vector.

      The two factors #

      theorem MIPRE.aOp_mul_bOp_eq {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (U : Matrix dA dA ℂ) (V : Matrix dB dB ℂ) :
      aOp U * bOp V = Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) U V
      theorem MIPRE.bornProb_eq_qform {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (U : Matrix dA dA ℂ) (V : Matrix dB dB ℂ) :
      bornProb ψ U V = qform ψ (aOp U * bOp V)
      theorem MIPRE.abs_qform_aOp_mul_bOp_le {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (U : Matrix dA dA ℂ) (V : Matrix dB dB ℂ) :

      Cauchy--Schwarz for a mixed product, with the deviation on Alice's side.

      theorem MIPRE.stateNorm_mul_le {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) {P : Matrix dA dA ℂ} (hP : P.conjTranspose * P ≤ 1) (N : Matrix dA dA ℂ) :
      stateNorm ψ (P * N) ≤ stateNorm ψ N

      A contraction in front costs nothing, on Alice's side.

      theorem MIPRE.norm_stateVecB_mul_le {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) {P : Matrix dB dB ℂ} (hP : P.conjTranspose * P ≤ 1) (N : Matrix dB dB ℂ) :

      A contraction in front costs nothing, on Bob's side.

      Sums of mutually orthogonal projections #

      Products of the two factors #

      theorem MIPRE.stateSqNorm_eq_qform {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (M : Matrix dA dA ℂ) :
      theorem MIPRE.normSq_stateVecB_eq_qform {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (M : Matrix dB dB ℂ) :
      theorem MIPRE.xSqNorm_eq_expand {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) {A : Matrix dA dA ℂ} (hA : A.conjTranspose = A) (B : Matrix dB dB ℂ) :
      xSqNorm ψ A B = stateSqNorm ψ A + ‖stateVecB ψ B‖ ^ 2 - 2 * bornProb ψ A B

      Expanding a cross-party deviation.

      theorem MIPRE.one_sub_sum_bornProb_eq {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {A : Type u_3} [Fintype A] [DecidableEq A] {ψ : dA × dB → ℂ} (hψ : ‖evec ψ‖ = 1) {X : A → Matrix dA dA ℂ} {X' : A → Matrix dB dB ℂ} (hX : IsPVM X) (hX' : IsPVM X') :
      1 - ∑ a : A, bornProb ψ (X a) (X' a) = (∑ a : A, xSqNorm ψ (X a) (X' a)) / 2

      The consistency of two projective measurements, as a defect from one. With both families projective the two diagonal sums are exactly one, so the agreement probability and the summed cross-party deviation determine each other.

      The sandwich #

      theorem MIPRE.sand_eq_gram {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) (p : A × A) :
      sand X Z p = (X p.1 * Z p.2).conjTranspose * (X p.1 * Z p.2)

      The sandwich is the Gram operator of the ordered product, which is where its positivity and its normalization both come from.

      theorem MIPRE.sand_conjTranspose {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) (p : A × A) :
      (sand X Z p).conjTranspose = sand X Z p
      theorem MIPRE.sand_posSemidef {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) (p : A × A) :
      theorem MIPRE.sum_sand {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) :
      ∑ p : A × A, sand X Z p = 1

      The sandwich is a POVM, exactly: only projectivity of Z and completeness of X are used, and no approximate commutation whatsoever.

      def MIPRE.sandPOVM {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) :
      POVM (A × A) d

      The sandwich, as a bundled POVM.

      Equations
      Instances For
        @[simp]
        theorem MIPRE.sandPOVM_mats {A : Type u_1} [Fintype A] [DecidableEq A] {d : Type u_4} [Fintype d] [DecidableEq d] {X Z : A → Matrix d d ℂ} (hX : IsPVM X) (hZ : IsPVM Z) (p : A × A) :
        ↑((sandPOVM hX hZ).mats p) = sand X Z p

        The chain #

        Five links from the agreement of the two parties' sandwiches to one. The two middle links are the parties' commutators, each paid for by one Cauchy--Schwarz against a family of squared norms summing to at most one; the third collapses the X-outcome sum by completeness; the last is the Z-consistency.

        theorem MIPRE.IsPVM.conjTranspose_mul_self_le_one {A : Type u_1} [Fintype A] [DecidableEq A] {N : Type u_4} [Fintype N] [DecidableEq N] {P : A → Matrix N N ℂ} (h : IsPVM P) (a : A) :
        (P a).conjTranspose * P a ≤ 1

        A projective measurement's elements are contractions.

        theorem MIPRE.sum_stateSqNorm_ord {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {X Z : A → Matrix dA dA ℂ} (hψ : ‖evec ψ‖ = 1) (hX : IsPVM X) (hZ : IsPVM Z) :
        ∑ p : A × A, stateSqNorm ψ (X p.1 * Z p.2) = 1

        The ordered products' squared norms sum to exactly one.

        theorem MIPRE.abs_link1_le {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {X Z : A → Matrix dA dA ℂ} (hZ : IsPVM Z) {S' : A × A → Matrix dB dB ℂ} (hS' : ∀ (p : A × A), (S' p).conjTranspose = S' p) :
        |∑ p : A × A, qform ψ (aOp (sand X Z p) * bOp (S' p)) - ∑ p : A × A, qform ψ (aOp (Z p.2 * X p.1) * bOp (S' p))| ≤ √(∑ p : A × A, stateSqNorm ψ (X p.1 * Z p.2 - Z p.2 * X p.1)) * √(∑ p : A × A, ‖stateVecB ψ (S' p)‖ ^ 2)

        Link 1: replacing each sandwich by the ordered product costs Alice's commutator.

        theorem MIPRE.abs_link2_le {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {X Z : A → Matrix dA dA ℂ} {X' Z' : A → Matrix dB dB ℂ} (hX : IsPVM X) (hZ : IsPVM Z) (hZ' : IsPVM Z') :
        |∑ p : A × A, qform ψ (aOp (Z p.2 * X p.1) * bOp (sand X' Z' p)) - ∑ p : A × A, qform ψ (aOp (Z p.2 * X p.1) * bOp (Z' p.2 * X' p.1))| ≤ √(∑ p : A × A, stateSqNorm ψ (X p.1 * Z p.2)) * √(∑ p : A × A, ‖stateVecB ψ (X' p.1 * Z' p.2 - Z' p.2 * X' p.1)‖ ^ 2)

        Link 2: replacing Bob's sandwich by his ordered product costs Bob's commutator.

        theorem MIPRE.abs_link3_le {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {X Z : A → Matrix dA dA ℂ} {X' Z' : A → Matrix dB dB ℂ} (hψ : ‖evec ψ‖ = 1) (hX : IsPVM X) (hZ : IsPVM Z) (hX' : IsPVM X') (hZ' : IsPVM Z') :
        |∑ p : A × A, qform ψ (aOp (Z p.2 * X p.1) * bOp (Z' p.2 * X' p.1)) - ∑ p : A × A, qform ψ (aOp (Z p.2) * bOp (Z' p.2 * X' p.1))| ≤ √((∑ a : A, xSqNorm ψ (X a) (X' a)) / 2)

        Link 3: dropping Alice's X-outcome costs her X-consistency with Bob, and nothing that depends on the number of outcomes: the whole outcome sum is one operator product.

        theorem MIPRE.link4_eq {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {Z : A → Matrix dA dA ℂ} {X' Z' : A → Matrix dB dB ℂ} (hX' : IsPVM X') :
        ∑ p : A × A, qform ψ (aOp (Z p.2) * bOp (Z' p.2 * X' p.1)) = ∑ b : A, qform ψ (aOp (Z b) * bOp (Z' b))

        Link 4: Bob's X-outcome sums away, exactly.

        theorem MIPRE.link5_eq {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {Z : A → Matrix dA dA ℂ} {Z' : A → Matrix dB dB ℂ} (hψ : ‖evec ψ‖ = 1) (hZ : IsPVM Z) (hZ' : IsPVM Z') :
        ∑ b : A, qform ψ (aOp (Z b) * bOp (Z' b)) = 1 - (∑ b : A, xSqNorm ψ (Z b) (Z' b)) / 2

        Link 5: the Z-agreement is one minus half the Z-consistency defect.

        The chain, assembled #

        theorem MIPRE.norm_evec_eq_one_of_unit {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) :
        theorem MIPRE.one_sub_sum_bornProb_sand_le {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ι : Type u_4} [Fintype ι] {w : ι → ℝ} (hw0 : ∀ (i : ι), 0 ≤ w i) (hw1 : ∑ i : ι, w i = 1) {ψ : dA × dB → ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) {X Z : ι → A → Matrix dA dA ℂ} {X' Z' : ι → A → Matrix dB dB ℂ} (hX : ∀ (i : ι), IsPVM (X i)) (hZ : ∀ (i : ι), IsPVM (Z i)) (hX' : ∀ (i : ι), IsPVM (X' i)) (hZ' : ∀ (i : ι), IsPVM (Z' i)) {cA cB α β : ℝ} (hcA : ∑ i : ι, w i * ∑ p : A × A, stateSqNorm ψ (X i p.1 * Z i p.2 - Z i p.2 * X i p.1) ≤ cA) (hcB : ∑ i : ι, w i * ∑ p : A × A, ‖stateVecB ψ (X' i p.1 * Z' i p.2 - Z' i p.2 * X' i p.1)‖ ^ 2 ≤ cB) (hα : ∑ i : ι, w i * ∑ a : A, xSqNorm ψ (X i a) (X' i a) ≤ α) (hβ : ∑ i : ι, w i * ∑ b : A, xSqNorm ψ (Z i b) (Z' i b) ≤ β) :
        1 - ∑ i : ι, w i * ∑ p : A × A, bornProb ψ (sand (X i) (Z i) p) (sand (X' i) (Z' i) p) ≤ √cA + √cB + √(α / 2) + β / 2

        The sandwich of two approximately commuting projective measurements is approximately self-consistent across the two parties. The five links of the chain, added up. Every error term is q-independent: the two commutators enter under a square root through one Cauchy--Schwarz each, the X-consistency through a third, and the Z-consistency linearly.

        The two-sided extension, and the dilated joint measurement #

        theorem MIPRE.stateVecB_add' {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (M N : Matrix dB dB ℂ) :
        stateVecB ψ (M + N) = stateVecB ψ M + stateVecB ψ N
        theorem MIPRE.stateVecB_sub' {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (M N : Matrix dB dB ℂ) :
        stateVecB ψ (M - N) = stateVecB ψ M - stateVecB ψ N
        theorem MIPRE.xNorm_le_add_stateVecB {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (Aop : Matrix dA dA ℂ) (B₁ B₂ : Matrix dB dB ℂ) :
        xNorm ψ Aop B₂ ≤ xNorm ψ Aop B₁ + ‖stateVecB ψ (B₁ - B₂)‖

        Replacing Bob's operator inside a cross-party deviation.

        def MIPRE.extVec2 {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [DecidableEq Anc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) :
        (dA × Anc) × dB × Bnc → ℂ

        The two-sided extension of a state: one ancilla register in the fixed state |a0> adjoined to each party. This is def:expanded-state's shape with an inert ancilla, and it is what a pair of Naimark dilations --- one per party --- is compressed back by.

        Equations
        Instances For
          theorem MIPRE.ancillaEmbed_kron_isometry2 {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (a₀ : Anc) (b₀ : Bnc) :
          (Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) (ancillaEmbed dA a₀) (ancillaEmbed dB b₀)).conjTranspose * Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) (ancillaEmbed dA a₀) (ancillaEmbed dB b₀) = 1
          theorem MIPRE.extVec2_unit {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] {ψ : dA × dB → ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) (a₀ : Anc) (b₀ : Bnc) :
          star (extVec2 ψ a₀ b₀) ⬝ᵥ extVec2 ψ a₀ b₀ = 1
          theorem MIPRE.bornProb_extVec2 {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) (EA : Matrix (dA × Anc) (dA × Anc) ℂ) (EB : Matrix (dB × Bnc) (dB × Bnc) ℂ) :
          bornProb (extVec2 ψ a₀ b₀) EA EB = bornProb ψ ((ancillaEmbed dA a₀).conjTranspose * (EA * ancillaEmbed dA a₀)) ((ancillaEmbed dB b₀).conjTranspose * (EB * ancillaEmbed dB b₀))

          The Born rule on the twice-extended state is the Born rule of the two compressions.

          theorem MIPRE.qform_aOp_extVec2 {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) (EA : Matrix (dA × Anc) (dA × Anc) ℂ) :
          qform (extVec2 ψ a₀ b₀) (aOp EA) = qform ψ (aOp ((ancillaEmbed dA a₀).conjTranspose * (EA * ancillaEmbed dA a₀)))
          theorem MIPRE.qform_bOp_extVec2 {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) (EB : Matrix (dB × Bnc) (dB × Bnc) ℂ) :
          qform (extVec2 ψ a₀ b₀) (bOp EB) = qform ψ (bOp ((ancillaEmbed dB b₀).conjTranspose * (EB * ancillaEmbed dB b₀)))
          theorem MIPRE.compress_aOp {dB : Type u_2} [Fintype dB] [DecidableEq dB] {Bnc : Type u_4} [Fintype Bnc] [DecidableEq Bnc] (b₀ : Bnc) (N : Matrix dB dB ℂ) :
          (ancillaEmbed dB b₀).conjTranspose * (aOp N * ancillaEmbed dB b₀) = N

          An operator with an inert ancilla compresses to itself.

          theorem MIPRE.normSq_stateVecB_extVec2_aOp {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_3} {Bnc : Type u_4} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) (N : Matrix dB dB ℂ) :
          ‖stateVecB (extVec2 ψ a₀ b₀) (aOp N)‖ ^ 2 = ‖stateVecB ψ N‖ ^ 2

          Bob's inert-ancilla operator has the same state norm on the extended state.

          The dilated joint measurement #

          theorem MIPRE.norm_stateVecB_extVec2_aOp {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {Anc : Type u_4} {Bnc : Type u_5} [Fintype Anc] [DecidableEq Anc] [Fintype Bnc] [DecidableEq Bnc] (ψ : dA × dB → ℂ) (a₀ : Anc) (b₀ : Bnc) (N : Matrix dB dB ℂ) :
          ‖stateVecB (extVec2 ψ a₀ b₀) (aOp N)‖ = ‖stateVecB ψ N‖
          theorem MIPRE.xSqNorm_le_of_stateVecB {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (Aop : Matrix dA dA ℂ) (B₁ B₂ : Matrix dB dB ℂ) :
          xSqNorm ψ Aop B₂ ≤ 2 * xSqNorm ψ Aop B₁ + 2 * ‖stateVecB ψ (B₁ - B₂)‖ ^ 2

          Replacing Bob's operator inside a squared cross-party deviation, at the usual factor two.

          theorem MIPRE.sum_xSqNorm_dilated_eq {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {Q : A × A → Matrix (dA × A × A) (dA × A × A) ℂ} {Q' : A × A → Matrix (dB × A × A) (dB × A × A) ℂ} {R : A × A → Matrix dA dA ℂ} {R' : A × A → Matrix dB dB ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) (a₀ : A × A) (hQ : IsPVM Q) (hQ' : IsPVM Q') (hkA : ∀ (p : A × A), (ancillaEmbed dA a₀).conjTranspose * (Q p * ancillaEmbed dA a₀) = R p) (hkB : ∀ (p : A × A), (ancillaEmbed dB a₀).conjTranspose * (Q' p * ancillaEmbed dB a₀) = R' p) (hR : ∑ p : A × A, R p = 1) (hR' : ∑ p : A × A, R' p = 1) :
          ∑ p : A × A, xSqNorm (extVec2 ψ a₀ a₀) (Q p) (Q' p) = 2 * (1 - ∑ p : A × A, bornProb ψ (R p) (R' p))

          The dilated pair's self-consistency is the sandwiches' agreement defect, exactly: the compression identity transports the whole Born-rule expansion.

          theorem MIPRE.sum_xSqNorm_dilated_aOp_le {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} {Q : A × A → Matrix (dA × A × A) (dA × A × A) ℂ} {R : A × A → Matrix dA dA ℂ} {R' : A × A → Matrix dB dB ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) (a₀ : A × A) (hQ : IsPVM Q) (hkA : ∀ (p : A × A), (ancillaEmbed dA a₀).conjTranspose * (Q p * ancillaEmbed dA a₀) = R p) (hR : ∑ p : A × A, R p = 1) (hR'B : ∑ p : A × A, ‖stateVecB ψ (R' p)‖ ^ 2 ≤ 1) :
          ∑ p : A × A, xSqNorm (extVec2 ψ a₀ a₀) (Q p) (aOp (R' p)) ≤ 2 * (1 - ∑ p : A × A, bornProb ψ (R p) (R' p))

          The same bound against the undilated sandwich on Bob's side, extended by identity on his ancilla.

          The theorem #

          theorem MIPRE.exists_projective_joint {A : Type u_1} [Fintype A] [DecidableEq A] {dA : Type u_2} {dB : Type u_3} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ι : Type u_4} [Fintype ι] {w : ι → ℝ} (hw0 : ∀ (i : ι), 0 ≤ w i) (hw1 : ∑ i : ι, w i = 1) {ψ : dA × dB → ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) (a₀ : A × A) {X Z : ι → A → Matrix dA dA ℂ} {X' Z' : ι → A → Matrix dB dB ℂ} (hX : ∀ (i : ι), IsPVM (X i)) (hZ : ∀ (i : ι), IsPVM (Z i)) (hX' : ∀ (i : ι), IsPVM (X' i)) (hZ' : ∀ (i : ι), IsPVM (Z' i)) {cA cB α β : ℝ} (hcA : ∑ i : ι, w i * ∑ p : A × A, stateSqNorm ψ (X i p.1 * Z i p.2 - Z i p.2 * X i p.1) ≤ cA) (hcB : ∑ i : ι, w i * ∑ p : A × A, ‖stateVecB ψ (X' i p.1 * Z' i p.2 - Z' i p.2 * X' i p.1)‖ ^ 2 ≤ cB) (hα : ∑ i : ι, w i * ∑ a : A, xSqNorm ψ (X i a) (X' i a) ≤ α) (hβ : ∑ i : ι, w i * ∑ b : A, xSqNorm ψ (Z i b) (Z' i b) ≤ β) :
          ∃ (QA : ι → A × A → Matrix (dA × A × A) (dA × A × A) ℂ) (QB : ι → A × A → Matrix (dB × A × A) (dB × A × A) ℂ), (∀ (i : ι), IsPVM (QA i)) ∧ (∀ (i : ι), IsPVM (QB i)) ∧ (∀ (i : ι) (p : A × A), (ancillaEmbed dA a₀).conjTranspose * (QA i p * ancillaEmbed dA a₀) = sand (X i) (Z i) p) ∧ (∀ (i : ι) (p : A × A), (ancillaEmbed dB a₀).conjTranspose * (QB i p * ancillaEmbed dB a₀) = sand (X' i) (Z' i) p) ∧ ∑ i : ι, w i * ∑ p : A × A, xSqNorm (extVec2 ψ a₀ a₀) (QA i p) (QB i p) ≤ 2 * (√cA + √cB + √(α / 2) + β / 2) ∧ ∑ i : ι, w i * ∑ p : A × A, xSqNorm (extVec2 ψ a₀ a₀) (QA i p) (aOp (Z' i p.2 * X' i p.1)) ≤ 4 * (√cA + √cB + √(α / 2) + β / 2) + 2 * cB ∧ ∑ i : ι, w i * ∑ p : A × A, xSqNorm (extVec2 ψ a₀ a₀) (QA i p) (aOp (X' i p.1 * Z' i p.2)) ≤ 4 * (√cA + √cB + √(α / 2) + β / 2) + 8 * cB

          Two approximately commuting projective measurements on each party admit a joint projective measurement, on each party's space enlarged by one ancilla register, which is self-consistent across the parties and consistent with both ordered products of the originals --- all at errors independent of the number of outcomes.

          The construction is the Naimark dilation of the sandwich Z_b X_a Z_b; hkA and hkB record that the dilations compress back to it, which is what carries every estimate.

          Coarse-graining #

          theorem MIPRE.sum_xSqNorm_map_le {A : Type u_1} {C : Type u_2} [Fintype A] [DecidableEq A] [Fintype C] [DecidableEq C] {dA : Type u_3} {dB : Type u_4} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ψ : dA × dB → ℂ} (hψ : star ψ ⬝ᵥ ψ = 1) (Q : POVM A dA) (Q' : POVM A dB) (hQ : IsPVM fun (a : A) => ↑(Q.mats a)) (hQ' : IsPVM fun (a : A) => ↑(Q'.mats a)) (f : A → C) :
          ∑ v : C, xSqNorm ψ ↑((POVM.map f Q).mats v) ↑((POVM.map f Q').mats v) ≤ ∑ a : A, xSqNorm ψ ↑(Q.mats a) ↑(Q'.mats a)

          Coarse-graining two projective measurements the same way costs nothing. The state-dependent distance has no data-processing inequality, and a per-fibre triangle inequality would cost the fibre size; what makes this free is that for projective families the summed deviation and the agreement probability determine each other exactly (one_sub_sum_bornProb_eq), and agreement can only increase under a coarse-graining.

          A deviation as the norm of one vector #

          sum_avg_norm_fibre_sq is a statement about vectors; this is the bridge to the cross-party deviation, and the linearity that lets a fibre sum of vectors be read as the deviation of the coarse-grained operators.

          theorem MIPRE.sum_mulVec' {ι : Type u_3} {N : Type u_4} {M : Type u_5} [Fintype N] (s : Finset ι) (A : ι → Matrix M N ℂ) (v : N → ℂ) :
          (∑ i ∈ s, A i).mulVec v = ∑ i ∈ s, (A i).mulVec v
          theorem MIPRE.xSqNorm_eq_norm_evec_sq {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] (ψ : dA × dB → ℂ) (A : Matrix dA dA ℂ) (B : Matrix dB dB ℂ) :
          xSqNorm ψ A B = ‖evec ((aOp A - bOp B).mulVec ψ)‖ ^ 2
          theorem MIPRE.sum_fibre_dev {dA : Type u_1} {dB : Type u_2} [Fintype dA] [DecidableEq dA] [Fintype dB] [DecidableEq dB] {ι : Type u_3} (ψ : dA × dB → ℂ) (s : Finset ι) (A : ι → Matrix dA dA ℂ) (B : ι → Matrix dB dB ℂ) :
          ∑ i ∈ s, (aOp (A i) - bOp (B i)).mulVec ψ = (aOp (∑ i ∈ s, A i) - bOp (∑ i ∈ s, B i)).mulVec ψ

          The fibre sum of the deviation vectors is the deviation of the coarse-grained operators.