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.
Every finite-dimensional channel has a finite isometric dilation
Statement
Let be finite-dimensional complex inner-product spaces and let be a quantum channel. It has a finite Kraus representation, and for any chosen such representation with operators there are an -dimensional environment and a linear isometry such that
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces and a channel .
Finite-dimensional quantum channel: a channel is completely positive and trace-preserving.
Kraus and Choi characterizations of complete positivity: complete positivity gives a finite Kraus representation.
Trace preservation is Kraus normalization: for any such Kraus representation, trace preservation gives .
Finite Kraus representation: the chosen family satisfies for every .
The standard formulas on and on are inner products: the standard basis of is orthonormal, including the empty basis when .
Ordered tensor registers, their inner product, and wire permutations and The product basis is orthonormal and tensor dimensions multiply: the tensor pairing is the factorwise pairing and the ordered product basis is orthonormal.
Tensor products of finitely many linear maps: tensor maps act linearly on elementary tensors.
The adjoint is characterised by and Every linear map between finite-dimensional inner product spaces has a unique adjoint: finite-dimensional adjoints exist uniquely and satisfy their defining pairing identity.
Adjoints satisfy , , , and : adjoints reverse compatible compositions.
Partial trace over a finite tensor factor and The partial trace is characterized by the trace pairing and is basis-independent: in the product basis of , partial trace over sums the diagonal environment blocks.
Finite-dimensional linear isometries satisfy the adjoint identity: a linear isometry satisfies .
Isometric Stinespring representation: a Stinespring representation has the form .
Proof
By [F1] and [F2], a finite Kraus family exists; take any such family for . Since is trace-preserving, [F3] gives . Take with its standard orthonormal basis and define . Each summand is linear in by [F7], so is linear. Orthogonality of , the product pairing [F6], the adjoint identity [F8], and the Kraus normalization give for every ; thus is a linear isometry. By [F11], .
For each , , and , the product pairing and [F8] give . By uniqueness of the adjoint, . Therefore, on each product vector , . By [F10], taking the partial trace sums exactly the blocks with , so by [F4] for every . This is the representation in [L1], with . If , [F3] forces , hence ; the empty sums and unique map give the same identities.
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
- 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
- Adjoints satisfy $(S+T)^*=S^*+T^*$, $(\lambda T)^*=\overline\lambda T^*$, $(ST)^*=T^*S^*$, and $T^{**}=T$
- Finite-dimensional quantum channel
- Finite Kraus representation
- Isometric Stinespring representation
- Partial trace over a finite tensor factor
- Ordered tensor registers, their inner product, and wire permutations
- Tensor products of finitely many linear maps
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- The product basis is orthonormal and tensor dimensions multiply
- Kraus and Choi characterizations of complete positivity
- Trace preservation is Kraus normalization
- The partial trace is characterized by the trace pairing and is basis-independent
- Finite-dimensional linear isometries satisfy the adjoint identity
Used by
- Complementary channels and coherent information Definition
- Coherent information equals output entropy minus environment entropy Lemma
- Flat-input coherent information is achievable by subspace codes Lemma
- Data processing for finite quantum mutual information Theorem
- Fidelity Data Processing Theorem
- Finite channel, Kraus, Choi, and Stinespring equivalence Theorem
- Pure State No Cloning Theorem
- Regularized coherent-information formula for quantum capacity Theorem
Dependency tree · two levels
65 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), Theorem 2.22 (standard reference, not scraped)
- John Preskill, Quantum Computation, Chapter 3, §3.3.2 (standard reference, not scraped)