Introduction to Quantum Computing:

What is Quantum Computing?

Quantum Computing is a new type of computing that uses the principles of quantum
mechanics (physics of very small particles like electrons and photons) to process
information.

Instead of using bits (0 or 1) like normal computers, quantum computers use qubits.

What is quantum mechanics?

What is Quantum Mechanics?

Quantum Mechanics is a branch of physics that studies the behavior of very small particles
like:

 Electrons
 Protons
 Neutrons
 Photons (light particles)

It explains how matter and energy behave at the atomic and subatomic level.

Classical vs Quantum Computing

Feature Classical Computing Quantum Computing

Basic Unit Bit Qubit
Bit Value 0 or 1 0, 1, or both (superposition)
Logic Gates AND, OR, NOT Hadamard, CNOT, Pauli gates
Physics Used Classical Physics Quantum Mechanics
Processing One calculation at a time Many possibilities at once
Speed Fast for normal tasks Very fast for specific complex
problems

Bits vs Qubits
What is a Bit?

A bit is the smallest unit of information in a classical computer.

It can have only one value at a time:

 0
 1

Bits are based on classical physics (rules of Isaac Newton).

IV SEM A & B SECTIONS 1|Page

Example

If we have 2 bits, possible combinations are:

 00
 01
 10
 11

But at any moment, the computer stores only one combination.

What is a Qubit?

A qubit (quantum bit) is the smallest unit of information in a quantum computer.

It can be:

 0
 1
 Both 0 and 1 at the same time (called superposition)

This idea comes from quantum mechanics.

Feature Bit Qubit

Values 0 or 1 0, 1, or both
Physics Classical Quantum
Power Processes one state Processes many states
simultaneously
Used In Normal computers Quantum computers

Why Do We Need Quantum Computers?

Problem with Classical Computers

Normal (classical) computers are very powerful. But some problems are too complex for
them.

Even the fastest supercomputers can take:

 Years
 Thousands of years
 Or even millions of years

to solve certain problems.

Note: - classical computers check solutions one by one.

IV SEM A & B SECTIONS 2|Page

How Classical Computers Work (Simple Idea)
Classical computers use bits:

 0
 1

If there are many possibilities, they test them step-by-step.

More possibilities = More time.

For small problems → No issue.

For very big problems → Takes too much time.

How Quantum Computers Are Different

Quantum computers use qubits.

A qubit can be:

 0
 1
 Both 0 and 1 at the same time (called superposition)

Because of this:

They can explore many possibilities at once.

This makes them powerful & very fast for special types of problems.

Simple Example
Imagine:

You have 1,000 locked doors.

Only one has treasure.

 Classical computer → Opens one door at a time.

 Quantum computer → Can check many doors at the same time (in a special way).

That’s why it can be faster.

History of Quantum Computing

Quantum computing is a field that uses the principles of quantum mechanics to build
computers that can perform certain types of calculations much faster than classical
computers. The field has a long and storied history, with many key developments and
milestones along the way.

IV SEM A & B SECTIONS 3|Page

 One of the earliest ideas related to quantum computing was proposed in the 1980s by
physicist Richard Feynman, who argued that quantum computers could potentially simulate
physical systems in a more efficient manner than classical computers.

In the early 1990s, researchers Peter Shor and Lov Grover developed algorithms that showed
how quantum computers could perform certain tasks, such as factoring large numbers and
searching databases, exponentially faster than classical computers.

The first experimental demonstration of a quantum algorithm was performed in 1994 by a

team led by Isaac Chuang at the Los Alamos National Laboratory. Using a small number of
atoms as quantum bits, or qubits, the team was able to demonstrate the principles of quantum
computation.

Over the next several years, researchers made significant progress in developing and
demonstrating the capabilities of quantum computers. In 2001, a team led by computer
scientist John Martinis at the University of California, Santa Barbara, built the first quantum
computer using superconducting qubits.

Since then, quantum computing has made significant strides, with companies like Google,
IBM, and Microsoft investing heavily in the field. Here are some specific examples of how
companies are currently using quantum computers:

 Google: In 2019, Google announced that it had achieved "quantum supremacy" with its
quantum computer, which was able to perform a specific task faster than any classical
computer. Google is currently using its quantum computers to research a wide range of
topics, including machine learning and chemistry.
 IBM: IBM has been working on quantum computers for many years and has made significant
