QUANTUM COMPUTING

Classic Quantum
Information Information
• Qubit (basic unit). States: 0 , 1 .
• Fundamental properties:
• Superposition.
• Entanglement.
• Bit: 0 – 1. • Gates: operations over the qubits.
• Logic Gates: AND, • IBM Devices: 5 qubits, 14 qubits.
• IBM Simulator: 32 qubits. (Noise)
OR, NOT.
• Measurement: transform qubits info.
Into classical bits.
• Quantum computer: store and process
qubits.
• Quantum algorithm: series of operations
over qubits.
Qubit
• Is a Quantum System of 2 energy levels: 0 and 1 .
• 0 and 1 : Standard basis vectors of 𝜀𝑠 . Describe
the state of a qubit.
• Another vector can be constructed with a linear
combination of them:
 𝑎 0 + 𝑏 1 𝜖 𝜀𝑠
 𝑎, 𝑏 𝜖 ℂ
 Normalized: 𝑃 0 = 𝑎 2 ; 𝑃 1 = 𝑏 2, 𝑎 2 + 𝑏 2 =1
Bloch Sphere
• Usefull for visualizing (single) qubits.
• Sphere: 𝑟 = 1 ; points on Surface  qubit state.
• Angle 𝜃 indicates superposition, angle 𝜑 indicates change
in phase.
 IBM Quantum Composer
• Graphical user interface for
programming a quantum processor • Quantum algorithm (circuit):
(quantum algorithms). • Prepare well-defined states.
• Run in: • Execute a series of gates.
– Real quantum processor: experimental • Measurement Gate.
errors.
– Custom quantum processor (simulator)
• Composer  Quantum score (“time
progress from left to right”)
 COMPOSER
• Interface to implement circuits.
Summary of Gates
Simple Simulation: 1-qubit
measurement, ground state

Quiskit
 Simulation: Single-Qubit
X GATE
• Flips the 0 to
1 (vice versa).
Similar to
classical NOT
gate.
• X-axis rotation 𝜋
radians.
 Creating superposition
H GATE
• Generating new quantum state: combination of basis states.
• H (Hadamard gate): equal-weighted combination of the 2
states.
• X+Z rotation
1 1 1
• New Basis: Superposition basis. 𝐻 =
2 1 −1
1
 𝐻0 = 0 + 1 = +
2
1
 𝐻1 = 0 − 1 = −
2
Simple Experiments: 1-qubit measurement, full superposition
of states

1 1
2 2
H= 1 −1
2 2
 Gates: Creating superposition
We measure along stanard basis Z : No Access information about qubit’s phase.
 Simple experiment: Introducing Qubit Phase

1 0
Z gate is a 𝜋 rotation around Z axis. Z=
0 −1
Simple Experiments: 2-qubit measurement, full
superposition of states

1 1
2 2
H= 1 −1
2 2
Multi-Qubit Gates
• Two qubit processor: 4 basis States: 00 , 01 , 10 , 11
• Three qubit processor: 8 basis States.
• N qubit processor: 2𝑁 basis states.
Multi-Qubit Gates: CNOT
• Conditional logic : Controlled-NOT
• Flip (X Gate) target qubit only if control quibit is 1 .
 Simulation: Multi-Qubit Gates
10 → |11⟩
00 → |00⟩

11 → |10⟩
01 → |01⟩
 Entaglement
• Entangled state: state of multiple qubits which can not be expressed as
a tensor product of individual states.
TESTING BASIC IDEAS
 PROBABILISTIC
1 Shot
1024 Shots

4096 Shots
 PROBABILISTIC
4096 Shots
Crear estados superpuestos con probabilidades fijas:

1 0
𝑃 ∅ =
0 𝑒 𝑖∅
1 𝑖∅
𝐻𝑃 ∅ 𝐻 0 = 1 + 𝑒 𝑖∅
2 1−𝑒
Las probabilidades entonces quedan:

∅
𝑃 0 = cos 2
2

∅ 𝜋 1 0
𝑃 1 = sin2 𝑇=𝑃 = 𝑖𝜋
2 4 0 𝑒4
𝜋
𝑃 0 = cos 2 = 0.85355
8
𝜋
𝑃 1 = sin2 = 0.14644
8
PROBABILISTIC
SIMULATION (1024 SHOTS)
1 0
𝑃 ∅ = IBM Simulation Theory
0 𝑒 𝑖∅
1.2

0.8

P(0)
0.6

0.4

0.2

0
0 2/4 1 1 2/4 2
Φ[Π*RAD]
SIMULATION vs EXPERIMENT
Quiskit

An open-source quantum computing framework

Jordan-Wigner Fourier Bogoliuvob