Workshop 07 - Introduction to Quantum Computing

←   Home  →

Qubit

As opposed to classical bit, one qubit has both 0 and 1 values at the same time, which is quite counter intuitive (e.g. a sphere spinning in both directions at the same time).
A qubit could be represented as a unit vector in C2 (the set of complex numbers):

Ψ = α|0> + β|1>, |α|2 + |β|2 = 1

"Semaphores Analogy" (proposed by the author)

Qubit => semaphore which randomly switches from red to green and back with probabilities:
r (red), and g (green) => r + g = 1
Supposing the semaphore switches fast enough from one color to another, the eye will perceive the average. Thus, one will perceive it is both red and green at the same time, but with different intensities

An example of a physical qubit implementation is the Josephson Junction, which is a macroscopic system with quantum behavior (superconductivity, Cooper electron pairs, Bose-Einstein condensate).

Quantum Register

In the frame of the same "Semaphores Analogy", one could consider two independent semaphores, randomly switching, enough fast, from red to green and back, with the corresponding probabilities:

(r1, g1), and (r2, g2)

Thus, the probabilities of compound states could be obtained by multiplication of individual probabilities:

r1 * r2, r1 * g2, g1 * r2, g1 * g2

This could be written using the matrix Kronecker product:

r1 * r2 + r1 * g2 + g1 * r2 + g1 * g2 = (r1 + g1) * (r2 + g2) = 1


Folding a piece of paper 50 times you'll almost get the distance to the Sun. Imagine the number of states of an 100 qubits register.

Quantum Entanglement

Consider a quantum register in which (0,0) and (1,1) states have the same probabilities:

Which is the state of each qubit in this case?


In "semaphores analogy", one could consider two "synchronized semaphores" with: r1 = g1 = 0.5, and r2 = g2 = 0.5
As the two semaphores are not independent, it is not possible any more to obtain the compound states probabilities by multiplying individual probabilities.

Unitary Operators

Unitary Operator: in "semaphores analogy", is a "device" capable of changing the "red/green" probabilities of one quantum register:

Each unitary operator is associated to a matrix. The action on a vector state could be obtained by matrix multiplication. It is important to mention unitary operators are preserving the norm.

Quantum logic gate: a unitary operator, acting on a small number of qubits.
Unlike many classical logic gates, quantum gates are reversible.

Quantum algorithm: a prescription of a sequence of unitary operators applied to an initial state:

Measurement

Measurement: in "semaphores analogy", is a "switch" used for stopping some or all semaphores from oscillating. The semaphores will "freeze" in a single state.
Thus, considering the case of a single qubit, one will find either red (with probability r) or green (with probability g).
Given the statistical nature of measurement, quantum algorithms are usually run multiple times.

The Bloch Circle

Considering one qubit:

Ψ=α|0> + β|1>, |α|2+|β|2=1

Without limiting generality, one could write:

Why θ/2 ?
R: It is more convenient from a graphical point of view

Why using the OZ axis?
R: As we'll see later, the qubit could be represented, in fact, on a sphere with polar coordinates.

Examples of single qubit Gates

Reset: |0> not a gate but an irreversible operation.

Hadamard:

IBM Quantum Platform


NOT:

Rx, Ry, Rz
Rotations around the 3 axes.


Observation! One could obtain any probability for |0>, respectively |1> by employing the Ry gate. For example:
Ry(π/6) => θ/2 = π/12 => 0.965 |0> + 0.258 |1> =>
p(0) = 0.9652 = 93.3%, p(1) = 0.2582 = 6.7%

Superposition or Statistical Mix?

Given the statistical nature of measurement, could one be sure the qubit is simultaneously 0 and 1? It could be simply a series of 0 and 1 values, chained with the corresponding probabilities.
Let's take, for example: |+> = H |0> => |0> -> 50%; |1> -> 50%
One could further apply the Ry(π/2) gate.

Statistical Mix Superposition
Ry(π/2) |0> = |+>
Ry(π/2) |1> = |-> 		Ry(π/2) |+> = |1>
Measurement: p(0) = p(1) = 0.5 Measurement: p(0) = 0, p(1) = 1



Theory:

Test run on a real quantum computer:

The deviation from expected result cannot be related to statistical fluctuations, as the probability of the |0> state should be either 0 or 50%! The presence of |0> is caused by Quantum Errors, e.g. qubits are very sensitive to the environment => Decoherence (loss of information from a system into the environment).

The Bloch Sphere

One qubit is described by its corresponding wave function:

Ψ = α|0> + β|1>, |α|2 + |β|2 = 1

α and β could be also separated by a phase difference:

Thus:

The Bloch Sphere:

Two-qubits Examples

Kronecker product test

Qubit 1: Pi/3 => cos(Pi/6)|0> + sin(Pi/6)|1> = 0.86|0> + 0.5|1>
    => p(0) = 0.862 = 0.75, p(1) = 0.52 = 0.25
Qubit 2: Pi/4 => cos(Pi/8)|0> + sin(Pi/8)|1> = 0.92|0> + 0.38|1>
    => p(0) = 0.922 = 0.85, p(1) = 0.382 = 0.14




Quantum Entanglement

"Synchronized semaphores":

1: Hadamard on first qubit => 2-0.5|0> + 2-0.5|1> (Diagonal State)
2: Apply the 2-bits Conditional Not (CNOT) gate => 2-0.5|0,0> + 2-0.5|1,1> (Bell State)


References:

IBM - Learn quantum computing
IBM Quantum Platform
Single qubit neural quantum circuit for solving Exclusive-OR
Introduction to Quantum Computing
←   Home  →