progress in the field. The company currently offers a cloud-based quantum computing
platform called IBM Q, which allows researchers and developers to access and use quantum
computers for their own projects. IBM is also working on developing new quantum
algorithms and applications in areas such as finance and healthcare.
 Microsoft: Microsoft has also been heavily investing in quantum computing, with a focus on
developing software and tools to make it easier for developers to use quantum computers.
 D-Wave Systems: D-Wave is a Canadian company that specializes in building quantum computers.
The company's quantum computers are primarily used for optimization problems, such as finding the
most efficient routes for delivery trucks or the most cost-effective way to schedule airline flights
 1QBit: 1QBit is a Canadian company that specializes in developing software and solutions for
quantum computers. The company has worked with a variety of clients, including financial
institutions and pharmaceutical companies, to help them utilize the capabilities of quantum
computers.
Quantum Properties

Superposition

A quantum particle can exist in multiple states at the same time until we measure it.

IV SEM A & B SECTIONS 4|Page

Example:
A classical bit = either 0 or 1
A quantum bit (qubit) = 0 and 1 at the same time

When measured → it becomes either 0 or 1.

Simple Real-Life Comparison

Think of a coin:

 If you place it on the table → it is either Head or Tail.

 But in quantum world → it is like the coin is Head and Tail at the same time (until
you look at it).

When you observe it, it becomes only one.

Example 1: Electron in Atom

An electron can be in:

 Energy level 1
 Energy level 2

In superposition, it can be in both levels together until measured.

Entanglement

Quantum entanglement is a phenomenon in quantum mechanics where two or more

particles become connected in such a way that:

The state of one particle instantly determines the state of the other, even if they are far apart.
This connection does not depend on distance.

Example: Two Light Bulbs 💡

Imagine two special light bulbs connected by a strange rule.

 One bulb is in Room A.

 Another bulb is in Room B.

They are programmed so that:

 If Bulb A turns ON, Bulb B turns OFF.

 If Bulb A turns OFF, Bulb B turns ON.

IV SEM A & B SECTIONS 5|Page

Now you check Bulb A and see it is ON.

Immediately you know Bulb B is OFF, even if it is very far away.

 Unprecedented Processing Speed: Quantum computers can solve specific, complex

problems (e.g., in optimization, cryptography, and molecular simulation) exponentially
faster than the best classical computers.
 Superior Simulation Capabilities: They can model molecular interactions and chemical
reactions at the atomic level, revolutionizing drug discovery and material sciences.
 Enhanced Optimization: They are ideal for complex logistical problems, such as route
planning, supply chain management, and financial modelling.
 Advanced Machine Learning: Quantum algorithms can potentially accelerate training
for artificial intelligence and machine learning models.
 Enhanced Cybersecurity: Quantum key distribution (QKD) promises nearly
unhackable communication channels.

Disadvantages of Quantum Computers

 High Costs and Fragility: Quantum computers are expensive, delicate, and often require
specialized, near-absolute zero cooling systems to operate.
 Decoherence and Noise: Qubits are highly sensitive to environmental interference,
which causes errors (decoherence) and makes maintaining quantum states difficult.
 Limited Scalability: Building large-scale, stable quantum computers with enough qubits
to perform complex, error-corrected tasks remains a significant technical challenge.
 Specialized Software Development: Quantum computers require entirely new,
specialized algorithms and programming languages, which are still in their infancy.
 Security Threats: Their power could threaten existing encryption methods, creating a,
need to overhaul current cybersecurity infrastructures.
 Limited Availability: Due to their complexity and cost, they are not currently
available for general public or small-scale commercial use.

Applications of Quantum Computers

Quantum computers are special computers used to solve very complex problems.
They are not for daily use like laptops or mobiles.

IV SEM A & B SECTIONS 6|Page

 1. Cybersecurity (Protecting Data)
Online banking

ATM transactions

UPI payments

Password protection

use encryption methods like RSA.

Quantum computers can:

 Break some old encryption systems

 Help create stronger quantum-safe encryption

2. Medicine & Drug Discovery

Our body and medicines are made of molecules.

Molecules behave according to quantum mechanics.

Quantum computers can:

 Simulate molecules accurately

 Help discover new medicines
 Speed up vaccine research

This can help treat diseases faster.

3. Chemistry & New Materials

Quantum computers can help scientists:

 Create better batteries

 Improve solar panels
 Develop new materials
 Study chemical reactions deeply

Example:
Better batteries for electric vehicles.

4. Traffic & Route Optimization

In real life:

 Traffic planning
 Delivery route planning

IV SEM A & B SECTIONS 7|Page

  Airline scheduling
 Supply chain management

