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.

Optimal phase-corrected four-level recovery

PDF p. 9: Paragraph following Eq. (S1.9)

Statement

Assume the postulated four-level model, with real ω0,Δ, rate γ≥0, and finite time t≥0. Its code is the span of the orthonormal vectors ∣0⟩,∣1⟩; the orthogonal decay space is the span of ∣2⟩,∣3⟩. Put p=1−e−γt. For p>0 define

χ=γ(eiΔt−e−γt)(γ+iΔ)p,r=∣χ∣,z=χ/r.

Then 0<r≤1. Projecting onto the code and decay spaces, leaving the code branch unchanged and applying D+=z‾∣0⟩⟨2∣+∣1⟩⟨3∣ to the decay branch gives a decoder whose conditional decay coherence multiplier is r. Here a coherence multiplier is the factor applied to the 01 matrix entry in the decoded logical basis. Among all quantum-channel decoders from the four-level output to the logical qubit, this decoder maximizes entanglement fidelity at the maximally mixed logical input, and

Fopt=1−p2(1−r).

For fixed γ>0 and Δ, as t↓0, 1−Fopt=γΔ2t3/48+O(t4), where O(t4) denotes a quantity bounded in magnitude by a constant times t4 for sufficiently small positive t. If p=0, the decay branch has zero probability, no conditional χ or D+ is needed, and the optimal fidelity is 1; the same short-time formula holds identically when γ=0.

Facts & Assumptions

[F1]

The model postulates a finite-dimensional channel with code and decay spaces as stated, rate γ≥0, and real ω0,Δ. Four-level spontaneous-decay model

[F2]

On code inputs, the channel has a null branch of fixed weight 1−p supported on the code and a decay branch of fixed weight p supported on the orthogonal decay space. For p>0, identifying the latter with the logical basis gives the coherence channel Dχ: diagonal entries are unchanged and the 01 entry is multiplied by χ. The null branch is the identity after this identification. Exact four-level Kraus operators Conditional decoded state and decay coherence

[F3]

For p>0, χ≠0, r≤1, and the displayed D+ cancels the phase of the decay coherence. At p=0 the null branch alone is present. Explicit four-level transpose decoder

[F4]

For a qubit channel R, unitary U, and Z=diag⁡(1,−1), the maximally mixed-input entanglement fidelities satisfy Fe(R∘Ad⁡U)+Fe(R∘Ad⁡ZU)≤1. Here Ad⁡U(X)=UXU†. Pauli-complementary qubit recovery fidelity inequality

[F5]

The coherence channel Dλ has Fe=(1+Re⁡λ)/2 for ∣λ∣≤1, and its composition and fixed-weight branch averages act as stated by the coherence-channel interface. Qubit coherence channels and fidelity functionals

[F6]

For fixed input-independent weights on orthogonal output blocks, the maximum decoder fidelity equals the weighted sum of the separate branch maxima, and a project-then-decode channel attains it. Recovery optimization on orthogonal flagged branches

[F7]

For fixed γ>0,Δ, the fraction (1−r)/2 is Δ2t2/48+O(t3) as t↓0. Decay Kraus weights and photon overlap

[F8]

Bras, kets, outer products, conjugate-transpose adjoints and rectangular matrix products use the finite ordered-orthonormal-basis conventions. Finite operator and ket conventions

[F9]

For a qubit channel E, entanglement fidelity at I/2 is Fe(E)=⟨Φ2∣(id⊗E)(∣Φ2⟩⟨Φ2∣)∣Φ2⟩, where ∣Φ2⟩=(∣00⟩+∣11⟩)/2. This overlap is linear in the channel and belongs to [0,1] for channels. Entanglement fidelity on a finite logical space

[F10]

At fixed scalar parameters, the exponential series has a controlled Taylor remainder, and multiplication of scalar expansions has the controlled remainder obtained by truncating their polynomial product. Finite exponential and smooth quotient remainder control

[F11]

For finite-dimensional complex inner-product spaces H,K, a quantum channel is a complex-linear, completely positive, trace-preserving map Φ:L(H)→L(K). Trace preservation is required on every input operator. Finite-dimensional quantum channel

Proof

Given: The model and parameters in the Statement; for the positive-decay case use the displayed definitions of p,χ,r,z.

Goal: Establish the phase-corrected decoder's fidelity, its maximum over all decoders, and the short-time and zero-decay cases.

1.1givenF2F3F8algebra

Suppose p>0. Put Z=diag⁡(1,−1) and U=diag⁡(1,z‾). Entrywise, the conditional decay channel in [F2] is Dχ=q+Ad⁡U+q−Ad⁡ZU, where q±=(1±r)/2. Indeed, the two conjugations preserve diagonal entries and multiply the 01 entry by z and −z, respectively. These weights are nonnegative and sum to one by [F3].

2.1F3F4F5F8F9F11step 1.1algebra

For any channel R decoding the decay block after its identification with the logical qubit, set a=Fe(R∘Ad⁡U) and b=Fe(R∘Ad⁡ZU). Both are nonnegative, and [F4] gives a+b≤1. Linearity of the fidelity overlap gives Fe(R∘Dχ)=q+a+q−b≤q+, since q+≥q−. The phase correction D+ realizes Ad⁡U† after block identification, so it changes the multiplier χ to r and achieves Fe(Dr)=(1+r)/2=q+ by [F5].

3.1F2F3F5F6F9F11step 2.1algebra

The null block has maximum fidelity one, attained by the identity. The weights in [F2] are independent of the input, so [F6] applies to all four-level-to-logical channel decoders, including those that do not initially measure the blocks. Its maximum is (1−p)+p(1+r)/2=1−p(1−r)/2, attained by projection followed by the identity on the null block and D+ on the decay block. This also establishes the stated conditional coherence multiplier.

4.1givenF2F3F7F9F10step 3.1algebra∎

For fixed γ>0, apply [F10] to the scalar matrix A=(−γ) with n=1 to obtain p=γt+O(t2) as t↓0. Multiplying this by the expansion in [F7] using the remainder control in [F10] gives 1−Fopt=γΔ2t3/48+O(t4). If p=0, [F2] and [F3] give only the identity null branch; decoding it attains fidelity one, which is maximal for a channel fidelity. For γ=0 this holds at every finite time, giving the stated zero coefficient.

Depends on

Used by · 1

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