Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV.A, p. 4 — L_{Uσ₋U†}(σ) = U L_{σ₋}(U†σU) U†, and the eigen-equations correspond

Proved
DissipativePrep.Unique.unitary_covariance

by mikedeng1 · Oct 21, 2026 · Mathlib 0df444a (Lean v4.33.1)

dissipative-state-preparationliouvillian-spectrump2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let UUU be a unitary on nnn qubits and g1,…,gn>0g_1,\dots,g_n>0g1​,…,gn​>0. Write L{ck}\mathcal L_{\{c_k\}}L{ck​}​ for the purely dissipative Liouvillian of Eq. (2) with jump operators ck=Uσ−(k)U†c_k = U\sigma_-^{(k)}U^\daggerck​=Uσ−(k)​U† and rates gkg_kgk​, and L{σ−(k)}\mathcal L_{\{\sigma_-^{(k)}\}}L{σ−(k)​}​ for the one with jump operators σ−(k)\sigma_-^{(k)}σ−(k)​ and the same rates. Then for every operator σ\sigmaσ

L{Uσ−(k)U†}(σ)=U L{σ−(k)}(U†σU) U†,\mathcal L_{\{U\sigma_-^{(k)}U^\dagger\}}(\sigma) = U\,\mathcal L_{\{\sigma_-^{(k)}\}}(U^\dagger\sigma U)\,U^\dagger,L{Uσ−(k)​U†}​(σ)=UL{σ−(k)​}​(U†σU)U†,

and consequently, for every λ∈C\lambda\in\mathbb Cλ∈C,

L{Uσ−(k)U†}(σ)=λσ  ⟺  L{σ−(k)}(U†σU)=λ U†σU.\mathcal L_{\{U\sigma_-^{(k)}U^\dagger\}}(\sigma) = \lambda\sigma \iff \mathcal L_{\{\sigma_-^{(k)}\}}(U^\dagger\sigma U) = \lambda\,U^\dagger\sigma U.L{Uσ−(k)​U†}​(σ)=λσ⟺L{σ−(k)​}​(U†σU)=λU†σU.

This reduces the spectral analysis of the process for an arbitrary target state to the case U=1U = \mathbb 1U=1.

Formalization Note "Purely dissipative" means H=0H = 0H=0. Rates gk>0g_k>0gk​>0 are assumed throughout the mission.

Preamble
import Mathlib
import Definitions.Def_DissipativePrep_Unique_Model

open scoped Matrix ComplexConjugate
open QAlgorithms QAlgorithms.Papers.Independent.Dependency50.P16
Formal statement
namespace DissipativePrep.Unique

theorem unitary_covariance {n : ℕ} (U : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ)
    (hU : U ∈ Matrix.unitaryGroup (Fin (2 ^ n)) ℂ) (g : Fin n → ℝ) (hg : ∀ k, 0 < g k) :
    (∀ σ : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ,
      gkslGenerator (prepData U g 0 Matrix.isHermitian_zero) σ =
        U * gkslGenerator (prepData 1 g 0 Matrix.isHermitian_zero) (Uᴴ * σ * U) * Uᴴ) ∧
    ∀ (σ : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ) (μ : ℂ),
      gkslGenerator (prepData U g 0 Matrix.isHermitian_zero) σ = μ • σ ↔
        gkslGenerator (prepData 1 g 0 Matrix.isHermitian_zero) (Uᴴ * σ * U) = μ • (Uᴴ * σ * U) := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 4, §IV.A
Human review
  • Endorsed by Shuze Chen · Oct 21, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 21, 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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me