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 , rate , and finite time . Its code is the span of the orthonormal vectors ; the orthogonal decay space is the span of . Put . For define
Then . Projecting onto the code and decay spaces, leaving the code branch unchanged and applying to the decay branch gives a decoder whose conditional decay coherence multiplier is . Here a coherence multiplier is the factor applied to the 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
For fixed and , as , , where denotes a quantity bounded in magnitude by a constant times for sufficiently small positive . If , the decay branch has zero probability, no conditional or is needed, and the optimal fidelity is ; the same short-time formula holds identically when .
Statement references
Four-level spontaneous-decay model
Exact four-level Kraus operators
Conditional decoded state and decay coherence
Explicit four-level transpose decoder
Decay Kraus weights and photon overlap
Qubit coherence channels and fidelity functionals
Recovery optimization on orthogonal flagged branches
Finite operator and ket conventions
Entanglement fidelity on a finite logical space
Facts & Assumptions
The model postulates a finite-dimensional channel with code and decay spaces as stated, rate , and real . Four-level spontaneous-decay model
On code inputs, the channel has a null branch of fixed weight supported on the code and a decay branch of fixed weight supported on the orthogonal decay space. For , identifying the latter with the logical basis gives the coherence channel : diagonal entries are unchanged and the entry is multiplied by . The null branch is the identity after this identification. Exact four-level Kraus operators Conditional decoded state and decay coherence
For , , , and the displayed cancels the phase of the decay coherence. At the null branch alone is present. Explicit four-level transpose decoder
For a qubit channel , unitary , and , the maximally mixed-input entanglement fidelities satisfy . Here . Pauli-complementary qubit recovery fidelity inequality
The coherence channel has for , and its composition and fixed-weight branch averages act as stated by the coherence-channel interface. Qubit coherence channels and fidelity functionals
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
For fixed , the fraction is as . Decay Kraus weights and photon overlap
Bras, kets, outer products, conjugate-transpose adjoints and rectangular matrix products use the finite ordered-orthonormal-basis conventions. Finite operator and ket conventions
For a qubit channel , entanglement fidelity at is , where . This overlap is linear in the channel and belongs to for channels. Entanglement fidelity on a finite logical space
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
For finite-dimensional complex inner-product spaces , a quantum channel is a complex-linear, completely positive, trace-preserving map . 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 .
Goal: Establish the phase-corrected decoder's fidelity, its maximum over all decoders, and the short-time and zero-decay cases.
Suppose . Put and . Entrywise, the conditional decay channel in [F2] is , where . Indeed, the two conjugations preserve diagonal entries and multiply the entry by and , respectively. These weights are nonnegative and sum to one by [F3].
For any channel decoding the decay block after its identification with the logical qubit, set and . Both are nonnegative, and [F4] gives . Linearity of the fidelity overlap gives , since . The phase correction realizes after block identification, so it changes the multiplier to and achieves by [F5].
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 , attained by projection followed by the identity on the null block and on the decay block. This also establishes the stated conditional coherence multiplier.
For fixed , apply [F10] to the scalar matrix with to obtain as . Multiplying this by the expansion in [F7] using the remainder control in [F10] gives . If , [F2] and [F3] give only the identity null branch; decoding it attains fidelity one, which is maximal for a channel fidelity. For this holds at every finite time, giving the stated zero coefficient.
Depends on
- Four-level spontaneous-decay model
- Exact four-level Kraus operators
- Conditional decoded state and decay coherence
- Explicit four-level transpose decoder
- Decay Kraus weights and photon overlap
- Pauli-complementary qubit recovery fidelity inequality
- Qubit coherence channels and fidelity functionals
- Recovery optimization on orthogonal flagged branches
- Finite operator and ket conventions
- Entanglement fidelity on a finite logical space
- Finite exponential and smooth quotient remainder control
- Finite-dimensional quantum channel
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. 9, paragraph following Eq. (S1.9)