Skip to content

Density-Matrix Formulation

The density-matrix formulation takes density operators as the primary quantum states. Pure-state vectors remain available through ρψ=∣ψ⟩⟨ψ∣\rho_\psi=\lvert\psi\rangle\langle\psi\rvert, but mixed preparations, reduced subsystem states, unread measurement outcomes, and open-system processes can all be stated without leaving the same operator language.

This page is the integrated postulate package. The Density Operators chapter owns the detailed theory of purity, ensembles, reductions, purification, and entropy. Here the goal is to show how states, measurements, probabilities, dynamics, composition, and conditioning fit together when ρ\rho is used from the start.

For a system with Hilbert space H\mathcal H:

  1. State:

    ρ≥0,Tr⁡ρ=1.\rho\geq0, \qquad \operatorname{Tr}\rho=1.
  2. Measurement effects:

    Ea≥0,∑aEa=I.E_a\geq0, \qquad \sum_aE_a=I.
  3. Born rule:

    p(a)=Tr⁡(ρEa).p(a) = \operatorname{Tr}(\rho E_a).
  4. Closed evolution:

    ρ⟼UρU†.\rho \longmapsto U\rho U^\dagger.
  5. Composition and reduction:

    HAB=HA⊗HB,ρA=Tr⁡BρAB.\begin{aligned} \mathcal H_{AB} &= \mathcal H_A\otimes\mathcal H_B,\\ \rho_A &= \operatorname{Tr}_B\rho_{AB}. \end{aligned}
  6. Outcome branch:

    ρ~a=Ia(ρ),p(a)=Tr⁡ρ~a.\widetilde\rho_a = \mathcal I_a(\rho), \qquad p(a) = \operatorname{Tr}\widetilde\rho_a.
  7. Conditional state, when p(a)>0p(a)>0:

    ρa=ρ~ap(a).\rho_a = \frac{\widetilde\rho_a}{p(a)}.
  8. Unconditioned operation:

    ρ′=∑aIa(ρ)=E(ρ).\rho' = \sum_a\mathcal I_a(\rho) = \mathcal E(\rho).

An instrument {Ia}\{\mathcal I_a\} describes both classical outcome statistics and quantum state disturbance. Its sum E\mathcal E is a trace-preserving quantum channel when all outcomes are retained but their labels are ignored.

The formulas apply directly in finite dimension and, with trace-class and continuity qualifications, to normal states on separable Hilbert spaces. Finite or countable outcome sets are used for compact notation. Continuous outcomes require operator-valued measures and instrument-valued measures.

The formulation distinguishes three kinds of positive operator:

  • a normalized state ρ\rho has trace one;
  • a subnormalized state or branch ρ~\widetilde\rho has trace between zero and one;
  • an effect EE satisfies 0≤E≤I0\leq E\leq I and pairs with states to produce probabilities.

These objects can look similar as matrices but play different operational roles. The notation and trace condition identify which role is intended.

A normalized state is a positive trace-class operator ρ\rho satisfying

ρ≥0,Tr⁡ρ=1.\rho\geq0, \qquad \operatorname{Tr}\rho=1.

Positivity means

⟨ϕ∣ρ∣ϕ⟩≥0\langle\phi\rvert \rho \lvert\phi\rangle \geq0

for every ∣ϕ⟩∈H\lvert\phi\rangle\in\mathcal H. In finite dimension, the spectral theorem gives

ρ=∑jλj∣j⟩⟨j∣,\rho = \sum_j \lambda_j \lvert j\rangle\langle j\rvert,

where

λj≥0,∑jλj=1.\lambda_j\geq0, \qquad \sum_j\lambda_j=1.

Thus the eigenvalues of a density matrix form a probability distribution.

A normalized vector defines

ρψ=∣ψ⟩⟨ψ∣.\rho_\psi = \lvert\psi\rangle \langle\psi\rvert.

