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 quantum mutual, conditional, and conditional mutual information
Definition
For a finite bipartite state on the ordered product , write and , using the partial traces in Partial trace over a finite tensor factor and Partial trace over the first tensor factor. They are states by Partial traces of a finite bipartite state are states. Define
For a finite tripartite state on the ordered product , set after identifying the factors as , and after identifying them as . Let be the wire permutation taking factor order to (Ordered tensor registers, their inner product, and wire permutations, Finite wire permutations are unitary basis permutations) whose unique adjoint exists by Every linear map between finite-dimensional inner product spaces has a unique adjoint, and set , tracing out the last factor. Because is unitary, is a state: unitary conjugation preserves non-negativity by the adjoint identity (The adjoint is characterised by , Non-negative and positive operators) and preserves trace by cyclicity (For and , ). Finally set . All these marginals are density operators by applying Partial traces of a finite bipartite state are states after grouping factors. Define
These are finite-dimensional definitions only; no non-negativity of conditional entropy or conditional mutual information is part of the notation.
Depends on
- Finite-dimensional von Neumann entropy
- Partial traces of a finite bipartite state are states
- Density operator
- Non-negative and positive operators
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Partial trace over a finite tensor factor
- Partial trace over the first tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Finite wire permutations are unitary basis permutations
- For $A\in M_{m\times n}(F)$ and $B\in M_{n\times m}(F)$, $\operatorname{tr}(AB)=\operatorname{tr}(BA)$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
Used by
- Finite classical-quantum states and Holevo information Definition
- A Bell pair has negative quantum conditional entropy Example
- Additivity of optimized entanglement-assisted information Lemma
- Coherent-information concavity and subadditivity for degradable channels Lemma
- Additive entanglement-assisted classical capacity formula Theorem
- Data processing for finite quantum mutual information Theorem
- Exact quantum, private, and entanglement-assisted erasure capacities Theorem
- Finite quantum conditional mutual information identity Theorem
- Finite quantum mutual information identities and the Holevo identity Theorem
- Nonnegativity of finite-dimensional quantum conditional mutual information Theorem
- Regularized coherent-information formula for quantum capacity Theorem
- Regularized private-information formula for quantum channel capacity Theorem
Dependency tree · two levels
43 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.2.1–5.2.2 (standard reference, not scraped)
- Mark M. Wilde, From Classical to Quantum Shannon Theory, arXiv:1106.1445v8, §§11.1 and 11.7 (standard reference, not scraped)