kraus-operator
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| kraus-operator [May 22, 2026 at 23:47] – Ivan Janevski | kraus-operator [June 13, 2026 at 03:13] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| # Kraus operator | # Kraus operator | ||
| - | **Kraus | + | **Kraus |
| $$\mathcal{E}(\rho) = \sum_k K_k\rho K_k^\dagger$$ | $$\mathcal{E}(\rho) = \sum_k K_k\rho K_k^\dagger$$ | ||
| + | The Kraus operators must satisfy the **completeness relation** $\sum_k K_k^\dagger K_k = I$, which ensures the map is trace-preserving ($\text{tr}(\mathcal{E}(\rho)) = \text{tr}(\rho) = 1$). Any set of matrices satisfying this condition defines a valid quantum channel. The decomposition into Kraus operators is not unique — the same channel can be expressed with different sets of $K_k$. | ||
| - | To derive | + | ## Examples |
| - | $$K_1 = \sqrt{dt}L$$ | + | |
| - | $$K_0 = I - \frac{i}{\hbar}H dt - \frac{1}{2}$$ | + | The six channels below all act on a single qubit. For each one the Kraus operators are stated, the completeness relation is verified, and the channel action $\mathcal{E}(\rho)$ is worked out in matrix form. |
| + | |||
| + | ### 1. Bit flip channel | ||
| + | |||
| + | With probability $1-p$ nothing happens; with probability $p$ the $X$ gate is applied, swapping $\lvert 0\rangle \leftrightarrow \lvert 1\rangle$. Two Kraus operators: | ||
| + | |||
| + | $$K_0 = \sqrt{1-p}\, | ||
| + | K_1 = \sqrt{p}\,X = \sqrt{p}\begin{pmatrix}0& | ||
| + | |||
| + | Completeness (using $X^\dagger X = I$): | ||
| + | |||
| + | $$K_0^\dagger K_0 + K_1^\dagger K_1 = (1-p)I + pX^\dagger X = (1-p)I + pI = I \quad\checkmark$$ | ||
| + | |||
| + | Channel action. First compute $X\rho X$: | ||
| + | |||
| + | $$X\rho X = \begin{pmatrix}0& | ||
| + | |||
| + | Then: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = (1-p)\rho + pX\rho X = \begin{pmatrix}(1-p)\rho_{00}+p\rho_{11} & (1-p)\rho_{01}+p\rho_{10} \\ (1-p)\rho_{10}+p\rho_{01} & (1-p)\rho_{11}+p\rho_{00}\end{pmatrix}$$ | ||
| + | |||
| + | The populations $\rho_{00}$ and $\rho_{11}$ mix toward each other. At $p=1/2$ both reach $1/2$ — the state is maximally mixed in the computational basis. | ||
| + | |||
| + | ### 2. Phase flip channel | ||
| + | |||
| + | With probability $p$ the $Z$ gate is applied, which maps $\lvert 0\rangle \to \lvert 0\rangle$ and $\lvert 1\rangle \to -\lvert 1\rangle$. This adds a random $\pi$ phase to the $\lvert 1\rangle$ state without changing populations: | ||
| + | |||
| + | $$K_0 = \sqrt{1-p}\, | ||
| + | K_1 = \sqrt{p}\,Z = \sqrt{p}\begin{pmatrix}1& | ||
| + | |||
| + | Completeness (using $Z^2 = I$): | ||
| + | |||
| + | $$K_0^\dagger K_0 + K_1^\dagger K_1 = (1-p)I + pZ^2 = I \quad\checkmark$$ | ||
| + | |||
| + | Channel action. First compute $Z\rho Z$: | ||
| + | |||
| + | $$Z\rho Z = \begin{pmatrix}1& | ||
| + | |||
| + | Then: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = (1-p)\rho + pZ\rho Z = \begin{pmatrix}\rho_{00} & (1-2p)\rho_{01} \\ (1-2p)\rho_{10} & \rho_{11}\end{pmatrix}$$ | ||
| + | |||
| + | Populations are completely unchanged. Coherences are suppressed by the factor $(1-2p)$: at $p=0$ nothing changes, at $p=1/2$ coherences are fully destroyed, at $p=1$ they are restored with opposite sign. This is the discrete-time model of $T_2$ dephasing. | ||
| + | |||
| + | ### 3. Bit-phase flip channel | ||
| + | |||
| + | With probability $p$ the $Y$ gate is applied. Since $Y = iXZ$, this simultaneously flips the bit and applies a phase — hence the name. Two Kraus operators: | ||
| + | |||
| + | $$K_0 = \sqrt{1-p}\, | ||
| + | K_1 = \sqrt{p}\,Y = \sqrt{p}\begin{pmatrix}0& | ||
| + | |||
| + | Completeness (using $Y^\dagger Y = I$): $(1-p)I + pI = I$ ✓ | ||
| + | |||
| + | Channel action. First compute $Y\rho Y$: | ||
| + | |||
| + | $$Y\rho Y = \begin{pmatrix}0& | ||
| + | |||
| + | Then: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = (1-p)\rho + pY\rho Y = \begin{pmatrix}(1-p)\rho_{00}+p\rho_{11} & (1-p)\rho_{01}-p\rho_{10} \\ (1-p)\rho_{10}-p\rho_{01} & (1-p)\rho_{11}+p\rho_{00}\end{pmatrix}$$ | ||
| + | |||
| + | Populations mix as in the bit-flip channel. Coherences pick up an extra sign flip from the $Y$ phase: the $(1,2)$ element mixes $\rho_{01}$ and $-\rho_{10}$ rather than $+\rho_{10}$. At $p=1/2$ coherences are destroyed regardless. | ||
| + | |||
| + | ### 4. Depolarizing channel | ||
| + | |||
| + | With probability $1-p$ nothing happens; with probability $p/3$ each, one of $X$, $Y$, $Z$ is applied. The channel is symmetric under all single-qubit unitaries. Four Kraus operators: | ||
| + | |||
| + | $$K_0 = \sqrt{1-p}\, | ||
| + | K_1 = \sqrt{\frac{p}{3}}\, | ||
| + | K_2 = \sqrt{\frac{p}{3}}\, | ||
| + | K_3 = \sqrt{\frac{p}{3}}\, | ||
| + | |||
| + | Completeness (using $X^2 = Y^2 = Z^2 = I$): | ||
| + | |||
| + | $$\sum_k K_k^\dagger K_k = (1-p)I + \frac{p}{3}(X^2 + Y^2 + Z^2) = (1-p)I + pI = I \quad\checkmark$$ | ||
| + | |||
| + | Channel action, using the Pauli identity $X\rho X + Y\rho Y + Z\rho Z = 2\, | ||
| + | |||
| + | $$\mathcal{E}(\rho) = (1-p)\rho + \frac{p}{3}(X\rho X + Y\rho Y + Z\rho Z) = (1-p)\rho + \frac{p}{3}(2I - \rho)$$ | ||
| + | |||
| + | $$\mathcal{E}(\rho) = \left(1 - \frac{4p}{3}\right)\rho + \frac{2p}{3}I$$ | ||
| + | |||
| + | In components: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = \begin{pmatrix}\left(1-\frac{2p}{3}\right)\rho_{00}+\frac{2p}{3}\rho_{11} & \left(1-\frac{4p}{3}\right)\rho_{01} \\ \left(1-\frac{4p}{3}\right)\rho_{10} & \left(1-\frac{2p}{3}\right)\rho_{11}+\frac{2p}{3}\rho_{00}\end{pmatrix}$$ | ||
| + | |||
| + | Both populations and coherences shrink toward the maximally mixed state $I/2$. The steady state $\rho = I/2$ is reached when $p = 3/4$. | ||
| + | |||
| + | ### 5. Amplitude damping (T1 / relaxation) | ||
| + | |||
| + | Amplitude damping models spontaneous emission: with probability $\gamma$ the qubit emits a photon and drops from $\lvert 1\rangle$ to $\lvert 0\rangle$. For a continuous-time process, $\gamma = 1 - e^{-t/ | ||
| + | |||
| + | $$K_0 = \begin{pmatrix}1& | ||
| + | K_1 = \begin{pmatrix}0& | ||
| + | |||
| + | $K_0$ is the no-emission evolution: the ground state amplitude stays fixed, the excited state amplitude shrinks by $\sqrt{1-\gamma}$. $K_1$ is the emission event: excitation $\lvert 1\rangle$ collapses to ground $\lvert 0\rangle$, and the $\sqrt{\gamma}$ prefactor ensures the correct probability. | ||
| + | |||
| + | Completeness: | ||
| + | |||
| + | $$K_0^\dagger K_0 + K_1^\dagger K_1 = \begin{pmatrix}1& | ||
| + | |||
| + | Channel action. No-emission term: | ||
| + | |||
| + | $$K_0\rho K_0^\dagger = \begin{pmatrix}1& | ||
| + | |||
| + | Emission term: | ||
| + | |||
| + | $$K_1\rho K_1^\dagger = \begin{pmatrix}0& | ||
| + | |||
| + | Sum: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = \begin{pmatrix}\rho_{00}+\gamma\rho_{11} & \sqrt{1-\gamma}\, | ||
| + | |||
| + | The excited population $\rho_{11}$ decays by factor $(1-\gamma)$; | ||
| + | |||
| + | ### 6. Phase damping (T2 / dephasing) | ||
| + | |||
| + | Phase damping destroys coherences without changing populations. It models random scattering events that shift the qubit frequency but do not cause energy transitions. Two Kraus operators: | ||
| + | |||
| + | $$K_0 = \begin{pmatrix}1& | ||
| + | K_1 = \begin{pmatrix}0& | ||
| + | |||
| + | Completeness: | ||
| + | |||
| + | $$K_0^\dagger K_0 + K_1^\dagger K_1 = \begin{pmatrix}1& | ||
| + | |||
| + | Channel action: | ||
| + | |||
| + | $$K_0\rho K_0^\dagger = \begin{pmatrix}\rho_{00}& | ||
| + | |||
| + | $$K_1\rho K_1^\dagger = \begin{pmatrix}0& | ||
| + | |||
| + | $$\mathcal{E}(\rho) = \begin{pmatrix}\rho_{00} & \sqrt{1-\lambda}\, | ||
| + | |||
| + | Populations are exactly preserved. Coherences shrink by $\sqrt{1-\lambda}$. Setting $\lambda = 1 - e^{-t/T_2}$ gives the continuous-time $T_2$ decay: $\rho_{01}(t) = \rho_{01}(0)\, | ||
| + | |||
| + | ## Qubit | ||
| + | |||
| + | A qubit' | ||
| + | |||
| + | $$\rho = \begin{pmatrix}\rho_{00} & \rho_{01} \\ \rho_{10} & \rho_{11}\end{pmatrix}$$ | ||
| + | |||
| + | where the diagonal entries $\rho_{00}$ and $\rho_{11}$ are real, non-negative **populations** (probabilities of finding the qubit in $\lvert 0\rangle$ and $\lvert 1\rangle$ respectively), | ||
| + | |||
| + | Because both $\rho$ and every $K_k$ are $2\times 2$ matrices, the channel $\mathcal{E}(\rho) = \sum_k K_k\rho K_k^\dagger$ is just a sum of $2\times 2$ matrix products. | ||
| + | |||
| + | Start from $\rho = \begin{pmatrix}\rho_{00}& | ||
| + | |||
| + | $$K_0 = \begin{pmatrix}1& | ||
| + | |||
| + | Multiply out $K_0\rho$: | ||
| + | |||
| + | $$K_0\rho = \begin{pmatrix}1& | ||
| + | |||
| + | Then multiply by $K_0^\dagger = K_0$ (it is real and diagonal): | ||
| + | |||
| + | $$K_0\rho K_0^\dagger = \begin{pmatrix}\rho_{00}& | ||
| + | |||
| + | Multiply out $K_1\rho$: | ||
| + | |||
| + | $$K_1\rho = \begin{pmatrix}0& | ||
| + | |||
| + | Then multiply by $K_1^\dagger = \begin{pmatrix}0& | ||
| + | |||
| + | $$K_1\rho K_1^\dagger = \begin{pmatrix}\sqrt{\gamma}\, | ||
| + | |||
| + | Add the two terms: | ||
| + | |||
| + | $$\mathcal{E}(\rho) = K_0\rho K_0^\dagger + K_1\rho K_1^\dagger = \begin{pmatrix}\rho_{00}+\gamma\rho_{11} & \sqrt{1-\gamma}\, | ||
| + | |||
| + | Reading off the entries: the excited population $\rho_{11}$ decays by $\gamma$, that probability flows into the ground population $\rho_{00}$, | ||
| + | |||
| + | ## Deriving the Lindblad equation | ||
| + | Kraus operators are the link between the [[lindblad-equation|Lindblad master equation]] and the operator-sum representation. For an infinitesimal time step $dt$ with Lindblad jump operator $L$ and Hamiltonian | ||
| + | |||
| + | $$K_0 = I - \frac{i}{\hbar}H\,dt - \frac{1}{2}L^\dagger L\,dt, \qquad K_1 = \sqrt{dt}\, | ||
| + | |||
| + | Substituting into $\rho(t+dt) = K_0\rho K_0^\dagger + K_1\rho K_1^\dagger$ and expanding to first order in $dt$ recovers the Lindblad equation. The full derivation is in the [[lindblad-equation# | ||
| - | You then use: | ||
| - | $$\rho(t + dt) = K_0\rho K_0^\dagger + K_1\rrho K_1^\dagger$$ | ||
kraus-operator.1779493638.txt.gz · Last modified: by Ivan Janevski
