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-dimensional quantum erasure channel
Definition
Let be a -dimensional complex inner-product space with . Form the orthogonal direct sum , where is a unit erasure vector orthogonal to every vector in ; the inner product on pairs is . Thus by If with every finite-dimensional, then is finite-dimensional and ; in particular . Let be the isometric inclusion into the data summand.
For an erasure probability , the -dimensional quantum erasure channel is the linear map
For a density operator , this outputs the data state with probability and the orthogonal erasure flag with probability . The definition is on the full operator space, and its channel property is established in The finite-dimensional erasure map is a quantum channel ↗.
Depends on
- Finite-dimensional quantum channel
- Density operator
- 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$
- Ordered tensor registers, their inner product, and wire permutations
- If $V = \bigoplus_{i<n} U_i$ with every $U_i$ finite-dimensional, then $V$ is finite-dimensional and $\dim_F V = \sum_{i<n} \dim_F U_i$; in particular $\dim_F(U \oplus W) = \dim_F U + \dim_F W$
Used by
- Capacity regimes of the qubit erasure channel Example
- Coherent information of a qudit erasure channel Lemma
- Complement and degradation maps of the erasure channel Lemma
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- The finite-dimensional erasure map is a quantum channel Theorem
Dependency tree · two levels
42 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, §8.3.2 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, §24.7.1 (standard reference, not scraped)