The projector is unchanged by global phase:

∣ψ⟩⟼eiα∣ψ⟩⟹ρψ⟼ρψ.\lvert\psi\rangle \longmapsto e^{i\alpha}\lvert\psi\rangle \quad\Longrightarrow\quad \rho_\psi \longmapsto \rho_\psi.

In finite dimension, equivalent purity conditions are

ρ pure⟺rank⁡ρ=1⟺ρ2=ρ⟺Tr⁡ρ2=1.\begin{aligned} \rho\text{ pure} &\Longleftrightarrow \operatorname{rank}\rho=1\\ &\Longleftrightarrow \rho^2=\rho\\ &\Longleftrightarrow \operatorname{Tr}\rho^2=1. \end{aligned}

These tests do not require choosing a state vector.

If preparation jj is selected with classical probability qjq_j, the state is

ρ=∑jqjρj,qj≥0,∑jqj=1.\rho = \sum_jq_j\rho_j, \qquad q_j\geq0, \qquad \sum_jq_j=1.

The same ρ\rho can generally have inequivalent ensemble decompositions. All predictions internal to the system are determined by ρ\rho, not by a preferred decomposition. If a classical record of jj is retained, the larger classical–quantum state contains more information than the averaged operator alone.

See Ensembles and Preparation Procedures for the canonical treatment.

A positive operator ρ~\widetilde\rho with

0≤Tr⁡ρ~≤10\leq \operatorname{Tr}\widetilde\rho \leq1

can encode an event together with its probability. If its trace is nonzero, then

ρcond=ρ~Tr⁡ρ~\rho_{\mathrm{cond}} = \frac{\widetilde\rho} {\operatorname{Tr}\widetilde\rho}

is normalized. Keeping branches subnormalized until the final conditioning step makes sequential calculations cleaner and avoids losing probability factors.

Postulates 2 and 3: Effects and the Trace Rule

Section titled “Postulates 2 and 3: Effects and the Trace Rule”

A finite or countable measurement is represented by a POVM {Ea}\{E_a\}:

Ea≥0,∑aEa=I.E_a\geq0, \qquad \sum_aE_a=I.

The probability of outcome aa in state ρ\rho is

p(a)=Tr⁡(ρEa).p(a) = \operatorname{Tr}(\rho E_a).

The state–effect pairing is linear in each argument. If a preparation is mixed,

Tr⁡[(∑jqjρj)Ea]=∑jqjTr⁡(ρjEa).\operatorname{Tr} \left[ \left( \sum_jq_j\rho_j \right) E_a \right] = \sum_jq_j \operatorname{Tr}(\rho_jE_a).

If two outcomes are classically merged, their effect is the sum of their effects, and their probabilities add. These linearity properties make the trace rule compatible with ordinary probabilistic randomization and coarse graining.

Because ρ\rho and EaE_a are positive,

Tr⁡(ρEa)=Tr⁡(ρ1/2Eaρ1/2)≥0.\operatorname{Tr}(\rho E_a) = \operatorname{Tr} \left( \rho^{1/2}E_a\rho^{1/2} \right) \geq0.

Completeness gives

∑ap(a)=Tr⁡(ρ∑aEa)=Tr⁡ρ=1.\begin{aligned} \sum_a p(a) &= \operatorname{Tr} \left( \rho\sum_aE_a \right)\\ &= \operatorname{Tr}\rho =1. \end{aligned}

For a pure state and rank-one projector,

Tr⁡(ρψ∣a⟩⟨a∣)=∣⟨a∣ψ⟩∣2.\begin{aligned} \operatorname{Tr} \left( \rho_\psi \lvert a\rangle\langle a\rvert \right) &= \lvert\langle a\mid\psi\rangle\rvert^2. \end{aligned}

The squared-amplitude Born rule is therefore a special case of the trace rule.

For

A=∑aaPa,A = \sum_a aP_a,

