Skip to content

Reduced States and Partial Trace

A joint quantum state contains more information than any one subsystem can access. The reduced state extracts exactly the information needed to predict every measurement performed locally on the retained subsystem, while discarding correlations that require joint access.

For a bipartite state ρAB\rho_{AB}, the reduced states are

ρA=Tr⁡BρAB,ρB=Tr⁡AρAB.\rho_A = \operatorname{Tr}_B\rho_{AB}, \qquad \rho_B = \operatorname{Tr}_A\rho_{AB}.

Required background. Density Operators supplies positive trace-one operators and the trace rule; Entangled States supplies the interpretation of a pure joint state with mixed local states. Familiarity with tensor-product operator algebra is assumed for finite-product-basis expansions and subsystem-index contractions.

Question Read
What does a subsystem state mean? Reduced Density Operators
How do I compute it? Partial Trace
How does it give probabilities? Local Measurement Statistics
What changes if a remote outcome is known? Conditional States
Can the same local state come from a larger pure state? Purification
What information was lost? Marginals and Correlations
What does local mixedness measure? Subsystem Entropy

Let MAM_A be any bounded observable on AA; in finite dimensions every observable is bounded. As an observable on the composite system it is represented by MA⊗IBM_A\otimes I_B. The reduced state ρA\rho_A is characterized by

Tr⁡AB[ρAB(MA⊗IB)]=Tr⁡A(ρAMA)\operatorname{Tr}_{AB} \left[ \rho_{AB}(M_A\otimes I_B) \right] = \operatorname{Tr}_A(\rho_A M_A)

for every MAM_A. This identity is more than a computational convenience: it says that ρA\rho_A contains all and only the information needed for measurements confined to AA.

The same statement holds for a local measurement effect EaE_a:

p(a)=Tr⁡AB[ρAB(Ea⊗IB)]=Tr⁡A(ρAEa).\begin{aligned} p(a) &= \operatorname{Tr}_{AB} \left[ \rho_{AB}(E_a\otimes I_B) \right] \\ &= \operatorname{Tr}_A(\rho_A E_a). \end{aligned}

No measurement on AA alone can distinguish two joint states with the same ρA\rho_A. Joint measurements, correlations with BB, or conditioning on information from BB may distinguish them.

Choose an orthonormal basis {∣j⟩B}\{\lvert j\rangle_B\} for the subsystem being discarded. For a trace-class operator XABX_{AB},

Tr⁡BXAB=∑j(IA⊗⟨j∣B)XAB×(IA⊗∣j⟩B).\operatorname{Tr}_B X_{AB} = \sum_j (I_A\otimes\langle j\rvert_B) X_{AB} \times (I_A\otimes\lvert j\rangle_B).

Although a basis appears in the formula, the result is basis independent. The sum contracts the bra and ket indices belonging to the same discarded factor.

In a product basis, write matrix elements as

(XAB)ij,i′j′=⟨i,j∣XAB∣i′,j′⟩.(X_{AB})_{ij,i'j'} = \langle i,j\rvert X_{AB}\lvert i',j'\rangle.

Then

(Tr⁡BXAB)ii′=∑j(XAB)ij,i′j.(\operatorname{Tr}_B X_{AB})_{ii'} = \sum_j (X_{AB})_{ij,i'j}.

The repeated BB index is set equal and summed; the AA indices remain. Tracing out AA instead contracts ii with i′i' and leaves the BB indices.

Reduction does not mean deleting every off-diagonal matrix element. Take

∣ψ⟩=∣00⟩+∣10⟩+∣11⟩3.|\psi\rangle=\frac{|00\rangle+|10\rangle+|11\rangle}{\sqrt3}.

The terms ∣00⟩⟨10∣|00\rangle\langle10| and its adjoint have the same BB index and survive the trace. Terms such as ∣00⟩⟨11∣|00\rangle\langle11| have different BB indices and vanish. In the ∣0⟩A,∣1⟩A|0\rangle_A,|1\rangle_A basis,

ρA=13(1112).\rho_A=\frac13\begin{pmatrix}1&1\\1&2\end{pmatrix}.

It has unit trace, determinant 1/91/9, and purity 7/97/9. Since the joint state is pure and the local state is mixed, this state is entangled. Its nonzero off-diagonal entries show that local coherence and local mixedness can coexist.

For a local trace-preserving measurement process on BB, if its outcome is ignored, the state available for local predictions on AA is the reduced state ρA\rho_A. No outcome label appears.

If a projective measurement {Qb}\{Q_b\} is performed on BB and outcome bb is learned, define the unnormalized conditional operator

