Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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.

The Knill–Laflamme criterion for a protected subsystem

Statement

Let J:HG⊗HL→HP be an isometric encoding between nonzero finite-dimensional complex inner-product spaces, let P=JJ∗, and let N(X)=∑a=1mEaXEa∗ be a finite Kraus representation of a channel from B(HP) to B(HO). The protected subsystem HL is exactly correctable under J, in the sense of Exact correction of a protected subsystem, if and only if there are operators Mab:HG→HG such that J∗Ea∗EbJ=Mab⊗IHLfor every a,b.

Equivalently, PEa∗EbP=J(Mab⊗IHL)J∗. For any chosen orthonormal basis (gk) of HG, put Qkℓ=∣gk⟩⟨gℓ∣⊗IHL and Pkℓ=JQkℓJ∗, where ∣u⟩⟨v∣ means x↦⟨x,v⟩u under the library's linear-first convention. The same criterion is equivalent to the existence of scalars λabkℓ such that PkkEa∗EbPℓℓ=λabkℓPkℓfor every a,b,k,ℓ. These are equalities of physical-space operators using the embedded gauge matrix units Pkℓ.

Facts & Assumptions

Given: The finite-dimensional encoding J, the finite Kraus channel N, and the exact-correctability definition in Exact correction of a protected subsystem.

[F1]

Exact correction of a protected subsystem: a decoded channel R witnesses exact correction when the recovered logical marginal equals the input logical marginal for every density operator, including every finite reference.

[F2]
[F3]

Finite-dimensional quantum channel, Finite Kraus representation, Trace preservation is Kraus normalization, A finite Kraus sum is completely positive, and Kraus and Choi characterizations of complete positivity: channels are completely positive and trace-preserving, finite Kraus sums are completely positive, trace preservation is Kraus normalization, and finite-dimensional completely positive maps have finite Kraus representations.

[F4]

Preserving the logical marginal forces a gauge-only channel: a channel preserving the logical marginal has Kraus operators Aj⊗IHL, and the marginal identity holds with every finite reference; it also verifies the gauge-reset channel.

[F5]

An explicit syndrome recovery corrects a Knill–Laflamme error family: for its constructed ordinary recovery, if Cab is defined by V∗Ea∗EbV=CabI, then R(EaVXV∗Eb∗)=CbaX for every operator X.

[F6]

Exact recovery implies the Knill–Laflamme condition: exact recovery of an ordinary code implies the scalar-compression condition; An explicit syndrome recovery corrects a Knill–Laflamme error family proves its sufficiency.

[F11]

Exact correction of a protected subsystem and Exact recovery of an encoded quantum code: when the gauge factor is one-dimensional, the marginal recovery definition is ordinary encoded recovery.

[F7]

Every finite-dimensional real or complex inner product space has an orthonormal basis: every finite-dimensional inner-product space has an orthonormal basis.

[F9]

Agreement on pure states implies complete agreement: equality of complex-linear maps on all operators gives equality after tensoring with the identity on any finite reference.

[F12]

Product operator matrix units form a basis: tensor products of operator matrix units form a basis of the endomorphisms of a finite-dimensional ordered product space.

Proof

1.1givenF1F2F3F4algebrachoose

For necessity, let R:B(HO)→B(HG⊗HL) be an exact decoded recovery. By [F3], choose a finite Kraus family (Sr) for R. The corrected map Φ=R∘N∘Ad⁡J has Kraus operators Kra=SrEaJ. It is completely positive by [F3], and ∑r,aKra∗Kra=J∗∑aEa∗(∑rSr∗Sr)EaJ=J∗(∑aEa∗Ea)J=J∗J=IHG⊗HL by [F2] and [F3]. Thus Φ is a channel. By exactness [F1], it preserves the HL marginal; [F4] gives SrEaJ=Ara⊗IHL for some Ara:HG→HG.

1.2givenF2F3F7F10constructchoose

For sufficiency, assume J∗Ea∗EbJ=Mab⊗IHL. Let dG=dim⁡HG>0 and choose an orthonormal basis (gk)k<dG by [F7]. Define ιk:HL→HG⊗HL by ιkx=gk⊗x, and put Fak=EaJιk and F~ak=Fak/dG. By trace preservation [F3] and J∗J=I from [F2], ∑a,kFak∗Fak=∑kιk∗J∗(∑aEa∗Ea)Jιk=dGIHL. Thus (F~ak) is a finite Kraus representation of a channel N~:B(HL)→B(HO).

