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 Kraus representation
Definition
Let and be finite-dimensional (have finite bases by Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis) complex inner-product spaces (Real and complex inner-product spaces and their induced length), with the root convention that each inner product is linear in its first argument. Write for the complex-linear endomorphisms of and for the complex-linear maps from to (Linear map between vector spaces over the same field). A finite Kraus representation of a complex-linear map is a finite family such that
where is the adjoint (The adjoint is characterised by ), which exists uniquely in finite dimensions (Every linear map between finite-dimensional inner product spaces has a unique adjoint). The composition maps to , so the sum defines an output endomorphism for each input endomorphism . The index set may be empty; its sum is then the zero map. Zero operators are allowed in a nonempty family.
Depends on
- Real and complex inner-product spaces and their induced length
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Linear map between vector spaces over the same field
- The adjoint $T^*:W\to V$ is characterised by $\langle Tv,w\rangle_W=\langle v,T^*w\rangle_V$
- Every linear map between finite-dimensional inner product spaces has a unique adjoint
Used by
- Distance corrects unlocated errors and known erasures Corollary
- Exact recovery of an encoded quantum code Definition
- A degenerate code with a non-diagonal Knill–Laflamme matrix Example
- Orthogonal error spaces and a recovery branch Example
- Qubit dephasing channel in Kraus and Choi forms Example
- A finite instrument has an isometric coherent record Lemma
- A finite POVM defines a classical-output quantum channel Lemma
- A positive Choi matrix yields finite Kraus operators Lemma
- Coherent normal form for finite quantum query algorithms Lemma
- Kraus operators in an identity-channel representation are scalar Lemma
- Preserving the logical marginal forces a gauge-only channel Lemma
- A finite Kraus sum is completely positive Theorem
- An explicit syndrome recovery corrects a Knill–Laflamme error family Theorem
- An isometry followed by partial trace is a channel Theorem
- Channel data processing for finite quantum relative entropy Theorem
- Every finite instrument induces a unique POVM Theorem
- Every finite-dimensional channel has a finite isometric dilation Theorem
- Exact recovery implies the Knill–Laflamme condition Theorem
- Finite channel, Kraus, Choi, and Stinespring equivalence Theorem
- Finite instruments can be coherently deferred Theorem
- Finite-dimensional channels compose and tensor Theorem
- Instrument branch Kraus families satisfy total normalization Theorem
- Kraus and Choi characterizations of complete positivity Theorem
- The Knill–Laflamme criterion for a protected subsystem Theorem
- Trace preservation is Kraus normalization 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 (2018), §2.2.2 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3, §3.2.1 (standard reference, not scraped)