have millions of possible combinations.

Quantum computers can find better solutions faster.

5. Artificial Intelligence (AI)

Quantum computers may:

 Speed up machine learning

 Analyze large data faster
 Improve pattern recognition

6. Climate & Weather Study

Quantum computers may help:

 Study climate change

 Improve weather prediction
 Simulate complex environmental systems

Basics of Quantum Mechanics

What is Quantum Mechanics?

Quantum Mechanics is a branch of physics that studies the behaviour of very small
particles like:

 Electrons
 Protons
 Neutrons
 Photons (light particles)

It explains how matter and energy behave at the atomic and subatomic level.

Basics of Quantum Mechanics

Wave–Particle Duality

Wave–particle duality is a fundamental concept in quantum mechanics which states that

every particle or quantum entity (like light and electrons) exhibits both wave-like and
particle-like properties.

In normal life:

 A ball behaves like a particle

 Water behaves like a waves

IV SEM A & B SECTIONS 8|Page

But in quantum mechanics

 An electron behaves like a particle.

 The same electron also behaves like a wave.

This dual behaviour depends on how we observe or measure it.

Real-Time Example : Light (Bulb or Sunlight)

When you switch on a bulb:

✔ Light behaves like a Wave

 Light spreads in all directions.

 It produces interference patterns.
 It shows diffraction like water waves. (Diffraction is the bending, spreading, and
interference of waves (light, sound, or water) as they pass through narrow openings or around
the edges of obstacles)

This wave nature was demonstrated in experiments such as the double-slit experiment.

✔ Light behaves like a Particle

In the photoelectric effect:

 Light falls on a metal surface.

 Electrons are ejected from the metal.
 This happens only if light has enough frequency.

This phenomenon was explained by Albert [Link], light behaves like small particles
called photons

The double-slit experiment is a fundamental physics demonstration showing

that microscopic entities like light (photons) and electrons exhibit both wave-
like and particle-like behaviors. It demonstrates that particles, when unobserved,
pass through two slits simultaneously and interfere with themselves, creating a
wave-like interference pattern on a screen, rather than just two clumps.

IV SEM A & B SECTIONS 9|Page

Heisenberg Uncertainty Principle
The Uncertainty Principle states that:

It is impossible to measure both the exact position and exact momentum of a particle at the
same time.

Here

Exact position → exact location of particle

Exact momentum → exact motion (mass × velocity)

This principle was proposed by Werner Heisenberg in 1927.

🔹 Mathematical Statement
Where:

h=6.626×10−34 J

This means:

 If position is measured very accurately → momentum becomes very uncertain.

 If momentum is measured very accurately → position becomes very uncertain.

IV SEM A & B SECTIONS 10 | P a g e

Both cannot be zero simultaneously.

Reason or why It is impossible to measure both the exact position and exact momentum of
a particle at the same time?

Imagine trying to locate a very small particle:

 If you use high-energy light (short wavelength) → position becomes accurate.

 But high energy light changes its momentum.

If you use low-energy light:

 Momentum disturbance is small.

 But position becomes unclear.

Thus, uncertainty is a natural property of nature, not due to poor instruments.

Example: Catching a Flying Mosquito

Imagine a small mosquito flying in a dark room.

Case 1: You want to know its exact position

You switch on a very bright flashlight to see exactly where the mosquito is.

 The light photons hit the mosquito.

 This disturbs its motion.

So you know the exact position, but its momentum (speed and direction) changes.

Case 2: You want to know its exact momentum

You use very soft light so the mosquito is not disturbed.

 Now its motion is not affected.

 But you cannot see it clearly, so you don't know its exact position.

What is a State in Quantum Mechanics?

In quantum mechanics, a state describes the complete information about a particle.

For example, for an electron, the state can include:

 position

IV SEM A & B SECTIONS 11 | P a g e

  momentum
 spin
 energy level

Quantum States

A quantum state describes the complete information about a quantum system.

It tells us how a quantum particle (electron, photon, or qubit) exists and behaves at a
given time.

In quantum physics:

 A particle can exist in multiple possibilities at the same time.

 The quantum state represents all these possibilities together.

Therefore,

Quantum State = Mathematical description of a quantum system.

Representation of Quantum States

But in quantum mechanics, quantum state is represented by the following symbol

Example:

∣ψ

Where:

 ∣ψ⟩| = quantum state of the system

 Pronounced as “ket psi”

What is State Space?

State space is the collection of all possible quantum states of a system.

