Skip to content

Partial trace is characterized by equality of all bounded local expectations. That characterization makes it possible to prove consistency under regrouping, local channels, and approximations without manipulating potentially ambiguous infinite index sums. The canonical Partial Trace article introduces the basic operation, and Trace and Partial Trace proves its trace-class construction.

Helpful background. Normal States supplies density-operator continuity. Completely Positive Maps and Instruments supply normal channels and outcome operations.

Repeated reductions commute when factors are declared

Section titled “Repeated reductions commute when factors are declared”

Let ρ\rho be a density operator on HA⊗HB⊗HC\mathcal H_A\otimes\mathcal H_B\otimes\mathcal H_C, with the usual canonical associativity identification. The reduction to AA can be performed in either order:

Tr⁡BCρ=Tr⁡B(Tr⁡Cρ)=Tr⁡C(Tr⁡Bρ).\operatorname{Tr}_{BC}\rho =\operatorname{Tr}_B(\operatorname{Tr}_C\rho) =\operatorname{Tr}_C(\operatorname{Tr}_B\rho).

The spaces in the last two expressions are understood after the corresponding factors have been removed.

To prove the first equality, pair both sides with arbitrary bounded XX on AA. Repeatedly using the defining identity gives

Tr⁡ ⁣[X Tr⁡B(Tr⁡Cρ)]=Tr⁡[ρ(X⊗IB⊗IC)].\operatorname{Tr}\!\left[ X\,\operatorname{Tr}_B(\operatorname{Tr}_C\rho) \right] =\operatorname{Tr}\bigl[\rho(X\otimes I_B\otimes I_C)\bigr].

The direct reduction gives the same value. Trace duality determines the trace-class operator uniquely. The other order follows identically.

This is a quantum analogue of integrating out independent coordinate labels in either order. The argument uses trace-class bounded-operator duality, so it does not require a pointwise density kernel or an exchange of conditionally convergent sums.

Trace-preserving local processing respects reduction

Section titled “Trace-preserving local processing respects reduction”

Let ΦA\Phi_A and ΦB\Phi_B be normal quantum channels in the Schrödinger picture, mapping trace-class inputs to trace-class outputs. Then

Tr⁡B′[(ΦA⊗ΦB)(ρ)]=ΦA(Tr⁡Bρ).\operatorname{Tr}_{B'}[(\Phi_A\otimes\Phi_B)(\rho)] =\Phi_A(\operatorname{Tr}_B\rho).

The prime permits a different output space for the second subsystem. To prove the identity, use the normal adjoints. For bounded XX on A′A',

Tr⁡[(ΦA⊗ΦB)(ρ)(X⊗IB′)]=Tr⁡[ρ(ΦA∗(X)⊗ΦB∗(IB′))].\operatorname{Tr}\bigl[(\Phi_A\otimes\Phi_B)(\rho) (X\otimes I_{B'})\bigr] =\operatorname{Tr}\bigl[\rho (\Phi_A^*(X)\otimes\Phi_B^*(I_{B'}))\bigr].

