Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-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.

Holevo information of an equiprobable binary pure-state channel

Example

Let a binary cq channel send equiprobable pure qubit states ∣ψ0⟩,∣ψ1⟩ with overlap magnitude c=∣⟨ψ0,ψ1⟩∣∈[0,1]. This ensemble has Holevo information χ=h ⁣(1+c2)nats per channel use, where h(t)=−tln⁡t−(1−t)ln⁡(1−t) with 0ln⁡0:=0. If χ>0, every rate R with 0≤R<χ is achievable for this memoryless channel; if c=1, the states coincide and no positive rate follows from this ensemble.

Facts & Assumptions

Given: Two unit vectors in a two-dimensional complex inner-product space and the equiprobable ensemble of their pure-state density operators.

[F1]

Finite-input memoryless cq channel: each input symbol is sent to its assigned output density operator and block outputs are tensor products.

[F2]

Finite classical-quantum states and Holevo information: χ=S(ρˉ)−∑xpxS(ρx).

[F4]

Density operator: a pure-state projector has trace one and is a density operator.

[F5]

Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels: the finite cq channel capacity is the maximum ensemble Holevo information, and every rate below that capacity is achievable by reliable memoryless block codes.

Verification

1.1F3F4givenalgebraconstruct

Put ρˉ=12∣ψ0⟩⟨ψ0∣+12∣ψ1⟩⟨ψ1∣. Its trace is one. After changing the global phase of ∣ψ1⟩ and choosing an orthonormal basis, write ∣ψ0⟩=(1,0) and ∣ψ1⟩=(c,1−c2). Then ρˉ=12(1+c2c1−c2c1−c21−c2), whose trace is 1 and determinant is 14((1+c2)(1−c2)−c2(1−c2))=(1−c2)/4. Thus its characteristic polynomial is t2−t+(1−c2)/4, and [F3] gives eigenvalues (1+c)/2 and (1−c)/2.

2.1F1F2F5step 1.1algebracases∎

Each pure output state has eigenvalues 1,0, hence entropy zero by [F2]. By the symmetry h(t)=h(1−t) in its displayed definition, the average entropy from step 1.1 is h((1+c)/2), so [F2] gives the displayed χ. This ensemble is among those maximized in [F5], so Ccq≥χ; the rate conclusion follows from [F5] for every 0≤R<χ when χ>0. If c=0, the value is ln⁡2; if c=1, both outputs coincide up to phase and the value is zero.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

38 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