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.
Jump histories, distinguishability, and limits of Kraus rank
PDF p. 4: Second and third paragraphs
Remark
In the article's equal-rate model, successive decays have different jump-time profiles. The article associates these profiles with effective-rank growth to twelve even at zero lift. It interprets the additional growth with nonzero lift as arising from different phases accumulated by histories with different jump times, polarizations and source states. It reports that formerly grouped components gain appreciable weight along independent Choi directions sooner for larger lift. This last timing comparison is the article's interpretation of its thresholded model curves; it is not a proved monotonic law for arbitrary channels or arbitrary thresholds.
A history here means a term labeled by ordered jump times and jump-operator indices in the finite channel expansion. A source state is an input basis state, and polarization is the physical label on a modeled jump operator. A Choi direction is an eigenvector of the channel's positive Choi matrix; its weight is the corresponding unnormalized eigenvalue. Exact Kraus rank counts all positive weights, whereas effective rank at threshold counts only weights strictly above that value. The latter depends on the normalization and threshold.
Rank alone is not a recovery-performance metric. It counts independent channel components, and the complementary record describes information available to an environment in a chosen dilation. To specify performance, let be a finite-dimensional code isometry, let be the noise channel, and let be a completely positive, trace-preserving decoded recovery. Here denotes the endomorphisms of . Put and . On use maximally-mixed-input entanglement fidelity , where . For a fixed encoding, write , with the supremum over all such decoders.
Rank alone determines neither the fidelity for a specified recovery nor this optimized fidelity. On the full qubit code with identity recovery, the identity and Pauli- channels both have exact rank one but have entanglement fidelities one and zero. Even after optimizing recovery, qubit bit-flip channels of probability all have rank two and have . The examples below also show that increasing rank in a comparison of channels can accompany either higher or lower fidelity, including optimized fidelity. These are comparisons of channels, not a monotonicity assertion along the emitter dynamics. More distinguishable components can make a particular code harder to recover, as the article's model interpretation proposes, but rank alone does not prove such degradation. At complete decay the limiting source-to-ground representation has nine operators under the additional hypotheses stated below; this limiting rank need not equal the rank at any finite time.
Facts & Assumptions
In the finite emitter model the lift adds ; transition-energy shifts depend on source labels, but this assumption alone does not specify a complete environmental record. Phenomenological angular-momentum degeneracy lift
In the equal-rate benchmark with , real and the stated fixed-jump continuation after lifting, exact rank is twelve for and eighteen for at every finite . The thresholded curves are separately reported model predictions. Exact and thresholded Kraus ranks for J at most two
With the finite-emitter and vacuum hypotheses, block-preserving Hamiltonian, lowering jumps and a strictly positive excited-block exit-rate bound, the channel converges to ground replacement, whose canonical source-resolving representation has nine operators. Long-time atomic channel and source-resolving Kraus operators
A finite Kraus family defines a complementary record with entries ; logical-state independence concerns the entire record, including off-diagonal entries. Complementary error records in a Kraus basis
A finite GKSL channel has an absolutely convergent expansion over ordered jump times and jump indices, with no-jump amplitude and single-jump amplitude . Finite no-jump and ordered-jump expansion
If a branch is actually an average of diagonal phase actions with a common probability measure, its relative-coherence multipliers form a positive Gram matrix. This averaging form is an additional hypothesis, not a consequence of an energy shift alone. Conditional jump-time phases form a positive Gram matrix
Exact rank counts positive Choi eigenvalues; a strict threshold count omits positive weights at or below the specified threshold and changes units when the Choi normalization changes. Exact versus thresholded Kraus rank protocol
For a finite code isometry and decoded recovery channel , the decoded logical channel is . Channels are complex-linear, completely positive and trace-preserving. Code restriction and decoded channel types
For a channel on , maximally-mixed-input entanglement fidelity is the overlap of with the density operator and lies in . The tensor map acts on elementary operator tensors factorwise. Entanglement fidelity on a finite logical space
Adopt Choice, Countable Choice and Dependent Choice as carried by the physical model suppliers. 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 finite benchmark and physical assumptions in [F1]–[F3], the mathematical interfaces in [F4]–[F9], and the choice assumptions in [A1].
Goal: Explain the conditional history and rank statements, while distinguishing the article's reported timing interpretation from deductions supplied here.
The expansion in [F5] expresses the channel as a no-jump contribution plus integrals of contributions indexed by ordered times and jump labels. In the emitter model those labels include the modeled polarizations; the amplitudes act on the source basis states. The lift in [F1] changes the diagonal energies and hence the phases in the intervening propagators. This identifies a possible phase mechanism without asserting that an energy shift alone establishes distinguishability.
In the fixed-jump benchmark, [F2] supplies the exact finite-time ranks. By [F7], a threshold count can grow as previously positive weights pass the threshold even when exact rank is already constant; the threshold comparison also requires the same normalization. Under the further exit-rate and model hypotheses in [F3], the limiting channel has the stated nine source-to-ground operators. A limiting rank can differ from every finite-time rank because positive weights may tend to zero.
The record in [F4] retains both diagonal and off-diagonal information and depends on the channel and its restriction to a code. Use [F8] to specify the encoding and decoded recovery and [F9] to specify the fidelity in the Remark. The supremum defining is well-defined: the fidelity values lie in , and the decoder set is nonempty, since is a channel into . Indeed, for an output orthonormal basis , the operators give this map, sum to the identity in , and each ancilla amplification is a sum of conjugations preserving positivity. We now prove non-determination and lack of a universal rank ordering by explicit channels.
Fix and . Put and , and write for . These matrices are unitary; their conjugations preserve trace, and their ancilla amplifications are unitary conjugations, so they are channels by [F8]. Nonnegative convex combinations of these maps are also channels, since every amplification preserves positivity and their weights sum to one. Let , and . They are orthonormal by their displayed coordinates, and the trace-one Choi matrices of are respectively their rank-one projectors: expand and apply the corresponding channel on the second factor. Thus and both have exact Kraus rank one by [F7]; with identity recovery their entanglement fidelities are and by [F9]. This proves non-determination even for a fixed code and recovery.
If, in a specified branch, the additional averaging hypothesis in [F6] holds, averaging the relative phases multiplies each input coherence by the corresponding Gram entry. The conclusion is conditional on that branch model. It does not by itself establish the article's comparison of threshold-crossing times. The reported role of successive jump-time profiles and the earlier onset for larger lift are retained as the article's model interpretation.
For , put . Its trace-one Choi matrix is , so its exact rank is two and its identity-recovery fidelity is . For any decoded recovery , put , a positive trace-one matrix by [F9], and set , . These are nonnegative and , by completing the two orthonormal vectors to a basis and summing the nonnegative diagonal entries of . Since , factorwise tensor action gives . Consequently . Identity recovery attains the bound, so . In particular and give the same rank two but different optimized fidelities and .
Finally put . Its trace-one Choi matrix is the corresponding positive combination of the three orthogonal projectors in step 1.4, so its exact rank is three and its identity-recovery fidelity is . Hence : increasing rank from two to three can accompany improved fixed-recovery and optimized fidelity. Conversely, increasing rank from to lowers both fidelities from one to , since fidelity is at most one and identity recovery attains one for . Thus rank comparisons alone impose neither a universal increase nor a universal decrease in these fidelities. These counterexamples establish the general limitation of a rank metric; the article's proposed connection between distinguishability and degradation in its emitter model remains a mechanism interpretation, not a deduction of such a universal ordering.
Source notes
The statements about the jump-time profiles and earlier appreciable weights are attributed to the article's page 4 discussion. No crossing times or monotonicity theorem are inferred from the phase-Gram lemma. The fixed-jump continuation is an explicit model assumption, and the long-time conclusion additionally requires the exit-rate bound.
Depends on
- Phenomenological angular-momentum degeneracy lift
- Exact and thresholded Kraus ranks for J at most two
- Long-time atomic channel and source-resolving Kraus operators
- Complementary error records in a Kraus basis
- Finite no-jump and ordered-jump expansion
- Conditional jump-time phases form a positive Gram matrix
- Exact versus thresholded Kraus rank protocol
- 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
- Code restriction and decoded channel types
- Entanglement fidelity on a finite logical space
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 page 4, paragraphs below Figure 2