Processing math: 100%

M.E. Irizarry-Gelpí

Physics impostor. Mathematics interloper. Husband. Father.

Biased Bell Basis


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:

0|0=1,1|0=0,0|1=0,1|1=1

The two basis vectors in the (fair) Bell basis are given by

|+=12(|0+|1)|=12(|0|1)

If a qubit is in one of the two (fair) Bell basis vectors, measurement outcomes are equally likely:

0|+=12,1|+=12,0|=12,1|=12

The Hadamard matrix,

H=12(1111)

takes one information basis vector and turns it into a Bell basis vector:

H|0=|+H|1=|

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:

|+ϵ=1ϵ2|0+1+ϵ2|1|ϵ=1+ϵ2|01ϵ2|1

Here we must require

1ϵ1

in order for the probability to be real and normalized. Note that the biased basis is ortho-normal:

+ϵ|+ϵ=1,ϵ|+ϵ=0,+ϵ|ϵ=0,ϵ|ϵ=1

However, information basis measurements are now not equally likely:

0|+ϵ=1ϵ2,1|+ϵ=1+ϵ2,0|ϵ=1+ϵ2,1|ϵ=1ϵ2

Note that ϵ=0 reduces to the fair Bell basis.

The matrix that produces the biased Bell basis is

Hϵ=12(1ϵ1+ϵ1+ϵ1ϵ)

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?