In simple words:

State space = all possible ways a quantum system can exist.

If a system can exist in many states, all those states together form the state space.

Simple Real-Life Analogy

Imagine a light switch.

Possible states:

IV SEM A & B SECTIONS 12 | P a g e

  OFF
 ON

State space = {OFF, ON}

But in quantum mechanics, a particle can also be in both states at the same time
(superposition).

So the state space becomes larger and continuous.

Example: Qubit State Space

A qubit has two basic states:

∣0⟩
∣1⟩

But in quantum mechanics, the particle can be in a combination of both states.

Example state:

1. Rule in Quantum Mechanics: Normalization

In quantum mechanics, the total probability must equal 1.

If a state is written as:

∣ψ⟩=a∣0⟩+b∣1⟩

a and b are called probability amplitudes.

They are numbers (usually complex numbers) that tell us the likelihood of measuring the
quantum system in a particular state.

 a → amplitude of state ∣0⟩

 b → amplitude of state ∣1⟩

then it must satisfy:

IV SEM A & B SECTIONS 13 | P a g e

This is called the normalization condition.

2. Equal Probability Case

In your example the system has equal probability of being:

 ∣0⟩
 ∣1⟩

So the amplitudes are the same:

a=b

Let the value be x

So the normalized quantum state becomes:

Probability of measuring each state:

So:

 P(0)=1/2
 P(1)=1/2

Total probability:

This means the particle is 50% in state |0⟩ and 50% in state |1⟩. All such combinations form the state space of the qubit.

Dirac Notation ( |0⟩ , |1⟩ )

IV SEM A & B SECTIONS 14 | P a g e

Dirac notation is a simple mathematical way to write and work with quantum states in
quantum mechanics and quantum computing. It was introduced by Paul Dirac.

The notation mainly uses two symbols:

 Ket ∣ ⟩
 Bra ⟨ ∣

1. Ket ( ∣ψ⟩)
A ket represents a quantum state.

General form:

Basic (Computational) States are

∣0⟩→ called ket 0

∣1⟩→ called ket 1

These are known as the basis states or computational basis states.

Vector Representation (Linear Algebra Form)

In quantum computing, states are represented as vectors:

Ket = column vector representing a quantum state.

IV SEM A & B SECTIONS 15 | P a g e

2. Inner Product (Bra × Ket)
When a bra multiplies a ket, we get a number.

This is called the inner product. Mathematically it is row vector × column vector.

IV SEM A & B SECTIONS 16 | P a g e

IV SEM A & B SECTIONS 17 | P a g e
IV SEM A & B SECTIONS 18 | P a g e
Bloch Sphere Visualization

he Bloch sphere is a geometric representation of the state of a single qubit in quantum

computing. It helps us visualize quantum states and superposition in a simple 3-
dimensional form.

IV SEM A & B SECTIONS 19 | P a g e

-axis (North/South): North pole is 0>, south pole 1>is . Measures basic computational states.

We represent it on the Bloch sphere using two angles,

IV SEM A & B SECTIONS 20 | P a g e

Here:

 θ → controls how much of |0⟩ vs |1⟩

 ϕ → controls the phase difference between them

Axes Meaning

Z-axis (vertical)

 Top → ∣0⟩(+Z)
 Bottom → ∣1⟩(-Z)

X-axis

Y-axis

 Represents phase-based superpositions

 Z-axis → pure states (|0⟩, |1⟩)

 X-axis → equal mix, no phase
 Y-axis → equal mix, with phase (±i)

IV SEM A & B SECTIONS 21 | P a g e

Probability Amplitude

1. Definition

A probability amplitude is a complex number that describes the likelihood of a quantum

system being in a particular state.

In quantum mechanics, we do not directly calculate probability.

Instead, we calculate the probability amplitude, and then take its square magnitude to get
the probability.

Example

Consider a quantum state:

IV SEM A & B SECTIONS 22 | P a g e

IV SEM A & B SECTIONS 23 | P a g e
IV SEM A & B SECTIONS 24 | P a g e
What is a Quantum Gate?

A quantum gate is a basic operation used in quantum computing to change the state of a
qubit.
It is similar to a logic gate (AND, OR, NOT) in classical computers, but it works on
quantum bits (qubits) instead of classical bits.

In simple terms:

Quantum gate = Operation that modifies a qubit state.

Pauli-X Gate

he Pauli-X gate is one of the most basic single-qubit quantum gates used in quantum
computing.
It flips the state of a qubit, similar to a NOT gate in classical computing.

