Lean, informalized

Nielsen & Chuang · Chapter 8, Quantum noise and quantum operations · p. 394

Exercise 8.34 - Process tomography on two qubits, from the outputs on sixteen inputs back to the process

Recovering a two-qubit process from sixteen outputs.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Exercise

A process on two qubits has a χ\chi matrix, the 16×1616 \times 16 array of its coefficients in a fixed basis of sixteen operators on the two qubits. Process tomography finds that matrix from the outputs of the process on known inputs. For one qubit, Box 8.5 of the book does this with a fixed 4×44 \times 4 matrix Λ\Lambda, written out in (7) below.

For two qubits the inputs are the sixteen operators |a⟩⟨b||a\rangle\langle b|, with aa and bb among 0000, 0101, 1010 and 1111, and their outputs fill a 16×1616 \times 16 block matrix. From that matrix χ\chi is to be recovered by a permutation of its rows and columns followed by multiplication with Λ⊗Λ\Lambda \otimes \Lambda on both sides.

The Operator Basis

The operator basis on one qubit assigns to each pair of bits jkjk an operator Ẽjk\tilde E_{jk} on the qubit, Ẽ00=I,Ẽ01=X,Ẽ10=−iY,Ẽ11=Z,\tilde E_{00} = I, \qquad \tilde E_{01} = X, \qquad \tilde E_{10} = -iY, \qquad \tilde E_{11} = Z,(1) where XX, YY and ZZ are the Pauli matrices X=(0110),Y=(0−ii0),Z=(100−1).X = \begin{pmatrix} 0 & 1 \\ 1 & 0 \end{pmatrix}, \qquad Y = \begin{pmatrix} 0 & -i \\ i & 0 \end{pmatrix}, \qquad Z = \begin{pmatrix} 1 & 0 \\ 0 & -1 \end{pmatrix}.(2)

A two-qubit label is a pair of single-qubit labels, one for each qubit.✦ The set of them, ℐ2=({0,1}×{0,1})×({0,1}×{0,1}),\mathcal{I}_2 = \bigl(\{0,1\} \times \{0,1\}\bigr) \times \bigl(\{0,1\} \times \{0,1\}\bigr),(3)✦ has sixteen elements. The two-qubit operator ẼM\tilde E_M with label M=(m1,m2)M = (m_1, m_2) in ℐ2\mathcal{I}_2 is the tensor product of the single-qubit operators of its two halves, ẼM=Ẽm1⊗Ẽm2.\tilde E_M = \tilde E_{m_1} \otimes \tilde E_{m_2}.(4)✦

The Process and Its Outputs

Here the process is given by its χ\chi matrix, and its outputs are computed from it rather than measured. For a complex matrix χ\chi with rows and columns labelled by ℐ2\mathcal{I}_2, the process ℰχ\mathcal{E}_\chi is the map on operators of the two qubits given by ℰχ(ρ)=∑M,N∈ℐ2χMNẼMρẼN†.\mathcal{E}_\chi(\rho) = \sum_{M, N \in \mathcal{I}_2} \chi_{MN} \, \tilde E_M \, \rho \, \tilde E_N^\dagger .(5)✦

The block matrix of outputs MM of ℰχ\mathcal{E}_\chi is the 16×1616 \times 16 matrix whose block in row aa and column bb is the output ℰχ(|a⟩⟨b|)\mathcal{E}_\chi(|a\rangle\langle b|).✦ With aa, bb, ii and jj two-qubit basis labels, so that (a,i)(a, i) and (b,j)(b, j) lie in ℐ2\mathcal{I}_2, its entries are M(a,i),(b,j)=⟨i|ℰχ(|a⟩⟨b|)|j⟩.M_{(a,i),(b,j)} = \langle i | \, \mathcal{E}_\chi\bigl(|a\rangle\langle b|\bigr) \, | j \rangle .(6)✦

Two Fixed Matrices

The matrix Λ\Lambda of Box 8.5 is the 4×44 \times 4 matrix with rows and columns labelled by pairs of bits in the order 0000, 0101, 1010, 1111, the first bit numbering the 2×22 \times 2 block and the second the place within it: Λ=12(IXX−I)=12(1001011001−10100−1).\Lambda = \frac{1}{2} \begin{pmatrix} I & X \\ X & -I \end{pmatrix} = \frac{1}{2} \begin{pmatrix} 1 & 0 & 0 & 1 \\ 0 & 1 & 1 & 0 \\ 0 & 1 & -1 & 0 \\ 1 & 0 & 0 & -1 \end{pmatrix}.(7)✦ The two-qubit matrix Λ2\Lambda_2 is the tensor product of Λ\Lambda with itself, a 16×1616 \times 16 matrix with rows and columns labelled by ℐ2\mathcal{I}_2: Λ2=Λ⊗Λ.\Lambda_2 = \Lambda \otimes \Lambda .(8)✦

The perfect shuffle σ\sigma is the permutation of ℐ2\mathcal{I}_2 that regroups the bits of a label of MM, input pair first and output pair second, into one pair for each qubit: σ((a1,a2),(i1,i2))=((a1,i1),(a2,i2)).\sigma\bigl((a_1, a_2), (i_1, i_2)\bigr) = \bigl((a_1, i_1), (a_2, i_2)\bigr).(9)✦ The shuffle matrix PP is the permutation matrix of σ\sigma, the 16×1616 \times 16 matrix on ℐ2\mathcal{I}_2 with entries PUV=δσ(U),V.P_{UV} = \delta_{\sigma(U), V} .(10)✦

The Claim

Theorem 1. Let χ\chi be a complex matrix with rows and columns labelled by ℐ2\mathcal{I}_2, and let MM be the block matrix of outputs of the process ℰχ\mathcal{E}_\chi. Then Λ2PTMPΛ2=χ.\Lambda_2 \, P^{T} M P \, \Lambda_2 = \chi .(11)✦

What Is Checked

The claim is stated over the process ℰχ\mathcal{E}_\chi of (5), built on the operators ẼM\tilde E_M of (4), over its block matrix of outputs (6), and over the fixed matrices Λ2\Lambda_2 and PP of (8) and (10).