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}.

This chapter organizes three distinct tasks:

reduce a joint state↓predict local statistics↓separate local data from correlations.\begin{gathered} \text{reduce a joint state} \\ \downarrow \\ \text{predict local statistics} \\ \downarrow \\ \text{separate local data from correlations}. \end{gathered}

The linked pages own the detailed derivations. This page supplies the shared interpretation, calculation protocol, and boundaries among discarding, conditioning, purification, and entropy.

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.

QuestionCurrent routeOutcome
What operation produces the state available to one subsystem?Partial Tracebasis-independent definition, index rules, block rules, and checks
What state and correlation language is required first?Entangled Statessubsystem split and joint-state classification
How does reduction become a general process?Quantum Operationschannels, selective maps, and discarded environments

Let MAM_A be any observable on AA. 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 an operator XABX_{AB},

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

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.

For operators in the appropriate trace class, the partial trace is:

  • linear;
  • positive and completely positive;
  • trace preserving from the joint operator space to the retained operator space;
  • Hermiticity preserving;
  • compatible with successive reductions over distinct factors.

In particular,

Tr⁡A(Tr⁡BXAB)=Tr⁡ABXAB.\operatorname{Tr}_A \left( \operatorname{Tr}_B X_{AB} \right) = \operatorname{Tr}_{AB}X_{AB}.

Therefore a positive, unit-trace ρAB\rho_{AB} reduces to a positive, unit-trace ρA\rho_A.

Write the Hilbert space and product basis explicitly, for example

HAB=HA⊗HB,∣i,j⟩=∣i⟩A⊗∣j⟩B.\begin{aligned} \mathcal H_{AB} &= \mathcal H_A\otimes\mathcal H_B, \\ \lvert i,j\rangle &= \lvert i\rangle_A\otimes\lvert j\rangle_B. \end{aligned}

For two qubits, state whether the matrix order is ∣00⟩,∣01⟩,∣10⟩,∣11⟩\lvert00\rangle,\lvert01\rangle,\lvert10\rangle,\lvert11\rangle. Most index mistakes begin with an unstated ordering convention.

To find ρA\rho_A, trace over BB. To find ρB\rho_B, trace over AA. Say this in words before manipulating indices.

3. Choose the most transparent representation

Section titled “3. Choose the most transparent representation”
  • Use ket-bra linearity for short sums of product projectors.
  • Use the index contraction for symbolic tensors.
  • Use block matrices for small finite-dimensional density matrices.
  • Use a reshape-and-contract routine for numerical arrays, with dimensions and factor order supplied explicitly.

Verify

ρA†=ρA,ρA≥0,Tr⁡ρA=1.\rho_A^\dagger=\rho_A, \qquad \rho_A\geq0, \qquad \operatorname{Tr}\rho_A=1.

For a pure bipartite input, the nonzero spectra of ρA\rho_A and ρB\rho_B must agree. This provides a strong independent check through the Schmidt decomposition.

The contrast among product, classically correlated, and entangled states shows both the power and the limits of reduction.

For

ρAB=∣0⟩⟨0∣A⊗∣1⟩⟨1∣B,\rho_{AB} = \lvert0\rangle\langle0\rvert_A \otimes \lvert1\rangle\langle1\rvert_B,

the marginals are

ρA=∣0⟩⟨0∣,ρB=∣1⟩⟨1∣.\rho_A=\lvert0\rangle\langle0\rvert, \qquad \rho_B=\lvert1\rangle\langle1\rvert.

Both are pure because the global pure state factorizes.

Consider

ρcc=12(∣00⟩⟨00∣+∣11⟩⟨11∣).\rho_{\mathrm{cc}} = \frac12 \left( \lvert00\rangle\langle00\rvert + \lvert11\rangle\langle11\rvert \right).

Tracing over either qubit gives

ρA=ρB=I2.\rho_A=\rho_B=\frac{I}{2}.

The local states are maximally mixed, but the joint state is separable and carries classical correlation.

For

∣Φ+⟩=∣00⟩+∣11⟩2,\lvert\Phi^+\rangle = \frac{\lvert00\rangle+\lvert11\rangle}{\sqrt2},

one again finds

ρA=ρB=I2.\rho_A=\rho_B=\frac{I}{2}.

This time the global state is pure and entangled. The same local marginals therefore arise from two globally different situations:

Joint stateLocal statesJoint information omitted by reduction
product projectorpurenone between the factors
diagonal separable mixturemaximally mixedclassical correlation
Bell projectormaximally mixedentanglement and joint coherence

The example demonstrates a general rule: marginals do not determine the joint state.

If the outcome of a measurement on BB 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)].\begin{aligned} \widetilde\rho_{A|b} &= \operatorname{Tr}_B \left[ (I_A\otimes Q_b) \rho_{AB} \right. \\ &\qquad\left. \times (I_A\otimes Q_b) \right]. \end{aligned}

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:

SituationState assigned to AARequired information
no measurement on BB, or outcome ignoredρA\rho_Anone 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_Arecord 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.

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⟩.\begin{aligned} C(X_A,Y_B) &= \langle X_A\otimes Y_B\rangle \\ &\quad- \langle X_A\rangle \langle Y_B\rangle. \end{aligned}

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

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.

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?

