Skip to content

Reduced Density Matrices

A reduced density matrix is obtained by summing the unobserved subsystem’s matching bra and ket indices. It predicts measurements on the retained subsystem without selecting a remote outcome. Reduced density operators explains the full structure; here we focus on reading a matrix in a declared product basis.

Helpful background. Partial trace gives the dyad rule; density operators explains matrix entries and positivity.

With rows and columns ordered as ∣i⟩A∣j⟩B|i\rangle_A|j\rangle_B,

(ρA)ii′=∑j(ρAB)ij,i′j.(\rho_A)_{ii'}=\sum_j(\rho_{AB})_{ij,i'j}.

For two qubits in the order 00,01,10,1100,01,10,11, this reads

ρA=(ρ00,00+ρ01,01ρ00,10+ρ01,11ρ10,00+ρ11,01ρ10,10+ρ11,11).\rho_A=\begin{pmatrix} \rho_{00,00}+\rho_{01,01}&\rho_{00,10}+\rho_{01,11}\\ \rho_{10,00}+\rho_{11,01}&\rho_{10,10}+\rho_{11,11} \end{pmatrix}.

The BB index is the same on the bra and ket sides of every retained term. Do not sum all entries of a block or average by dividing by the subsystem dimension.

For example, ρAB=diag⁡(0.1,0.2,0.3,0.4)\rho_{AB}=\operatorname{diag}(0.1,0.2,0.3,0.4) gives ρA=diag⁡(0.3,0.7)\rho_A=\operatorname{diag}(0.3,0.7), whereas tracing out AA gives ρB=diag⁡(0.4,0.6)\rho_B=\operatorname{diag}(0.4,0.6).

For every bounded local observable MAM_A,

Tr⁡(ρAMA)=Tr⁡[ρAB(MA⊗IB)].\operatorname{Tr}(\rho_A M_A) =\operatorname{Tr}[\rho_{AB}(M_A\otimes I_B)].

In the example, ⟨ZA⟩=0.3−0.7=−0.4\langle Z_A\rangle=0.3-0.7=-0.4 in either calculation. The result remains positive with unit trace. It is the marginal state, not a state conditioned on a particular BB outcome.

For that diagonal example, condition on a computational-basis result B=0B=0. Find its probability and the conditional state of AA, and compare it with ρA\rho_A.

Solution

The retained weights are 0.10.1 for A=0A=0 and 0.30.3 for A=1A=1, so p(B=0)=0.4p(B=0)=0.4. Normalizing them gives ρA∣B=0=diag⁡(1/4,3/4)\rho_{A\mid B=0}=\operatorname{diag}(1/4,3/4), different from the marginal diag⁡(0.3,0.7)\operatorname{diag}(0.3,0.7). Averaging all conditional states with their outcome probabilities recovers the marginal.

  • M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010, sec. 2.4.3.
  • J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018, ch. 2. Author’s manuscript.