Trace distance

From testwiki
Revision as of 02:57, 25 February 2025 by imported>LR.127 (Adding short description: "Metric in quantum mechanics")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description In quantum mechanics, and especially quantum information and the study of open quantum systems, the trace distance is a metric on the space of density matrices and gives a measure of the distinguishability between two states. It is the quantum generalization of the Kolmogorov distance for classical probability distributions.

Definition

The trace distance is defined as half of the trace norm of the difference of the matrices:T(ρ,σ):=12ρσ1=12Tr[(ρσ)(ρσ)],where A1Tr[AA] is the trace norm of A, and A is the unique positive semidefinite B such that B2=A (which is always defined for positive semidefinite A). This can be thought of as the matrix obtained from A taking the algebraic square roots of its eigenvalues. For the trace distance, we more specifically have an expression of the form |C|CC=C2 where C=ρσ is Hermitian. This quantity equals the sum of the singular values of C, which being C Hermitian, equals the sum of the absolute values of its eigenvalues. More explicitly, T(ρ,σ)=12Tr|ρσ|=12i=1r|λi|, where λi is the i-th eigenvalue of ρσ, and r is its rank.

The factor of two ensures that the trace distance between normalized density matrices takes values in the range [0,1].

Connection with the total variation distance

The trace distance serves as a direct quantum generalization of the total variation distance between probability distributions. Given two probability distributions P and Q, their total variation distance is defined asδ(P,Q)=12PQ1=12k|PkQk|.When extending this concept to quantum states, one must account for the fact that for quantum states different measurement can produce different distributions. A natural approach is to consider the (classical) total variation distance between the measurement outcomes produced by two states for a fixed choice of measurement, and then maximize over all possible measurements. This procedure leads precisely to the trace distance between the quantum states. More explicitly, this is the quantitymaxΠ12i|Tr(Πiρ)Tr(Πiσ)|,with the maximization performed with respect to all possible POVMs {Πi}i.

To understand why this maximum equals the trace distance between the states, note that there is a unique decomposition ρσ=PQ with P,Q0 positive semidefinite matrices with orthogonal support. With these operators we can write concisely |ρσ|=P+Q. Furthermore Tr(ΠiP),Tr(ΠiQ)0, and thus |Tr(ΠiP)Tr(ΠiQ))|Tr(ΠiP)+Tr(ΠiQ). We thus havei|Tr(Πi(ρσ))|=i|Tr(Πi(PQ))|iTr(Πi(P+Q))=Tr|ρσ|.This shows thatmaxΠδ(PΠ,ρ,PΠ,σ)T(ρ,σ),where PΠ,ρ denotes the classical probability distribution resulting from measuring ρ with the POVM Π, (PΠ,ρ)iTr(Πiρ), and the maximum is performed over all POVMs Π{Πi}i.

To conclude that the inequality is saturated by some POVM, we need only consider the projective measurement with elements corresponding to the eigenvectors of ρσ. With this choice,δ(PΠ,ρ,PΠ,σ)=12i|Tr(Πi(ρσ))|=12i|λi|=T(ρ,σ),where λi are the eigenvalues of ρσ.

Physical interpretation

By using the Hölder duality for Schatten norms, the trace distance can be written in variational form as [1]

T(ρ,σ)=12sup𝕀U𝕀Tr[U(ρσ)]=sup0P𝕀Tr[P(ρσ)].

As for its classical counterpart, the trace distance can be related to the maximum probability of distinguishing between two quantum states:

For example, suppose Alice prepares a system in either the state ρ or σ, each with probability 12 and sends it to Bob who has to discriminate between the two states using a binary measurement. Let Bob assign the measurement outcome 0 and a POVM element P0 such as the outcome 1 and a POVM element P1=1P0 to identify the state ρ or σ, respectively. His expected probability of correctly identifying the incoming state is then given by

pguess=12p(0|ρ)+12p(1|σ)=12Tr(P0ρ)+12Tr(P1σ)=12(1+Tr(P0(ρσ))).

Therefore, when applying an optimal measurement, Bob has the maximal probability

pguessmax=supP012(1+Tr(P0(ρσ)))=12(1+T(ρ,σ))

of correctly identifying in which state Alice prepared the system.[2]

Properties

The trace distance has the following properties[1]

  • It is a metric on the space of density matrices, i.e. it is non-negative, symmetric, and satisfies the triangle inequality, and T(ρ,σ)=0ρ=σ
  • 0T(ρ,σ)1 and T(ρ,σ)=1 if and only if ρ and σ have orthogonal supports
  • It is preserved under unitary transformations: T(UρU,UσU)=T(ρ,σ)
  • It is contractive under trace-preserving CP maps, i.e. if Φ is a CPTP map, then T(Φ(ρ),Φ(σ))T(ρ,σ)
  • It is convex in each of its inputs. E.g. T(ipiρi,σ)ipiT(ρi,σ)
  • On pure states, it can be expressed uniquely in term of the inner product of the states: T(|ψψ|,|ϕϕ|)=1|ψ|ϕ|2 [3]

For qubits, the trace distance is equal to half the Euclidean distance in the Bloch representation.

Relationship to other distance measures

Fidelity

The fidelity of two quantum states F(ρ,σ) is related to the trace distance T(ρ,σ) by the inequalities

1F(ρ,σ)T(ρ,σ)1F(ρ,σ).

The upper bound inequality becomes an equality when ρ and σ are pure states. [Note that the definition for Fidelity used here is the square of that used in Nielsen and Chuang]

Total variation distance

The trace distance is a generalization of the total variation distance, and for two commuting density matrices, has the same value as the total variation distance of the two corresponding probability distributions.

References

Template:Reflist

  1. 1.0 1.1 Template:Cite book
  2. S. M. Barnett, "Quantum Information", Oxford University Press, 2009, Chapter 4
  3. Template:Cite book