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.
Completely positive maps
Definition
Let and be finite-dimensional complex inner-product spaces and write and for their vector spaces of complex-linear endomorphisms with pointwise operations (Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis, Real and complex inner-product spaces and their induced length, The space of linear maps with pointwise addition and scalar multiplication, is a vector space over the common scalar field). Let be complex-linear. For each integer , put with its standard ordered register basis (Finite registers and their ordered computational bases). Write an operator in its unique block form with , and define to have blocks on . Lemma Finite ancilla amplification is a well-defined block map proves that this block rule defines a linear map on the full operator space for every finite . For , the extension is under the canonical unitary identifications and proved in that lemma.
The map is completely positive if, for every finite , sends every nonnegative operator on to a nonnegative operator on (Non-negative and positive operators). The quantifier includes ; complete positivity therefore implies positivity. No Kraus, Choi, or Stinespring characterization is part of this definition.
Depends on
- Non-negative and positive operators
- Finite ancilla amplification is a well-defined block map
- Finite registers and their ordered computational bases
- Ordered tensor registers, their inner product, and wire permutations
- Finite-dimensional vector space, and its dimension $\dim_F V$; infinite-dimensional means having no finite basis
- Real and complex inner-product spaces and their induced length
- Linear map between vector spaces over the same field
- The space $\mathcal L(V,W)$ of linear maps with pointwise addition and scalar multiplication
- $\mathcal L(V,W)$ is a vector space over the common scalar field
Used by
- Quantum phase estimation Algorithm
- Finite instruments and conditional states Definition
- Finite-dimensional quantum channel Definition
- Heralded success and the zero-success branch Example
- Qubit dephasing decreases quantum relative entropy Example
- Complete positivity implies Choi positivity Lemma
- Computational-basis instruments and conditional states on two registers Lemma
- Pauli projectors define a finite measurement instrument 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
- Unnormalized branch density entries have degree at most twice the query count Lemma
- A finite Kraus sum is completely positive Theorem
- A zero-probability instrument branch has no conditioned state Theorem
- An isometry followed by partial trace is a channel Theorem
- Finite instruments can be coherently deferred Theorem
- Hybrid bound for a composed channel circuit Theorem
- Instrument outcome weights normalize Theorem
- Kraus and Choi characterizations of complete positivity Theorem
- Phase estimation on a superposition of eigenspaces Theorem
- Positive-probability instrument branches are density operators Theorem
- Singular Pair No Broadcasting Theorem
- The Choi partial trace characterizes trace preservation Theorem
- The nonselective output of an instrument is a density operator Theorem
- The square-root Lüders maps form an instrument Theorem
Dependency tree · two levels
37 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 and Theorem 2.22 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3: Foundations II: Measurement and Evolution, §3.2.6 (standard reference, not scraped)