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 channel
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. A quantum channel from to is a complex-linear map (Linear map between vector spaces over the same field) that is completely positive (Completely positive maps) and trace-preserving, meaning
where trace is the basis-independent trace of a finite-dimensional endomorphism (The basis-independent trace of an endomorphism of a finite-dimensional vector space). Trace preservation is required on the full operator space, not only on density operators. This definition is mathematical and assumes no physical realization.
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
- Completely positive maps
- The basis-independent trace of an endomorphism of a finite-dimensional vector space
Used by
- Distance corrects unlocated errors and known erasures Corollary
- Broadcasting Family Definition
- Complementary channels and coherent information Definition
- Degradable and antidegradable channels Definition
- End-to-end channel and output error contract Definition
- Exact correction of a protected subsystem Definition
- Exact recovery of an encoded quantum code Definition
- Finite authenticated key-distribution protocol Definition
- Finite IID quantum source and compression code Definition
- Finite ordered channel-location schedules Definition
- Finite-dimensional quantum erasure channel Definition
- Local-Stochastic Correlated Quantum Noise Definition
- Operational quantum, private, and entanglement-assisted capacities Definition
- Parameterized variational quantum objective Definition
- A degenerate code with a non-diagonal Knill–Laflamme matrix Example
- Orthogonal error spaces and a recovery branch Example
- Qubit dephasing decreases quantum relative entropy Example
- A finite POVM defines a classical-output quantum channel Lemma
- Complement and degradation maps of the erasure channel Lemma
- Every finite extension is obtained from a purification by a channel Lemma
- Finite channel information maxima are attained Lemma
- Finite cq wiretap achievability with strong Holevo secrecy Lemma
- Kraus operators in an identity-channel representation are scalar Lemma
- Optimal Cloner Attains Bound Lemma
- Optimal Cloning Worst Case Upper Bound Lemma
- Preserving the logical marginal forces a gauge-only channel Lemma
- Replacing Bob's key by a copy of Alice's costs the correctness error Lemma
- The finite classical key-copy map is a quantum channel Lemma
- The Local Noise Model Composes With Circuit Semantics Lemma
- Unitary conjugation is a channel Proposition
- An explicit syndrome recovery corrects a Knill–Laflamme error family Theorem
- An isometry followed by partial trace is a channel Theorem
- Channel Composition Hybrid Bound Theorem
- Channel data processing for finite quantum relative entropy Theorem
- Channel Diamond Norm One Theorem
- Channel Tensor Error Bound Theorem
- Every finite-dimensional channel has a finite isometric dilation Theorem
- Exact Mixed State Cloning Fidelity Criterion Theorem
- Exact recovery implies the Knill–Laflamme condition Theorem
- Fidelity Data Processing Theorem
…and 9 more results.
Dependency tree · two levels
30 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.1 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3, §§3.2.1 and 3.2.6 (standard reference, not scraped)