Kraus Decomposition for Quantum Channels

• Kraus Decomposition is a canonical representation of completely positive trace-preserving maps that defines quantum state evolutions.
• It uses an operator-sum formulation to model both noisy and unitary dynamics, crucial for understanding decoherence in open systems.
• Its applications extend to quantum process tomography, low-rank learning, and novel areas like geometric and knowledge embedding techniques.

The Kraus decomposition, also known as the operator-sum representation, is a fundamental structural result in quantum information theory and the theory of open quantum systems. It provides a canonical form for all linear maps that are completely positive and trace-preserving (CPTP), describing the most general evolution—both noisy and unitary—that a quantum state may undergo due to its interaction with an environment. This decomposition reveals not only the structure of physical quantum channels but also underpins a wide array of techniques across quantum physics, information processing, statistical learning, and emerging applications in geometry and representation theory.

1. Mathematical Definition and Derivation

Every CPTP map $\mathcal{E}$ between operator spaces $\Omega_n$ on a finite-dimensional Hilbert space can be written in the Kraus (operator-sum) form: $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$ Here $\rho$ is a density operator, $K_i$ are "Kraus operators" ($K_i \in \mathbb{C}^{n \times n}$), and $r \leq n^2$ is the Kraus rank, minimized to match the rank of the corresponding Choi matrix (Miszczak, 2010, Maziero, 2015).

Starting from a joint system-environment unitary evolution $U$ acting on $\mathcal{H}_S \otimes \mathcal{H}_E$ and an initial uncorrelated state $\rho_S(0) \otimes \rho_E$, the reduced system state at time $\Omega_n$0 is: $\Omega_n$1 Kraus operators $\Omega_n$2 are constructed from matrix elements of $\Omega_n$3—for instance, $\Omega_n$4 for suitable system and environment bases (Maziero, 2015, Miszczak, 2010).

2. Fundamental Properties and Non-Uniqueness

The Kraus decomposition guarantees three essential properties for quantum channels:

• Linearity: Each $\Omega_n$5 is linear; the map $\Omega_n$6 is linear as a result.
• Complete Positivity: For any extended Hilbert space and any positive semidefinite input, $\Omega_n$7 maps positive semidefinite operators to positive semidefinite operators.
• Trace Preservation: $\Omega_n$8 ensures $\Omega_n$9 for any $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$0.

The Kraus representation is non-unique: alternative sets $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$1 connected by unitary rotations ($$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$2 for unitary $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$3) describe the same channel. The minimal Kraus rank equals the rank of the Choi matrix of the map (Miszczak, 2010, Maziero, 2015).

For any CPTP map on dimension $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$4, the minimal number of required Kraus operators is bounded above by $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$5 (Maziero, 2015).

3. Explicit Construction and Examples

Canonical construction of the Kraus decomposition utilizes the Choi-Jamiolkowski isomorphism. Given a channel $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$6, the Choi matrix $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$7 is obtained by reshaping the superoperator or by applying $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$8 to a maximally entangled state. Its spectral decomposition $$\mathcal{E}(\rho) = \sum_{i=1}^r K_i \, \rho \, K_i^\dagger , \qquad \sum_{i=1}^r K_i^\dagger K_i = I .$$9 yields Kraus operators via unvectorization: $\rho$0 This construction allows for systematic calculation and composition of channels (Miszczak, 2010).

Prototype: Amplitude-Damping Channel

A two-level atom (qubit) coupled to the vacuum electromagnetic field realizes an amplitude-damping channel with Kraus operators

$\rho$1

These satisfy $\rho$2 (Maziero, 2015).

Microscopic Derivation: Generalized Depolarizing Channel

From a full open-system Hamiltonian and microscopic Lindblad equation, physically motivated generalized Kraus operators emerge, capturing both anisotropies and Lamb-shift-induced coherent rotations, refining the standard depolarizing-channel model (Arsenijevic et al., 2015).

Non-Markovian Kraus Expansions

In non-Markovian settings, especially with reservoir-induced memory effects, the Kraus map becomes infinite, indexed by interaction order, and can be constructed via time-ordered expansions and continued-fraction solutions in Laplace space (Wonderen et al., 2018).

4. Constraints, Reduction, and Resource Theories