the projectors {Pa}\{P_a\} form a PVM and

p(a)=Tr⁡(ρPa).p(a) = \operatorname{Tr}(\rho P_a).

The expectation value is

⟨A⟩ρ=Tr⁡(ρA).\langle A\rangle_\rho = \operatorname{Tr}(\rho A).

The canonical derivation and consistency checks are in Trace Rule for Expectation Values.

A closed system evolves by unitary conjugation:

ρ(t2)=U(t2,t1)ρ(t1)U(t2,t1)†.\rho(t_2) = U(t_2,t_1) \rho(t_1) U(t_2,t_1)^\dagger.

This map preserves all state conditions. Hermiticity follows from taking the adjoint. Positivity follows because

⟨ϕ∣UρU†∣ϕ⟩=⟨χ∣ρ∣χ⟩≥0,\langle\phi\rvert U\rho U^\dagger \lvert\phi\rangle = \langle\chi\rvert \rho \lvert\chi\rangle \geq0,

where ∣χ⟩=U†∣ϕ⟩\lvert\chi\rangle=U^\dagger\lvert\phi\rangle. Trace preservation follows from cyclicity:

Tr⁡(UρU†)=Tr⁡(ρU†U)=1.\operatorname{Tr} \left( U\rho U^\dagger \right) = \operatorname{Tr} \left( \rho U^\dagger U \right) =1.

Unitary conjugation also preserves the eigenvalues of ρ\rho. Consequently, it preserves rank, purity, and von Neumann entropy. Closed evolution can rotate the eigenvectors but cannot purify a mixed state without conditioning or changing the system boundary.

For a time-independent Hamiltonian,

U(t)=exp⁡ ⁣(−iℏHt),U(t) = \exp\!\left( -\frac{i}{\hbar}Ht \right),

and the differential form is

iℏdρdt=[H,ρ].i\hbar \frac{d\rho}{dt} = [H,\rho].

If [H,ρ]=0[H,\rho]=0, the density operator is stationary even though individual pure-state representatives in an ensemble may carry phases.

One may evolve the state,

ρ′=UρU†,\rho' = U\rho U^\dagger,

or equivalently evolve an effect or observable backward,

Ea′=U†EaU.E_a' = U^\dagger E_aU.

The trace pairing agrees:

Tr⁡(ρ′Ea)=Tr⁡(ρEa′).\operatorname{Tr}(\rho'E_a) = \operatorname{Tr}(\rho E_a').

This duality is one reason density-operator notation makes picture changes especially transparent.

For distinguishable systems,

HAB=HA⊗HB.\mathcal H_{AB} = \mathcal H_A \otimes \mathcal H_B.

Independent preparations have product states

ρAB=ρA⊗ρB,\rho_{AB} = \rho_A\otimes\rho_B,

but general joint density operators need not be convex mixtures of product states. Entangled states lie outside that separable subset.

The state available for predictions on AA alone is

ρA=Tr⁡BρAB.\rho_A = \operatorname{Tr}_B\rho_{AB}.

It is characterized by the identity

Tr⁡AB[ρAB(XA⊗IB)]=Tr⁡A(ρAXA)\begin{aligned} \operatorname{Tr}_{AB} \left[ \rho_{AB}(X_A\otimes I_B) \right] &= \operatorname{Tr}_A(\rho_AX_A) \end{aligned}

for every suitable operator XAX_A.

This identity guarantees that local Born probabilities can be calculated from the reduced state:

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

A pure joint state can have a mixed reduced state. Mixedness therefore does not by itself imply classical ignorance about a pure state of the subsystem. See Reduced Density Matrices.

Let {Pa}\{P_a\} be a PVM. The ideal Lüders branch for outcome aa is

ρ~a=PaρPa.\widetilde\rho_a = P_a\rho P_a.

Its trace is the Born probability:

