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.
Channels, Kraus, Choi, and Stinespring Representations
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Complex Norms and Realification
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurements, POVMs, and Instruments
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Registers, Tensor Products, and Partial Trace
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops finite-dimensional complex-linear maps between full operator spaces. It fixes the repository inner product as linear in the first argument and the Choi matrix as input factor first, output factor second. Complete positivity and trace preservation are properties on every operator, with trace preservation distinct from trace nonincrease. The page proves the finite Kraus, Choi, and isometric Stinespring characterizations, their composition and tensor rules, and unitary conjugation facts. Zero-dimensional spaces and empty finite families are treated where the claims require them. The statements are mathematical and assert no physical postulate. A global scalar phase leaves a single conjugation map unchanged; controlled uses are outside that claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
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.
Finite-dimensional linear isometries satisfy the adjoint identity
Statement
Let 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 and let be a linear isometry. Then . If is also surjective, then .
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces and a linear isometry .
Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces: a linear isometry preserves the norm of every vector.
Jordan–von Neumann: a norm is induced by an inner product exactly when it satisfies the parallelogram law: for the first-argument-linear complex pairing, .
The adjoint is characterised by : the adjoint satisfies .
Every linear map between finite-dimensional inner product spaces has a unique adjoint: every linear map between these finite-dimensional inner-product spaces has a unique adjoint.
Inner products separate vectors, and the induced norm is homogeneous: : if for every , then .
Proof
For all , [F2] expresses each inner product using the four displayed norm squares. Applying [F1] to , , , and therefore gives .
The adjoint exists by [F4]. By [F3] and step 1.1, for every . For each fixed , conjugate symmetry and [F5] force , hence .
If is surjective, choose for arbitrary a vector with . Step 2.1 gives , so . The proof includes zero-dimensional spaces and uses only pointwise preimages, not a choice axiom.
Unitary conjugation map
Definition
Let be nonzero finite-dimensional (have finite bases by Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis) complex inner-product spaces of equal dimension. We call a surjective linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces) a unitary map between these spaces. By Finite-dimensional linear isometries satisfy the adjoint identity, its adjoint exists uniquely, , and . Define the unitary conjugation map Here and are the complex-linear endomorphism spaces (Linear map between vector spaces over the same field). It is well-defined because the composition is , and it is complex-linear in .
Trace preservation is Kraus normalization
Statement
Let be finite-dimensional complex inner-product spaces and let be a finite Kraus representation, where each . The map is trace-preserving on all of , meaning for every , if and only if
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , a finite family , and the indicated Kraus formula for every .
Finite Kraus representation: a finite Kraus representation satisfies on every input operator.
For and , : for and , , including zero dimensions.
Trace is a linear functional on : trace is linear over finite sums.
The trace pairing on a finite endomorphism space is nondegenerate: if for every , then , including .
Proof
Put . For every , [F1], trace linearity [F3], and rectangular cyclicity [F2] give . If , this equals for every , so is trace-preserving by the Statement. This includes an empty family when , where .
Conversely, suppose is trace-preserving on all of . The identity in step 1.1 gives for every . Apply [F4] with to obtain . Thus the normalization holds. In particular, if both sides are the unique zero endomorphism and the argument still applies.
Unitary conjugation is invariant under a global phase
Statement
Let be nonzero finite-dimensional complex inner-product spaces of equal dimension, let be a unitary map, and let satisfy . Then is unitary and This equality concerns conjugation by a single unitary. It makes no assertion about controlled uses, where a scalar on one control branch may be a relative phase.
Facts & Assumptions
Given: Nonzero finite-dimensional complex inner-product spaces , a surjective linear isometry , and a scalar with .
Unitary conjugation map: a unitary map is a surjective linear isometry, and .
Finite-dimensional linear isometries satisfy the adjoint identity: every surjective linear isometry between finite-dimensional spaces satisfies both adjoint identities.
Proof
For each , [F2] and give . The map is surjective: for any , choose with , then . Hence is a surjective linear isometry and is unitary by [F1]; [F4] supplies its adjoint identities.
For every , [F1] and [F3] give . This holds on every input operator, so the maps are equal. The proof concerns only a single conjugation map and yields no controlled-operation identity.
Choi matrix with input factor first
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), and fix an ordered orthonormal basis of (the register basis convention is in Finite registers and their ordered computational bases). For , let be the matrix unit, where denotes the complex-linear endomorphisms (Linear map between vector spaces over the same field), , using the root inner product convention that the first argument is linear. Given a complex-linear map (Linear map between vector spaces over the same field), its Choi matrix relative to is
where the operator tensor is the tensor map of Tensor products of finitely many linear maps and the tensor inner product is the finite product pairing in Ordered tensor registers, their inner product, and wire permutations.
The tensor factors are ordered input first and output second. The coordinate matrix has size . The chosen input basis is part of this definition. If the input basis is empty, the displayed sum is empty; if , each summand is zero and is the unique endomorphism of the zero-dimensional tensor product.
Isometric Stinespring 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), and let be a linear isometry (Linear isometries, and orthogonal or unitary operators on finite-dimensional inner product spaces), so by Finite-dimensional linear isometries satisfy the adjoint identity. The map
is the isometric Stinespring form associated with . An isometric Stinespring representation (Linear map between vector spaces over the same field) of is such a formula, where is the finite partial trace (Partial trace over a finite tensor factor) under the tensor convention Ordered tensor registers, their inner product, and wire permutations, together with its chosen finite environment and isometry . The composition is an endomorphism of , and the partial trace maps it linearly to an endomorphism of . Thus the displayed formula defines a complex-linear map on the full input operator space. This definition makes no existence assertion for an arbitrary map.
Tensor products of operator matrix units form a basis
Statement
Let 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 with ordered orthonormal bases and . For and define and . Then is a basis of . Empty dimensions give the empty basis of the zero endomorphism space. The root pairing is linear in its first argument, so the displayed matrix-unit maps are linear.
Facts & Assumptions
Given: The finite-dimensional spaces, their ordered orthonormal bases, and the matrix-unit maps in the Statement.
Ordered tensor registers, their inner product, and wire permutations: the tensor product has its ordered product basis and product inner product.
The product basis is orthonormal and tensor dimensions multiply: the product basis is orthonormal, spans, and has dimension , including zero factors.
Tensor products of finitely many linear maps: the tensor of linear maps is the unique linear extension of its action on elementary tensors.
Coordinate columns and matrices of linear maps relative to ordered bases and A finite list is an ordered basis if and only if every equals for exactly one ; those scalars are the coordinates of in that ordered basis: an endomorphism is determined by its coordinate columns on an ordered basis.
Proof
For a product basis vector , [F3] gives when and , and gives otherwise, by orthonormality in [F1]. Thus each tensor matrix unit has a single coordinate and zeros elsewhere in the product basis.
Every endomorphism of has a unique coordinate coefficient for the image of each product basis vector . The finite sum has the same image as on each such basis vector by step 1.1; [F4] therefore makes it equal to . The same coordinate entries show that this expression is unique. If or , the product space is zero by [F2] and both the basis and sum are empty.
A positive Choi matrix yields finite Kraus operators
Statement
Let be finite-dimensional complex inner-product spaces, let be an ordered orthonormal basis of , and let be complex-linear. If is non-negative, then has a finite Kraus representation with at most operators.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an ordered orthonormal basis of , a complex-linear map , and .
A non-negative operator is equivalently self-adjoint with nonnegative eigenvalues, a positive semidefinite matrix in an orthonormal basis, or an operator of the form S^*S: a non-negative finite-dimensional operator has an orthonormal eigenbasis with non-negative real eigenvalues.
A non-negative operator has a unique non-negative square root: a non-negative finite-dimensional operator has a non-negative square root with .
Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional and admit ordered orthonormal bases, including empty bases when a space is zero.
Coordinate columns and matrices of linear maps relative to ordered bases: a linear map is determined by its coordinate columns on an ordered basis.
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: matrix products are row-by-column finite sums, including zero-sized shapes.
In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix: in orthonormal bases, the matrix of an adjoint is the conjugate transpose.
The product basis is orthonormal and tensor dimensions multiply: the product basis is orthonormal and has size , including zero-dimensional factors.
Choi matrix with input factor first (same-page definition): in the input-first product basis, .
Finite Kraus representation (same-page definition): a Kraus representation is a finite family of maps with for every .
Proof
If or , the input or output operator space is zero, so and the empty family is a Kraus representation. Assume both dimensions are positive and choose an ordered orthonormal basis of by [F3]. If , its product-basis entry is the entry of by [L1], so every . For each , the finite sum whose coordinate entries are those of agrees with on each ; [F4] therefore makes it equal to . Thus and the empty family works also in this case.
Suppose . Let be its non-negative square root from [F2]. By [F1], choose an orthonormal eigenbasis of with eigenvalues . Then . For each with , put and write . Define the linear map on the basis by .
For every and , the entry of [L1] is . The entry of is , which is the same sum because by construction and [F6] gives the conjugate-transpose matrix of . Therefore for every matrix unit.
Every is the finite coordinate combination established in step 1.1. By linearity, step 2.1 therefore gives for every . There are at most retained operators because the eigenbasis of has elements; when the empty family was handled in step 1.1. This is a finite Kraus representation by [L2].
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.
Complete positivity implies Choi positivity
Statement
Let and be finite-dimensional complex inner-product spaces, fix an ordered orthonormal basis of , and let be completely positive. Then is non-negative.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an ordered orthonormal basis of , and a completely positive linear map .
Non-negative and positive operators: an endomorphism is non-negative when it is self-adjoint and its quadratic form is non-negative.
Every finite-dimensional real or complex inner product space has an orthonormal basis: each finite-dimensional inner-product space has an ordered orthonormal basis, including the empty basis in dimension zero.
Finite-dimensional vector space, and its dimension ; infinite-dimensional means having no finite basis: a space of dimension zero is the zero space.
The adjoint is characterised by and Adjoints satisfy , , , and : adjoints satisfy their defining pairing identity, , and for compatible finite-dimensional maps.
The standard formulas on and on are inner products: the standard basis of is orthonormal for its standard coordinate inner product.
Finite-dimensional linear isometries satisfy the adjoint identity: a surjective linear isometry between finite-dimensional complex inner-product spaces satisfies and .
Completely positive maps: for each integer , the block amplification sends non-negative operators on to non-negative operators on .
Ordered tensor registers, their inner product, and wire permutations and The product basis is orthonormal and tensor dimensions multiply: the product basis is ordered with the displayed factor order and is orthonormal.
Tensor products of finitely many linear maps: on elementary tensors, an operator tensor acts by applying its first and second factor maps to their respective factors.
Choi matrix with input factor first: , input factor first and output factor second, with .
Proof
If , [F3] makes the Choi sum empty. If , the output operator space contains only the zero map, so every . In either case is non-negative. Assume now both spaces are nonzero, write , let have its standard orthonormal basis by [F5], and set . Define . The root pairing is linear in its first argument, so is linear. For all , , and . Thus is non-negative by [F1].
For , let be the matrix unit for and . On the product basis , the product pairing gives if , and . The same action is given by , so by [A2] and [A3]. The -blocks of are therefore ; the actual block rule in [A1] gives the non-negative operator on .
Choose an ordered orthonormal basis of by [F2]. By [A2], both and are orthonormal bases. Let be the linear map sending to . This bijection of orthonormal bases is a surjective linear isometry; [F6] gives and . Applying the map and its inverse to product basis vectors shows for each . Hence by [L1].
By [F4], is self-adjoint because is self-adjoint. For every , the adjoint identity gives , since is non-negative. Therefore is non-negative.
A finite Kraus sum is completely positive
Statement
Let be finite-dimensional complex inner-product spaces and let have a finite Kraus representation . Then is completely positive.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , a finite family of linear maps , and the Kraus formula for .
Non-negative and positive operators: an endomorphism is non-negative when it is self-adjoint and its quadratic form is non-negative.
The adjoint is characterised by and Adjoints satisfy , , , and : adjoints satisfy the defining pairing identity and reverse compatible compositions.
The standard formulas on and on are inner products: the standard basis of is orthonormal.
Coordinate columns and matrices of linear maps relative to ordered bases: an operator is determined by its coordinate columns on an ordered basis.
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: matrices are multiplied by finite row-by-column sums, including zero-sized shapes.
Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional complex inner-product spaces admit ordered orthonormal bases, with the empty basis in dimension zero.
Finite Kraus representation (same-page definition): for every .
Completely positive maps: for every , the block amplification on sends non-negative operators to non-negative operators on .
Ordered tensor registers, their inner product, and wire permutations and The product basis is orthonormal and tensor dimensions multiply: ordered orthonormal bases of the factors give ordered orthonormal product bases of and .
Tensor products of finitely many linear maps: tensor maps act on elementary tensors by applying factor maps in the displayed order.
Tensor maps preserve composition, identities, and adjoints: tensor maps preserve composition and .
Proof
Fix and put with its standard ordered basis , the basis used for the block amplification in [A1]. Choose ordered orthonormal bases of and of by [F6], allowing an empty basis. If , the domain is zero and the identity below holds for its sole operator. Otherwise let be the matrix units of in the basis and let be the matrix units of in its standard basis . By [A2], is a basis; the operators are its matrix units, so they span by [F4] and [F5]. For such a product matrix unit, its only nonzero ancilla block is block , equal to . The block rule in [A1] therefore gives . On the other hand, [A3], [A4], and [L1] give . By linearity the two maps agree for every .
Let be non-negative and put . Each is self-adjoint because by [F2]. For every , the adjoint identity in [F2] gives by [F1]. Thus each summand and their finite sum are non-negative. If is empty, the sum is zero and has the same property.
Since was arbitrary, [A1] and step 2.1 show that every finite ancilla block amplification preserves non-negativity. This is precisely complete positivity by [A1].
An isometry followed by partial trace is a channel
Statement
Let be finite-dimensional complex inner-product spaces and let be a linear isometry. Then is a quantum channel from to .
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces and a linear isometry .
Isometric Stinespring representation: the represented map is and the isometry satisfies by Finite-dimensional linear isometries satisfy the adjoint identity.
Ordered tensor registers, their inner product, and wire permutations and The product basis is orthonormal and tensor dimensions multiply: if and are orthonormal bases of and , then is an orthonormal basis of with the displayed factor order.
Partial trace over a finite tensor factor and The partial trace is characterized by the trace pairing and is basis-independent: for any such output and environment bases, .
The adjoint is characterised by , Every linear map between finite-dimensional inner product spaces has a unique adjoint, and Adjoints satisfy , , , and : finite-dimensional adjoints exist uniquely, obey their defining pairing identity, and reverse compatible compositions.
Inner products separate vectors, and the induced norm is homogeneous: : inner-product pairings separate vectors.
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
For and , : for compatible rectangular maps, the traces of the two products agree.
Trace is a linear functional on : trace is linear over finite sums.
Finite-dimensional quantum channel: a channel is a complex-linear completely positive map that preserves trace on every input operator.
Proof
Choose ordered orthonormal bases of and of by finite-dimensional orthonormal-basis existence. For each , define the linear map on the product basis by if and otherwise. Its adjoint satisfies : both sides have the same pairing with every product basis vector by [F2] and [F4]. Linearity extends the equality of pairings to every first argument, and [F5] then makes the vectors equal. For any , the entry of is , which is the defining coordinate of by [F3]. Thus .
Put . By [F4], . Substituting into step 1.1 gives for every . This is a finite Kraus representation, so [F6] makes completely positive.
On each product basis vector , the sum acts as the identity; hence . By [F4] and [F1], . Rectangular trace cyclicity [F7] and trace linearity [F8] then give, for every , . The complete positivity from step 2.1 and this trace identity are exactly the channel conditions [F9]. Empty bases and sums give the same identities when ; the isometry equation then forces .
Kraus and Choi characterizations of complete positivity
Statement
Let be finite-dimensional complex inner-product spaces, fix an ordered orthonormal basis of , and let be complex-linear. The following are equivalent: is completely positive; is non-negative; and has a finite Kraus representation.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an ordered orthonormal input basis , and a complex-linear map between their endomorphism spaces.
Complete positivity implies Choi positivity (same-page result): complete positivity implies .
A positive Choi matrix yields finite Kraus operators (same-page result): implies a finite Kraus representation.
A finite Kraus sum is completely positive (same-page result): a finite Kraus representation implies complete positivity.
Completely positive maps: complete positivity is the positivity-preserving property of every finite ancillary block amplification.
Choi matrix with input factor first (same-page definition): the Choi convention is , input factor first and output factor second.
Finite Kraus representation (same-page definition): a finite family represents when for every .
Proof
Suppose is completely positive. By [F1], its Choi matrix is non-negative. Suppose instead that its Choi matrix is non-negative. By [F2], has a finite Kraus representation. These give the first two implications in the cycle.
If has a finite Kraus representation in the sense of [L2], [F3] implies that is completely positive. This closes the cycle, so each of the three stated conditions implies the other two. All statements use the same fixed input basis and the input-first/output-second Choi convention of [L1].
Unitary conjugation is a channel
Statement
Let be nonzero finite-dimensional complex inner-product spaces and let be a unitary map. Then is a channel. For any nonzero finite-dimensional complex inner-product space and unitary map , ; the inverse channel to is .
Facts & Assumptions
Given: The finite-dimensional spaces and unitary maps specified in the Statement.
Unitary conjugation map: , and a unitary map is a surjective linear isometry satisfying and .
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
Trace preservation is Kraus normalization: a Kraus map is trace-preserving exactly when its adjoint-square sum is the input identity.
Finite-dimensional quantum channel: a channel is completely positive and trace-preserving on all input operators.
Adjoints satisfy , , , and : adjoints reverse compositions.
Proof
The single-operator family is a Kraus representation of by [F1]. Hence the map is completely positive by [F2]; its adjoint-square sum is by [F1], so it is trace-preserving by [F3]. It is a channel by [F4].
The composite is surjective and norm-preserving because both and are; hence is a unitary map by [F1]. For every , [F1] and [F5] give . Thus . Also is a unitary map: for , [F1] gives , so preserves norms, and it is onto because . Applying the composition identity to and in both orders shows that is a two-sided inverse. It is a channel by step 1.1 applied to .
Finite-dimensional channels compose and tensor
Statement
Let and be finite-dimensional quantum channels. Then is a channel. If is another finite-dimensional channel, the tensor map is the linear map specified on product matrix units by . The basis result Tensor products of operator matrix units form a basis makes this map well-defined and unique. It is also a channel, with the displayed factor order.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces and channels with the domains and codomains in the Statement.
Finite-dimensional quantum channel: each channel is completely positive and trace-preserving.
Kraus and Choi characterizations of complete positivity: every completely positive map has a finite Kraus representation.
Trace preservation is Kraus normalization: a Kraus representation is trace-preserving exactly when its adjoint-square sum is the identity.
A finite Kraus sum is completely positive: every finite Kraus sum is completely positive.
Finite Kraus representation: the family represents when , and likewise for the other maps.
Tensor products of finitely many linear maps: tensor maps act on elementary tensors by applying the factor maps in order.
Tensor maps preserve composition, identities, and adjoints: tensor maps preserve composition and identities, and the tensor adjoint is the tensor of the adjoints.
Tensor products of operator matrix units form a basis: the product matrix units form a basis of each operator space on a tensor product.
Adjoints satisfy , , , and : for compatible maps, the adjoint reverses composition, so .
Proof
By [F1] and [F2], choose finite Kraus families for and for . By [F9], for each , so for every , . Thus the composite has a finite Kraus representation and is completely positive by [F4]. By [F1] and [F3], and . Therefore . By [F3] the composite is trace-preserving, hence a channel by [F1].
By [F1] and [F2], choose finite Kraus families and for and . For any product matrix unit , [F6] and [F7] give by the definition in the Statement. By [F8] these product matrix units form a basis of ; linearity therefore gives a finite Kraus representation of on every input operator. Hence this tensor map is completely positive by [F4].
By [F1] and [F3], and . Using [F7], . Thus [F3] makes the tensor map trace-preserving, and [F4] gives complete positivity; it is a channel by [F1]. Empty Kraus families are covered: their normalization equals the input identity only when that input space is zero, where all displayed sums and identities are empty or zero.
The Choi partial trace characterizes trace preservation
Statement
Let be finite-dimensional complex inner-product spaces, fix an ordered orthonormal basis of , and let be completely positive. Then for every if and only if where is the partial trace over the output factor in the input-first/output-second Choi convention.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an ordered orthonormal input basis , and a completely positive complex-linear map .
Kraus and Choi characterizations of complete positivity: complete positivity gives a finite Kraus representation of .
Trace preservation is Kraus normalization: for such a Kraus representation, trace preservation on every input is equivalent to .
Choi matrix with input factor first: , with input factor first and .
Partial trace over a finite tensor factor and The partial trace is characterized by the trace pairing and is basis-independent: the partial trace over is basis-independent and in a product orthonormal basis its entry is .
Coordinate columns and matrices of linear maps relative to ordered bases and Rectangular matrix multiplication and the identity matrix , including zero-sized shapes: matrix entries are the coefficients on basis vectors, and the identity has entries .
Every finite-dimensional real or complex inner product space has an orthonormal basis: finite-dimensional admits an ordered orthonormal basis, including the empty basis when .
In orthonormal bases, the matrix of the adjoint is the conjugate transpose of the matrix: in the chosen orthonormal bases, .
Proof
By [F1], choose a finite Kraus family for , and put . Choose an ordered orthonormal basis of . The entry of [F3] is the entry of , which by the Kraus formula is using the adjoint matrix formula. Taking the partial trace in [F4] therefore gives . Thus . If is trace-preserving on all input operators, [F2] gives ; then and the partial trace equals .
Conversely, suppose . By the entry formula in step 1.1 and uniqueness of matrix entries [F5], for every , hence . By [F2], this is exactly trace preservation on every input. If , both sides are the unique zero endomorphism and trace preservation is vacuous. If and , the partial trace and are zero while , so neither condition holds.
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.
Finite channel, Kraus, Choi, and Stinespring equivalence
Statement
Let be finite-dimensional complex inner-product spaces, fix an ordered orthonormal basis of , and let be complex-linear. The following four conditions are equivalent:
- is a quantum channel.
- and .
- for a finite family of maps with .
- There are a finite-dimensional and an isometry with for every .
The Choi order is input factor first, output factor second.
Facts & Assumptions
Given: Finite-dimensional complex inner-product spaces , an ordered orthonormal basis of , and a complex-linear map .
Finite-dimensional quantum channel (same-page definition): condition 1 means complete positivity and trace preservation.
Kraus and Choi characterizations of complete positivity (same-page theorem): complete positivity is equivalent to Choi non-negativity and to existence of a finite Kraus representation.
Trace preservation is Kraus normalization (same-page theorem): trace preservation of a Kraus map is equivalent to .
The Choi partial trace characterizes trace preservation (same-page theorem): for a completely positive , trace preservation is equivalent to .
Every finite-dimensional channel has a finite isometric dilation (same-page theorem): every finite-dimensional channel has an isometric Stinespring representation.
An isometry followed by partial trace is a channel (same-page theorem): every isometric Stinespring form is a channel.
Choi matrix with input factor first (same-page definition): uses the fixed input basis and input-first/output-second tensor convention.
Isometric Stinespring representation (same-page definition): an isometric dilation has the displayed partial-trace form.
Proof
Condition 1 implies condition 2: its complete-positivity part and [F2] give , while its trace-preservation part and [F4] give . Conversely, condition 2 gives complete positivity by [F2] and trace preservation by [F4], hence condition 1 by [F1].
Conditions 1 and 3 are equivalent: by [F2], condition 1's complete positivity is equivalent to a finite Kraus representation, and by [F3] its trace-preservation clause is equivalent to the stated normalization. The same two results show condition 3 implies both clauses of condition 1.
By [F5], condition 1 implies condition 4. By [F6], condition 4 implies condition 1. Thus condition 4 is equivalent to condition 1.
Steps 1.1, 1.2, and 1.3 connect each of conditions 2, 3, and 4 to condition 1 in both directions, so all four conditions are equivalent. Throughout, the Choi factor order remains the one in [L1], and the environment occupies the second factor of in [L2].
5 · Examples, counterexamples and false statements
None yet.
Sources
- John Watrous, The Theory of Quantum Information (2018), §2.2.2
- John Preskill, Quantum Computation, Chapter 3, §3.2.1
- John Watrous, The Theory of Quantum Information (2018), Theorem 2.22
- John Preskill, Quantum Computation, Chapter 3, §3.3.2
- John Watrous, The Theory of Quantum Information (2018), §2.2.1
- John Watrous, The Theory of Quantum Information (2018), Theorem 2.26
- John Watrous, The Theory of Quantum Information (2018), §2.2.1–2.2.2
- John Preskill, Quantum Computation, Chapter 3, §§3.3.1–3.3.2
- John Watrous, The Theory of Quantum Information (2018), §2.2.1–2.2.3
- John Preskill, Quantum Computation, Chapter 3, §§3.2.1 and 3.2.6
- John Preskill, Quantum Computation, Chapter 3, §§3.2.6 and 3.3.1
- John Preskill, Quantum Computation, Chapter 3, §§3.2.6 and 3.3.1–3.3.2
- John Watrous, The Theory of Quantum Information (2018), §§2.2.1–2.2.3
- John Preskill, Quantum Computation, Chapter 3, §§3.2–3.3
- John Watrous, The Theory of Quantum Information (2018), Theorem 2.26 and Corollary 2.27
- John Watrous, The Theory of Quantum Information (2018), §§2.2.2–2.2.3
- John Preskill, Quantum Computation, Chapter 3, §§3.2.6–3.3.2