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 be a finite-dimensional quantum channel and use its memoryless extension . Rates use natural logarithms, so they are in nats per channel use. For code sizes , a rate is achievable when 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 and a quantum-channel decoder , where . Let and let be a normalized maximally entangled vector. Its entanglement fidelity is
where . A rate is quantum-achievable if ; the resulting capacity is . This is the subspace entanglement-transmission convention.
For private classical transmission, a block code uses equiprobable messages , input states on , and a decoding POVM on . Its average error is
Fix a complementary channel as in Complementary channels and coherent information. Eve's average state is . Define leakage by its Holevo information
A rate is privately achievable when and ; this is strong secrecy in mutual-information form. The corresponding capacity is . 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 the sender and receiver begin with a finite-dimensional shared state independent of the equiprobable message. For each , the sender applies a quantum channel . The receiver measures with a POVM . Its average error is
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 .
The input, output, and reference registers are finite-dimensional in each block. No single-letter formula is included in these operational definitions.
Depends on
- Finite-dimensional quantum channel
- Density operator
- Finite POVMs and their outcome law
- Partial trace over a finite tensor factor
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Purifications exist and are unitarily equivalent after padding
- Ordered tensor registers, their inner product, and wire permutations
- Complementary channels and coherent information
- Finite-dimensional channels compose and tensor
- Finite classical-quantum states and Holevo information
- Finite-dimensional von Neumann entropy
- Private information is an average coherent-information difference
Used by
- Additive entanglement-assisted classical capacity formula Theorem
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- Regularized coherent-information formula for quantum capacity Theorem
- Regularized private-information formula for quantum channel capacity Theorem
- Single-letter quantum and private capacities of degradable channels Theorem
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
- John Watrous, The Theory of Quantum Information, Chapter 8 (standard reference, not scraped)