Definite-parity Kraus representation
OpenQAlgorithms.Papers.Independent.Intakethird100.P44.definite_parity_krausAll Hilbert spaces are finite dimensional and nonzero, and every channel is completely positive and trace preserving on the full matrix algebra. Let be total parity for a finite spinless-fermion Fock space, and put . A channel is physical if . A Kraus operator has definite parity when it commutes or anticommutes with . Then
The projected channel has the same physical-observable action. Both parity-preserving and parity-flipping Kraus operators are allowed.
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P44
noncomputable section
namespace QAlgorithms.Papers.Independent.Intakethird100.P44
open scoped Matrix ComplexConjugate ComplexOrder
open QAlgorithms.Papers.Independent.Information100.P60 (Mat)
open QAlgorithms.Papers.Independent.Information100.P67 (mapFirst)
open QAlgorithms.Papers.Independent.Claimed50.P48 (operatorTraceDual)
open QAlgorithms.Papers.Independent.Renew46.P43 (purification)
variable {H K L J E F B : Type*}
variable [Fintype H] [DecidableEq H] [Fintype K] [DecidableEq K]
variable [Fintype L] [DecidableEq L] [Fintype J] [DecidableEq J]
variable [Fintype E] [DecidableEq E] [Fintype F] [DecidableEq F]
variable [Fintype B] [DecidableEq B]
/-- PDF p.3, Proposition 1. The converse represents the PHYSICALLY
EQUIVALENT projected channel QN, not necessarily N on forbidden coherences.
Parity correction, PDF p.2 Eq.(1): printed i^(|omega|-1) for Majorana labels;
changed to i^m on 2m ordered modes. Why: the printed four-mode value is
anti-Hermitian with square -I, whereas the source requires parity sectors of
a Hermitian involution. Only this normalization (up to sign) is corrected. -/
theorem definite_parity_kraus {n : ℕ} (f : Fermions n)
(N : Superop (Fin (2 ^ n)) (Fin (2 ^ n))) (hN : IsChannel N) :
((∃ (m : ℕ) (A : Fin m → Mat (Fin (2 ^ n))), IsKrausFamily A ∧
N = krausApply A ∧ ∀ j, DefiniteParity (totalParity f) (A j)) →
IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f)) N) ∧
(IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f)) N →
∃ (m : ℕ) (A : Fin m → Mat (Fin (2 ^ n))), IsKrausFamily A ∧
parityProject (totalParity f) ∘ N = krausApply A ∧
∀ j, DefiniteParity (totalParity f) (A j)) := by sorry
end QAlgorithms.Papers.Independent.Intakethird100.P44
end
Read-back
What the Lean code literally says, in plain math · gpt-6.1-sol
For every natural number , let be Hermitian matrices on satisfying , put , and define . Let be a channel on this space, meaning that it has a finite Kraus representation with . The theorem asserts two implications: if there exist and matrices with that normalization, for every , and each or , then for every matrix ; conversely, if this last identity holds for every , then there exist and normalized Kraus matrices of definite parity representing :
The case is included, with , the identity map, and every matrix commuting with .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.