Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck pending
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.

Flat-input entanglement-assisted achievability by Weyl coding

Statement

Let τ=JJ∗/D be the flat state of a nonzero D-dimensional input subspace of a finite-dimensional channel N. With prior shared maximally entangled states on that subspace, every 0≤R<S(τ)+Ic(τ,N) is achievable for classical messages with average error tending to zero. The code consists of finite Weyl operations followed by a collective output/reference POVM; it has rate tending to R.

Facts & Assumptions

Given: The finite-dimensional spaces, states, channels and explicit scalar hypotheses in the Statement.

[F1]

Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels: Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels.

[F2]

Complementary channels and coherent information: Complementary channels and coherent information.

[F3]

Coherent information equals output entropy minus environment entropy: Coherent information equals output entropy minus environment entropy.

[F4]

Schmidt decomposition: Schmidt decomposition.

[F5]

Ordered tensor registers, their inner product, and wire permutations: Ordered tensor registers, their inner product, and wire permutations.

[F6]

Finite classical-quantum states and Holevo information: the ensemble Holevo information is S(ρˉ)−∑xpxS(ρx).

[F7]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the logarithm product law gives entropy additivity for finite product spectra and S(ID/D)=ln⁡D.

[F9]

The finite Weyl twirl is the normalized partial trace: the uniform finite Weyl conjugations on the second factor replace it by its maximally mixed state and retain the first-factor marginal, including dimension one.

Proof

1.1F1F2F3F4F5F9givenalgebraconstruct

Fix a D-dimensional subspace of the input, with embedding J and flat state τ=JJ∗/D. Share ∣ΦD⟩ between the sender's subspace and a receiver reference R. On the sender half apply the D2 Weyl unitaries, each uniformly likely, before the input embedding. The Weyl matrices in the fixed ordered basis are Uab∣j⟩=e2πibj/D∣j+a(modD)⟩. Reorder the shared state as R⊗CD using [F5]. Applying [F9] with retained factor R and twirled factor the sender's D-dimensional register gives IR/D⊗ID/D, since the retained marginal is IR/D. Reordering back gives ID/D⊗IR/D. The supplied finite root-of-unity calculation establishes the phase cancellation for every D≥1.

2.1F1F2F3F4F5F6F7F8step 1.1givenalgebraconstruct∎

Let σab be the joint output on BR of this finite cq alphabet through N. Because (Uab⊗I)∣ΦD⟩=(I⊗UabT)∣ΦD⟩ in coefficient coordinates, all σab are related by a unitary on R and have identical entropy S(Nc(τ)) by purity of the full Stinespring output and [F4]. Their average is N(τ)⊗IR/D. The spectral theorem [F8] and logarithm law [F7] give S(N(τ)⊗IR/D)=S(N(τ))+ln⁡D. Thus [F6] gives the ensemble Holevo information exactly as χ=ln⁡D+S(N(τ))−S(Nc(τ))=fN(τ). The HSW theorem applies to this fixed finite cq channel ab↦σab, with output BR. Each cq codeword is physically implemented by its sequence of Weyl operations on independent shared maximally entangled pairs. Its collective POVM is a permitted receiver measurement and its rate/error are exactly those of HSW. Therefore every nonnegative rate strictly below fN(τ) is entanglement-assisted achievable. Dimension D=1 is included: the one-letter ensemble then has Holevo information zero.

Depends on

Used by

Dependency tree · two levels

65 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