Tr⁡ρ~a=Tr⁡(PaρPa)=Tr⁡(ρPa)=p(a).\begin{aligned} \operatorname{Tr}\widetilde\rho_a &= \operatorname{Tr}(P_a\rho P_a)\\ &= \operatorname{Tr}(\rho P_a) =p(a). \end{aligned}

If p(a)>0p(a)>0, the selective state is

ρa=PaρPaTr⁡(ρPa).\rho_a = \frac{P_a\rho P_a} {\operatorname{Tr}(\rho P_a)}.

The denominator is not defined for a zero-probability outcome. The formalism supplies no conditional state for an event that cannot occur under the stated model.

If the measurement occurs but the outcome is ignored, the nonselective state is

ρ′=∑aPaρPa.\rho' = \sum_aP_a\rho P_a.

Selective and nonselective updates answer different information questions. Averaging the normalized conditional states with their outcome probabilities recovers the nonselective state:

ρ′=∑ap(a)ρa.\rho' = \sum_a p(a)\rho_a.

For a degenerate outcome, PaP_a projects onto an eigenspace rather than one ray. The Lüders update preserves coherence within that eigenspace. A more disturbing apparatus can have the same PVM effects and different postmeasurement states.

The update rule is developed canonically in State Update Rule.

Density operators make open dynamics and generalized measurement compact.

A quantum channel E\mathcal E maps normalized input states to normalized output states. It is linear, completely positive, and trace preserving. In finite dimension it has a Kraus representation

E(ρ)=∑μKμρKμ†,\mathcal E(\rho) = \sum_\mu K_\mu\rho K_\mu^\dagger,

with

∑μKμ†Kμ=I.\sum_\mu K_\mu^\dagger K_\mu = I.

Trace preservation follows directly:

Tr⁡E(ρ)=∑μTr⁡(ρKμ†Kμ)=Tr⁡ρ=1.\begin{aligned} \operatorname{Tr}\mathcal E(\rho) &= \sum_\mu \operatorname{Tr} \left( \rho K_\mu^\dagger K_\mu \right)\\ &= \operatorname{Tr}\rho =1. \end{aligned}

Complete positivity ensures that E⊗IR\mathcal E\otimes\mathcal I_R remains positive when the system is entangled with an arbitrary reference RR. Ordinary positivity on isolated input states is not enough for a universally valid local physical process.

Unitary evolution is the one-Kraus special case

EU(ρ)=UρU†.\mathcal E_U(\rho) = U\rho U^\dagger.

An instrument is a family of completely positive, trace-nonincreasing maps {Ia}\{\mathcal I_a\} whose sum is a channel:

∑aIa=E.\sum_a\mathcal I_a = \mathcal E.

Each map produces an unnormalized branch,

ρ~a=Ia(ρ),\widetilde\rho_a = \mathcal I_a(\rho),

and

p(a)=Tr⁡Ia(ρ).p(a) = \operatorname{Tr}\mathcal I_a(\rho).

The corresponding effect satisfies

Tr⁡Ia(ρ)=Tr⁡(ρEa)\operatorname{Tr}\mathcal I_a(\rho) = \operatorname{Tr}(\rho E_a)

for every state ρ\rho. The effects determine the classical outcome distribution; the maps determine both outcomes and disturbance.

A finite-dimensional instrument can be written

Ia(ρ)=∑μMaμρMaμ†,\mathcal I_a(\rho) = \sum_\mu M_{a\mu} \rho M_{a\mu}^\dagger,

with

Ea=∑μMaμ†Maμ.E_a = \sum_\mu M_{a\mu}^\dagger M_{a\mu}.

The overall completeness relation is

∑a,μMaμ†Maμ=I.\sum_{a,\mu} M_{a\mu}^\dagger M_{a\mu} = I.

See Quantum Instruments, Kraus Representation, and Completely Positive Maps for the mature open-systems treatment.

