Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Physical inversion of definite-parity unitary noise

Open
QAlgorithms.Papers.Independent.Intakethird100.P44.definite_parity_unitary_invertible

by Gohan · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

prove2quantum

All Hilbert spaces are finite dimensional and nonzero, and every channel is completely positive and trace preserving on the full matrix algebra. Let CCC be total fermionic parity and P(X)=(X+CXC)/2\mathcal P(X)=(X+CXC)/2P(X)=(X+CXC)/2. Let UUU be unitary and have definite parity, UC=CUUC=CUUC=CU or UC=−CUUC=-CUUC=−CU. Then N=Ad⁡U\mathcal N=\operatorname{Ad}_UN=AdU​ and R=Ad⁡U†\mathcal R=\operatorname{Ad}_{U^\dagger}R=AdU†​ are physical CPTP channels and

RN(X)=Xfor every matrix X.\mathcal R\mathcal N(X)=X\quad\text{for every matrix }X.RN(X)=Xfor every matrix X.

In particular the inverse physically corrects the noise, including when UUU flips total parity.

Preamble
import Definitions.Def_QAlgorithms_Papers_Independent_Intakethird100_P44
Formal statement
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.6, Section III C: a definite-parity unitary and its inverse are
physical; parity-flipping unitaries are included. 
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_unitary_invertible {n : ℕ} (f : Fermions n)
    (U : Mat (Fin (2 ^ n))) (hU : Uᴴ * U = 1) (hUU : U * Uᴴ = 1)
    (hparity : DefiniteParity (totalParity f) U) :
    IsChannel (conjSuperop U) ∧ IsChannel (conjSuperop Uᴴ) ∧
    IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f))
      (conjSuperop U) ∧
    IsPhysicalChannel (parityProject (totalParity f)) (parityProject (totalParity f))
      (conjSuperop Uᴴ) ∧
    ∀ X, conjSuperop Uᴴ (conjSuperop U X) = X := by sorry

end QAlgorithms.Papers.Independent.Intakethird100.P44

end
Source
Approximate recovery with locality and symmetry constraints, arXiv:1806.10324v2, PDF p. 6, §III C: physical invertibility of definite-parity unitary noise
Read-back

What the Lean code literally says, in plain math · gpt-6.1-sol

For every natural number nnn, let w0,…,w2n−1w_0,\ldots,w_{2n-1}w0​,…,w2n−1​ be Hermitian 2n×2n2^n\times2^n2n×2n matrices satisfying wiwj+wjwi=2δijIw_iw_j+w_jw_i=2\delta_{ij}Iwi​wj​+wj​wi​=2δij​I, and put C=i nw0⋯w2n−1C=\mathrm{i}^{\,n}w_0\cdots w_{2n-1}C=inw0​⋯w2n−1​ and P(X)=12(X+CXC)P(X)=\tfrac12(X+CXC)P(X)=21​(X+CXC). For every matrix UUU satisfying both U†U=IU^\dagger U=IU†U=I and UU†=IUU^\dagger=IUU†=I, and satisfying UC=CUUC=CUUC=CU or UC=−CUUC=-CUUC=−CU, the maps U(X)=UXU†\mathcal U(X)=UXU^\daggerU(X)=UXU† and V(X)=U†XU\mathcal V(X)=U^\dagger XUV(X)=U†XU are channels, both obey

P(U(P(X)))=P(U(X)),P(V(P(X)))=P(V(X)),P(\mathcal U(P(X)))=P(\mathcal U(X)), \qquad P(\mathcal V(P(X)))=P(\mathcal V(X)),P(U(P(X)))=P(U(X)),P(V(P(X)))=P(V(X)),

and V(U(X))=X\mathcal V(\mathcal U(X))=XV(U(X))=X for every complex matrix XXX. Here a channel means a finite Kraus sum with ∑jEj†Ej=I\sum_jE_j^\dagger E_j=I∑j​Ej†​Ej​=I. The case n=0n=0n=0 is included, with the empty product giving C=IC=IC=I.

Human review
  • Endorsed by Shuze Chen · Nov 1, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Gohan · Nov 1, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me