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.
Ensemble and purification
Definition
Let be a nonzero finite-dimensional complex-inner-product space. A finite ensemble of density operators on is a positive integer , weights with , and density operators on . Its barycenter is . A zero-weight component still names a density operator but contributes zero to the barycenter.
Let be any finite-dimensional complex-inner-product space. A purification of a density operator on is a unit vector such that
The tensor factors are ordered then . Tensor products, outer products and partial trace have the conventions of Ordered tensor registers, their inner product, and wire permutations, Dirac Notation Conversion and Partial trace over a finite tensor factor. The auxiliary space may be any finite dimension that supports such a unit vector.
Depends on
Used by
- Complementary channels and coherent information Definition
- Bell-state Schmidt decomposition and reduced density Example
- Coherent information equals output entropy minus environment entropy Lemma
- Every finite state ensemble is obtainable from a purification Theorem
- Finite ensemble barycenters are density operators Theorem
- Purifications exist and are unitarily equivalent after padding Theorem
- The least purification environment dimension is the density rank Theorem
- The set of density operators is convex Theorem
Dependency tree · two levels
23 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, §2.1.2–2.1.3 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 2: Foundations I: States and Ensembles (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes, §§15.1 and 18.3 (standard reference, not scraped)