Kraus Representation Theorem in Quantum Channels

• Kraus Representation Theorem is a framework that defines CPTP maps as sums of Kraus operators satisfying completeness relations.
• It provides a systematic method for deriving quantum channels through unitary dilations and environment trace-outs, key for understanding decoherence.
• Generalizations extend its applicability to infinite-dimensional and hybrid classical–quantum systems, enabling efficient algorithmic parametrizations.

The Kraus Representation Theorem provides the canonical structure of completely positive, trace-preserving (CPTP) linear maps—known as quantum channels—on operator algebras. These evolution maps govern the dynamics of open quantum systems, parameterize quantum operations, and underpin both foundational theory and statistical learning frameworks in contexts from quantum information to classical-quantum hybrid models. The theorem asserts that any CPTP map can be represented by a countable family of bounded operators (Kraus operators), subject to completeness relations. Its generalizations accommodate infinite dimensions, hybrid probabilistic structures, and serve as the basis for efficient algorithmic parameterizations.

1. Structural Statement and Derivation

Consider Hilbert spaces $\mathcal{H}_S$ (system) and $\mathcal{H}_E$ (environment), with $\dim(\mathcal{H}_S)=d_S$, $\dim(\mathcal{H}_E)=d_E$. Suppose the joint initial state is uncorrelated: $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$, and evolves unitarily under $U(t)$: $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$ The reduced system state at time $t$ is: $$\rho_S(t) = \operatorname{Tr}_E\left[U(t)\left(\rho_S(0)\otimes|E_0\rangle\langle E_0|\right)U^\dagger(t)\right]$$ The Kraus Representation Theorem asserts that $\rho_S(t)$ admits the operator-sum form

$\mathcal{H}_E$0

where $\mathcal{H}_E$1: $\mathcal{H}_E$2, constructed as $\mathcal{H}_E$3 for any orthonormal basis $\mathcal{H}_E$4 of $\mathcal{H}_E$5. The completeness relation $\mathcal{H}_E$6 guarantees trace preservation. This operator-sum form generalizes to any finite-dimensional CPTP map, and the minimal number of Kraus operators ("Kraus rank") is bounded above by $\mathcal{H}_E$7 (Maziero, 2015).

2. Operator-Sum Structure and Complete Positivity

Let $\mathcal{H}_E$8 and $\mathcal{H}_E$9 be operator systems. A linear map $\dim(\mathcal{H}_S)=d_S$0 is called completely positive (CP) if its ampliations $\dim(\mathcal{H}_S)=d_S$1 are positive for all $\dim(\mathcal{H}_S)=d_S$2. The Kraus Representation Theorem for CP maps states: $\dim(\mathcal{H}_S)=d_S$3 for (possibly infinite) $\dim(\mathcal{H}_S)=d_S$4. For trace-preservation, $\dim(\mathcal{H}_S)=d_S$5 holds, with strong operator convergence in infinite dimensions (Ende, 2023, Tian, 29 Nov 2025). The theorem is both necessary and sufficient: any finite-sum of this form is CP, and every CP map admits a Kraus decomposition.

A table summarizing the core correspondence:

Property	Mathematical Formulation	Kraus Representation Criterion
Complete positivity (CP)	$\dim(\mathcal{H}_S)=d_S$6 is positive	Exists $\dim(\mathcal{H}_S)=d_S$7 with $\dim(\mathcal{H}_S)=d_S$8
Trace preservation (TP)	$\dim(\mathcal{H}_S)=d_S$9	$\dim(\mathcal{H}_E)=d_E$0
Minimal number of Kraus operators (rank)	$\dim(\mathcal{H}_E)=d_E$1, $\dim(\mathcal{H}_E)=d_E$2 Choi	$\dim(\mathcal{H}_E)=d_E$3

This characterization is foundational in quantum information theory and is exploited in statistical learning to parametrize the entire CP family by a finite set of matrix-valued parameters (Kadri et al., 2020).

3. Construction Methods and Unitary Dilations

Multiple approaches yield the Kraus representation:

• System–environment Unitary Picture: Kraus operators are obtained by tracing out the environment after a joint unitary evolution, as above (Maziero, 2015).
• Stinespring Dilation: CP maps are factorized as

$\dim(\mathcal{H}_E)=d_E$4

where $\dim(\mathcal{H}_E)=d_E$5 is a unitary on system + environment and $\dim(\mathcal{H}_E)=d_E$6 is a fixed pure state. Via orthonormal decomposition, projecting onto an environment basis recovers the operator-sum form (Ende, 2023).