Trace preservation is precisely ΦB∗(IB′)=IB\Phi_B^*(I_{B'})=I_B, reducing this to the right-hand side’s expectation.

In particular, an unread local channel on BB leaves ρA\rho_A unchanged. This statement includes noisy channels and replacement channels, not only local unitaries. Normality is part of the assumptions: it supplies the trace-class maps and their tensor extension in this setting.

A remote conditional state depends only on the local effect

Section titled “A remote conditional state depends only on the local effect”

Now select one trace-nonincreasing completely positive operation ΦB\Phi_B, with effect E=ΦB∗(IB′)E=\Phi_B^*(I_{B'}). The unnormalized conditional state on AA is

τA=Tr⁡B′[(id⁡⊗ΦB)(ρ)].\tau_A=\operatorname{Tr}_{B'}[(\operatorname{id}\otimes\Phi_B)(\rho)].

Its defining expectation is

Tr⁡(XτA)=Tr⁡[ρ(X⊗E)].\operatorname{Tr}(X\tau_A)=\operatorname{Tr}[\rho(X\otimes E)].

Thus after discarding the measured subsystem, the remote conditional state depends on the local branch only through its effect. An explicitly positive expression is

τA=Tr⁡B ⁣[(I⊗E)ρ(I⊗E)].\tau_A=\operatorname{Tr}_B\!\left[ (I\otimes\sqrt E)\rho(I\otimes\sqrt E) \right].

Cyclicity with bounded factors verifies the same expectation identity. Distinct instruments with the same outcome POVM can have different joint or local output states on B′B', while giving the same conditional marginal on the untouched AA.

The branch probability is p=Tr⁡τA=Tr⁡(ρBE)p=\operatorname{Tr}\tau_A=\operatorname{Tr}(\rho_BE). Normalize by pp only when it is positive. Summing over all outcomes returns ρA\rho_A because the effects sum to identity. Outcome conditioning therefore changes a remote ensemble without enabling a change of the unread remote marginal.

Number correlation gives a worked conditional example

Section titled “Number correlation gives a worked conditional example”

For

Ψq=1−q∑n=0∞qn/2∣n,n⟩,0<q<1,\Psi_q=\sqrt{1-q}\sum_{n=0}^\infty q^{n/2}|n,n\rangle, \qquad 0<q<1,

let the effect on BB be the number event En=∣n⟩⟨n∣E_n=|n\rangle\langle n|. The displayed positive expression gives

τA(n)=(1−q)qn∣n⟩⟨n∣.\tau_A(n)=(1-q)q^n|n\rangle\langle n|.

The conditional state is ∣n⟩⟨n∣|n\rangle\langle n| and the outcome probability is (1−q)qn(1-q)q^n. This remains true if the device prepares an entirely different B′B' state after reading nn, since that preparation does not change EnE_n.

If the record is discarded, the mixture on AA is its original geometric marginal. If only a bin of numbers is retained, the conditional state is the corresponding normalized diagonal mixture. Neither conclusion requires treating an exact continuous-variable eigenket as a Hilbert-space state.

Local subspace cutoffs control all marginal errors

Section titled “Local subspace cutoffs control all marginal errors”

Let Pn→IAP_n\to I_A and Qn→IBQ_n\to I_B be increasing finite-rank projections, and put Πn=Pn⊗Qn\Pi_n=P_n\otimes Q_n. For a fixed density operator, pn=Tr⁡(ρΠn)→1p_n=\operatorname{Tr}(\rho\Pi_n)\to1. Whenever pn>0p_n>0, form

ρn=ΠnρΠnpn.\rho_n=\frac{\Pi_n\rho\Pi_n}{p_n}.

A purification of ρ\rho and its normalized projection have overlap pn\sqrt{p_n}. The fidelity–distance bounds and reduction contractivity therefore give

D(ρ,ρn)≤1−pn.D(\rho,\rho_n)\leq\sqrt{1-p_n}.

Every reduced state obeys the same upper bound on its trace distance. This supplies a simultaneous error certificate for all bounded local measurement predictions.

The bound is state dependent and becomes useless when the retained probability is small. It also says nothing by itself about convergence of unbounded energy or entropy; those require extra tail control.

  1. If an outcome effect is E=qIBE=qI_B, with fixed 0<q≤10<q\leq1, can conditioning on that outcome change the remote state?
Solution

The expectation formula gives τA=qρA\tau_A=q\rho_A. The outcome probability is qq, so the normalized state is unchanged. The measured subsystem can nevertheless undergo a nontrivial output transformation; only its effect is fixed.

  1. A local cutoff retains probability 1−10−61-10^{-6}. What follows for a binary measurement probability on either subsystem?
Solution

The reduced-state trace distance is at most 10−310^{-3}. Any effect’s probability changes by at most that distance. An energy expectation need not satisfy the same bound because energy is generally unbounded.

  • Busch, Paul, Pekka Lahti, Juha-Pekka Pellonpää, and Kari Ylinen, Quantum Measurement, Springer, 2016 — instruments, effects, and conditional states. Publisher.
  • Holevo, Alexander S., Quantum Systems, Channels, Information: A Mathematical Introduction, second revised and expanded edition, De Gruyter, 2019 — normal channels, reductions, and infinite-dimensional composite systems. Publisher.
  • Watrous, John, The Theory of Quantum Information, Cambridge University Press, 2018 — purification and distinguishability estimates. Author’s text.