Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Exact four-level Kraus operators

PDF p. 6: Eqs. (12)–(14), continued on p. 7; PDF p. 7: Definitions following Eq. (14)

Statement

Assume the four-level model of Four-level spontaneous-decay model, with t≥0, γ≥0 and real ω0,Δ. For a set X of basis labels put ΠX=∑i∈X∣i⟩⟨i∣; write Π01 for X={0,1} and Πj for X={j}. Put Ω=γ+iΔ. When γ>0 and t>0, define f±(t)=γ∣eΩt−1∣/∣Ω∣±(eγt−1) and u(t)=∣Ω(etΩ∗−1)∣/[Ω(etΩ∗−1)]. Then the channel on the entire four-dimensional operator space has Kraus representation Nt(X)=∑j=13KjXKj†, where

K1=e−iω0te−γt/2+iΔtΠ01+eiΔtΠ2+Π3,

K2=e−γt/2f+(t)/2 [u(t)∣2⟩⟨0∣+∣3⟩⟨1∣],

K3=e−γt/2−f−(t)/2 [−u(t)∣2⟩⟨0∣+∣3⟩⟨1∣].

The square roots are real and nonnegative. At t=0 or γ=0, use K2=K3=0 and the displayed K1; this also specifies the channel when the printed phase or Ω is undefined. In particular, for Δ=0 the representation reduces to K1=e−iω0te−γt/2Π01+Π2+Π3, K2=1−e−γt(∣2⟩⟨0∣+∣3⟩⟨1∣) and K3=0.

Facts & Assumptions

Given: The postulated model and parameters in the Statement.

Goal: Derive the displayed representation for every input operator, including the stated endpoints.

[F1]

The model has H=ω0Π01+ΔΠ3, L=γ(∣2⟩⟨0∣+∣3⟩⟨1∣), and generator L(X)=−i[H,X]+LXL†−{L†L,X}/2. Four-level spontaneous-decay model

[F2]

The ordered orthonormal basis, adjoints, and outer products obey the finite operator conventions. Finite operator and ket conventions

[F3]

For the finite GKSL generator, the channel has the convergent ordered-jump expansion with no-jump amplitude E(t)=et(−iH−L†L/2) and one-jump amplitude E(t−s)LE(s). Finite no-jump and ordered-jump expansion

[F4]

A two-path branch with coefficient matrix p(1χχ‾1), where p≥0 and ∣χ∣≤1, has the orthogonal Kraus decomposition obtained from its two eigenvectors. Two-path coherence Gram spectrum and Kraus weights

Proof

1.1givenF1F2F3algebra

By [F1] and [F2], L†L=γΠ01 and E(s)=e(−iω0−γ/2)sΠ01+Π2+e−iΔsΠ3. Since L maps the excited span into the decay span and annihilates the latter, LE(r)L=0 for every r≥0. Thus all terms with two or more jumps vanish in [F3]. Moreover K1=eiΔtE(t), so its individual phase does not change the no-jump map.

2.1givenF2F3step 1.1algebra

Set F0=∣2⟩⟨0∣ and F1=∣3⟩⟨1∣. The one-jump amplitude is γe(−iω0−γ/2)s[F0+e−iΔ(t−s)F1]. Hence its integral acts on every four-level operator as p(F0XF0†+F1XF1†)+cF0XF1†+c‾F1XF0†, with p=1−e−γt and c=γ∫0te−γseiΔ(t−s) ds. This form includes inputs with coherences outside the excited span: both path operators annihilate the decay span. The triangle inequality gives ∣c∣≤p.

3.1givenF4step 2.1algebra

For γ>0 and t>0, p>0, Ω≠0, and integration gives c=γ(eiΔt−e−γt)/Ω. Its numerator is nonzero because e−γt<1. The displayed u is c/∣c∣: indeed c=γe−γt(eΩt−1)/Ω, and Ω(eΩ∗t−1) is the complex conjugate of Ω∗(eΩt−1). Also e−γtf+=∣c∣+p and −e−γtf−=p−∣c∣. Applying [F4] with χ=c/p, then multiplying the minus eigenoperator by the harmless phase −1, gives exactly K2,K3. The bound ∣c∣≤p makes both square roots nonnegative.

4.1givenF3step 1.1step 2.1step 3.1algebra∎

If t=0 or γ=0, the one-jump amplitude in step 2.1 vanishes and the stated zero operators together with K1 give the channel. If Δ=0 and γt>0, then c=p, u=1, f−=0 and e−γtf+/2=p, giving the stated amplitude-damping form. The same form follows at the zero-decay endpoints. Combining these cases with steps 1.1, 2.1 and 3.1 proves the representation on the full operator space.

Depends on

Used by · 8

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources