Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV and §IV.A, p. 4 — U|0ⁿ⟩ is the unique stationary state of L_{H,c_k}, c_k = Uσ₋^{(k)}U†; for H = 0 it attracts every state and T_relax = 1/min_k g_k

Proved
DissipativePrep.Unique.unique_attractive_stationary

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

dissipative-state-preparationp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1relaxation-timeunique-stationary-state

Let n≥1n\ge 1n≥1, let UUU be a unitary on nnn qubits, ∣Ψ⟩=U∣0n⟩|\Psi\rangle = U|0^n\rangle∣Ψ⟩=U∣0n⟩, and ck=Uσ−(k)U†c_k = U\sigma_-^{(k)}U^\daggerck​=Uσ−(k)​U† for k=1,…,nk = 1,\dots,nk=1,…,n, where σ−(k)=1⊗⋯⊗∣0⟩k⟨1∣⊗⋯⊗1\sigma_-^{(k)} = \mathbb 1\otimes\dots\otimes|0\rangle_k\langle1|\otimes\dots\otimes\mathbb 1σ−(k)​=1⊗⋯⊗∣0⟩k​⟨1∣⊗⋯⊗1. Let g1,…,gn>0g_1,\dots,g_n>0g1​,…,gn​>0 and gmin⁡=min⁡kgkg_{\min} = \min_k g_kgmin​=mink​gk​. Then:

  1. Uniqueness. For every Hermitian HHH having ∣Ψ⟩|\Psi\rangle∣Ψ⟩ as an eigenvector (H∣Ψ⟩=E∣Ψ⟩H|\Psi\rangle = E|\Psi\rangleH∣Ψ⟩=E∣Ψ⟩, E∈RE\in\mathbb RE∈R), the only stationary state of LH,ck\mathcal L_{H,c_k}LH,ck​​ is ∣Ψ⟩⟨Ψ∣|\Psi\rangle\langle\Psi|∣Ψ⟩⟨Ψ∣: a density matrix ρ\rhoρ satisfies LH,ck(ρ)=0\mathcal L_{H,c_k}(\rho) = 0LH,ck​​(ρ)=0 if and only if ρ=∣Ψ⟩⟨Ψ∣\rho = |\Psi\rangle\langle\Psi|ρ=∣Ψ⟩⟨Ψ∣.
  2. Preparation. For the purely dissipative process (H=0H = 0H=0), every initial density matrix converges to the target:
etL{ck}(ρ)→t→∞∣Ψ⟩⟨Ψ∣for every density matrix ρ.e^{t\mathcal L_{\{c_k\}}}(\rho) \xrightarrow[t\to\infty]{} |\Psi\rangle\langle\Psi| \quad\text{for every density matrix } \rho.etL{ck​}​(ρ)t→∞​∣Ψ⟩⟨Ψ∣for every density matrix ρ.
  1. Relaxation time. For H=0H = 0H=0, the least value of −Re⁡μ-\operatorname{Re}\mu−Reμ over the nonzero eigenvalues μ\muμ of L{ck}\mathcal L_{\{c_k\}}L{ck​}​ is gmin⁡g_{\min}gmin​; equivalently the relaxation time is
Trelax=1min⁡kgk.T_{\mathrm{relax}} = \frac{1}{\min_k g_k}.Trelax​=mink​gk​1​.

Every pure state of nnn qubits is thus the unique and attractive stationary state of a dissipative process whose relaxation time does not depend on nnn.

Formalization Note Three hypotheses are added relative to the page: gk>0g_k>0gk​>0 (the page allows gℓ≥0g_\ell\ge 0gℓ​≥0; with gk=0g_k = 0gk​=0 uniqueness fails and Trelax=∞T_{\mathrm{relax}} = \inftyTrelax​=∞), n≥1n\ge 1n≥1 (for n=0n = 0n=0 there is no nonzero eigenvalue and min⁡kgk\min_k g_kmink​gk​ is undefined), and gmin⁡g_{\min}gmin​ is given as the least element of {g1,…,gn}\{g_1,\dots,g_n\}{g1​,…,gn​}. Convergence is in the entrywise topology on matrices; the semigroup is the matrix exponential of the Liouvillian.

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 unique_attractive_stationary {n : ℕ} (hn : 1 ≤ n)
    (U : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ) (hU : U ∈ Matrix.unitaryGroup (Fin (2 ^ n)) ℂ)
    (g : Fin n → ℝ) (hg : ∀ k, 0 < g k) (gmin : ℝ) (hgmin : IsLeast (Set.range g) gmin) :
    (∀ (H : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ) (hH : H.IsHermitian) (E : ℝ),
        act H (target U) = (E : ℂ) • target U →
        ∀ ρ, stationary (prepData U g H hH) ρ ↔ ρ = pureDensity (target U)) ∧
    attractive (prepData U g 0 Matrix.isHermitian_zero) (pureDensity (target U)) ∧
    IsLeast (relaxRates (gkslGenerator (prepData U g 0 Matrix.isHermitian_zero))) gmin ∧
    IsRelaxTime (gkslGenerator (prepData U g 0 Matrix.isHermitian_zero)) (1 / gmin) := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 4, §IV ("This immediately implies …") and §IV.A (Eq. (5); "We find T_relax = 1/min_k g_k"), with Eq. (1), p. 1
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