Quantum requires a lot of Linear Algebra, so much even that it’s very interesting to have a quick reminder about it. In here I will explain the basics of Linear Algebra that are needed to work with Quantum Computing.
Most often used in Quantum Computing are the so called “Ket” vectors, which are a representation of the “Dirac Notation”.
These vectors can look like: where we have several elements:
< x= Our “bra”, mostly representing a row vector
|= Action of a linear functional on a vector or the scalar product of vectors
y >= our “ket”, mostly representing a column vector
A matrix is a rectangular scheme of numbers with
m rows and
x columns. It is an easy way to calculate formulas that are represented in some sort of structure. Most commonly used in Quantum Computing is the need for being able to Multiply these matrices. However to be able to multiple these matrices, we first need to look if the base requirement of the columns of matrix a being equal to the rows of matrix b is met. Once that is done, we can start multiplying them.
To multiple those, we then take every row and multiply it with every column, taking the sum of the results.
Notice that our first matrix is a 2 x 2 matrix, and our second one is a 2 x 1 —> 2 x 2 & 2 x 1, the insides 2’s have to be equal.
Putting this into practice:
Complex numbers are written by , they solve the fundamental problem of which is impossible to solve, stating it as a new symbol .
We can visualize complex numbers by using a circle of unit length 1, generating an Imaginary axis and a Real axis.
Where we can find the following statements: