Alphabeta Math
Thought experimentStatement: 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.

Checking-time comparison under the Jm lift

PDF p. 4: Fig. 3 and code-comparison paragraph

Statement

Consider the following idealized comparison. Take a finite angular-momentum emitter with spin blocks J=0,1,…,5, magnetic labels m=−J,…,J, common instantaneous downward rate γ>0 for each state with J≥1, and rigid-rotor energy factors J(J+1). Add the modeled energy lift ΔJm, with Δ≥0. Use the downward-jump and other physical, spectral and choice hypotheses of the equal-rate model. Adopt the finite lifted-model postulate with Δ(J,m)=ΔJm: its same three benchmark downward jump matrices and rate parameter are retained after adding the lift. This continuation is a separate physical assumption, not a deduction from the energy shifts. Compare the four specified two-dimensional encodings: the minimal code in J=1, detection code in J=2, Aydin–Barg code in J=4, and absorption–emission (Æ) code in J=5.

For each code and elapsed time, apply the modeled noise and its code-dependent transpose recovery. Its checking time is τ=inf⁡{t≥0:Ftr(t)<0.9999}, with τ=+∞ if the set is empty. Here Ftr is the entanglement fidelity at the maximally mixed logical input; the transpose recovery is constructed from the channel and code at that time. A larger checking time means a later first threshold crossing in this definition, not by itself a repeated-cycle guarantee.

The article reports the following numerical results for this benchmark. At small lift, the checking times saturate at code-dependent values ordered τminimal⋆<τdetection⋆<τAydin–Barg⋆<τÆ⋆. For the compared codes retaining part of the encoded information after a decay, checking time decreases as distinguishability increases; the minimal code's checking time is independent of the lift. The Æ curve is reported highest up to approximately Δ/γ=50; above that the two rank-one-correcting curves nearly coincide, with Aydin–Barg marginally ahead. Rank one here describes the angular-momentum transition family, not matrix rank. These statements are attributed numerical predictions, not independently established inequalities or measured outcomes.

Facts & Assumptions

[F1]

For a finite isometric code and channel, the support-completed transpose recovery has entanglement fidelity dL−2∥Tr⁡LM∥F2, where M is the code-and-Kraus Gram matrix and dL is the logical dimension. This includes singular matrices. Transpose fidelity from the QEC matrix

[F2]

The checking-time interface takes the infimum of the strict sub-target fidelity set, with the empty-set convention stated above; it does not assume monotonicity or a repeated-cycle bound. Operational checking time

[F3]

The benchmark assigns ηJ=J(J+1) and the stated jump coefficients; its common instantaneous downward rate γ is supplied by the uniform-decay result. The separate lift adds ΔJm to the energy. The general-lift postulate with Δ(J,m)=ΔJm retains the same three jumps after lifting, so the rate identity still applies. The coefficients, lift and fixed-jump continuation are assumptions; the rate identity is a conditional deduction. Equal-rate rigid-rotor benchmark parameters Phenomenological angular-momentum degeneracy lift General bounded diagonal lift for fast-checking analysis Normalized jumps give a scalar total decay operator

[F4]

The four named suppliers specify isometric encodings in the respective spin blocks. The Æ and Aydin–Barg suppliers state their correction properties for their specified coherent rank-one error spans. Minimal single-manifold encoding J equals two detection encoding J equals five absorption-emission code J equals four Aydin–Barg encoding

[F5]

The numerical-method interface constructs the finite channel by exponentiating its generator, extracts a Kraus family from its Choi matrix and evaluates the fidelity formula. Approximate implementation and threshold crossing require a separate error assessment. Lindbladian exponentiation and Choi Kraus extraction

[A1]

Assume the physical, spectral and finite-emitter hypotheses of [F3], including the downward-jump model. Adopt the Axiom of Choice, Countable Choice and Dependent Choice carried by those model interfaces. The Axiom of Choice The Axiom of Countable Choice (AC_ω) The axiom of dependent choice: a relation in which every element is related to something admits an ℕ-indexed chain

Proof

Given: The benchmark assumptions, the four encodings and the checking-time convention in the statement.

Goal: Specify the conditional calculation and the interpretation of its reported output.

1.1givenA1F1F3F4F5

Under [A1], [F3] fixes the model parameters, lift and retained jump matrices and supplies the common-rate identity; [F4] supplies the four isometries. For each code and time, [F5] specifies a channel and a Kraus family. Applying [F1] with logical dimension two gives the corresponding transpose-recovery fidelity. This is a conditional calculation for the stated model.

2.1givenF2F5step 1.1∎

Applying the strict first-crossing definition [F2] to each resulting fidelity curve defines the four checking times, including the empty-set case. If a numerical implementation resolves the crossings and comparison differences to sufficient accuracy, its output can be compared as described in the statement. The article reports the stated ordering, trends and crossover; the calculation specified here does not itself establish their numerical accuracy. Thus the reported curves are predictions conditional on the model and computation, and the checking-time definition alone supplies no repeated-cycle performance guarantee.

Remarks

The article reports direct exponentiation of the full Lindbladian and extraction of Kraus operators from the resulting Choi matrix. No solver version, precision, crossing search, certified error bounds or independent numerical replay is supplied here. In particular, a nearly coincident pair of curves cannot be ordered reliably from this item alone. Real species may have rates that depend on J, so the equal-rate benchmark does not by itself determine their code ordering.

Depends on

Used by · 3

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