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.
QEC matrix and logical partial trace
PDF p. 2: Eq. (6), definitions continuing on p. 3; PDF p. 8: Eq. (S1.6) and following definitions
Definition
Let be nonzero finite-dimensional complex coordinate spaces with specified orthonormal bases. Let be a linear isometry, and write for the code basis, where and . Let , , be a finite nonempty Kraus family for a quantum channel , meaning ; a quantum channel is a completely positive, trace-preserving linear map. Let have orthonormal basis indexed by the Kraus labels and use the ordered product basis of .
The QEC matrix in this basis is defined by . The adjoint is conjugate transpose in the specified bases, and .
For any operator on , its logical partial trace is the operator on with entries . For a finite square complex matrix , its Frobenius norm is , with the nonnegative square root; equivalently, , where the trace is the sum of diagonal entries.
Facts & Assumptions
The finite coordinate conventions specify adjoints, bra-ket notation and ordered product bases. Finite operator and ket conventions
An isometric code is given by an isometry from the logical space into the physical space, and a quantum channel is completely positive and trace-preserving. Code restriction and decoded channel types
For this finite family, the QEC entries form , where . QEC matrix as an error-vector Gram operator
The first-factor partial trace has the displayed contraction in ordered orthonormal product bases. Partial trace over the first tensor factor
The Frobenius norm is the square root of the sum of squared entry moduli. The Frobenius norm ‖ A‖_F=(∑_i,j|aᵢⱼ|²)^1/2 on real or complex matrices
Justification
The isometry sends the logical orthonormal basis to an orthonormal code basis. By [F1] and [F3], the given entries are those of the well-defined operator in the specified finite product basis. The construction depends on the chosen code basis and Kraus family, both part of the input.
The logical contraction is the first-factor partial trace in [F4], so it defines an operator on . By [F5], the stated nonnegative square root defines the Frobenius norm. For square , matrix multiplication gives ; summing over proves the displayed trace identity.
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. 2, Eq. (6), and p. 3; PDF p. 8, Eq. (S1.6) and following definitions