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.
Æ rank-one correction with separated error spaces
PDF p. 6: Æ-code bullet continued into right column
Statement
Let have orthonormal magnetic basis , , and let the code be the span of and . Select finitely many spin blocks including , each with , and let be their orthogonal direct sum. Let be the complex span on of the identity and the coherent components of rank-zero and rank-one spherical tensor families from into the selected blocks, extended by zero outside . Tensor rank refers to the transformation law, not matrix rank.
For every , for a scalar , where is the code projector. Consequently every finite Kraus channel on whose Kraus operators lie in has an exact decoded recovery on this code. In particular, , so the subspaces and are orthogonal. The article attributes this Æ code and its correction property to Ref. [9]. The conclusion concerns coherent tensor components; it does not claim correction of every separately resolved matrix-unit transition.
Facts & Assumptions
The stated codewords are orthonormal and define an isometric encoding of a two-dimensional logical space; their magnetic supports are and . J equals five absorption-emission code
The error-span contract defines the selected direct sum, the extended coherent tensor components and the pair-product condition. Rank-one transition terminology refers to tensor rank, rather than matrix rank. Order-one absorption–emission tensor error span Rank-one transition errors in the benchmark
For two normalized codewords with disjoint magnetic supports whose union has pairwise spacing at least three, equality of moments of orders implies the pair-product condition for the selected order-one tensor error span. Spaced-support moment criterion for order-one AE correction
For a finite-dimensional isometric code and a finite Kraus channel, scalar pair-product compressions of its Kraus operators imply a decoded recovery channel that acts as the identity on the logical operator space. Knill–Laflamme criterion
Proof
Given: The codewords, selected finite blocks, and error span in the Statement, together with a finite Kraus channel whose Kraus operators belong to that span.
Goal: Establish the pair-product condition, exact decoded recovery, and orthogonality of the two generated logical error spaces.
The union of supports is , with consecutive gaps ; the supports are disjoint. The moments of orders for are , , and . For they are , , and . Thus all hypotheses of the spaced-support criterion hold.
The criterion gives for every . In particular it holds for every pair of Kraus operators of the given channel. Since the code is finite dimensional and the encoding is isometric, the Knill–Laflamme criterion supplies an exact decoded recovery.
Taking the matrix element of the pair-product condition between the orthogonal codewords gives . These are precisely the inner products ; linearity therefore makes the two generated subspaces orthogonal. This proves the stated correction and separation.
Depends on
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. 6, Æ-code bullet continued into the right column