If

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

then a canonical 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. Once the reference space is large enough, purifications of the same ρA\rho_A are related by an isometry on the reference. That isometry changes the auxiliary representation without changing the reduced state or any prediction made from ρA\rho_A.

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. The classically correlated state and Bell state above both give S(A)=log⁡2S(A)=\log2 despite different entanglement classifications.

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.

For a tripartite state ρABC\rho_{ABC}, reductions can be nested:

ρAB=Tr⁡CρABC,ρA=Tr⁡BρAB=Tr⁡BCρABC.\begin{aligned} \rho_{AB} &= \operatorname{Tr}_C\rho_{ABC}, \\ \rho_A &= \operatorname{Tr}_B\rho_{AB} \\ &= \operatorname{Tr}_{BC}\rho_{ABC}. \end{aligned}

Traces over distinct factors commute:

Tr⁡BTr⁡CXABC=Tr⁡CTr⁡BXABC.\operatorname{Tr}_B \operatorname{Tr}_C X_{ABC} = \operatorname{Tr}_C \operatorname{Tr}_B X_{ABC}.

What must not change silently is the labeling and ordering of factors in the chosen matrix or tensor representation.

For a local unitary acting only on the discarded subsystem,

Tr⁡B[(IA⊗UB)XAB×(IA⊗UB†)]=Tr⁡BXAB.\begin{aligned} &\operatorname{Tr}_B \left[ (I_A\otimes U_B) X_{AB} \right. \\ &\qquad\left. \times (I_A\otimes U_B^\dagger) \right] = \operatorname{Tr}_B X_{AB}. \end{aligned}

The retained state is invariant because the partial trace is basis independent and UBU_B merely changes the discarded basis.

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.

  • Tracing over the subsystem to be kept. Name the output before contracting indices.
  • Using inconsistent basis order. A correct block formula with the wrong product-basis order gives the wrong marginal.
  • Taking an elementwise trace. The partial trace contracts matched tensor indices; it is not deletion of arbitrary rows and columns.
  • Assuming reduction preserves purity. A pure entangled state has mixed reduced states.
  • Inferring the global state from marginals. Different joint states can share every one-body marginal.
  • Confusing discarding with conditioning. A postselected state requires an outcome record and normalization.
  • Calling local entropy entanglement in a mixed joint state. That identification is valid for pure bipartite states, not generally.
  • Treating a basis formula as basis dependent. The calculation uses a basis; the map does not.
  • Dropping domain assumptions in infinite dimensions. Trace-class conditions matter.

Core calculation. Read Density Operators → Entangled States → Partial Trace.

Processes and information. Continue to Quantum Operations and then No-Broadcasting Theorem.

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

Let XAB=A⊗BX_{AB}=A\otimes B, where AA and BB are finite-dimensional operators. Show that

Tr⁡B(A⊗B)=ATr⁡B.\operatorname{Tr}_B(A\otimes B) = A\operatorname{Tr}B.
Solution

Choose an orthonormal basis {∣j⟩B}\{\lvert j\rangle_B\}. Then

Tr⁡B(A⊗B)=∑j(IA⊗⟨j∣)(A⊗B)×(IA⊗∣j⟩)=∑jA⟨j∣B∣j⟩=ATr⁡B.\begin{aligned} \operatorname{Tr}_B(A\otimes B) &= \sum_j (I_A\otimes\langle j\rvert) (A\otimes B) \\ &\quad\times (I_A\otimes\lvert j\rangle) \\ &= \sum_j A\langle j\rvert B\lvert j\rangle \\ &= A\operatorname{Tr}B. \end{aligned}

For density operators ρA⊗ρB\rho_A\otimes\rho_B, this gives Tr⁡B(ρA⊗ρB)=ρA\operatorname{Tr}_B(\rho_A\otimes\rho_B)=\rho_A because Tr⁡ρB=1\operatorname{Tr}\rho_B=1.

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.\begin{aligned} &\operatorname{Tr}_B \left[ (I_A\otimes U_B) \rho_{AB} \right. \\ &\qquad\left. \times (I_A\otimes U_B^\dagger) \right] = \operatorname{Tr}_B\rho_{AB}. \end{aligned}
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.

Let ρABC\rho_{ABC} be a tripartite density operator. Show from the product-basis index formula that tracing out BB and then CC gives the same state on AA as tracing out BCBC at once.

Solution

Write the matrix elements as ρijk,i′j′k′\rho_{ijk,i'j'k'}. Tracing over BB and CC successively gives

(ρA)ii′=∑k∑jρijk,i′jk=∑j,kρijk,i′jk.\begin{aligned} (\rho_A)_{ii'} &= \sum_k\sum_j \rho_{ijk,i'jk} \\ &= \sum_{j,k} \rho_{ijk,i'jk}. \end{aligned}

The second line is exactly the contraction obtained by treating (j,k)(j,k) as a joint basis index for BCBC. Finite sums commute, so the order of tracing distinct factors does not matter.