Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-generated
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.

Environment-state independence under KL

PDF p. 1: Paragraph following Eq. (1)

Statement

Let HL,HP,HO be nonzero finite-dimensional complex inner-product spaces, V:HL→HP an isometry, C=im⁡V, and N(X)=∑a=1mEaXEa† a quantum channel with a finite Kraus family. Suppose the Knill–Laflamme conditions hold: ⟨ψ∣Ea†Eb∣φ⟩=cab⟨ψ∣φ⟩ for all ψ,φ∈C and all a,b. For the complementary channel associated with this Kraus family, every density operator supported on C has the same environment state, whose (a,b) entry is cba. In particular, for a normalized code vector ψ, the entries are ⟨ψ∣Eb†Ea∣ψ⟩=cba.

Consequently every fixed finite instrument applied to this environment has outcome probabilities and, when defined, conditional output states independent of the encoded logical density operator. Such outcomes can serve as syndrome flags: they may convey information about the error record, while the full record conveys no information that distinguishes logical input states. This assertion does not require every error label to be distinguishable.

Facts & Assumptions

[F1]

The finite-dimensional Knill–Laflamme criterion uses the stated scalar-overlap conditions and identifies them with exact correction for the stated channel and code. Knill–Laflamme criterion

[F2]

On arbitrary finite-dimensional complex inner-product spaces, ∣v⟩ denotes v, ⟨v∣ is the linear functional x↦⟨x,v⟩root, and ∣u⟩⟨v∣ maps x to ⟨x,v⟩rootu, with the root pairing linear in its first argument. Dirac Notation Conversion The symbol † is the adjoint used in [F1]. In specified ordered orthonormal coordinates these conventions give ⟨u∣A∣v⟩=u†Av and conjugate-transpose adjoints. Finite operator and ket conventions

[F3]

The isometric encoding has code projector P=VV†; a logical density operator is encoded as VρV†. Code restriction and decoded channel types

[F4]

For the chosen Kraus representation, the complementary record has (a,b) entry Tr⁡(EaXEb†). A density operator supported on C satisfies PXP=X and has trace one. Complementary error records in a Kraus basis

[F5]

A syndrome instrument is a fixed finite instrument on the environment; each outcome probability is the trace of its output, and its conditional output is that output divided by its nonzero probability. Syndrome flags and logical-state-independent environmental records

[F6]

Every finite-dimensional real or complex inner-product space has an orthonormal basis. In particular, this applies to the code subspace C with its inherited inner product. Every finite-dimensional real or complex inner product space has an orthonormal basis

Proof

Given: The finite-dimensional channel, isometric code and scalar-overlap conditions in the statement, and an arbitrary density operator X supported on C.

Goal: Show that the full complementary record and every fixed finite syndrome instrument's statistics and defined conditional outputs are independent of the encoded state.

1.1givenF1F2F4F6algebra

By [F6], choose an orthonormal basis {∣i⟩} of C and write X=∑i,jXij∣i⟩⟨j∣. The support condition makes this expansion valid, and ∑iXii=Tr⁡X=1. Expanding the finite matrix trace gives Tr⁡(EaXEb†)=∑i,jXij⟨j∣Eb†Ea∣i⟩=cba∑iXii=cba. Thus every entry of the complementary record is independent of X; for X=∣ψ⟩⟨ψ∣ this is the stated overlap formula.

2.1givenF3F4F5step 1.1∎

Every encoded logical density operator is supported on C, so step 1.1 gives one common environment density operator σ. For each outcome map Is of a fixed finite instrument, both Is(σ) and its trace are therefore independent of the logical input. If this trace is nonzero, the normalized conditional output is independent as well; if it is zero, no conditional state is assigned. Hence no finite-outcome measurement or other fixed finite instrument on the record can distinguish logical inputs by its outcome statistics, although its labels may describe syndrome information.

Depends on

Used by · 2

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