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

Operational quantum, private, and entanglement-assisted capacities

Definition

Let N:A→B be a finite-dimensional quantum channel and use its memoryless extension N⊗n:A⊗n→B⊗n. Rates use natural logarithms, so they are in nats per channel use. For code sizes Kn≥1, a rate R≥0 is achievable when lim inf⁡n→∞n−1ln⁡Kn≥R and the relevant error terms below tend to zero; each capacity is the supremum of its achievable rates.

For quantum transmission, a block code consists of an isometric encoder Wn:Mn→A⊗n and a quantum-channel decoder Dn:B⊗n→Mn, where dim⁡Mn=Kn. Let Rn≅Mn and let ∣ΦKn⟩∈Rn⊗Mn be a normalized maximally entangled vector. Its entanglement fidelity is

Fn:=⟨ΦKn∣(id⁡Rn⊗DnN⊗nWn)(∣ΦKn⟩⟨ΦKn∣)∣ΦKn⟩,

where Wn(X)=WnXWn∗. A rate is quantum-achievable if Fn→1; the resulting capacity is Q(N). This is the subspace entanglement-transmission convention.

For private classical transmission, a block code uses equiprobable messages m∈[Kn], input states ρm,n on A⊗n, and a decoding POVM {Λm,n}m=1Kn on B⊗n. Its average error is

en:=1−1Kn∑m=1Kntr⁡(Λm,nN⊗n(ρm,n)).

Fix a complementary channel Nc as in Complementary channels and coherent information. Eve's average state is τˉn=Kn−1∑m(Nc)⊗n(ρm,n). Define leakage by its Holevo information

ℓn:=S(τˉn)−1Kn∑m=1KnS((Nc)⊗n(ρm,n)).

A rate is privately achievable when en→0 and ℓn→0; this is strong secrecy in mutual-information form. The corresponding capacity is P(N). The value is independent of the chosen complementary dilation, as follows from Private information is an average coherent-information difference.

For classical transmission with prior shared entanglement, for each block length n the sender and receiver begin with a finite-dimensional shared state σSASB independent of the equiprobable message. For each m∈[Kn], the sender applies a quantum channel Em,n:L(SA)→L(A⊗n). The receiver measures B⊗n⊗SB with a POVM {Γm,n}m=1Kn. Its average error is

enEA:=1−1Kn∑m=1Kntr⁡ ⁣[Γm,n((N⊗n∘Em,n)⊗id⁡SB)(σSASB)]. A rate is achievable when this error tends to zero; there is no constraint on the dimension or consumption of the shared entanglement. The resulting capacity is CE(N).

The input, output, and reference registers are finite-dimensional in each block. No single-letter formula is included in these operational definitions.

Depends on

Used by

Dependency tree · two levels

68 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