Density-operator language is not merely a repair for incomplete knowledge. It is the natural formulation whenever:

  1. a preparation is classically randomized;
  2. a subsystem is entangled with another system;
  3. a measurement outcome is ignored or coarsened;
  4. environmental degrees of freedom are traced out;
  5. thermal states are used;
  6. noisy channels and quantum operations are central;
  7. one wants basis-independent trace formulas;
  8. pure and mixed cases should be handled uniformly.

It also separates three questions that state-vector notation can blur:

  • What are the outcome probabilities?
  • What conditional state follows a recorded outcome?
  • What unconditioned state follows when the record is discarded?

The answers use effects, normalized branches, and channel outputs, respectively.

Worked Example: Selective and Unread Qubit Measurement

Section titled “Worked Example: Selective and Unread Qubit Measurement”

Write a qubit state in the computational basis as

ρ=(acc∗1−a),\rho = \begin{pmatrix} a&c\\ c^*&1-a \end{pmatrix},

with positivity requiring

0≤a≤1,∣c∣2≤a(1−a).0\leq a\leq1, \qquad \lvert c\rvert^2 \leq a(1-a).

Measure the PVM

P0=(1000),P1=(0001).P_0 = \begin{pmatrix} 1&0\\ 0&0 \end{pmatrix}, \qquad P_1 = \begin{pmatrix} 0&0\\ 0&1 \end{pmatrix}.

The outcome probabilities are

p(0)=a,p(1)=1−a.p(0)=a, \qquad p(1)=1-a.

The unnormalized Lüders branches are

ρ~0=(a000),ρ~1=(0001−a).\begin{aligned} \widetilde\rho_0 &= \begin{pmatrix} a&0\\ 0&0 \end{pmatrix},\\ \widetilde\rho_1 &= \begin{pmatrix} 0&0\\ 0&1-a \end{pmatrix}. \end{aligned}

When 0<a<10<a<1, the conditional states are

ρ0=P0,ρ1=P1.\rho_0=P_0, \qquad \rho_1=P_1.

If the outcome is unread, the state is

ρ′=ρ~0+ρ~1=(a001−a).\rho' = \widetilde\rho_0 + \widetilde\rho_1 = \begin{pmatrix} a&0\\ 0&1-a \end{pmatrix}.

The measurement removes the off-diagonal coherence cc in this basis but preserves the outcome populations. Before the unread measurement,

Tr⁡ρ2=a2+(1−a)2+2∣c∣2.\operatorname{Tr}\rho^2 = a^2+(1-a)^2+2\lvert c\rvert^2.

Afterward,

