-
Notifications
You must be signed in to change notification settings - Fork 66
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Exercise 2.63 #3
Comments
The answer is a direct conclusion of polar decomposition. |
If all measurement operators are square, I agree polar decomposition is sufficient. |
Doesn't the squareness depend on your basis? Unless I'm missing something you can always make the measurement operator have a square matrix representation by padding it with P.S. Thank you for your work :) |
We can always choose an appropriate basis to transform a matrix into square matrix. A simple way is to pick up the support of input space and the range of output space |
We actually need to prove the existence of unitaries$U_m$ , not just verify the correctness of the formula $M_m = U_m\sqrt{E_m}$ .
So, the correct solution is something like this:
Suppose$M_m^\dagger M_m = E_m$ .$E_m > 0$ then denote $U_m = M_m(\sqrt{E_m})^{-1}$ . We can verify that $U_m$ is indeed unitary, because we can deduce that $U_m^\dagger U_m = I$ .$E_m \ge 0$ then use limiting argument similar to this https://en.wikipedia.org/wiki/Cholesky_decomposition#Proof_for_positive_semi-definite_matrices$E_m^\prime = E_m + \frac{1}{k}I$ and so on...
If
If
I.e. consider
The text was updated successfully, but these errors were encountered: