Alphabeta Math
DefinitionDefinition: AI-generatedProof: 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.

Complementary error records in a Kraus basis

Definition

Let H and K be nonzero finite-dimensional complex inner-product spaces. Let N:L(H)→L(K) be a quantum channel, meaning a completely positive, trace-preserving linear map, with a finite Kraus representation N(X)=∑aEaXEa†. Here L(H) denotes the linear endomorphisms of H, and Ea† is the adjoint of Ea:H→K. Choose a nonempty finite label set for the family and an environment space E with orthonormal basis {∣a⟩} indexed by that set. Define W:H→K⊗E by W∣ψ⟩=∑aEa∣ψ⟩⊗∣a⟩. The complementary error record associated with this representation is Nc(X)=Tr⁡K(WXW†), where the partial trace contracts the first tensor factor. In the chosen label basis its (a,b) entry is Tr⁡(EaXEb†).

For an isometric code encoding V:HL→H with nonzero finite-dimensional logical space and code subspace C=im⁡V, the record is logical-state independent on the code when Nc(ρ) is the same operator for every density operator ρ on H supported on C. A density operator is a positive semidefinite operator of trace one; supported on C means PρP=ρ for the orthogonal projector P=VV†. This condition concerns the entire record, including off-diagonal entries, and is stronger than merely requiring the diagonal entries to be independent of the code state.

Facts & Assumptions

[F1]

A finite Kraus representation is the stated finite sum of operator maps. Finite Kraus representation

[F2]

A finite-dimensional quantum channel is linear, completely positive and trace-preserving on all input operators. Finite-dimensional quantum channel

[F3]

The first-factor partial trace is given by summing the corresponding matrix entries over an orthonormal basis of that factor. Partial trace over the first tensor factor

[F4]

A complementary channel is obtained by tracing the output factor of a chosen isometric dilation. Complementary channels and coherent information

[F5]

An isometric encoding has code subspace im⁡V and code projector VV†. Quantum code as an isometric encoding and its code projector

[F6]

A density operator is positive semidefinite with trace one. Density operator

[F7]

Ordered tensor products retain factor order and carry the factorwise product inner product, with orthonormal elementary product bases. Ordered tensor registers, their inner product, and wire permutations

[F8]

For an operator R on an ordered product K⊗E with ordered orthonormal product basis, the second-factor partial trace has entries (Tr⁡ER)ii′=∑aR(i,a),(i′,a). Partial trace over a finite tensor factor

[F9]

A complex-linear map is completely positive when, for every integer r≥1, its block amplification [Xij]↦[N(Xij)] preserves nonnegative operators. Completely positive maps

Justification

Trace preservation and the Kraus formula give Tr⁡(X∑aEa†Ea)=Tr⁡(X) for every X. Taking matrix units for X shows ∑aEa†Ea=IH. The product inner product and orthonormality of the label basis give ⟨Wψ,Wφ⟩=∑a⟨Eaψ,Eaφ⟩=⟨ψ,φ⟩, hence W†W=IH, so W is an isometry. Expanding WXW† and tracing over E gives N(X); thus W is a dilation of the given channel. Tracing instead over K gives the displayed entries, so the defined record is the complementary channel for this chosen dilation. The choice of labels and basis is part of the representation.

The code-state condition is well-defined because the code projector specifies exactly which density operators are supported on C. Equality of full operators entails equality of their diagonal entries, while diagonal entries alone do not specify off-diagonal entries. For example, the two density matrices 12(1111) and 12(1−1−11) have the same diagonal and are different. These matrices occur as complementary records for a single channel on the full two-dimensional code: take H=K=HL=C2, V=I, Z=(100−1), E0=I/2 and E1=Z/2. The map N(X)=(X+ZXZ)/2 is completely positive, since each amplification is a sum of conjugations, and is trace-preserving, since E0†E0+E1†E1=I. The record formula gives Nc(ρ)=12(1Tr⁡(ρZ)Tr⁡(ρZ)1) for every density operator ρ. Its diagonal entries are both 1/2 for every code state, whereas the inputs ∣0⟩⟨0∣ and ∣1⟩⟨1∣ yield the two distinct matrices above. Thus diagonal independence over all code states does not imply full-record independence.

Depends on

Used by · 9

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.