Tr⁡(ρ′)2=a2+(1−a)2.\operatorname{Tr}(\rho')^2 = a^2+(1-a)^2.

The purity decreases by 2∣c∣22\lvert c\rvert^2 unless the state was already diagonal. For the input ∣+⟩⟨+∣\lvert+\rangle\langle+\rvert, one has a=1/2a=1/2 and c=1/2c=1/2, so

∣+⟩⟨+∣⟼I2\lvert+\rangle\langle+\rvert \longmapsto \frac{I}{2}

under the unread computational-basis measurement.

This example distinguishes:

  • the POVM, which supplies p(0)p(0) and p(1)p(1);
  • the selective branches, which encode outcome and probability together;
  • the normalized conditional states;
  • the nonselective channel, which removes coherence when the record is ignored.

Whenever ρ=∣ψ⟩⟨ψ∣\rho=\lvert\psi\rangle\langle\psi\rvert:

  • the trace Born rule reduces to

    Tr⁡(ρE)=⟨ψ∣E∣ψ⟩;\operatorname{Tr}(\rho E) = \langle\psi\rvert E\lvert\psi\rangle;
  • unitary conjugation reduces to

    UρU†=∣Uψ⟩⟨Uψ∣;U\rho U^\dagger = \lvert U\psi\rangle \langle U\psi\rvert;
  • the Lüders branch reduces to

    PaρPa=∣ψ~a⟩⟨ψ~a∣,P_a\rho P_a = \lvert\widetilde\psi_a\rangle \langle\widetilde\psi_a\rvert,

    where

    ∣ψ~a⟩=Pa∣ψ⟩;\lvert\widetilde\psi_a\rangle = P_a\lvert\psi\rangle;
  • tensor-product pure states reduce to projectors onto product vectors.

The density-matrix formulation therefore contains the pure-state formulation rather than competing with it.

Verify Hermiticity, trace one, and positivity. In finite dimension, inspect eigenvalues. Small negative values at floating-point scale may be numerical noise; substantial negativity indicates an invalid state or algorithm.

Verify each effect is positive and the POVM sums to identity. Then confirm all computed probabilities are real, nonnegative, and normalized.

For each outcome,

Tr⁡ρ~a=p(a).\operatorname{Tr}\widetilde\rho_a = p(a).

Do not normalize a branch before recording its probability.

Verify complete positivity through a valid representation and trace preservation through the adjoint condition or Kraus completeness. Testing a few input matrices cannot prove complete positivity.

Verify the partial trace has trace one and reproduces all local expectation values. A tensor-ordering error often preserves dimensions while corrupting local predictions.

State explicitly whether an outcome was selected, ignored, coarse-grained, or never measured. Different records justify different density operators.

  1. Treating every density operator as ignorance about one hidden pure state. Reduced states of entangled systems do not have that interpretation.
  2. Attaching physical meaning to one ensemble decomposition. Decompositions are generally nonunique.
  3. Confusing an effect with a state. Both can be positive operators, but their normalization and operational roles differ.
  4. Normalizing an outcome branch too early. Its trace carries the outcome probability.
  5. Using the Born rule as a disturbance rule. Effects determine probabilities; instruments determine output states.
  6. Equating unread measurement with no measurement. Nonselective measurement can remove coherence.
  7. Applying unitary conjugation to an open subsystem. Reduced evolution is generally a channel.
  8. Checking positivity but not complete positivity for a local operation. Entangled extensions expose the difference.
  9. Forgetting the zero-probability condition. Conditional normalization requires p(a)>0p(a)>0.
  10. Assuming mixedness always increases. Channels can increase or decrease purity depending on the process and input; unital channels have additional monotonicity properties not shared by all channels.
  • J. von Neumann, Mathematical Foundations of Quantum Mechanics, Princeton University Press, 1955 — foundational operator and density-matrix formulation.
  • K. Kraus, States, Effects, and Operations: Fundamental Notions of Quantum Theory, Springer, 1983 — states, effects, operations, and instruments.
  • A. Peres, Quantum Theory: Concepts and Methods, Kluwer, 1995 — operationally careful treatment of mixed states and measurement.
  • M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed., Cambridge University Press, 2010 — density operators, channels, measurements, and composite systems.
  • J. Watrous, The Theory of Quantum Information, Cambridge University Press, 2018 — rigorous finite-dimensional states, maps, and complete positivity.
  • P. Busch, P. J. Lahti, J.-P. Pellonpää, and K. Ylinen, Quantum Measurement, Springer, 2016 — modern effect and instrument formalism.
  1. Validate a qubit state. Determine the real values of rr for which
ρr=12(1rr1)\rho_r = \frac12 \begin{pmatrix} 1&r\\ r&1 \end{pmatrix}

is a density matrix, and identify the pure cases.

Solution

The matrix is Hermitian and has trace one. Its eigenvalues are

λ±=1±r2.\lambda_\pm = \frac{1\pm r}{2}.

Positivity requires

−1≤r≤1.-1\leq r\leq1.

The purity is

Tr⁡ρr2=1+r22.\operatorname{Tr}\rho_r^2 = \frac{1+r^2}{2}.

It equals one exactly when ∣r∣=1\lvert r\rvert=1. Thus r=1r=1 and r=−1r=-1 are the pure states ∣+⟩⟨+∣\lvert+\rangle\langle+\rvert and ∣−⟩⟨−∣\lvert-\rangle\langle-\rvert.

  1. Recover the vector Born rule. Show directly that
Tr⁡[∣ψ⟩⟨ψ∣∣a⟩⟨a∣]=∣⟨a∣ψ⟩∣2.\operatorname{Tr} \left[ \lvert\psi\rangle\langle\psi\rvert \lvert a\rangle\langle a\rvert \right] = \lvert\langle a\mid\psi\rangle\rvert^2.
Solution

Multiply the rank-one operators:

∣ψ⟩⟨ψ∣a⟩⟨a∣=⟨ψ∣a⟩∣ψ⟩⟨a∣.\lvert\psi\rangle\langle\psi\mid a\rangle \langle a\rvert = \langle\psi\mid a\rangle \lvert\psi\rangle\langle a\rvert.

The trace of ∣u⟩⟨v∣\lvert u\rangle\langle v\rvert is ⟨v∣u⟩\langle v\mid u\rangle, so

Tr⁡[∣ψ⟩⟨ψ∣∣a⟩⟨a∣]=⟨ψ∣a⟩⟨a∣ψ⟩=∣⟨a∣ψ⟩∣2.\begin{aligned} \operatorname{Tr} \left[ \lvert\psi\rangle\langle\psi\rvert \lvert a\rangle\langle a\rvert \right] &= \langle\psi\mid a\rangle \langle a\mid\psi\rangle\\ &= \lvert\langle a\mid\psi\rangle\rvert^2. \end{aligned}
  1. Unitary preservation. Prove that unitary conjugation preserves Tr⁡ρ2\operatorname{Tr}\rho^2.
Solution

Let ρ′=UρU†\rho'=U\rho U^\dagger. Then

(ρ′)2=UρU†UρU†=Uρ2U†.\begin{aligned} (\rho')^2 &= U\rho U^\dagger U\rho U^\dagger\\ &= U\rho^2U^\dagger. \end{aligned}

Cyclicity and unitarity give

Tr⁡(ρ′)2=Tr⁡(ρ2U†U)=Tr⁡ρ2.\operatorname{Tr}(\rho')^2 = \operatorname{Tr} \left( \rho^2U^\dagger U \right) = \operatorname{Tr}\rho^2.

Thus closed-system evolution preserves purity.

  1. Selective versus nonselective update. A qubit in ∣+⟩\lvert+\rangle is measured in the computational basis with the Lüders instrument. Find the two branches, conditional states, and unread state.
Solution

The input is

ρ+=12(1111).\rho_+ = \frac12 \begin{pmatrix} 1&1\\ 1&1 \end{pmatrix}.

The branches are

ρ~0=12P0,ρ~1=12P1.\widetilde\rho_0 = \frac12P_0, \qquad \widetilde\rho_1 = \frac12P_1.

Each has trace 1/21/2. The conditional states are P0P_0 and P1P_1. Ignoring the outcome gives

ρ′=12P0+12P1=I2.\rho' = \frac12P_0+\frac12P_1 = \frac{I}{2}.

The unread measurement removes the computational-basis coherence.

  1. Same effects, different instruments. For Pa=∣a⟩⟨a∣P_a=\lvert a\rangle\langle a\rvert, compare
Ia(ρ)=PaρPa\mathcal I_a(\rho) = P_a\rho P_a

with

Ja(ρ)=Tr⁡(ρPa)∣+⟩⟨+∣.\mathcal J_a(\rho) = \operatorname{Tr}(\rho P_a) \lvert+\rangle\langle+\rvert.

Show that the effects agree and the conditional states differ.

Solution

For either map,

Tr⁡Ia(ρ)=Tr⁡Ja(ρ)=Tr⁡(ρPa).\operatorname{Tr}\mathcal I_a(\rho) = \operatorname{Tr}\mathcal J_a(\rho) = \operatorname{Tr}(\rho P_a).

Thus both instruments have effect PaP_a and identical outcome probabilities. For a nonzero branch, Ia\mathcal I_a gives conditional state PaP_a, while Ja\mathcal J_a gives ∣+⟩⟨+∣\lvert+\rangle\langle+\rvert. The POVM does not determine disturbance.

  1. Reduce a Bell state. For
∣Φ+⟩=∣00⟩+∣11⟩2,\lvert\Phi^+\rangle = \frac{ \lvert00\rangle+\lvert11\rangle }{\sqrt2},

compute the reduced density operator of subsystem AA.

Solution

Expand the joint projector:

ρAB=12(∣00⟩⟨00∣+∣00⟩⟨11∣+∣11⟩⟨00∣+∣11⟩⟨11∣).\begin{aligned} \rho_{AB} &= \frac12 \Big( \lvert00\rangle\langle00\rvert + \lvert00\rangle\langle11\rvert\\ &\qquad+ \lvert11\rangle\langle00\rvert + \lvert11\rangle\langle11\rvert \Big). \end{aligned}

The partial trace over BB removes the cross terms because ⟨1∣0⟩=0\langle1\mid0\rangle=0:

ρA=12(∣0⟩⟨0∣+∣1⟩⟨1∣)=I2.\rho_A = \frac12 \left( \lvert0\rangle\langle0\rvert + \lvert1\rangle\langle1\rvert \right) = \frac{I}{2}.

The joint state is pure while the subsystem state is maximally mixed.

  1. A depolarizing channel. For a dd-dimensional system, define
Dq(ρ)=qρ+(1−q)Id,\mathcal D_q(\rho) = q\rho + (1-q)\frac{I}{d},

with 0≤q≤10\leq q\leq1. Show that it preserves trace and find its fixed states for q≠1q\neq1.

Solution

Trace preservation follows from

Tr⁡Dq(ρ)=qTr⁡ρ+(1−q)Tr⁡Id=q+(1−q)=1.\begin{aligned} \operatorname{Tr}\mathcal D_q(\rho) &= q\operatorname{Tr}\rho + (1-q) \operatorname{Tr}\frac{I}{d}\\ &= q+(1-q) =1. \end{aligned}

A fixed state satisfies

ρ=qρ+(1−q)Id.\rho = q\rho + (1-q)\frac{I}{d}.

For q≠1q\neq1, division by 1−q1-q gives

ρ=Id.\rho=\frac{I}{d}.

The maximally mixed state is the unique fixed density operator in that range. The displayed convex form also makes positivity immediate.

  1. Coarse-grain an instrument. Outcomes aa in a subset CC are reported only as “CC.” Show that the coarse-grained branch and probability are
ρ~C=∑a∈CIa(ρ)\widetilde\rho_C = \sum_{a\in C} \mathcal I_a(\rho)

and

p(C)=∑a∈Cp(a).p(C) = \sum_{a\in C}p(a).
Solution

The coarse-grained operation is the sum of the mutually exclusive outcome maps. Its trace is

Tr⁡ρ~C=∑a∈CTr⁡Ia(ρ)=∑a∈Cp(a).\begin{aligned} \operatorname{Tr}\widetilde\rho_C &= \sum_{a\in C} \operatorname{Tr}\mathcal I_a(\rho)\\ &= \sum_{a\in C}p(a). \end{aligned}

Thus p(C)=Tr⁡ρ~Cp(C)=\operatorname{Tr}\widetilde\rho_C. If this probability is nonzero, the state conditioned only on the coarse record is

ρC=∑a∈CIa(ρ)∑a∈Cp(a).\rho_C = \frac{ \sum_{a\in C}\mathcal I_a(\rho) }{ \sum_{a\in C}p(a) }.

Coarse graining retains less classical information than learning the fine outcome.