Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Exact correction of a protected subsystem

Definition

Let HG,HL,HP,HO be nonzero finite-dimensional complex inner-product spaces with the fixed factor order HG⊗HL. Let J:HG⊗HL→HP be an isometric encoding and set P=JJ∗. The factors HG and HL are the gauge and protected logical subsystems. Let N:B(HP)→B(HO) be a channel.

For any finite-dimensional residual space HQ, use the first-factor partial trace Tr⁡G of Partial trace over the first tensor factor on HG⊗HQ. In particular, for a reference HR, take HQ=HL⊗HR and leave that factor order unchanged.

A decoded recovery is a channel R:B(HO)→B(HG⊗HL). The subsystem HL is exactly correctable for N under J when some decoded recovery satisfies, for every finite-dimensional reference HR and every positive semidefinite trace-one operator ρ on (HG⊗HL)⊗HR,

((Tr⁡G⊗id⁡B(HR))∘((R∘N∘Ad⁡J)⊗id⁡B(HR)))(ρ)=(Tr⁡G⊗id⁡B(HR))(ρ),

where Ad⁡J(X)=JXJ∗. The recovery may change the gauge state. The one-operator Kraus map Ad⁡J is completely positive by A finite Kraus sum is completely positive and trace-preserving by J∗J=I and Trace preservation is Kraus normalization. Thus Φ=R∘N∘Ad⁡J is a channel by Finite-dimensional channels compose and tensor, and it has a finite Kraus representation by Kraus and Choi characterizations of complete positivity. Explicitly, if (Rb) and (Ea) represent R and N, then (RbEaJ)b,a represents Φ. Taking a one-dimensional reference in the displayed recovery condition gives precisely the marginal hypothesis of Preserving the logical marginal forces a gauge-only channel. By that lemma and its converse with arbitrary finite references, this is equivalently a corrected decoded channel of the form TG⊗id⁡B(HL) for a channel TG on the gauge factor. For a unit vector g0∈HG, resetting the decoded gauge and re-encoding uses X↦J(Pg0⊗Tr⁡G(R(X)))J∗, where Pg0(x)=⟨x,g0⟩g0; the same supplier proves this is a channel. If dim⁡HG=1, the marginal condition is ordinary exact recovery of the code subspace in the sense of Exact recovery of an encoded quantum code.

Depends on

Used by

Dependency tree · two levels

53 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