Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§IV.A, p. 4 — explicit tensor eigenbasis of L_{c_k} with eigenvalues −Σ_k m_k g_k, m_k ∈ {0,1,2}

Proved
DissipativePrep.Unique.product_spectrum

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, g1,…,gn>0g_1,\dots,g_n>0g1​,…,gn​>0, and let L=L{ck}\mathcal L = \mathcal L_{\{c_k\}}L=L{ck​}​ be 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​, acting on 2n×2n2^n\times 2^n2n×2n complex matrices. Then

  1. the eigenvalues of L\mathcal LL are exactly the numbers
λi1,…,in=∑kλik=−∑k=1nmk gk,mk∈{0,1,2},\lambda_{i_1,\dots,i_n} = \sum_k \lambda_{i_k} = -\sum_{k=1}^n m_k\,g_k,\qquad m_k\in\{0,1,2\},λi1​,…,in​​=k∑​λik​​=−k=1∑n​mk​gk​,mk​∈{0,1,2},

where mk=0,1,2m_k = 0,1,2mk​=0,1,2 corresponds to λ0=0\lambda_0 = 0λ0​=0, λ1=λ2=−gk\lambda_1 = \lambda_2 = -g_kλ1​=λ2​=−gk​, λ3=−2gk\lambda_3 = -2g_kλ3​=−2gk​; 2. the explicit operators U(σi1(1)⊗⋯⊗σin(n))U†U(\sigma_{i_1}^{(1)}\otimes\cdots\otimes\sigma_{i_n}^{(n)})U^\daggerU(σi1​(1)​⊗⋯⊗σin​(n)​)U†, with ik∈{0,1,2,3}i_k\in\{0,1,2,3\}ik​∈{0,1,2,3}, form a basis, and each has eigenvalue ∑kλik\sum_k\lambda_{i_k}∑k​λik​​.

This is the complete solution of the master equation ρ˙=L(ρ)\dot\rho = \mathcal L(\rho)ρ˙​=L(ρ) for the constructed process, from which convergence and the relaxation time are read off.

Formalization Note The tensor product is given entrywise on Boolean bit strings and transported to {0,…,2n−1}\{0,\dots,2^n-1\}{0,…,2n−1}. The statement records the eigen-equation for every indexed tensor product, their linear independence and span, and the exact eigenvalue set. Rates gk>0g_k>0gk​>0 are assumed.

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 product_spectrum {n : ℕ} (U : Matrix (Fin (2 ^ n)) (Fin (2 ^ n)) ℂ)
    (hU : U ∈ Matrix.unitaryGroup (Fin (2 ^ n)) ℂ) (g : Fin n → ℝ) (hg : ∀ k, 0 < g k) :
    let G := gkslGenerator (prepData U g 0 Matrix.isHermitian_zero)
    let σ := fun i : Fin n → Fin 4 => U * tensorEigenoperator i * Uᴴ
    (∀ i, G (σ i) = (∑ k, localEigenvalue (g k) (i k)) • σ i) ∧
    LinearIndependent ℂ σ ∧
    Submodule.span ℂ (Set.range σ) = ⊤ ∧
    (∀ μ : ℂ, G.HasEigenvalue μ ↔
      ∃ m : Fin n → Fin 3, μ = -(∑ k, ((m k : ℕ) : ℂ) * (g k : ℂ))) := by sorry

end DissipativePrep.Unique
Source
Kraus et al., Preparation of entangled states by quantum Markov processes, arXiv:0803.1463v3, p. 4, §IV.A ("Thus, a basis of the eigenvectors of the total Liouvillian …")
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