next up previous contents
Next: The Quantum Memory Register Up: The Quantum Computer Previous: Superposition and Eigenstates   Contents

The Quantum qubit

Back to our qubit, the spin-1/2 particle. We know that while it can only be measured to have a spin of +1/2 or -1/2, it may in general be in a superposition of these states when we are not measuring it.

Let x1 be the eigenstate corresponding to the spin +1/2 state, and let x0 be the eigenstate corresponding to the spin -1/2 state. Let X be the total state of the state vector, and let w1 and w0 be the complex numbers that weight the contribution of the base states to the total state, then in general:

| X > = w0*| x0 > + w1*| x1 > = = (w0, w1)

At this point it should be remembered that w0 and w1, the weighting factors of the base states are complex numbers, and that when the state of X is measured, we are guaranteed to find it to be in either the state:

0*| x0 > + w1*| x1 > = = (0, w1)

or the state

w0*| x0 > +0*| x1 > = = (w0, 0)

The state vector is a unit vector in a Hilbert space, which is similar to vector spaces you may be more familiar with, but it differs in that the lengths of the vectors are complex numbers. It is not necessary from a physics perspective for the state vector to be a unit vector (meaning it has a length of 1), but it makes for easier calculations further on, so we will assume from here on out that the state vector has length 1. This assumption does not invalidate any claims about the behavior of the state vector.

Thus we have fully defined the basic building block of a quantum computer, the qubit. It is fundamentally different from a classical bit in that it can exist in any superposition of the 0 and 1 states when it is not being measured. (Barenco, Ekert, Sanpera, Machiavello)


next up previous contents
Next: The Quantum Memory Register Up: The Quantum Computer Previous: Superposition and Eigenstates   Contents
Matthew Hayward - Quantum Computing, Shor's Algorithm, and Parallelism GitHub Repository