• Kernel-Theoretic Construction: By constructing reproducing kernel Hilbert spaces (RKHS) from scalar positive-definite kernels $\dim(\mathcal{H}_E)=d_E$7, the existence of a minimal Stinespring dilation $\dim(\mathcal{H}_E)=d_E$8 and operator $\dim(\mathcal{H}_E)=d_E$9 yields the canonical Kraus decomposition through a tensor structure with the ancillary space (Tian, 29 Nov 2025).
• Sz.-Nagy Dilation: For infinite-dimensional systems, Sz.-Nagy’s dilation theorem extends partial isometries arising from Kraus families to explicit unitaries on an enlarged Hilbert space, yielding a fully explicit unitary realization of any CP map (Ende, 2023).

Comparative analysis between constructions (standard finite-dimensional, Hellwig-Kraus, Sz.-Nagy) demonstrates differences in auxiliary space dimension and technical details, but all instantiate the same structural theorem.

4. Minimality, Choi Matrix, and Variants

The Choi isomorphism gives a matrix bijectively associated to any linear map $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$0 via $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$1. Complete positivity is equivalent to $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$2, and the minimal Kraus rank is $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$3 (Kadri et al., 2020, Tian, 29 Nov 2025). The family of Kraus operators is not unique: any set $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$4 related by $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$5 for a unitary $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$6 yields the same channel, reflecting the redundancy in the operator-sum representation.

In the kernel-theoretic formulation, the dimension of the ancillary RKHS sets the minimal Kraus index set, and any other minimal family is obtained by isometric rotation in the ancilla space (Tian, 29 Nov 2025).

5. Illustrative Example: Amplitude-Damping Channel

A standard application considers a two-level atom (qubit) undergoing amplitude damping via coupling to a vacuum field: $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$7 with $$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$8 depending on time. The Kraus operators are

$$\rho_{SE}(0)=\rho_S(0)\otimes|E_0\rangle\langle E_0|$$9

and the atomic state evolution becomes

$U(t)$0

This yields an explicit illustration of decoherence: off-diagonal coherences decay as $U(t)$1, and a basis-dependent coherence measure $U(t)$2 (Maziero, 2015).

6. Generalizations: Hybrid Classical–Quantum Systems

For hybrid systems—jointly governed by classical and quantum degrees of freedom—Kraus-type theorems require lifting the notion of CP and state space. A hybrid state $U(t)$3 (joint probability measure on classical events $U(t)$4 and quantum effects $U(t)$5) with a reference measure $U(t)$6 admits a density-operator-valued function $U(t)$7. A hybrid operation $U(t)$8 subject to continuity and a generalized CP condition (formulated with respect to classical partitions and quantum ancillas) is characterized by a Kraus-type expansion using hybrid kernels (Camalet, 2024): $U(t)$9 In the purely quantum limit ($$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$0 a point), this reduces to the standard Kraus representation. Specialization to the discrete-classical case yields a finite sum over $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$1, $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$2 (Camalet, 2024).

Continuity in trace-norm and separability conditions are required for existence and extension of this form to general (possibly infinite-dimensional) settings. Such hybrid generalized Kraus theorems extend the applicability of operator-sum structure to evolutions and operations in hybrid probabilistic contexts.

7. Applications, Learning, and Statistical Implications

The operator-sum (Kraus) parameterization underlies quantum dynamical maps, error modeling, decoherence, and quantum feedback protocols. In data-driven settings, parameterizing CP maps by low Kraus rank enables efficient learning and regularization of regression-like models mapping $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$3 between matrix domains. The Kraus decomposition is exploited algorithmically: empirical minimization over $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$4 operator parameters balances accuracy and complexity, with risk bounds and pseudo-dimension scaling directly with $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$5, and $$\rho_{SE}(t) = U(t)\left[\rho_S(0)\otimes|E_0\rangle\langle E_0|\right]U^\dagger(t)$$6 (Kadri et al., 2020).

In kernel approaches, the entire Stinespring–and hence Kraus–dilation can be realized through manipulations in reproducing kernel Hilbert spaces, bypassing explicit representations and exploiting positivity at the scalar level (Tian, 29 Nov 2025).

The Kraus theorem is thus both structurally ubiquitous in the analysis of open quantum systems and central to the practical design and identification of quantum operations in a variety of theoretical and applied domains.