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 with overlap magnitude . This ensemble has Holevo information where with . If , every rate with is achievable for this memoryless channel; if , 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.
Finite-input memoryless cq channel: each input symbol is sent to its assigned output density operator and block outputs are tensor products.
Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely: finite-dimensional Hermitian operators have orthonormal eigenbases.
Density operator: a pure-state projector has trace one and is a density operator.
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
Put . Its trace is one. After changing the global phase of and choosing an orthonormal basis, write and . Then whose trace is and determinant is . Thus its characteristic polynomial is , and [F3] gives eigenvalues and .
Each pure output state has eigenvalues , hence entropy zero by [F2]. By the symmetry in its displayed definition, the average entropy from step 1.1 is , so [F2] gives the displayed . This ensemble is among those maximized in [F5], so ; the rate conclusion follows from [F5] for every when . If , the value is ; if , both outputs coincide up to phase and the value is zero.
Depends on
- Finite-input memoryless cq channel
- Finite classical-quantum states and Holevo information
- Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels
- Complex spectral theorem: a normal endomorphism of a finite-dimensional complex inner product space has an orthonormal eigenbasis, and conversely
- Density operator
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
- Mark M. Wilde, From Classical to Quantum Shannon Theory, second-edition prepublication v8, Chapters 18 and 20 (standard reference, not scraped)
- John Watrous, The Theory of Quantum Information, §§5.3.2 and 8.1.2 (standard reference, not scraped)