Quantum Computation Presentation for school

Classical/Quantum
Computation
Dr. Ayesha Anjum | SDC Degree College, Kolar

IAPT | SDC Degree College | IYQ - 2025
Operations using Bits
 Binary System
 Gates (Basic Circuits)
 Addition of two bits
 Mechanical switches
 Vaccuum Tubes
 Transistors and Tunnel Effect
 Qubits
 Superposition, Decoherence,
and Entanglement
 Quantum Computers

Computers’ Language
(Binary)
Vs
Human Language
(Decimal)

Counting Binary Numbers

Bits
0 1

Bits

Bits
0 1
OFF ON

Bits
0 1
OFF ON
False True
switch switch

On/Off: Simple Circuit
Input Output
0 (OFF) 0 (OFF)
1 (ON) 1 (ON)
Truth Table

Classical -********
Truth Table
Input Output
0 (OFF) 1 (ON)
1 (ON) 0 (OFF)

Classical - Not Gate
Truth Table
Input Output
0 (OFF) 1 (ON)
1 (ON) 0 (OFF)

Classical - Not Gate

Other Classical Gates
Gate: A circuit element that performs an
operation on input bits to produce output bits.
i. NOT: A one-bit gate, which takes 0 to 1 and vice versa
ii. AND: A two-bit gate that produces a 0 output unless
both inputs are 1
iii. OR: A two-bit gate that produces a 0 output unless one
or both inputs are 1
iv. XOR: A two-bit gate that produces a 0 output if both
inputs are 1

Classical - AND Gate
Input 1 (A) Input 2 (B) Output (X/Q)
0 0 0
0 1 0
1 0 0
1 1 1

Classical - OR Gate
0 0 0
0 1 1
1 0 1
1 1 1

Classical - XOR Gate
0 0 0
0 1 1
1 0 1
1 1 0
Used in Half-Adders
and Full-Adders

Quantum Gate?

Adding Binary Numbers
0
0
1
0
0
1
1
1
+
+
+
+
=
=
=
=
1
1
0
?

Math Operations using switches
0
0
1
0
0
1
1
1
+
+
+
+
=
=
=
=
1
1
0
?

0
0
1
0
0
1
1
1
+
+
+
+
=
=
=
=
1
1
0
?
1

0
0
1
0
0
1
1
1
+
+
+
+
=
=
=
=
1
1
0
0
1

0
0
1
0
0
1
1
1
+
+
+
+
=
=
=
=
1
1
0
0
1
A B Carry
bit
Sum
bit

Before Quantum Computers
1. Basics: https://youtube.com/clip/UgkxksaEMqeyX5Tlsu4iYLuS9fGPl2CnxQa2?si=dQc-
35OTxR9Lm5yi
2. Edison Effect : https://youtube.com/clip/UgkxWE3VW0YFcTFsbdCf0UVTD4Qu91x2Az
Mj?si=_smxJnrbmCymByVX
3. Diode:https
://youtube.com/clip/UgkxNcQCGGJAdQ0yI2gdYp4nellxWwD5StJ0?si=AWDPbcHoNrOc
-5UR
4. Boolean Algebra: https://youtube.com/clip/Ugkx_DhRwXSAzN_Jfk2meW93Djdj1VCEg
JHi?si=f3awClyl2N9WjlKE
5. Switches and Gates: https://youtube.com/clip/Ugkxaoz-pS6e_gjNKw6PpPk_lqPjc_5I7
SQ-?si=fADdsBJ_rW0IUe3o
6. Calculator: https://youtube.com/clip/UgkxNu4Kw_00pxZdzqiwUdGpUqawWENQrPwf?
si=9z4cD-eZKRIF4x8x
7. Relay: https://youtube.com/clip/Ugkx3A0mSaiqs589cB3osM-GA2ddcFrXLS_w?si=Ulc
6pbcdlNu27mQz
8. ENIAC: https://youtube.com/clip/Ugkx_2lo0RzBn7_1pJ4Eh6FwM04ZGIQQ6f9I?si=av
Ppu_3Y_Jbu-p65

Question.....
Why don’t we apply Moore‘s Law and continue to build
smaller and smaller transistors????
Moore’s Law: The number of transistors on a microchip
doubles every two years, with a minimal increase in cost

Question.....
Why don’t we apply Moore‘s Law and continue to build
smaller and smaller transistors????
Quantum
Tunnelling!

Why this “Quantum” leap ?
Classical computers have several limitations, including:
Scalability: Classical computers have difficulty scaling to
solve problems that require large calculations.
Power consumption: High-performance classical computers
use a lot of power and generate a lot of heat.
Binary limitation: The binary system is not flexible enough to
solve problems in fields like cryptography, drug discovery, and
optimization.
Sequential processing: Classical computers process
instructions one after the other, which can make it difficult to
solve complex problems quickly.
Heat and power constraints: High-performance classical
computers require large cooling systems to manage the heat
they generate.

