Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicable
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 HL,HP,HO be nonzero finite-dimensional complex coordinate spaces with specified orthonormal bases. Let V:HL→HP be a linear isometry, and write ∣μˉ⟩=V∣μ⟩ for the code basis, where μ=1,…,dL and dL=dim⁡HL. Let El:HP→HO, l=1,…,r, be a finite nonempty Kraus family for a quantum channel N, meaning N(X)=∑lElXEl†; a quantum channel is a completely positive, trace-preserving linear map. Let HE have orthonormal basis ∣l⟩ indexed by the Kraus labels and use the ordered product basis ∣μ,l⟩=∣μ⟩⊗∣l⟩ of HL⊗HE.

The QEC matrix M in this basis is defined by M[μ,l],[ν,k]=⟨μˉ∣El†Ek∣νˉ⟩. The adjoint is conjugate transpose in the specified bases, and ⟨u∣A∣v⟩=u†Av.

For any operator B on HL⊗HE, its logical partial trace Tr⁡LB is the operator on HE with entries (Tr⁡LB)l,k=∑μ=1dLB[μ,l],[μ,k]. For a finite square complex matrix C, its Frobenius norm is ∥C∥F=(∑i,j∣Cij∣2)1/2, with the nonnegative square root; equivalently, ∥C∥F2=Tr⁡(C†C), where the trace is the sum of diagonal entries.

Facts & Assumptions

[F1]

The finite coordinate conventions specify adjoints, bra-ket notation and ordered product bases. Finite operator and ket conventions

[F2]

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

[F3]

For this finite family, the QEC entries form A†A, where A∣μ,l⟩=El∣μˉ⟩. QEC matrix as an error-vector Gram operator

[F4]

The first-factor partial trace has the displayed contraction in ordered orthonormal product bases. Partial trace over the first tensor factor

[F5]

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 A†A 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 HE. By [F5], the stated nonnegative square root defines the Frobenius norm. For square C, matrix multiplication gives (C†C)jj=∑iCij‾Cij; summing over j proves the displayed trace identity.

Depends on

Used by · 3

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