In simple words:

Pauli-X gate changes |0⟩ to |1⟩ and |1⟩ to |0⟩.

The Pauli-X gate is represented by the following matrix:

Mathematical Representation
The Pauli-X gate is represented by the following matrix:

This matrix acts on the qubit state vector.

Effect of Pauli-X Gate

Case 1: Applying X gate to |0⟩

Initial qubit:

After applying X gate

IV SEM A & B SECTIONS 25 | P a g e

Result:

Case 2: Applying X gate to |1⟩

Initial qubit:

After applying X gate

Result:

So,

X|1⟩ = |0⟩

IV SEM A & B SECTIONS 26 | P a g e

Input Qubit Output After X Gate

|0⟩ |1⟩

|1⟩ |0⟩

Circuit Symbol
In a quantum circuit, the Pauli-X gate is represented as:

|ψ⟩ ── X ──

Pauli-Y Gate
The Pauli-Y gate is a single-qubit quantum gate used in quantum computing.

The Pauli-Y gate performs both a bit flip and a phase flip simultaneously.

It rotates the qubit 180° (π radians) around the Y-axis of the Bloch Sphere.

Matrix Representation

The Pauli-Y gate is represented by the following 2 × 2 unitary matrix:

where

 i → adds a phase shift

 −i → adds the opposite phase

i and –i are imaginary numbers used to represent phase change in quantum states.

IV SEM A & B SECTIONS 27 | P a g e

 Extra

They show that the Pauli-Y gate flips the qubit and changes its phase.

This matrix operates on a qubit state vector.

Operation on Basis States

IV SEM A & B SECTIONS 28 | P a g e

So the Y gate:

 Flips the state (0 → 1, 1 → 0)

 Adds a phase factor ±i

Quantum Circuit Symbol

In a quantum circuit the Pauli-Y gate is written as:

|q⟩ ──[ Y ]──

Pauli-Z gate

The Pauli-Z gate is a single-qubit quantum gate that changes the phase of the qubit.

It does not flip the qubit value, but it adds a phase change.

Matrix Representation

The Pauli-Z gate is represented by the matrix

IV SEM A & B SECTIONS 29 | P a g e
This matrix operates on the qubit state vector.

So the Z gate adds a negative phase to ∣1⟩.

IV SEM A & B SECTIONS 30 | P a g e

Quantum Circuit Symbol

In a quantum circuit:

|q⟩ ──[ Z ]──

Hadamard Gate

The Hadamard gate (H gate) is a single-qubit quantum gate that creates superposition.

It converts a definite state (0 or 1) into a superposition of both states.

So after applying the Hadamard gate, the qubit can be 0 and 1 at the same time.

Matrix Representation

The Hadamard gate is represented by the matrix

IV SEM A & B SECTIONS 31 | P a g e

 Extra

Extra
Quantum Circuit Symbol

In a quantum circuit:

|q⟩ ──[ H ]──

CNOT GATE

IV SEM A & B SECTIONS 32 | P a g e

The CNOT gate is two-qubit operation, where the first qubit is usually referred to
as the control qubit and the second qubit as the target qubit.

Rule of CNOT
 If the control qubit = |0⟩
→ Target stays the same
 If the control qubit = |1⟩
→ Apply Pauli-X (NOT) to target (flip it)

Mathematical Representation
CNOT is represented by this matrix:

Truth Table

Control (C) Target (T) Output (C, T)

0 0 0, 0
0 1 0, 1
1 0 1, 1
1 1 1, 0

Circuit Symbol

IV SEM A & B SECTIONS 33 | P a g e

Difference Between Single-Qubit & Two-Qubit Gates

Feature Single-Qubit Gates Two-Qubit Gates

Definition Operate on one qubit Operate on two qubits

Function Change state of a single qubit Create interaction between two qubits

Entanglement Cannot create entanglement Can create entanglement

Complexity Simple More complex

Matrix Size 2×2 4×4

Operation Type Rotation / flipping Conditional operations

Examples X, Y, Z, H Gates CNOT, CZ, SWAP Gates

Linear algebra for quantum computing (Applications of Vectors in Quantum

Computing)

Linear algebra is necessary because it describes how quantum states evolve. It allows for
calculating the probability of outcomes and for simulating quantum circuits.

In quantum computing, a qubit is represented as a vector in a complex vector space called a

Hilbert space. A general qubit is written as:

∣ψ⟩=α∣0⟩+β∣1⟩
where α and β are complex numbers satisfying the normalization condition:

