Trace Distance in quantum mechanics

Click For Summary
SUMMARY

The discussion focuses on the quantum mechanical trace distance, specifically Theorem 9.1 from "Quantum Computation and Quantum Information" by Nielsen and Chuang. The theorem defines the trace distance between two quantum states, represented by density matrices ρ and σ, using the probabilities obtained from a set of Positive Operator-Valued Measures (POVMs). The proof involves spectral decomposition, where the difference between the states is expressed as the sum of positive operators with orthogonal support, leading to the conclusion that |ρ - σ| = Q + S. The participants clarify the relationship between the operators and the necessity of orthogonality in the decomposition.

PREREQUISITES
  • Understanding of quantum mechanics concepts, particularly density matrices.
  • Familiarity with Positive Operator-Valued Measures (POVMs).
  • Knowledge of spectral decomposition in linear algebra.
  • Basic grasp of Hermitian operators and their properties.
NEXT STEPS
  • Study the proof of Theorem 9.1 in "Quantum Computation and Quantum Information" by Nielsen and Chuang.
  • Explore the concept of Positive Operator-Valued Measures (POVMs) in quantum measurement theory.
  • Learn about spectral decomposition and its applications in quantum mechanics.
  • Investigate the properties of Hermitian operators and their role in quantum state transformations.
USEFUL FOR

Quantum physicists, researchers in quantum information theory, and students studying quantum mechanics who seek a deeper understanding of trace distance and its mathematical foundations.

Emil_M
Messages
45
Reaction score
2
Hi, I am trying to familiarize myself with the quantum mechanical trace distance and hit a brick wall. Thus, I would appreciate your help with the matter!

I am reading up on trace distance using Nielsen, Chunang - Quantum Computation and Quantum Information and Bengtsson, Zyczkowski - Geometry of quantum states; an introduction to quantum entanglement.

Unfortunately, I can't seem to wrap my head around the prove of Theorem 9.1 in Nielsen, Chuang.

It states:

Let ##\{E_m\}## be a set of POVMs, with ##p_m:=tr(\rho E_m)## and ##q_m:=tr(\sigma E_m)## as the probabilities of obtaining a measurement outcome labeled by ##m##. Then ##D(\rho,\sigma) = max_{\{E_m\}} D(q_m, q_m)##, where the maximization is over all POVMs.

The prove of this theorem states:

Note that ##D(p_m,q_m ) =\frac{1}{2} \sum_m |tr(E_m(\rho-\sigma))|##.

Using the spectral decomposition, we may write ##\sigma - \rho =Q-S##, where ##Q## and ##S## are positive operators with orthogonal support. Thus ##|\rho-\sigma| = Q+S##.
Here ##|A|:=\sqrt{|A^\dagger A|}##How exactly does one obtain this last relation?

I have tried writing ##\rho-\sigma## as ##UDU^\dagger## and split the diagonal matrix into positive and negative parts.

This yields:

\rho-\sigma= UQU^\dagger + USU^\dagger

\begin{align*}|\rho-\sigma|&amp;=\sqrt{\big( UDU^\dagger\big)^\dagger \big( UDU^\dagger\big)}\\<br /> &amp;=\sqrt{\big( UD^\dagger U^\dagger\big) \big( UDU^\dagger\big)}\\<br /> &amp;=UDU^\dagger = Q-S\end{align*} since ##D## is diagonal and real, right?

However that doesn't look like it's correct at all.

Could you guys help me out? Thanks!
 
The OP might already solved the problem, but here we go.
Emil_M said:
Using the spectral decomposition, we may write ##\sigma - \rho =Q-S##, where ##Q## and ##S## are positive operators with orthogonal support.
The keyword is "orthogonal". ## \rho - \sigma ## is Hermitian so by the spectral decomposition,
\rho - \sigma = \sum_i \lambda_i P_i,
where the ##\lambda_i##'s are eigenvalues with the corresponding orthogonal projections ##P_i## onto the eigenvectors. Both \sum_{\substack{i \\ \lambda_i \ge 0}} \lambda_i P_i and - \sum_{\substack{i \\ \lambda_i &lt; 0}} \lambda_i P_i are positive operators. Call them ##Q## and ##S## respectively so that \rho - \sigma = Q - S.
Then ## | \rho - \sigma | = Q + S ## because ##Q## and ##S## are orthogonal i.e. ##QS = SQ = 0##.
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
11K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 4 ·
Replies
4
Views
4K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 19 ·
Replies
19
Views
4K
  • · Replies 3 ·
Replies
3
Views
5K
  • · Replies 22 ·
Replies
22
Views
6K