1 / 23

Dirac Notation and Spectral decomposition

Dirac Notation and Spectral decomposition. Michele Mosca. Dirac notation. For any vector , we let denote , the complex conjugate of . . We denote by the inner product between two vectors and . defines a linear function that maps .

burton
Download Presentation

Dirac Notation and Spectral decomposition

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Dirac Notation and Spectral decomposition Michele Mosca

  2. Dirac notation For any vector , we let denote , the complex conjugate of . We denote by the inner product between two vectors and defines a linear function that maps (I.e. … it maps any state to the coefficient of its component)

  3. More Dirac notation defines a linear operator that maps (I.e. projects a state to its component) (Aside: this projection operator also corresponds to the “density matrix” for ) More generally, we can also have operators like

  4. More Dirac notation For example, the one qubit NOT gate corresponds to the operator e.g. The NOT gate is a 1-qubit unitary operation.

  5. Special unitaries: Pauli Matrices The NOT operation, is often called the X or σX operation.

  6. Special unitaries: Pauli Matrices

  7. What is ?? It helps to start with the spectral decomposition theorem.

  8. Spectral decomposition • Definition: an operator (or matrix) M is “normal” if MMt=MtM • E.g. Unitary matrices U satisfy UUt=UtU=I • E.g. Density matrices (since they satisfy =t; i.e. “Hermitian”) are also normal

  9. Spectral decomposition • Theorem: For any normal matrix M, there is a unitary matrix P so that M=PPt where  is a diagonal matrix. • The diagonal entries of  are the eigenvalues. The columns of P encode the eigenvectors.

  10. e.g. NOT gate

  11. Spectral decomposition

  12. Spectral decomposition

  13. Spectral decomposition

  14. Spectral decomposition

  15. Verifying eigenvectors and eigenvalues

  16. Verifying eigenvectors and eigenvalues

  17. Why is spectral decomposition useful? Note that recall So Consider e.g.

  18. Why is spectral decomposition useful?

  19. Same thing in matrix notation

  20. Same thing in matrix notation

  21. Same thing in matrix notation

  22. “Von Neumann measurement in the computational basis” • Suppose we have a universal set of quantum gates, and the ability to measure each qubit in the basis • If we measure we get with probability

  23. In section 2.2.5, this is described as follows • We have the projection operators and satisfying • We consider the projection operator or “observable” • Note that 0 and 1 are the eigenvalues • When we measure this observable M, the probability of getting the eigenvalue is and we are in that case left with the state

More Related