∣α∣2+∣β∣2=1
The basic states ∣0⟩ and ∣1⟩ are represented as vectors:

Quantum gates are matrices that act on vectors.

For Example pauli-X gate is multiplied with ket |0> & ket |1> the quantum state get changed
as follows.

IV SEM A & B SECTIONS 34 | P a g e

Similarly pauli-y, z gates acts on vectors to change their state.

vectors are used to Representation of Multi-Qubit Systems for example

Vectors are used in quantum computing for:

1. Representing qubits
2. Modelling superposition
3. Applying quantum gates (matrix × vector)
4. Combining qubits (tensor products)
5. Describing entanglement
6. Calculating measurement probabilities
7. Running quantum algorithms
8. Tracking system evolution

IV SEM A & B SECTIONS 35 | P a g e

Application of Matrix in Quantum Computing

Quantum operations are performed using matrices, known as quantum gates. These gates
transform the state of qubits through matrix multiplication:

Matrices play a key role in quantum computing because they are used to represent quantum
gates (operations) that act on qubits.

Matrices Represent Quantum Gates

Every quantum operation is represented by a matrix

Examples:

IV SEM A & B SECTIONS 36 | P a g e

The Pauli-Y gate is represented by the following 2 × 2 unitary matrix:

Matrices in quantum computing are used for:

1. Representing quantum gates

2. Ensuring reversible computation (unitary matrices)
3. Handling multi-qubit systems
4. Creating entanglement
5. Modelling measurement
6. Building quantum circuits
7. Running quantum algorithms
8. Describing time evolution
9. Performing error correction

IV SEM A & B SECTIONS 37 | P a g e

What is a Quantum Circuit?

A quantum circuit is a sequence of quantum gates applied to perform computations, process

information and produce an output using qubits.

Circuits Symbols

Symbol Name Representation Simple Explanation

───── Qubit (Wire) ` q⟩ ─────`
[H] Hadamard Gate ──[H]── Creates superposition (0 → 0 & 1)
[X] Pauli-X Gate ──[X]── Flips qubit (0 ↔ 1), like NOT gate
[Y] Pauli-Y Gate ──[Y]── Rotates qubit with phase change
[Z] Pauli-Z Gate ──[Z]── Changes phase of qubit
⊕ Target (NOT) ──⊕── Flips target qubit in CNOT
●⊕ CNOT Gate ●──⊕ Flips target if control = 1
× SWAP Gate ×──× Swaps two qubits
[U] Unitary Gate ──[U]── General quantum operation
[M] Measurement ──[M]── Converts qubit to classical bit (0 or 1)

Building a Simple Quantum Circuit

Single-Qubit Quantum Circuit

Initialize the Qubits

In quantum computing, we almost always start with qubits in the ground state, which is |0>.
If you have a two-qubit circuit, you start with |00>.

Step 1: Start State

Assume that we start with ∣0⟩ qubit

Step 2: Apply Hadamard on First Qubit

IV SEM A & B SECTIONS 38 | P a g e

 The qubit is now in superposition

It is not 0 or 1, but a combination of both

Step 3: Measurement

When we measure:

 50% chance → |0⟩


 50% chance → |1⟩

Two-Qubit Quantum Circuit

Step 1: Start State

∣00⟩

Meaning:

 First qubit = 0
 Second qubit = 0

Step 2: Apply Hadamard on First Qubit

 First qubit becomes superposition (0 and 1)

 Second qubit stays 0

So system becomes:

 |00⟩ (first = 0)
 |10⟩ (first = 1)

Step 3: Apply CNOT Gate

Rule of CNOT:

 Control = first qubit

 Target = second qubit


If control = 1 → flip second qubit

If control = 0 → do nothing

IV SEM A & B SECTIONS 39 | P a g e

Apply to each term:

 |00⟩ → stays |00⟩

 |10⟩ → becomes |11⟩ (because control = 1)

Final state

Step 4: Measurement
Now:

 50% → |00⟩
 50% → |11⟩

Extra

IV SEM A & B SECTIONS 40 | P a g e

What is Quantum Entanglement?

Quantum Entanglement is a special connection between two or more qubits (particles) where their
states become linked.

Example
Consider the following entangled state:

This means:

Before measurement:

 Both states exist together: 00 and 11

After measurement:

 If first qubit = 0 → second also = 0

 If first qubit = 1 → second also = 1

Possible outputs:

 00 (50%)
 11 (50%)

Never:

 01
 10