2.1F2F3F4step 1.1algebraconstruct

Trace preservation of R and N gives ∑rSr∗Sr=IHO and ∑aEa∗Ea=IHP by [F3]. Hence J∗Ea∗EbJ=J∗Ea∗(∑rSr∗Sr)EbJ=∑r(SrEaJ)∗(SrEbJ)=(∑rAra∗Arb)⊗IHL. Set Mab=∑rAra∗Arb. This proves the operator-valued condition.

2.2F3F5F8step 1.2algebra

For all a,b,k,ℓ, the assumed condition gives F~ak∗F~bℓ=⟨Mabgℓ,gk⟩dGIHL. Apply [F5] to N~ with the identity encoding of HL. It supplies a channel S:B(HO)→B(HL) and a finite Kraus family (Sr) for which S(F~akXF~bℓ∗)=⟨Mbagk,gℓ⟩dGX for every X∈B(HL).

3.1step 2.1F2F7F8algebrachoose

Fix an orthonormal gauge basis (gk) using [F7]. The matrix entry of Mab in row k, column ℓ is ⟨Mabgℓ,gk⟩ by [F8]. Therefore PkkEa∗EbPℓℓ=J(Qkk(Mab⊗IHL)Qℓℓ)J∗=⟨Mabgℓ,gk⟩Pkℓ. This proves the matrix-unit statement in the necessary direction.

3.2step 1.2step 2.2F2F3F7F9F10F12algebrachoose

Trace preservation and J∗J=I imply ∑aMaa⊗IHL=J∗(∑aEa∗Ea)J=IHG⊗HL, so ∑aMaa=IHG: applying the equality to each g⊗ℓ0 for fixed unit ℓ0 gives (∑aMaag−g)⊗ℓ0=0, and tensoring with nonzero ℓ0 is injective. Define the decoded recovery T(X)=Pg0⊗S(X) for a fixed unit g0∈HG. For a gauge matrix unit ∣gk⟩⟨gℓ∣⊗X, the encoded channel output is ∑aFakXFaℓ∗; applying S and scaling the cross-term formula in step 2.2 from F~ak to Fak=dG F~ak gives logical output ∑aS(FakXFaℓ∗)=∑a⟨Maagk,gℓ⟩X=⟨gk,gℓ⟩X=δkℓX. Here the scaling is S(FakXFbℓ∗)=dGS(F~akXF~bℓ∗), so the factor dG cancels the denominator in step 2.2. The input logical marginal of that matrix unit is also δkℓX. By linearity and the product matrix-unit basis in [F12], the decoded map T with output gauge reset preserves the logical marginal on every operator; [F9] extends the equality to every finite reference.

3.3F2step 2.1algebra

Since P=JJ∗, the operator-valued condition gives PEa∗EbP=J(Mab⊗IHL)J∗. Conversely, multiplying this compressed equality by J∗ and J and using J∗J=I recovers the operator-valued condition.

4.1step 3.2F1F3F4F9algebraconstruct

The Kraus operators of T are Try=g0⊗Sry. Since g0 is unit, ∑rTr∗Tr=∑rSr∗Sr=IHO; hence T is a channel by [F3]. Step 3.2 proves it preserves the logical marginal on every operator, and [F9] extends that identity to every finite reference. The physical reset-and-encode map is a channel by [F4], so the protected subsystem is exactly correctable.

4.2F2F7step 3.3algebra

For a fixed orthonormal gauge basis, if the operator-valued condition holds, then Qkk(J∗Ea∗EbJ)Qℓℓ=⟨Mabgℓ,gk⟩Qkℓ, which gives the embedded matrix-unit condition after multiplying by J and J∗. Conversely, sum the embedded matrix-unit identities over k,ℓ. Since ∑kPkk=P and J∗PkℓJ=Qkℓ, the resulting operator is J∗Ea∗EbJ=(∑k,ℓλabkℓ∣gk⟩⟨gℓ∣)⊗IHL. This establishes equivalence for the fixed basis; because the operator-valued condition is basis-independent, it holds for every orthonormal gauge basis.

5.1F2F6F7F11algebra∎

If dim⁡HG=1, every Mab is a scalar, so the criterion becomes PEa∗EbP=CabP. Under the unitary identification HG⊗HL≅HL, the first-factor trace leaves the logical operator unchanged, so the subsystem recovery definition [F11] is ordinary exact recovery. The necessity and sufficiency directions are [F6].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

73 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources