Documentation

MIPRE.Foundations.WeylBinary

From qudits to qubits: the generalized Pauli system is a qubit Pauli system #

Blueprint lem:pauli-binary. A self-dual basis of F_q over F_2 identifies F_q^n with F_2^{n x k}, and under that identification every piece of the Weyl data over F_q becomes the corresponding piece over F_2: the form trDot, the two operator families, their spectral projectors, and the maximally entangled state.

The relabelling #

noncomputable def MIPRE.Weyl.binEquiv {F : Type u_1} [Field F] [Algebra (ZMod 2) F] {n : Type u_2} {ι : Type u_3} [Fintype ι] (b : Module.Basis ι (ZMod 2) F) :
(n → F) ≃ (n × ι → ZMod 2)

The coordinate relabelling F_q^n ≃ F_2^{n x k} attached to a basis b of F_q over F_2: send a to its matrix of coordinates.

Equations
Instances For
    @[simp]
    theorem MIPRE.Weyl.binEquiv_apply {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (a : n → F) (p : n × ι) :
    (binEquiv b) a p = (b.repr (a p.1)) p.2
    theorem MIPRE.Weyl.binEquiv_add {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (a a' : n → F) :
    (binEquiv b) (a + a') = (binEquiv b) a + (binEquiv b) a'
    theorem MIPRE.Weyl.binEquiv_injective {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} :
    theorem MIPRE.Weyl.binEquiv_eq_iff {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (a a' : n → F) :
    (binEquiv b) a = (binEquiv b) a' ↔ a = a'

    The form #

    theorem MIPRE.Weyl.trDot_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) (a a' : n → F) :
    trDot ((binEquiv b) a) ((binEquiv b) a') = trDot a a'

    Self-duality is exactly what makes the form transport.

    The operator families #

    Both are carried over by Matrix.submatrix along the relabelling --- which is conjugation by the permutation unitary the paper calls the isometry phi, written as a reindexing of rows and columns so that no unitary has to be constructed.

    theorem MIPRE.Weyl.wX_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (a : n → F) :
    (wX ((binEquiv b) a)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wX a

    The X-type family transports, and needs no self-duality: the relabelling is additive, which is all a shift knows about.

    theorem MIPRE.Weyl.wZ_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) (c : n → F) :
    (wZ ((binEquiv b) c)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wZ c

    The Z-type family transports, by self-duality of the basis.

    The spectral projectors #

    The Fourier average commutes with the relabelling: the index group is reindexed by it, the character is the transported form, and the normalization is the same cardinality counted on either side.

    theorem MIPRE.Weyl.card_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι (ZMod 2) F) :
    Fintype.card (n × ι → ZMod 2) = Fintype.card (n → F)
    theorem MIPRE.Weyl.proj_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) (w : (n × ι → ZMod 2) → Matrix (n × ι → ZMod 2) (n × ι → ZMod 2) ℂ) (e : n → F) :
    (proj w ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj (fun (a : n → F) => (w ((binEquiv b) a)).submatrix ⇑(binEquiv b) ⇑(binEquiv b)) e

    The Fourier average commutes with the relabelling, for an arbitrary family: no group law and no self-duality beyond the form's.

    theorem MIPRE.Weyl.proj_wZ_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) (e : n → F) :
    (proj wZ ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wZ e

    The Z-side projectors transport.

    theorem MIPRE.Weyl.proj_wX_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) (e : n → F) :
    (proj wX ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wX e

    The X-side projectors transport.

    The maximally entangled state #

    theorem MIPRE.Weyl.eprScale_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] (b : Module.Basis ι (ZMod 2) F) :
    theorem MIPRE.Weyl.epr_binEquiv {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (p : (n → F) × (n → F)) :
    epr ((binEquiv b) p.1, (binEquiv b) p.2) = epr p

    The maximally entangled state transports: phi ⊗ phi |EPR_q⟩^{⊗ n} = |EPR_2⟩^{⊗ nk}, in the relabelled form. Both sides are the normalized diagonal, and a relabelling of the index set preserves the diagonal; the two normalizations agree because the two index sets have the same cardinality.

    The five items together #

    theorem MIPRE.Weyl.pauli_binary {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] {n : Type u_2} [Fintype n] [DecidableEq n] {ι : Type u_3} [Fintype ι] [DecidableEq ι] {b : Module.Basis ι (ZMod 2) F} (hb : LowDegree.IsSelfDualBasis b) :
    (∀ (p : (n → F) × (n → F)), epr ((binEquiv b) p.1, (binEquiv b) p.2) = epr p) ∧ (∀ (a : n → F), (wX ((binEquiv b) a)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wX a) ∧ (∀ (c : n → F), (wZ ((binEquiv b) c)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wZ c) ∧ (∀ (e : n → F), (proj wX ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wX e) ∧ ∀ (e : n → F), (proj wZ ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wZ e

    lem:pauli-binary. Given a self-dual basis of F_q over F_2, the coordinate relabelling carries the whole Weyl system over F_q on n registers to the Weyl system over F_2 on n x k registers --- the maximally entangled state, both operator families, and both families of spectral projectors.

    The paper's phi is a genuine isometry (C^q)^{⊗ L} → (C^2)^{⊗ Lk} and the transported operator is phi^† (...) phi; here the isometry is a bijection of basis index sets, so conjugating by it is Matrix.submatrix, and no unitary has to be built.

    theorem MIPRE.Weyl.exists_binEquiv_pauli_binary {F : Type u_1} [Field F] [Fintype F] [DecidableEq F] [Algebra (ZMod 2) F] (hodd : Odd (Module.finrank (ZMod 2) F)) (n : Type u_4) [Fintype n] [DecidableEq n] :
    ∃ (k : ℕ) (b : Module.Basis (Fin k) (ZMod 2) F), LowDegree.IsSelfDualBasis b ∧ LowDegree.IsNormalBasis b ∧ (∀ (p : (n → F) × (n → F)), epr ((binEquiv b) p.1, (binEquiv b) p.2) = epr p) ∧ (∀ (a : n → F), (wX ((binEquiv b) a)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wX a) ∧ (∀ (c : n → F), (wZ ((binEquiv b) c)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = wZ c) ∧ (∀ (e : n → F), (proj wX ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wX e) ∧ ∀ (e : n → F), (proj wZ ((binEquiv b) e)).submatrix ⇑(binEquiv b) ⇑(binEquiv b) = proj wZ e

    The relabelling exists for every field of characteristic two and odd degree over F_2: lem:pauli-binary composed with the existence half of lem:self-dual-basis. The oddness is the hypothesis of exists_isSelfDualBasis_isNormalBasis, not of anything here; the paper's admissible field sizes satisfy it.

    The target system is qubits, register by register #

    The binary Weyl system is Weyl at F = F_2 and index set n x k, whose matrices are indexed by the functions n x k → F_2 --- that is, by the computational basis of (C^2)^{⊗ nk}. These three identities say that the operators are the tensor products of the single-qubit ones, in the only sense the one-matrix presentation can state it: entry by entry, as a product over the qubits. They are what makes "these are qubit Paulis" a checked statement rather than a reading of the encoding.

    theorem MIPRE.Weyl.trDot_two {m : Type u_4} [Fintype m] [DecidableEq m] (a c : m → ZMod 2) :
    trDot a c = ∑ p : m, a p * c p

    Over F_2 the form is the plain dot product: the field trace of a one-dimensional extension is the identity.

    theorem MIPRE.Weyl.sgn_trDot_two {m : Type u_4} [Fintype m] [DecidableEq m] (a c : m → ZMod 2) :
    sgn (trDot a c) = ∏ p : m, sgn (a p * c p)

    The character of the binary form factorizes over the qubits.

    theorem MIPRE.Weyl.wZ_two_diag {m : Type u_4} [Fintype m] [DecidableEq m] (c i : m → ZMod 2) :
    wZ c i i = ∏ p : m, sgn (c p * i p)

    The binary Z-type operator is the tensor product of single-qubit Zs: it is diagonal (wZ_apply) and its diagonal entries are products over the qubits.

    theorem MIPRE.Weyl.wX_two_apply {m : Type u_4} [Fintype m] [DecidableEq m] (a j i : m → ZMod 2) :
    wX a j i = ∏ p : m, if j p = i p + a p then 1 else 0

    The binary X-type operator is the tensor product of single-qubit Xs: every entry is the product of the single-qubit entries.