Trace distance: Difference between revisions
unreferenced, stub sort |
Expanded and references added |
||
Line 1: | Line 1: | ||
⚫ | In [[quantum mechanics]], and especially [[quantum information]] and the study of [[open quantum system]]s, the '''trace distance''' ''T'' is a [[metric (mathematics)|metric]] on the space of [[density matrix|density matrices]] and gives a measure of the distinguishability between two states. It is the quantum generalization of the [[Kolmogorov–Smirnov test|Kolmogorov distance]] for classical probability distributions. |
||
{{unreferenced|date=August 2012}} |
|||
⚫ | In [[quantum mechanics]], and especially [[quantum information]] and the study of [[open quantum system]]s, the '''trace distance''' ''T'' is a [[metric (mathematics)|metric]] on the space of [[density matrix|density matrices]] |
||
== Definition == |
|||
The trace norm is just half of the [[trace norm]] of the difference of the matrices: |
|||
:<math>T(\rho,\sigma) := \frac{1}{2}||\rho - \sigma||_{1} = \frac{1}{2} \mathrm{Tr} \left[ \sqrt{(\rho-\sigma)^\dagger (\rho-\sigma)} \right] .</math> |
:<math>T(\rho,\sigma) := \frac{1}{2}||\rho - \sigma||_{1} = \frac{1}{2} \mathrm{Tr} \left[ \sqrt{(\rho-\sigma)^\dagger (\rho-\sigma)} \right] .</math> |
||
Line 12: | Line 14: | ||
where the <math>\lambda_i</math> are eigenvalues of the Hermitian, but not necessarily positive, matrix <math>(\rho-\sigma)</math>. |
where the <math>\lambda_i</math> are eigenvalues of the Hermitian, but not necessarily positive, matrix <math>(\rho-\sigma)</math>. |
||
== |
== Physical interpretation == |
||
It can be shown that the trace distance satisfies the equation<ref name="nielsen">M. Nielsen, I. Chuang, ''Quantum Computation and Quantum Information'', Cambridge University Press, 2000, Chapter 9</ref> |
|||
:<math> |
|||
T(\rho,\sigma) = \max_P \mathrm{Tr}[P(\rho-\sigma)] |
|||
</math> |
|||
where the maximization can be carried either over all [[Projection (linear algebra)|projectors]] <math>P</math>, or over all positive operators <math>P \leq I</math>, where <math>I</math> is the identity operator. |
|||
<math>\mathrm{Tr}[P(\rho-\sigma)]</math> is the difference in probability that the outcome of the measurement be <math>P</math>, depending on weather the system was in the state <math>\rho</math> or <math>\sigma</math>. Thus the trace distance is the probability difference maximized over all possible measurements: it gives a measure of the maximum probability of distinguishing between two states with an optimal measurement. |
|||
For example, suppose [[Alice and Bob|Alice]] prepares a system in either the state <math>\rho</math> or <math>\sigma</math>, each with probability <math>\frac 12</math> and sends it to Bob who has to discriminate between the two states. It is easy to show that with the optimal measurement, Bob has the probability |
|||
⚫ | |||
:<math> |
|||
p_{\text{max}} = \frac 12 (1 + T(\rho,\sigma)) |
|||
</math> |
|||
of correctly identify in which state Alice prepared the system.<ref>S. M. Barnett, "Quantum Information", Oxford University Press, 2009, Chapter 4</ref> |
|||
== Properties == |
|||
The trace distance has the following properties<ref name="nielsen" /> |
|||
* It is a metric on the space of density matrices, i.e. it is non-negative, symmetric, and satisfies the [[triangle inequality]], and <math>T(\rho,\sigma) = 0 \Leftrightarrow \rho=\sigma</math> |
|||
* <math>0 \leq T(\rho,\sigma) \leq 1</math> and <math>T(\rho,\sigma)=1 </math> if and only if <math>\rho</math> and <math>\sigma</math> have orthogonal supports |
|||
* It is preserved under [[unitary operator|unitary transformations]]: <math>T(U\rho U^\dagger,U\sigma U^\dagger) = T(\rho,\sigma) </math> |
|||
* It is contractive under [[Quantum operation|trace-preserving CP maps]], i.e. if <math>\Phi</math> is a CPT map, then <math>T(\Phi(\rho),\Phi(\sigma))\leq T(\rho,\sigma)</math> |
|||
* It is convex in each of its inputs. E.g. <math>T(\sum_i p_i \rho_i,\sigma) \leq \sum_i p_i T(\rho_i,\sigma)</math> |
|||
For [[qubits]], the trace distance is equal to half the [[Euclidean distance]] in the [[Bloch sphere|Bloch representation]]. |
|||
⚫ | |||
==== Fidelity ==== |
|||
⚫ | |||
:<math> |
:<math> |
||
Line 20: | Line 46: | ||
</math> |
</math> |
||
The upper inequality becomes an equality when <math>\rho</math> and <math>\sigma</math> are [[quantum state#pure states|pure states]]. |
|||
⚫ | |||
==== Total variation distance ==== |
|||
The trace distance is a generalization of the [[Total variation distance of probability measures|total variation distance]], and for two commuting density matrices, has the same value as the total variation distance of the two corresponding probability distributions. |
The trace distance is a generalization of the [[Total variation distance of probability measures|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 == |
|||
{{reflist}} |
|||
[[Category:Quantum information science]] |
[[Category:Quantum information science]] |
||
[[Category:Quantum mechanics]] |
[[Category:Quantum mechanics]] |
||
{{applied-math-stub}} |
Revision as of 10:54, 12 October 2014
In quantum mechanics, and especially quantum information and the study of open quantum systems, the trace distance T 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 norm is just half of the trace norm of the difference of the matrices:
(The trace norm is the Schatten norm for p=1.) The purpose of the factor of two is to restrict the trace distance between two normalized density matrices to the range [0, 1] and to simplify formulas in which the trace distance appears.
Since density matrices are Hermitian,
where the are eigenvalues of the Hermitian, but not necessarily positive, matrix .
Physical interpretation
It can be shown that the trace distance satisfies the equation[1]
where the maximization can be carried either over all projectors , or over all positive operators , where is the identity operator. is the difference in probability that the outcome of the measurement be , depending on weather the system was in the state or . Thus the trace distance is the probability difference maximized over all possible measurements: it gives a measure of the maximum probability of distinguishing between two states with an optimal measurement.
For example, suppose Alice prepares a system in either the state or , each with probability and sends it to Bob who has to discriminate between the two states. It is easy to show that with the optimal measurement, Bob has the probability
of correctly identify 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
- and if and only if and have orthogonal supports
- It is preserved under unitary transformations:
- It is contractive under trace-preserving CP maps, i.e. if is a CPT map, then
- It is convex in each of its inputs. E.g.
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 is related to the trace distance by the inequalities
The upper inequality becomes an equality when and are pure states.
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.