ρ~A∣b=Tr⁡B[(IA⊗Qb)ρAB×(IA⊗Qb)].\widetilde\rho_{A|b} = \operatorname{Tr}_B \left[ (I_A\otimes Q_b) \rho_{AB} \times (I_A\otimes Q_b) \right].

Its trace is the outcome probability,

pb=Tr⁡Aρ~A∣b,p_b = \operatorname{Tr}_A\widetilde\rho_{A|b},

and, when pb>0p_b>0, the normalized conditional state is

ρA∣b=ρ~A∣bpb.\rho_{A|b} = \frac{\widetilde\rho_{A|b}}{p_b}.

The distinction is informational:

Situation State assigned to AA Required information
no measurement on BB, or outcome ignored ρA\rho_A none from BB
outcome bb learned ρA∣b\rho_{A\vert b} classical record bb
all outcomes averaged ∑bpbρA∣b=ρA\sum_b p_b\rho_{A\vert b}=\rho_A record discarded

Conditioning can change the state assigned by an observer who learns bb. It does not permit faster-than-light signaling because an observer at AA who lacks the record still uses the unchanged average ρA\rho_A. Quantum Operations supplies the instrument formalism; here the essential composite-system distinction is between an outcome-conditioned state and the unchanged nonselective marginal.

Marginals generally do not determine correlations

Section titled “Marginals generally do not determine correlations”

The pair (ρA,ρB)(\rho_A,\rho_B) fixes all separate local statistics but generally not the expectation of a product observable XA⊗YBX_A\otimes Y_B. Define the connected correlation

C(XA,YB)=⟨XA⊗YB⟩−⟨XA⟩⟨YB⟩.C(X_A,Y_B) = \langle X_A\otimes Y_B\rangle - \langle X_A\rangle \langle Y_B\rangle.

Every connected correlation vanishes in a product state, but checking one pair of observables is not enough to prove product structure.

For finite-dimensional systems, the quantum mutual information

I(A:B)=S(ρA)+S(ρB)−S(ρAB)I(A{:}B) = S(\rho_A)+S(\rho_B)-S(\rho_{AB})

measures total correlation. It vanishes exactly for product states in finite dimensions, but it does not by itself separate classical correlation from entanglement. That separation requires the joint-state classification developed in the state-classification chapter, not the marginals alone. In infinite dimension, the entropy subtraction can involve undefined differences of infinities; use the relative-entropy definition explained in mutual information.

Reduction maps a larger state to a subsystem state. Purification asks the inverse existence question: can a mixed state be represented as the reduction of a larger pure state?

For a finite-dimensional reduced state, write

ρA=∑rλr∣r⟩⟨r∣A,\rho_A = \sum_r \lambda_r \lvert r\rangle\langle r\rvert_A,

A convenient purification on A⊗RA\otimes R is

∣Ψ⟩AR=∑rλr ∣r⟩A∣r⟩R.\lvert\Psi\rangle_{AR} = \sum_r\sqrt{\lambda_r}\, \lvert r\rangle_A\lvert r\rangle_R.

Direct reduction gives

Tr⁡R∣Ψ⟩⟨Ψ∣AR=ρA.\operatorname{Tr}_R \lvert\Psi\rangle\langle\Psi\rvert_{AR} = \rho_A.

Purifications are not unique. Their occupied reference subspaces are related by an isometry; when the full reference dimensions agree, this can be extended to a unitary on the reference. The local state and every prediction on AA stay unchanged.

Purification is a representation theorem, not a claim that every mixed state has one uniquely identifiable hidden environment. Whether the reference is physical, hypothetical, or computational depends on the problem.

The von Neumann entropy of a reduced state is

S(A)=−Tr⁡(ρAlog⁡ρA).S(A) = -\operatorname{Tr}(\rho_A\log\rho_A).

Its interpretation depends on the global state.

If ρAB\rho_{AB} is pure, then

S(A)=S(B),S(A)=S(B),

and this common value is the bipartite entanglement entropy. It vanishes exactly for a product pure state.

If ρAB\rho_{AB} is mixed, S(A)S(A) can reflect local statistical mixing, classical correlation, quantum correlation, or combinations of them. It is not by itself an entanglement measure. For example, the separable mixture (∣00⟩⟨00∣+∣11⟩⟨11∣)/2(|00\rangle\langle00|+|11\rangle\langle11|)/2 and the pure Bell state (∣00⟩+∣11⟩)/2(|00\rangle+|11\rangle)/\sqrt2 both give S(A)=log⁡2S(A)=\log2.

