MHB Matrices Often Used in Quantum Computing

Click For Summary
The discussion focuses on the matrices commonly used in quantum computing, highlighting their properties such as whether they are unitary and self-adjoint. Key matrices discussed include the Hadamard, Pauli X, Y, Z, Phase, and pi/8 gates, along with their eigenvalues and normalized eigenvectors. The conversation also touches on the implementation of a quantum computer simulator that currently includes Shor's and Grover's algorithms, with plans for further development. Participants express interest in moving the discussion to a more relevant forum for quantum mechanics or computer science. Overall, the thread serves as a resource for those studying quantum computing and its mathematical foundations.
Ackbach
Gold Member
MHB
Messages
4,148
Reaction score
94
I am beginning a study I have long wanted to engage in: quantum computing. This is a field lying at the intersection of mathematics, physics, computer science, and electrical engineering - all topics I studied, to varying levels. From time to time, I plan on posting notes and summaries that might prove useful to others studying the same thing. Without further ado:

$$\begin{array}{|c|c|c|c|c|c|} \hline
\textbf{Name} &\textbf{Matrix} &A^{\dagger}A=I? &A=A^{\dagger}? &\textbf{E-values} &\textbf{Norm. E-vectors} \\
\hline
\text{Hadamard} &H=\dfrac{1}{\sqrt{2}}\begin{bmatrix}1 &1\\1 &-1\end{bmatrix} &\text{Yes} &\text{Yes}
&1,\; -1 &\dfrac{1}{\sqrt{4-2\sqrt{2}}}\begin{bmatrix}1 \\ \sqrt{2}-1\end{bmatrix}, \;
\dfrac{1}{\sqrt{4+2\sqrt{2}}}\begin{bmatrix}1 \\ -\sqrt{2}-1\end{bmatrix} \\ \hline
\text{Pauli }X &X=\begin{bmatrix}0 &1\\1 &0\end{bmatrix} &\text{Yes} &\text{Yes} &1, \; -1
&\dfrac{1}{\sqrt{2}}\begin{bmatrix}1\\1\end{bmatrix}, \; \dfrac{1}{\sqrt{2}}
\begin{bmatrix}1\\-1\end{bmatrix} \\ \hline
\text{Pauli }Y &Y=\begin{bmatrix}0&-i\\i&0\end{bmatrix} &\text{Yes} &\text{Yes}
&1, \; -1 &\dfrac{1}{\sqrt{2}}\begin{bmatrix}1\\i\end{bmatrix}, \; \dfrac{1}{\sqrt{2}}
\begin{bmatrix}1\\-i\end{bmatrix} \\ \hline
\text{Pauli }Z &Z=\begin{bmatrix}1&0\\0&-1\end{bmatrix} &\text{Yes} &\text{Yes}
&1, \; -1 &\begin{bmatrix}1\\0\end{bmatrix}, \; \begin{bmatrix}0\\1\end{bmatrix} \\ \hline
\text{Phase} &S=\begin{bmatrix}1&0\\0&i\end{bmatrix} &\text{Yes} &\text{No} &1,\;i
&\begin{bmatrix}1\\0\end{bmatrix}, \; \begin{bmatrix}0\\1\end{bmatrix} \\ \hline
\pi/8 &T=\begin{bmatrix}1&0\\0&e^{i\pi/4}\end{bmatrix} &\text{Yes} &\text{No} &1, \; e^{i\pi/4}
&\begin{bmatrix}1\\0\end{bmatrix}, \; \begin{bmatrix}0\\1\end{bmatrix} \\ \hline
\end{array}$$
 
Last edited by a moderator:
  • Like
Likes aaroman and vanhees71
Physics news on Phys.org
Greg Bernhardt said:
Thanks @Ackbach! Think we can move to QM or Comp Sci forum?
Let's put these two in QM. I don't think they're useful enough for stickying.
 
A few days ago, I started to implement a quantum computer simulator. It's very basic but the things I tried seem to work ok.
For now only Shor (the quantum part) and Grover algorithms are there but I intend to add more.
Source code here: https://github.com/aromanro/QCSim
Phase and pi/8 gates mentioned above can be used with the more general PhaseShiftGate.
 
I am slowly going through the book 'What Is a Quantum Field Theory?' by Michel Talagrand. I came across the following quote: One does not" prove” the basic principles of Quantum Mechanics. The ultimate test for a model is the agreement of its predictions with experiments. Although it may seem trite, it does fit in with my modelling view of QM. The more I think about it, the more I believe it could be saying something quite profound. For example, precisely what is the justification of...

Similar threads

  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 22 ·
Replies
22
Views
2K
Replies
2
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 1 ·
Replies
1
Views
1K