Why this “Quantum” leap ?

What is a Quantum Computer?
 A computer that uses laws of quantum
mechanics to perform massively parallel computing
through superposition, entanglement, and
decoherence.
 It provides high computational power, less
energy consumption and exponential speed over
classical computers by controlling the behavior of
electrons, photons, atoms, etc.

Classical vs. Quantum Computaters(ion)
➢ Classical Computer
A computer that uses
voltages flowing
through circuits and
gates, which can be
controlled and
manipulated entirely
by classical
mechanics.
 Quantum Computer
A computer that uses
laws of quantum
mechanics to perform
massively parallel
computing through
• Superposition
• Entanglement, and
• Decoherence.

Superposition: A quantum system can exist in multiple states
simultaneously.
 This is the phenomenon in quantum mechanics where a
quantum particle can exist in multiple states
simultaneously, meaning it can be in a combination of
different possible states until it is measured.
 Example: A spinning coin
Imagine a coin spinning in the air - according to classical
physics, it is either heads or tails. But in quantum
superposition, the coin could be considered as both heads
and tails simultaneously until it lands and is observed.
Superpostion of States

Superposition: A quantum system can exist in multiple states simultaneously.
 This is the phenomenon in quantum mechanics where a quantum particle
can exist in multiple states simultaneously, meaning it can be in a combination of
different possible states until it is measured.
 Example: A spinning coin
Imagine a coin spinning in the air - according to classical physics, it is either heads
or tails. But in quantum superposition, the coin could be considered as both heads
and tails simultaneously until it lands and is observed.
Superpostion of States

Bits
0 1
OFF ON
False True
switch switch
Qubits

Bits
0 1
OFF ON
False True
switch switch
Qubits
0
1

Bits
0 1
OFF ON
False True
switch switch
Qubits
0
1 |
0
|
1

Decoherence
The process where a quantum system loses
its quantum properties, like superposition
and entanglement, due to interactions with
its surrounding environment

|0 = Ground State
|1 = Excited State
Quantum State

| = |0+|1
Where  and  are the probabilities
of measuring |0 and |1, respectively.
Also, ||2
+ ||2
= 1
A qubit in superposition is in both of the states |0
and |1 at the same time.
In a 3-qubit register, an equally weighted
superposition of all possible states would be denoted
by:
| = |000 + |001 + ...... + |111
Representation of Data

 Quantum computers would be based on the
principles of quantum mechanics, in which the
smallest particles of matter and light can be in
different places at the same time.
 In a quantum computer, one quantum bit
(Qubit) can be both 0 and 1 at the same time.
 so, with 3 qubits of data, a quantum
computer can store eight combinations of 0
and 1 simultaneously. A 3-qubit computer can
calculate 8 times faster than a 3-bit
conventional computer.

 A 64-bit personal computers calculate 64 bits
of data at a time.
 A 64-bit Q-computer would calculate 264
bits of
data at a time. That is, 18 billlion billion times
faster.

Entanglement
A phenomenon where two or more quantum particles
are linked in such a way that the state of one particle
cannot be described independently from the others,
even when separated by a large distance

Question.....
Why don’t we apply Moore‘s Law and continue to
build smaller and smaller transistors????

 Quantum tunnelling refers to the
quantum mechanical phenomenon
where a particle tunnels through a
barrier that it classically could not
surmount.
 Applications: Tunnel diode,
quantum computing, and the
scanning tunnelling microscope.
 Tunnelling is often explained
using the Heisenberg uncertainty
principle
Quantum Tunnelling

Chinese 76-qubit photon-based
Quantum Computer
https://youtu.be/ustVvxJ8t-s?si=E_29nfKa-yo6oF9k

IonQ, ion-trap-based 32-qubit quantum computer
https://youtu.be/aV1wL5jsfRU?si=9SkeHRnj5fuYm1ft

I B M 53-qubit superconductor-based quantum computer
https://youtu.be/xsdleM-f0i8?
si=O861IRxYlR7xw2pO

Thanks to....
https://khansaadbinhasan.github.io/Understanding-Quantum-Computers/
https://ccrcomputing.weebly.com/binary.html
https://revise.learnlearn.uk/app/section/438/60
https://github.com/cduck/bloch_sphere

Thank you all!!!

Quantum Computation Presentation for school

More Related Content

Similar to Quantum Computation Presentation for school

Recently uploaded

Quantum Computation Presentation for school