Bell States
Bell states are the 4 special entangled states of 2 qubits. They are the basic examples of
quantum entanglement. A Bell State means two qubits become perfectly connected even
when far apart.

Imagine you and your friend have each magic coin. Each coin is hidden in a box.

Before opening:

 Both are in a mystery state

 Could be Head/Head or Tail/Tail

IV SEM A & B SECTIONS 41 | P a g e

When you open your coin:

 If yours is Head → your friend’s is also Head

 If yours is Tail → your friend’s is also Tail

Even if your friend is in another city.

This is like Bell State:

IV SEM A & B SECTIONS 42 | P a g e

Bell state means two qubits become one connected pair.

Example1
Imagine 2 magic balls in 2 boxes.

Before opening:

 We don’t know values.

When you open first box:

 If it is 0 → second is also 0
 If it is 1 → second is also 1

They are connected.

IV SEM A & B SECTIONS 43 | P a g e

Example2
Imagine I give you and your friend two magic coins.

Each coin is hidden in a box.

Before opening:

 Both are in a mystery state

 Could be Head/Head or Tail/Tail

When you open your coin:

 If yours is Head → your friend’s is also Head

 If yours is Tail → your friend’s is also Tail

Even if your friend is in another city. That is like Bell State:

Key reasons why entanglement is important(why entanglement is

Important)

Enables Quantum Computing

Entanglement allows qubits to be interconnected in such a way that the state of one depends
on another. This helps quantum computers perform many calculations simultaneously.

 Used in Quantum Computing

 Speeds up complex problems like cryptography, optimization, and simulations

Foundation of Quantum Communication

Entanglement makes it possible to transmit information securely. Used in Quantum

Cryptography

Quantum Teleportation

Entanglement allows the transfer of quantum states from one particle to another without
moving the particle itself. It is Known as Quantum Teleportation & also it is Important for
future quantum networks.

Faster Information Processing

Entangled systems can process information more efficiently than classical systems. Improves
parallelism in computation.

IV SEM A & B SECTIONS 44 | P a g e

 Tests Fundamental Physics

Entanglement helps scientists understand the nature of reality. Used in experiments like Bell's
Theorem. Shows that particles can be connected even over long distances.

Applications in Quantum Sensing

Entanglement improves measurement precision.

 Used in advanced sensors and imaging

 Helps in detecting very small changes in physical systems

Basis for Future Technologies

Many next-generation technologies rely on entanglement:

 Quantum internet
 Ultra-secure communication
 Advanced AI systems (future research)

Real quantum computers

Real quantum computers are specialized, physical machines that use quantum mechanical
phenomena—specifically superposition and entanglement—to process information, rather than
traditional binary bits.

Current State of Real Quantum Computers:

 Experimental & Specialized: Current quantum hardware is primarily experimental and used for
research rather than general-purpose computing.
 Leading Developers: Major organizations including IBM, Google, Microsoft, D-Wave, and others
have built functional quantum processors, with some offering cloud access to their hardware.
 Performance Constraints: While systems exist with hundreds of qubits, they are highly sensitive to
errors (noise) and require ultra-cold environments to operate.

Types of Quantum Hardware

Quantum hardware are physical systems to create qubits

The following are types of Quantum Hardware

Superconducting Qubits:
Superconducting qubits are artificial atoms made from superconducting circuits, acting as the
fundamental data-storing units (qubits) in many quantum computers. Operating at near absolute zero,
they utilize zero electrical resistance to create quantum superposition and entanglement. They are a
leading technology used by companies like IBM and Google, known for fast operation speeds.

IV SEM A & B SECTIONS 45 | P a g e

They are constructed using superconducting materials like aluminium or niobium.

Advantages of Superconducting Qubits

 Fast Operation: Superconducting qubits able very fast gate operations, often in
the nanosecond range, allowing many operations before decoherence occurs.

 Scalability & Manufacturing: Fabrication uses established semiconductor,

making them relatively easy to build and scale compared to some other technologies.

 Design Flexibility: They can be designed as "artificial atoms" to have specific,

customizable properties

Disadvantages of Superconducting Qubits

 Extreme Cooling Requirements: They require temperatures near absolute
zero.

 Short Coherence Times: They are highly susceptible to noise and material
impurities, leading to faster loss of quantum information (decoherence).

 High Error Rates: Compared to trapped-ion systems, superconducting qubits

currently have higher error rates, necessitating complex quantum error correction.

 Manufacturing Variability: No two qubits are perfectly identical at the atomic