The two cases above are the essential interpretation rule: subsystem entropy is an entanglement measure for a bipartite pure global state, but not for an arbitrary mixed global state.

Continuous Variables and Infinite Dimensions

Section titled “Continuous Variables and Infinite Dimensions”

In a position basis for two particles, a density kernel may be written

ρ(xA,xB;xA′,xB′).\rho(x_A,x_B;x_A',x_B').

Tracing out BB contracts its two arguments:

ρA(xA;xA′)=∫dxB ρ(xA,xB;xA′,xB).\rho_A(x_A;x_A') = \int dx_B\, \rho(x_A,x_B;x_A',x_B).

The notation is the continuous counterpart of the finite index sum. Functional-analytic care is required: the kernel must represent a trace-class operator, generalized position kets are distributions, and the diagonal contraction must exist in the appropriate operator sense rather than only as a formal integral.

In the ordered basis ∣00⟩,∣01⟩,∣10⟩,∣11⟩\lvert00\rangle,\lvert01\rangle,\lvert10\rangle,\lvert11\rangle, write a two-qubit operator as a 2×22\times2 array of 2×22\times2 blocks,

XAB=(B00B01B10B11),X_{AB} = \begin{pmatrix} B_{00} & B_{01} \\ B_{10} & B_{11} \end{pmatrix},

where each block acts on BB. Express Tr⁡BXAB\operatorname{Tr}_B X_{AB}.

Solution

The outer block labels are the retained AA indices, while the trace contracts the two BB indices inside each block. Therefore

Tr⁡BXAB=(Tr⁡B00Tr⁡B01Tr⁡B10Tr⁡B11).\operatorname{Tr}_B X_{AB} = \begin{pmatrix} \operatorname{Tr}B_{00} & \operatorname{Tr}B_{01} \\ \operatorname{Tr}B_{10} & \operatorname{Tr}B_{11} \end{pmatrix}.

This rule depends on the declared factor and basis order. With a different ordering, the same numerical matrix must be regrouped differently before tracing.

Prove for finite-dimensional BB that

Tr⁡B[(IA⊗UB)ρAB×(IA⊗UB†)]=Tr⁡BρAB.\operatorname{Tr}_B \left[ (I_A\otimes U_B) \rho_{AB} \times (I_A\otimes U_B^\dagger) \right] = \operatorname{Tr}_B\rho_{AB}.
Solution

Evaluate the partial trace in a basis {∣j⟩B}\{\lvert j\rangle_B\}:

ρA′=∑j(IA⊗⟨j∣UB)ρAB(IA⊗UB†∣j⟩).\begin{aligned} \rho_A' &= \sum_j (I_A\otimes\langle j\rvert U_B) \rho_{AB} (I_A\otimes U_B^\dagger\lvert j\rangle). \end{aligned}

The vectors ∣j~⟩=UB†∣j⟩\lvert\widetilde j\rangle=U_B^\dagger\lvert j\rangle form another orthonormal basis. Hence the sum is simply the basis-independent definition of Tr⁡BρAB\operatorname{Tr}_B\rho_{AB}.

For the Bell state ∣Φ+⟩\lvert\Phi^+\rangle, qubit BB is measured in the computational basis. Find the two conditional states of AA and show that their probability-weighted average equals the original reduced state.

Solution

Outcome 00 occurs with probability 1/21/2 and leaves AA in ∣0⟩⟨0∣\lvert0\rangle\langle0\rvert. Outcome 11 also occurs with probability 1/21/2 and leaves AA in ∣1⟩⟨1∣\lvert1\rangle\langle1\rvert. The averaged state is

∑bpbρA∣b=12∣0⟩⟨0∣+12∣1⟩⟨1∣=I2=ρA.\begin{aligned} \sum_b p_b\rho_{A|b} &= \frac12\lvert0\rangle\langle0\rvert + \frac12\lvert1\rangle\langle1\rvert \\ &= \frac{I}{2} = \rho_A. \end{aligned}

Someone who learns the outcome uses a pure conditional state; someone without that record uses the unchanged maximally mixed reduced state.

  • I. Bengtsson and K. Życzkowski, Geometry of Quantum States, 2nd ed., Cambridge University Press, 2017.
  • M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010.
  • A. Peres, Quantum Theory: Concepts and Methods, Kluwer, 1995.
  • J. Preskill, Lecture Notes for Physics 229: Quantum Information and Computation, California Institute of Technology.
  • J. von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton University Press, 1955.
  • J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018.
  • M. M. Wilde, Quantum Information Theory, 2nd ed., Cambridge University Press, 2017.