The structure and number of Kraus operators are crucial in specialized resource theories. For incoherent operations (IO) and strictly incoherent operations (SIO), further criteria are imposed: each $\rho$3 maps incoherent states to incoherent states (in IO), and both $\rho$4 and $\rho$5 preserve incoherence (in SIO). Recent results refine the maximal number of required incoherent Kraus operators: four suffices for qubits (improving upon the prior five), and 32 for single qutrit IO (from 39); SIO for qutrits can be realized with 13 Kraus operators (from 15). These reductions simplify state-transformation characterizations and have practical implications for quantum coherence manipulation (Qiao et al., 2020).

Scenario	Previous Bound	Improved Bound	Reference
Qubit IO	5	4	(Qiao et al., 2020)
Qutrit IO	39	32	(Qiao et al., 2020)
Qutrit SIO	15	13	(Qiao et al., 2020)

5. Computational, Learning, and Tomographic Aspects

The Kraus decomposition underpins both theoretical and operational approaches to quantum process identification:

• Quantum Process Tomography (QPT): Rather than reconstructing a full $\rho$6 Choi matrix, low-rank Kraus ansatzes directly optimize a physically admissible set of $\rho$7 operators, employing Riemannian gradient descent on the Stiefel manifold. This approach guarantees CPTP structure at every iteration, scales to larger systems than standard semidefinite programming, and handles compressed (informationally incomplete) measurement sets accurately (Ahmed et al., 2022).
• Low-Rank Learning: In regression or matrix completion contexts, models that respect Kraus structure—expressing a map $\rho$8—can be learned efficiently via SGD or block coordinate descent. Generalization is characterized via a pseudo-dimension bound depending on the Kraus rank $\rho$9, and stacking layers maintains the complete-positivity and structure of the learned map (Kadri et al., 2020).

Application	Kraus Role	Algorithmic Features	Reference
Quantum process ID	Parameterization, exact CP	Gradient descent on Stiefel manifold	(Ahmed et al., 2022)
Matrix regression	Low-rank CP map	SGD, backprop, generalization bound	(Kadri et al., 2020)

6. Generalizations and Emerging Applications

Recent trends extend the formalism beyond standard quantum information:

• Geometric and Representation-Theoretic Extensions: The w-Kraus decomposition generalizes the Kraus form to arbitrary quadratic geometries (elliptic, Lorentzian, etc.), with completeness constraints reflecting the appropriate inner product and positivity notion (Chaki, 11 May 2026).
• Knowledge Embedding Models: Relations in (e.g.) knowledge-graph embedding are modeled as CPTP maps whose structure is dictated by three axioms: linearity, trace preservation, and complete positivity. The Kraus decomposition is then inevitable, and Kraus rank provides a natural per-relation complexity measure. Closure under composition (multi-hop reasoning) and handling of high-fan-out relations are guaranteed by the CPTP structure (Chaki, 11 May 2026).

Generalization	Key Principle	Structure/Constraint	Reference
w-Kraus (geometry)	CPTP in arbitrary geometry	$K_i$0	(Chaki, 11 May 2026)
Knowledge graph	CPTP channel for relations	Completeness $K_i$1	(Chaki, 11 May 2026)

7. Computational Methods and Automation

Canonical methods for obtaining Kraus decompositions from superoperators or Choi matrices are well developed. Standard practice involves vectorization (column-stacking), reshuffling (mapping between process and Choi representations), and singular value (Schmidt) decomposition. Automation of these procedures is available via platforms such as Mathematica, allowing symbolic and numerical calculations for arbitrary channels and composite systems (Miszczak, 2010). The superoperator formalism facilitates channel composition via mapping composition, and Kraus composition is simply $K_i$2 for composed channels.

• "The Kraus representation for the dynamics of open quantum systems" (Maziero, 2015)
• "Singular value decomposition and matrix reorderings in quantum information theory" (Miszczak, 2010)
• "Generalized Kraus operators for the one-qubit depolarizing quantum channel" (Arsenijevic et al., 2015)
• "The reduction of the number of incoherent Kraus operations for qutrit systems" (Qiao et al., 2020)
• "Partial Trace Regression and Low-Rank Kraus Decomposition" (Kadri et al., 2020)
• "Gradient-descent quantum process tomography by learning Kraus operators" (Ahmed et al., 2022)
• "Continued-fraction representation of the Kraus map for non-Markovian reservoir damping" (Wonderen et al., 2018)
• "Kraus map closed-form solution for general master equation dynamics" (Chishti et al., 11 Mar 2026)
• "Relations Are Channels: Knowledge Graph Embedding via Kraus Decompositions" (Chaki, 11 May 2026)