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.
Conditional decoded state and decay coherence
PDF p. 8: Eqs. (S1.2)–(S1.3)
Statement
Assume the four-level model with real , rate , and time . Let be a normalized code state, so . Apply the four-level syndrome recovery to its evolved density operator, retaining the null or decay outcome. For , the outcome probabilities are and . The normalized null output is . The normalized decay output, expressed in the recovered code basis , is
where
Here h.c. denotes the Hermitian conjugate of the preceding off-diagonal term. At the decay outcome has zero probability, so no conditional decay state is assigned.
Facts & Assumptions
The postulated model has the ordered orthonormal basis , code span , decay span , real , and . Its evolution is the specified finite GKSL channel. Four-level spontaneous-decay model
For the normalized initial code state, the evolved operator is , where when and at . Exact state evolution from a four-level codeword
The recovery's null branch is and its decay branch is , where and . Four-level syndrome recovery
Bras, adjoints and outer products act by the stated finite orthonormal-basis conventions. Finite operator and ket conventions
An instrument outcome's probability is the trace of its unnormalized output; its conditional state is that output divided by its probability when positive, and no conditional state is assigned at zero probability. Finite instruments and conditional states
Proof
Given: The model, normalized initial code state, time, and recovery in the statement.
Goal: Compute both outcome probabilities and the positive-probability conditional outputs, including the zero-decay-probability boundary.
The code and decay spans in [F1] are orthogonal. Applying the null operation in [F3] to [F2] therefore gives . Its trace is because is normalized. This number is positive for finite , so [F5] gives the original state as the conditional null output.
The operator annihilates the code basis vectors and maps to and to . Applying it on both sides of [F2] yields the unnormalized decay output . Its trace is , since the off-diagonal terms have zero trace and .
If , then and , so . Divide the output from step 1.2 by its trace and substitute the expression for in [F2]. This gives the displayed and . If , the decay probability in step 1.2 is zero, and [F5] assigns no conditional decay state. Thus all asserted branch probabilities and conditional outputs follow.
Depends on
Used by · 11
- Branch-averaged decoded state fidelity
- Cubic short-time loss and recoverable limits
- Decay Kraus weights and photon overlap
- Exact four-level transpose fidelity
- Cubic transpose-fidelity loss
- Long-time four-level transpose plateau
- Four-level fidelity measures for the unrotated decoder
- Explicit four-level transpose decoder
- Optimal phase-corrected four-level recovery
- Transient later-time advantage of the unrotated decoder
- Gradual which-path leakage and inverse splitting timescale
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
- Monolithic Quantum Error Correction in the Presence of Distinguishability · PDF p. 8, Eqs. (S1.2)–(S1.3)