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.
Finite classical-quantum states and Holevo information
Definition
Let be a finite nonempty classical label set, represented by a register with computational orthonormal basis (Finite registers and their ordered computational bases). For each , write , the rank-one orthogonal projection using the root linear-first convention, as in An orthogonal finite ensemble block sum is a density operator. Let be a nonzero finite-dimensional complex inner-product space. A finite classical-quantum state is
where , , and each is a density operator on . It is a density operator by An orthogonal finite ensemble block sum is a density operator. Its quantum marginal is by the first-factor partial-trace formula in Partial trace over the first tensor factor, and it is a density operator by Partial traces of a finite bipartite state are states. The Holevo information of this ensemble is
where zero-probability branches contribute nothing. This is measured in nats under Finite-dimensional von Neumann entropy.
Depends on
- Finite-dimensional von Neumann entropy
- Finite quantum mutual, conditional, and conditional mutual information
- An orthogonal finite ensemble block sum is a density operator
- Partial traces of a finite bipartite state are states
- Density operator
- Finite registers and their ordered computational bases
- Ordered tensor registers, their inner product, and wire permutations
- Partial trace over the first tensor factor
Used by
- A fixed POVM need not attain ensemble Holevo information Counterexample
- Finite-input memoryless cq channel Definition
- Operational quantum, private, and entanglement-assisted capacities Definition
- Private information of a finite channel ensemble Definition
- An orthogonal ensemble attains its Holevo information Example
- Holevo information of an equiprobable binary pure-state channel Example
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Dimension-dependent quantum entropy continuity and Holevo control Lemma
- Exponential averaged spectral projectors for a finite cq ensemble Lemma
- Finite cq wiretap achievability with strong Holevo secrecy Lemma
- Flat-input entanglement-assisted achievability by Weyl coding Lemma
- Private information is an average coherent-information difference Lemma
- Typical-projector bounds for finite quantum sources and cq ensembles Lemma
- Finite quantum mutual information identities and the Holevo identity Theorem
- Holevo–Schumacher–Westmoreland capacity theorem for finite cq channels Theorem
- Regularized private-information formula for quantum channel capacity Theorem
- The finite Holevo measurement bound Theorem
Dependency tree · two levels
37 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
- John Watrous, The Theory of Quantum Information, §5.3.3 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, §11.1 (standard reference, not scraped)