Lean, informalized

Nielsen & Chuang · Chapter 9, Distance measures for quantum information · p. 423

Problem 9.1 - The fidelity squared as an infimum of trace products, and a qubit pair where the square is needed

The squared fidelity is an infimum over positive operators.

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

Let ρ\rho and σ\sigma be states of a quantum system with a finite-dimensional state space, and let PP be an invertible positive operator on that space, an observable with strictly positive eigenvalues. Then tr⁡(ρP)\operatorname{tr}(\rho P) is the mean value of PP in the state ρ\rho, and tr⁡(σP−1)\operatorname{tr}(\sigma P^{-1}) is the mean value of its inverse in σ\sigma. The exercise is to show that the infimum of the product of these two mean values, over all such PP, is the square of the fidelity between ρ\rho and σ\sigma.

The library states this for any two positive operators, and adds a pair of qubit states for which the square cannot be dropped.

The Alberti Product

Let EE be a finite-dimensional complex Hilbert space. For a positive operator ρ\rho on EE, ρ\sqrt{\rho} is its positive square root, and P>0P > 0 says that the operator PP is positive and invertible.

For operators ρ\rho, σ\sigma and an invertible operator PP on EE, the Alberti product of ρ\rho and σ\sigma at PP is the real number A(ρ,σ;P)=Re⁡tr⁡(ρP)Re⁡tr⁡(σP−1).A(\rho,\sigma;P) = \operatorname{Re}\operatorname{tr}(\rho P)\, \operatorname{Re}\operatorname{tr}(\sigma P^{-1}).(1)✦

The trace norm ∥T∥1\|T\|_1 of a linear map TT between finite-dimensional inner product spaces is the sum of its singular values s1(T),…,sd(T)s_1(T), \dots, s_d(T), with dd the dimension of the space TT acts on: ∥T∥1=∑i=1dsi(T).\|T\|_1 = \sum_{i=1}^{d} s_i(T).(2)✦

Two Qubit States

The second claim is about real 2×22\times 2 matrices. For real square matrices ρ\rho and σ\sigma, the fidelity F(ρ,σ)F(\rho,\sigma) is the number F(ρ,σ)=tr⁡ρσρ,F(\rho,\sigma) = \operatorname{tr}\sqrt{\sqrt{\rho}\,\sigma\sqrt{\rho}},(3)✦ and for an invertible real matrix PP the Alberti product is A(ρ,σ;P)=tr⁡(ρP)tr⁡(σP−1).A(\rho,\sigma;P) = \operatorname{tr}(\rho P)\,\operatorname{tr}(\sigma P^{-1}).(4)✦

The two states are the qubit density matrices ρ0=(9/10001/10),σ0=(1/10009/10),\rho_0 = \begin{pmatrix} 9/10 & 0 \\ 0 & 1/10 \end{pmatrix}, \qquad \sigma_0 = \begin{pmatrix} 1/10 & 0 \\ 0 & 9/10 \end{pmatrix},(5) diagonal in the computational basis with eigenvalues 9/109/10 and 1/101/10 in opposite order: ρ0\rho_0 is mostly |0⟩|0\rangle, and σ0\sigma_0 is mostly |1⟩|1\rangle.

The Claim

Theorem 1. Let ρ\rho and σ\sigma be positive operators on a finite-dimensional complex Hilbert space EE. The infimum of their Alberti products (1) over the invertible positive operators PP on EE is the square of the trace norm of ρσ\sqrt{\rho}\sqrt{\sigma}: infP>0A(ρ,σ;P)=∥ρσ∥12.\inf_{P > 0} A(\rho,\sigma;P) = \bigl\|\sqrt{\rho}\,\sqrt{\sigma}\bigr\|_1^2.(6)✦

Theorem 2. Let ρ0\rho_0 and σ0\sigma_0 be the qubit states (5). There is a positive definite real 2×22\times 2 matrix PP whose Alberti product (4) lies below the fidelity (3): A(ρ0,σ0;P)<F(ρ0,σ0).A(\rho_0,\sigma_0;P) < F(\rho_0,\sigma_0).(7)✦

For states ρ\rho and σ\sigma, where ∥ρσ∥1\|\sqrt{\rho}\sqrt{\sigma}\|_1 is the fidelity F(ρ,σ)F(\rho,\sigma), the first theorem is the exercise.

What Is Checked

The first theorem is stated over the Alberti product (1) of operators and the trace norm (2); the second over the fidelity (3) and the Alberti product (4) of real matrices, at the states (5). For a positive operator ρ\rho, a positive operator σ\sigma, and an invertible positive operator PP, the two mean values entering the Alberti product are real and nonnegative.