Lean, informalized

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

Exercise 8.33 - The values of an affine map of real space at fewer than four points never determine it

Fixing an affine Bloch map takes at least four points.

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 state ρ\rho of a qubit is a density operator, and it is written ρ=(I+r→⋅σ→)/2\rho = (I + \vec{r} \cdot \vec{\sigma})/2, with σ→\vec{\sigma} the vector of Pauli matrices and r→\vec{r} its Bloch vector, a point of the unit ball in ℝ3\mathbb{R}^3. A trace preserving quantum operation on the qubit acts on Bloch vectors as an affine map, r→↦Mr→+c→,\vec{r} \mapsto M \vec{r} + \vec{c},(1) where MM is a real 3×33 \times 3 matrix and c→\vec{c} a vector of ℝ3\mathbb{R}^3. The exercise bounds the number of points one has to follow to know the map: if the images of the points of a finite set determine MM and c→\vec{c}, there are at least four of them.✦

Points That Fix an Affine Map

The library poses the question for every affine map of ℝ3\mathbb{R}^3, with any real matrix and any translation, and for any finite set of points of ℝ3\mathbb{R}^3, inside the Bloch ball or not. A finite set PP of points of ℝ3\mathbb{R}^3 specifies affine Bloch maps if any two affine maps that agree at every point of PP have the same matrix and the same translation: for all real 3×33 \times 3 matrices M1,M2M_1, M_2 and all vectors c→1,c→2\vec{c}_1, \vec{c}_2 of ℝ3\mathbb{R}^3, M1r→+c→1=M2r→+c→2 for every r→∈P⇒M1=M2 and c→1=c→2.M_1 \vec{r} + \vec{c}_1 = M_2 \vec{r} + \vec{c}_2 \ \text{ for every } \vec{r} \in P \qquad \Longrightarrow \qquad M_1 = M_2 \ \text{ and } \ \vec{c}_1 = \vec{c}_2 .(2)✦

The Claim

Theorem 1. If a finite set PP of points of ℝ3\mathbb{R}^3 specifies affine Bloch maps, then PP has at least four points: |P|≥4.|P| \ge 4 .(3)✦

What Is Checked

The claim is stated over the sets of points that specify affine Bloch maps, the condition (2). What the library proves about such a set is the bound (3) on its size.