scale, which causes no uniform performance.

Trapped Ion Qubits:

Trapped ion qubits are a type of quantum bit (qubit) where individual charged atoms (ions) are
held in place using electromagnetic fields and used to store and process quantum information. Here
lasers are used to manipulate Qubits. They offer high fidelity and long coherence times.

Advantages of Trapped Ion Qubits

 Long Coherence Times: Trapped ions can maintain their quantum states for a
remarkably long time, often seconds to minutes, which is significantly longer than
superconducting qubits (milliseconds).

 High Gate Fidelity: They are extremely high fidelity for both single-qubit
and two-qubit operations making them suitable for reliable quantum
computations.
 Identical Qubits: Because all ions are natural atoms (e.g., all
ions are exactly the same), there is no variation in properties between qubits.

IV SEM A & B SECTIONS 46 | P a g e

 Disadvantages of Trapped Ion Qubits
 Slow Operation Speeds: Gate speeds are relatively slow (in the microsecond
range) compared to superconducting qubits (nanosecond range), limiting the total
number of operations possible within the coherence time.

 Scalability Challenges: While they work well for a small number of qubits,
increasing the number of ions in a single chain makes them harder to control.

 High Control Infrastructure Complexity: The system requires complex,

precise laser systems and vacuum, requiring high-precision engineering.

 Cross-talk and Heating: As more ions are trapped, collective vibrational modes
can cause heating, and focusing laser beams individually on many ions can lead to
undesirable crosstalk.

 Ion Loss: Ions can sometimes be lost from the trap entirely, requiring the system to
be re-initialized, which disrupts calculations.

Photonic Qubits:
Photonic qubits are quantum bits encoded into the quantum states of individual light particles
(photons), serving as a foundation for optical quantum computing and secure communication. By
using properties like polarization, they enable room-temperature operation, minimal decoherence, and
high-speed data transmission over fiber optics.

Advantages
 Room Temperature Operation: Unlike superconducting qubits requiring
cryogenic cooling, photonic systems can operate at room temperature, reducing
complex infrastructure.

 Low Decoherence/High Stability: Photons interact weakly with their

environment, making them robust against noise and enabling long-lived coherence.

 Long-Distance Transmission & Networking: Photonic qubits can travel

through fiber optics, making them "flying qubits" perfect for quantum internet and
connecting distant quantum computers.

 Scalability & Integration: Photonic circuits can be integrated onto chips

(integrated photonics) using existing semiconductor manufacturing techniques.
 High Speed: Light provides high-speed data transmission and high-frequency clock
rates

IV SEM A & B SECTIONS 47 | P a g e

 Disadvantages
 Photon Loss: Photons can be easily absorbed or scattered in optical fibers, leading
to the loss of the quantum state.

 Difficult Photon-Photon Interaction: Photons do not naturally interact with

each other, making two-qubit logic gates extremely challenging, requiring complex
non-linear optics.

 High Development Cost: While compatible with standard manufacturing,

developing precise, low-loss, and integrated photonic components is expensive.

 Encoding Challenges: Different encodings (polarization, time-bin, frequency)

have trade-offs between environmental stability and ease of manipulation

Key challenges facing quantum computing

 Decoherence and Noise: Qubits are highly susceptible to environmental disturbances—

magnetic fields, temperature changes, and cosmic rays—which cause them to lose their
quantum state, a process known as decoherence.
 Error Correction Needs: Current quantum devices are noisy (NISQ-era). Creating a
stable, "logical" qubit requires hundreds or thousands of physical qubits for error correction,
making large-scale, fault-tolerant computers difficult to build.
 Scaling Up Qubits: Transitioning from dozens to millions of stable, interconnected qubits
is a major engineering hurdle, as increasing the number of qubits increases the complexity
and noise.
 Cryogenic Engineering and Physical Constraints: Many quantum systems require
temperatures near absolute zero, necessitating complex, expensive dilution refrigerators.
Managing the physical space and wiring (I/O) inside these fridges for thousands of qubits is a
bottleneck.
 Developing Software and Algorithms: Quantum programming requires specialized
skills and software, which are still in their infancy compared to classical computing. There is
a scarcity of professionals and a need for quantum-specific algorithms.
 Security Threats and Mitigation: A functional quantum computer can break modern
encryption (RSA, ECC), necessitating the urgent development of post-quantum cryptography
(PQC).

IV SEM A & B SECTIONS 48 | P a g e

IV SEM A & B SECTIONS 49 | P a g e