The information basis is given by the vectors |0⟩ and |1⟩. If a qubit is in one of the two information basis vectors, then the measurement outcomes have all-or-nothing probability:
The two basis vectors in the (fair) Bell basis are given by
If a qubit is in one of the two (fair) Bell basis vectors, measurement outcomes are equally likely:
The Hadamard matrix,
takes one information basis vector and turns it into a Bell basis vector:
Since each information basis measurement of a Bell basis vector is equally likely, you can think of this basis as a fair coin.
So far, this Hadamard matrix has appear greatly in the quantum information MOOC. You can also have unfair coins, corresponding to a biased Bell basis. Here is one such biased basis:
Here we must require
in order for the probability to be real and normalized. Note that the biased basis is ortho-normal:
However, information basis measurements are now not equally likely:
Note that ϵ=0 reduces to the fair Bell basis.
The matrix that produces the biased Bell basis is
I suppose that the fairness of the usual Bell basis is important for the algorithms where this gate is used. But can you do anything useful with a biased Bell basis?