Documentation

MIPRE.Foundations.WeylEPR

The maximally entangled state of the Weyl system #

|EPR_q⟩^{⊗ n} on two copies of (C^q)^{⊗ n}, normalized, and the one property the Pauli basis test uses it for: the two parties' Weyl operators act identically on it.

That property is the reason the expansion stage of the appendix works at all. Its expanded state adjoins |EPR_q⟩^{⊗ M} to each player, and the sign (-1)^γ that the strategy's own observables carry is cancelled against one the ancilla observables carry; for that the ancilla halves must be tied together, and stateVec_epr_wX/stateVec_epr_wZ is the tie.

The general fact, and why the Weyl case is clean #

For any operator, (M ⊗ Id)|EPR⟩ = (Id ⊗ Mᵗ)|EPR⟩ (stateVec_epr) --- the maximally entangled state transports an operator to the other factor at the cost of a transpose. Generalized Paulis over a field of characteristic two are real symmetric matrices, so the transpose is the identity map on them and the cost vanishes. Over F_p for odd p it would not: τ^Z(b) has entries ω^{tr(bj)}, whose transpose is τ^Z(b) but whose conjugate is τ^Z(-b), and the bookkeeping reappears. This is the second dividend of the characteristic-two restriction, after the operators being involutions.

The state #

noncomputable def MIPRE.Weyl.eprScale {F : Type u_1} [Fintype F] {n : Type u_2} [Fintype n] [DecidableEq n] :

The normalizing scalar 1/√N of the maximally entangled state, N = q^n.

Equations
Instances For
    noncomputable def MIPRE.Weyl.epr {F : Type u_1} [Fintype F] [DecidableEq F] {n : Type u_2} [Fintype n] [DecidableEq n] :
    (n → F) × (n → F) → ℂ

    The normalized maximally entangled state on two copies of (C^q)^{⊗ n}.

    Equations
    Instances For
      @[simp]
      theorem MIPRE.Weyl.epr_same {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (a : n → F) :
      theorem MIPRE.Weyl.epr_ne {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {a b : n → F} (h : a ≠ b) :
      epr (a, b) = 0
      @[simp]
      theorem MIPRE.Weyl.swapVec_epr {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] :

      The maximally entangled state is symmetric under exchanging the two halves.

      theorem MIPRE.Weyl.eprScale_sq {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] :
      eprScale ^ 2 = (↑(Fintype.card (n → F)))⁻¹
      theorem MIPRE.Weyl.epr_unit {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] :

      The state is a unit vector.

      Transport to the other factor #

      theorem MIPRE.Weyl.stateVec_entry {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (ψ : (n → F) × (n → F) → ℂ) (M : Matrix (n → F) (n → F) ℂ) (a b : n → F) :
      (Matrix.kroneckerMap (fun (x1 x2 : ℂ) => x1 * x2) M 1).mulVec ψ (a, b) = ∑ k : n → F, M a k * ψ (k, b)
      theorem MIPRE.Weyl.stateVec_epr {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (M : Matrix (n → F) (n → F) ℂ) :

      The maximally entangled state transports an operator to the other factor, at the cost of a transpose: (M ⊗ Id)|EPR⟩ = (Id ⊗ Mᵗ)|EPR⟩.

      The Weyl operators are symmetric #

      So the transpose in stateVec_epr costs nothing: the two parties' operators act identically on the state.

      @[simp]
      theorem MIPRE.Weyl.wX_transpose {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (a : n → F) :
      @[simp]
      theorem MIPRE.Weyl.wZ_transpose {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (b : n → F) :
      theorem MIPRE.Weyl.stateVec_epr_wX {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (a : n → F) :

      The two parties' X-type operators act identically on the maximally entangled state.

      theorem MIPRE.Weyl.stateVec_epr_wZ {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] (b : n → F) :

      The two parties' Z-type operators act identically on the maximally entangled state.

      theorem MIPRE.Weyl.stateVec_epr_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 : ∀ (a : n → F), (w a).transpose = w a) (e : n → F) :

      The same for the spectral projectors of either family, which are built from the operators by a real Fourier average and are therefore symmetric too.

      The syndrome projectors #

      syn w v a collects the spectral projectors along a level set of the pairing. Two facts the expansion stage needs: it is a projective measurement, and it transports across the maximally entangled state like each projector does.

      theorem MIPRE.Weyl.isPVM_synOf {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) ℂ} {C : Type u_3} [Fintype C] [DecidableEq C] (hw : IsWeylFamily w) (φ : (n → F) → C) :
      IsPVM (synOf w φ)

      A coarse-grained eigenbasis measurement is a projective measurement, indexed by the values of the label. Orthogonality of the spectral projectors makes each element idempotent, and the level sets partition the index group.

      theorem MIPRE.Weyl.isPVM_syn {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 : IsWeylFamily w) (v : n → F) :
      IsPVM (syn w v)

      The syndrome projectors form a projective measurement, indexed by the value of the pairing.

      theorem MIPRE.Weyl.stateVec_epr_synOf {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) ℂ} {C : Type u_3} [DecidableEq C] (hw : ∀ (a : n → F), (w a).transpose = w a) (φ : (n → F) → C) (o : C) :
      stateVec epr (synOf w φ o) = stateVecB epr (synOf w φ o)

      Coarse-grained eigenbasis projectors transport across the maximally entangled state, exactly: each spectral projector does (stateVec_epr_proj) and the level-set projector is a sum of them.

      theorem MIPRE.Weyl.stateVec_epr_syn {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 : ∀ (a : n → F), (w a).transpose = w a) (v : n → F) (a : F) :
      stateVec epr (syn w v a) = stateVecB epr (syn w v a)

      The syndrome projectors transport across the maximally entangled state, exactly.