UNIT I- Introduction and The Leap from Classical to Quantum

1. Define Classical Bits (Cbits) and Quantum Bits (Qbits)

Classical Bit (Cbit)
A Classical Bit (Cbit) is the basic unit of information in a classical computer.
●​ It can exist in only one of two states:
○​ 0
○​ 1
●​ Used in traditional computers such as laptops, mobile phones, and calculators.
●​ Represented using electrical signals.
Representation
Bit = 0 or 1

Quantum Bit (Qbit)

A Quantum Bit (Qbit) is the basic unit of information in a quantum computer.
●​ It can exist in:
○​ State |0⟩
○​ State |1⟩
○​ Superposition of both states simultaneously.
●​ Based on principles of quantum mechanics.
●​ Can perform complex calculations much faster than classical bits.
Representation
|ψ⟩ = α|0⟩ + β|1⟩

Where:
●​ α and β are probability amplitudes.
●​ |α|² + |β|² = 1
Diagram
Classical Bit:- 0 or 1
Quantum Bit

|0⟩
\
\
● (Qbit)
/
/
|1⟩

2. Difference Between Cbits and Qbits

Feature Classical Bit (Cbit) Quantum Bit (Qbit)

Definition Basic unit of classical information Basic unit of quantum information

Values 0 or 1

State at a time Only one state Multiple states simultaneously

Principle Classical Physics Quantum Mechanics

Information Storage Limited More information can be represented

Parallelism No Yes
Measurement Does not change state Collapses to 0 or 1

Speed Lower for complex problems Faster for many problems

Example Computer memory bit Electron spin, photon polarization

3. Explain Reversible Operations on Classical Bits

A reversible operation is an operation where the original input can be recovered from the output.
Characteristics
●​ No information loss.
●​ One-to-one mapping.
●​ Important in quantum computing because all quantum operations must be reversible.

Example: NOT Gate

Truth Table
Input Output

0 1

1 0
Since output uniquely identifies input, the operation is reversible.
Diagram
Input ──[NOT]── Output

0→1
1→0

Example: Controlled-NOT (CNOT)

Control Target Output

0 0 00

0 1 01

1 0 11

1 1 10
Input can always be recovered.

4. Explain Reversible Operations on Quantum Bits

Quantum operations must always be reversible.
Properties
●​ Represented using unitary matrices.
●​ Preserve quantum information.
●​ No loss of data.

Example: Pauli-X Gate

Acts like classical NOT gate.
Operation
|0⟩ → |1⟩
|1⟩ → |0⟩
Diagram
|ψ⟩ ──[X]── Output

Example: Hadamard Gate

Creates superposition.
Operation
|0⟩ → (|0⟩ + |1⟩)/√2

|1⟩ → (|0⟩ - |1⟩)/√2

5. Explain Manipulation of Qbits Using Quantum Gates

Quantum gates manipulate the state of Qbits.
Similar to logic gates in classical computing.

Common Quantum Gates

1. Pauli-X Gate
Acts as NOT gate.
|0⟩ → |1⟩
|1⟩ → |0⟩

2. Hadamard Gate (H)

Creates superposition.
|0⟩ → (|0⟩+|1⟩)/√2

Diagram
|0⟩ ──[H]── Superposition

3. CNOT Gate
Creates entanglement.
Diagram
Control ──●────
|
Target ───⊕────

6. Explain Circuit Diagrams Used in Quantum Computing

Quantum circuits represent computation using Qbits and quantum gates.

Basic Quantum Circuit

|0⟩ ──[H]────●────
|
|0⟩ ─────────⊕────

Explanation
1.​ First Qbit starts in |0⟩.
2.​ Hadamard gate creates superposition.
3.​ CNOT gate entangles both Qbits.

General Quantum Circuit

Q0 ──[H]────●────[M]
|
Q1 ─────────⊕────[M]
Where:
●​ H = Hadamard Gate
●​ ●⊕ = CNOT Gate
●​ M = Measurement Gate

7. Explain Measurement Gates in Quantum Systems

Measurement converts a quantum state into a classical state.
Before measurement:
|ψ⟩ = α|0⟩ + β|1⟩

After measurement:
●​ Becomes 0 with probability |α|²
●​ Becomes 1 with probability |β|²

Diagram
|ψ⟩ ──[M]── Classical Output

Example
|ψ⟩ = (|0⟩ + |1⟩)/√2

Measurement gives:
0 → 50%
1 → 50%

8. Explain State Preparation in Quantum Computing

State preparation means initializing Qbits into a desired quantum state before computation.

Steps
1.​ Start with |0⟩ state.
2.​ Apply quantum gates.
3.​ Obtain required state.
Example
|0⟩ ──[H]──

Produces
(|0⟩ + |1⟩)/√2

Diagram
Initial State → Quantum Gates → Desired State

9. Explain How Arbitrary 1-Qbit States are Constructed

Any single Qbit state can be represented as:
∣ψ⟩=α∣0⟩+β∣1⟩
Where: |α|² + |β|² = 1

Construction Process
Start with:
|0⟩

Apply rotation gates:

●​ Rx
 ●​ Ry
●​ Rz
Diagram
|0⟩ ──[Rotation Gates]── Arbitrary State

Result:
Any point on the Bloch Sphere can be reached.

10. Explain Construction of Arbitrary 2-Qbit States

General two-Qbit state:
∣ψ⟩=a∣00⟩+b∣01⟩+c∣10⟩+d∣11⟩
Where
|a|²+|b|²+|c|²+|d|² =1

Construction Steps
1.​ Initialize:
|00⟩

2.​ Apply single-Qbit gates.

3.​ Apply CNOT gate.
4.​ Generate entanglement.
Diagram
|0⟩ ──[H]────●────
|
|0⟩ ─────────⊕────

11. Explain Classical Deterministic Systems

A deterministic system always produces the same output for the same input.
Characteristics
●​ Predictable
●​ Fixed rules
●​ No randomness
Example
Input = 5

Output = 5 + 2 = 7

Every time output remains 7.

Diagram
Input → Fixed Rule → Output

12. Explain Probabilistic Systems with Suitable Example

A probabilistic system includes randomness.
Characteristics
●​ Output is uncertain.
●​ Multiple possible outcomes.
●​ Each outcome has a probability.

Example: Tossing a Coin

Possible outcomes:
Head = 0.5
Tail = 0.5
 Diagram
Coin Toss
|
/\
H T
50% 50%

13. Explain Quantum Systems and Their Characteristics

A quantum system follows quantum mechanics principles.
Examples:
●​ Electrons
●​ Photons
●​ Atoms

Characteristics
1. Superposition
Qbit can be in multiple states simultaneously.
2. Entanglement
Two Qbits become strongly correlated.
3. Interference
Probability amplitudes combine.
4. Measurement Collapse
State collapses after measurement.
5. Reversibility
Quantum operations are reversible.
Diagram
Quantum System

Superposition
|
Entanglement
|
Interference
|
Measurement

14. Difference Between Deterministic, Probabilistic, and Quantum Systems

Feature Deterministic Probabilistic Quantum

Output Fixed Random Probability-based

Predictability Complete Partial Partial

State Single state Multiple possible outcomes Superposition

Randomness No Yes Quantum randomness

Example Calculator Coin toss Quantum computer

Mathematical Model Classical rules Probability theory Quantum mechanics

Parallelism No No Yes
Measurement Effect No change Observation only State collapse

15. Explain the Concept of Assembling Systems in Quantum Computing

Assembling systems means combining smaller quantum systems to form a larger system.

Example
Single Qbits:
Q1 = |0⟩

Q2 = |1⟩

Combined system:
|0⟩ ⊗ |1⟩ = |01⟩

(⊗ = Tensor Product)

Diagram
Qbit 1 ----\
---- Combined System
Qbit 2 ----/

Importance
●​ Builds multi-Qbit systems.
●​ Enables entanglement.
●​ Increases computational power.

16. Discuss the Transition from Classical to Quantum Computing

The transition from classical computing to quantum computing occurred due to limitations of classical
computers in solving highly complex problems.

Classical Computing
●​ Uses bits (0 or 1).
●​ Sequential processing.
●​ Limited parallelism.
Diagram
Bit → Logic Gates → Output

Quantum Computing
●​ Uses Qbits.
●​ Superposition and entanglement.
●​ Massive parallel processing.
Diagram
Qbit
|
Superposition
|
Entanglement
|
Quantum Gates
|
Measurement
Comparison of Evolution
Classical Computing
↓
Improved Processors
↓
Parallel Computing
↓
Quantum Computing

Advantages of Quantum Computing

1.​ Faster computation.
2.​ Solves optimization problems efficiently.
3.​ Useful in cryptography.
4.​ Accelerates scientific simulations.
5.​ Supports advanced AI and machine learning.
 UNIT II- Basic Quantum Theory & Architecture
1. Define Quantum States and Explain Their Representation
Definition
A quantum state is the complete description of a quantum system. It contains all the information about
a quantum particle or quantum bit (qubit).
In quantum computing, the state of a qubit tells us the probability of obtaining 0 or 1 when measured.

Representation of Quantum States

A qubit can exist in:
●​ |0⟩ state
●​ |1⟩ state
●​ Superposition of both states
Mathematically:
∣ψ⟩=α∣0⟩+β∣1⟩
Where:
●​ α and β are probability amplitudes.
●​ |α|² + |β|² = 1
Example
If:
|ψ⟩ = (|0⟩ + |1⟩)/√2
Then,
●​ Probability of getting 0 = 50%
●​ Probability of getting 1 = 50%
Diagram
Quantum State
|0⟩
\
\
●
/
/
|1⟩
Key Points
●​ Describes the condition of a quantum system.
●​ Represented using vectors.
●​ May contain superposition.
●​ Changes when measured.

2. Explain Observables in Quantum Theory

Definition
An observable is a physical quantity that can be measured in a quantum system.
Examples:
●​ Position
●​ Momentum
 ●​ Energy
●​ Spin
●​ Polarization

Characteristics
●​ Every observable is represented by a mathematical operator.
●​ Measurement gives one of the operator's eigenvalues.
●​ After measurement, the system collapses to the corresponding eigenstate.

Example
Consider spin of an electron.
Possible measurement results:
Spin Up ↑
Spin Down ↓

Only one result is obtained after measurement.

Diagram
Quantum State
|
Measurement
|
Observable
|
Result

Applications
●​ Measuring qubit values.
●​ Quantum algorithms.
●​ Quantum communication.

3. Explain the Measurement Process in Quantum Systems

Definition
Measurement is the process of observing a quantum state and obtaining a classical result.

Before Measurement
A qubit may exist in superposition.
Example:
|ψ⟩ = (|0⟩ + |1⟩)/√2

During Measurement
The quantum state collapses into one definite state.
Possible results:
0 with probability 50%
1 with probability 50%

After Measurement
The qubit remains in the measured state.

Diagram
Superposition State
|
V
Measurement
|
-----------
| |
0 1

Importance
●​ Converts quantum information into classical information.
●​ Necessary to obtain final results from a quantum computer.

4. Explain Dynamics of Quantum Systems

Definition
Quantum dynamics describes how quantum states change with time.

Main Idea
A quantum system evolves continuously until measurement occurs.
State changes are controlled using quantum gates.

Example
Initial State:
|0⟩
Apply Hadamard Gate:
(|0⟩ + |1⟩)/√2
The state has evolved.

Diagram
Initial State
|
Quantum Gate
|
New Quantum State

Characteristics
●​ Evolution is reversible.
●​ Governed by quantum mechanics.
 ●​ Preserves probability.

Importance
●​ Performs quantum computation.
●​ Enables quantum algorithms.

5. Explain Assembling of Quantum Systems

Definition
Assembling means combining multiple quantum systems to create a larger quantum system.

Tensor Product
Quantum systems are combined using the tensor product.
Example:
Qubit A = |0⟩
Qubit B = |1⟩
Combined state:
|0⟩ ⊗ |1⟩ = |01⟩

Diagram
Qubit A ----\
\
--> Combined System
/
Qubit B ----/

Importance
●​ Creates multi-qubit systems.
●​ Enables entanglement.
●​ Increases computational power.

6. Differentiate Between Classical Bits and Qubits

Feature Classical Bit Qubit

Definition Basic unit of classical information Basic unit of quantum information

Values 0 or 1

State Single state Superposition

Physics Classical physics Quantum mechanics

Parallelism No Yes

Entanglement Not possible Possible

 Processing Power Lower Higher

Measurement No state change State collapse

Example Computer memory Electron spin

7. Explain Classical Logic Gates with Examples

Definition
Logic gates are electronic circuits that perform logical operations on bits.

1. AND Gate
Truth Table
A B Output

0 0 0

0 1 0

1 0 0

1 1 1
Diagram
A ----\
AND ---- Output
B ----/

2. OR Gate
A B Output

0 0 0

0 1 1

1 0 1

1 1 1

3. NOT Gate
Input Output

0 1

1 0
Diagram
Input ---- NOT ---- Output
Applications
●​ Computers
●​ Digital circuits
●​ Arithmetic operations

8. Explain Reversible Gates and Their Importance

Definition
A reversible gate is a gate whose input can be uniquely determined from its output.

Characteristics
●​ No information loss.
●​ One-to-one mapping.
●​ Essential in quantum computing.

Example: NOT Gate

Input Output

0 1

1 0
Input can always be recovered.

Example: CNOT Gate

Control Target Output

0 0 00

0 1 01

1 0 11

1 1 10

Importance
1.​ Reduces energy loss.
2.​ Required for quantum computation.
3.​ Preserves information.

9. Explain Quantum Gates with Suitable Examples

Definition
Quantum gates are operations that change the state of qubits.
They are the building blocks of quantum circuits.
1. Pauli-X Gate
Acts like classical NOT gate.
|0⟩ → |1⟩
|1⟩ → |0⟩

2. Hadamard Gate (H)

Creates superposition.
|0⟩ → (|0⟩+|1⟩)/√2
Diagram
|0⟩ ---- H ---- Superposition

3. CNOT Gate
Diagram
Control ----●----
|
Target -----⊕----
Used to create entanglement.

Importance
●​ Manipulate qubits.
●​ Implement quantum algorithms.
●​ Create superposition and entanglement.

10. Compare Classical Gates and Quantum Gates

Feature Classical Gates Quantum Gates

Operate On Bits Qubits

States 0 or 1 Superposition states

Reversible Mostly No Always Yes

Parallelism Limited High

Basis Classical Physics Quantum Mechanics

Examples AND, OR, NOT H, X, Y, Z, CNOT

Entanglement Not Supported Supported

Information Loss Possible Not Allowed

11. Explain Superposition in Quantum Systems

Definition
Superposition is the ability of a qubit to exist in multiple states simultaneously.
Example
A classical bit:
0 or 1
A qubit:
0 and 1 simultaneously

Representation
∣ψ⟩=α∣0⟩+β∣1⟩

Diagram
|0⟩
\
\
●
/
/
|1⟩

Advantages
●​ Enables parallel computation.
●​ Increases computational power.

12. Explain Entanglement and Its Significance

Definition
Entanglement is a quantum phenomenon where two or more qubits become strongly connected.
The state of one qubit instantly affects the other, regardless of distance.

Example
Entangled State:
(|00⟩ + |11⟩)/√2

If first qubit is measured as 0, second is also 0.

If first is 1, second is also 1.

Diagram
Qubit A ===== Qubit B
(Linked States)

Significance
1.​ Quantum communication.
2.​ Quantum teleportation.
3.​ Quantum cryptography.
4.​ Quantum algorithms.
13. Explain the Role of Unitary Operations in Quantum Computing
Definition
Unitary operations are mathematical operations that preserve quantum information.
All quantum gates are unitary.

Characteristics
●​ Reversible.
●​ Preserve probability.
●​ Maintain normalization.

Example
Pauli-X Gate:
|0⟩ → |1⟩
|1⟩ → |0⟩
The operation can be reversed.

Diagram
Quantum State
|
Unitary Gate
|
New State

Importance
●​ Perform quantum computations.
●​ Prevent information loss.
●​ Enable state evolution.

14. Discuss the Architecture of Quantum Computing Systems

Definition
Quantum computer architecture consists of hardware and software components used to perform
quantum computations.

Main Components
1. Qubits
Store quantum information.
2. Quantum Gates
Manipulate qubits.
3. Quantum Circuits
Sequence of quantum operations.
4. Control Unit
Controls execution of gates.
5. Measurement Unit
Converts quantum information into classical information.
6. Classical Computer
Manages and interprets results.

Architecture Diagram
Classical Computer
|
V
Control System
|
V
-----------------------
| Quantum CPU |
| |
| Qubits + Gates |
-----------------------
|
V
Measurement Unit
|
V
Output

Importance
●​ Enables execution of quantum algorithms.
●​ Coordinates quantum and classical processing.

15. Explain How Quantum Systems Differ from Classical Computational Models
Feature Classical System Quantum System

Information Unit Bit Qubit

States 0 or 1 Superposition

Processing Sequential Parallel

Entanglement Not Available Available

Computation Basis Classical Physics Quantum Mechanics

Operations Logic Gates Quantum Gates

Reversibility Not Always Always

Performance Limited for complex problems Faster for many complex problems
 Examples Laptop, Calculator Quantum Computer

UNIT III- Algorithms & Programming Languages

1. Define Quantum States and Explain Their Mathematical Representation
Definition
A quantum state is the complete description of a quantum system. It contains all the information
about a quantum particle or qubit and helps predict the results of measurements.
In quantum computing, a quantum state describes the condition of a qubit.

Mathematical Representation
A qubit can exist in state |0⟩, |1⟩, or a combination of both.
General quantum state:
∣ψ⟩=α∣0⟩+β∣1⟩
Where:
●​ α and β are complex probability amplitudes.
●​ |α|² gives probability of measuring 0.
●​ |β|² gives probability of measuring 1.
Normalization condition:
∣α∣2+∣β∣2=1

Vector Representation
Basis states are represented as:
|0⟩ = [1]
[0]

|1⟩ = [0]
[1]

Example
If
|ψ⟩ = (|0⟩ + |1⟩)/√2
Then:
●​ Probability of 0 = 50%
●​ Probability of 1 = 50%

Diagram
|0⟩
\
\
●
/
/
 |1⟩

Conclusion
Quantum states are the foundation of quantum computing and are mathematically represented using
vectors and probability amplitudes.

2. Explain Observables in Quantum Mechanics

Definition
An observable is any physical quantity that can be measured in a quantum system.
Examples:
●​ Position
●​ Momentum
●​ Energy
●​ Spin
●​ Polarization

Mathematical Representation
In quantum mechanics, observables are represented by Hermitian operators (matrices).
When an observable is measured:
●​ The result obtained is called an eigenvalue.
●​ The system collapses into the corresponding eigenstate.

Example
Observable: Spin of an electron
Possible outcomes:
Spin Up ↑

Spin Down ↓

Only one value is obtained after measurement.

Diagram
Quantum State
|
V
Observable
|
Measurement
|
Result

Importance
●​ Used to extract information from quantum systems.
●​ Forms the basis of quantum measurements.
 ●​ Essential in quantum algorithms.

3. Explain Measurement in Quantum Systems with Suitable Example

Definition
Measurement is the process of observing a quantum state and obtaining a classical result.

Before Measurement
A qubit may exist in superposition.
Example:
|ψ⟩ = (|0⟩ + |1⟩)/√2

During Measurement
The quantum state collapses into one definite state.
Possible outcomes:
0 with probability 50%

1 with probability 50%

After Measurement
The qubit remains in the measured state.

Example
Consider:
|ψ⟩ = (|0⟩ + |1⟩)/√2
After measurement:
50% chance → |0⟩
50% chance → |1⟩

Diagram
Superposition
|
V
Measurement
|
-----------
| |
0 1

Importance
●​ Converts quantum information into classical information.
●​ Provides the final result of quantum computation.

4. Explain Dynamics of Quantum Systems

Definition
Quantum dynamics describes how a quantum state changes with time.

Principle
Unlike classical systems, quantum systems evolve according to quantum mechanical laws.
The evolution is continuous and reversible until measurement occurs.

State Evolution
Initial State:
|0⟩
Apply Hadamard Gate:
(|0⟩ + |1⟩)/√2
The state has evolved.

Diagram
Initial State
|
Quantum Gate
|
New State

Characteristics
1.​ Reversible evolution.
2.​ Governed by quantum mechanics.
3.​ Preserves probability.
4.​ Implemented using quantum gates.

Importance
●​ Enables quantum computation.
●​ Forms the basis of quantum algorithms.

5. Explain Assembling of Quantum Systems

Definition
Assembling quantum systems means combining two or more quantum systems to form a larger
quantum system.

Tensor Product
Quantum states are combined using the tensor product (⊗).
Example:
Qubit A = |0⟩
Qubit B = |1⟩
Combined state:
|0⟩ ⊗ |1⟩ = |01⟩

Diagram
Qubit A ----\
\
--> Combined System
/
Qubit B ----/

Importance
1.​ Creates multi-qubit systems.
2.​ Enables entanglement.
3.​ Increases computational power.

6. Differentiate Between Classical Bits and Qubits

Feature Classical Bit Qubit

Definition Basic unit of classical information Basic unit of quantum information

Values 0 or 1

State Single state Multiple states simultaneously

Physics Classical physics Quantum mechanics

Entanglement Not possible Possible

Parallelism Limited High

Measurement No state change Causes collapse

Computing Power Lower Higher

7. Explain Classical Logic Gates with Examples

Definition
Classical logic gates are electronic circuits that perform logical operations on bits.

AND Gate
Truth Table
A B Output

0 0 0

0 1 0

1 0 0

1 1 1
Diagram
A ----\
AND ---- Output
B ----/

OR Gate
A B Output

0 0 0

0 1 1

1 0 1

1 1 1

NOT Gate
Input Output

0 1

1 0
Diagram
Input ---- NOT ---- Output

Applications
●​ Digital circuits
●​ Computers
●​ Arithmetic operations

8. Explain Reversible Gates and Their Importance in Quantum Computing

Definition
A reversible gate is a gate where the input can always be recovered from the output.

Characteristics
●​ No information loss.
●​ One-to-one mapping.
●​ Essential for quantum computation.

Example: NOT Gate

Input Output

0 1

1 0
Example: CNOT Gate
Control Target Output

0 0 00

0 1 01

1 0 11

1 1 10

Importance in Quantum Computing

1.​ Quantum operations must be reversible.
2.​ Prevent information loss.
3.​ Reduce energy dissipation.
4.​ Enable implementation of quantum gates.

9. Explain Quantum Gates with Suitable Examples

Definition
Quantum gates are operations that manipulate qubits.
They are the building blocks of quantum circuits.

1. Pauli-X Gate
Acts like classical NOT gate.
|0⟩ → |1⟩

|1⟩ → |0⟩

2. Hadamard Gate (H)

Creates superposition.
|0⟩ → (|0⟩+|1⟩)/√2
Diagram
|0⟩ ---- H ---- Superposition

3. CNOT Gate
Diagram
Control ----●----
|
Target -----⊕----
Used to create entanglement.

Importance
●​ Manipulate quantum states.
●​ Create superposition.
 ●​ Create entanglement.
●​ Execute quantum algorithms.

10. Compare Classical and Quantum Gates

Feature Classical Gates Quantum Gates

Operate On Bits Qubits

States 0 or 1 Superposition states

Reversible Usually No Always Yes

Parallelism Low High

Entanglement Not Supported Supported

Information Loss Possible Not Allowed

Examples AND, OR, NOT H, X, Y, Z, CNOT

11. Explain the Role of Quantum Programming Languages

Definition
Quantum programming languages are specialized languages used to design, simulate, and execute
quantum algorithms on quantum computers.
Examples:
●​ Qiskit (Python-based)
●​ Q#
●​ Cirq
●​ Quipper

Roles
1. Create Quantum Circuits
Programmers can define qubits and gates.
2. Implement Quantum Algorithms
Algorithms such as Grover's and Shor's can be written.
3. Control Quantum Hardware
Connect software with quantum processors.
4. Simulate Quantum Systems
Test programs before running on real quantum hardware.

Diagram
Programmer
|
Quantum Language
|
Quantum Circuit
|
Quantum Computer

12. Discuss Features of Quantum Programming Languages

Important Features
1. Qubit Support
Allows creation and manipulation of qubits.
2. Quantum Gates
Provides built-in quantum gates.
3. Quantum Circuits
Supports circuit design.
4. Measurement Operations
Allows measurement of qubits.
5. Classical Control
Combines classical and quantum operations.
6. Simulation Tools
Enables testing without quantum hardware.
7. Error Handling
Supports quantum error correction techniques.

Advantages
●​ Simplifies quantum algorithm development.
●​ Provides hardware-independent programming.
●​ Enables experimentation and research.

13. Explain How Quantum Algorithms Are Implemented Using Programming

Languages
Steps
Step 1: Initialize Qubits
|0⟩ |0⟩

Step 2: Apply Quantum Gates

Example:
Hadamard Gate
CNOT Gate

Step 3: Create Quantum Circuit

Qubit → Gates → Circuit

Step 4: Measure Qubits

Convert quantum output into classical results.

Step 5: Execute Program

Run on:
●​ Quantum simulator
●​ Real quantum computer

Implementation Flow
Algorithm
|
Programming Language
|
Quantum Circuit
|
Execution
|
Measurement
|
Result

14. Discuss Challenges in Quantum Programming

1. Limited Quantum Hardware
Current quantum computers have few qubits.

2. Quantum Noise
Environmental disturbances introduce errors.

3. Decoherence
Quantum states lose information over time.

4. Complex Mathematics
Requires knowledge of:
●​ Linear algebra
●​ Probability
●​ Quantum mechanics

5. Debugging Difficulty
Quantum states cannot be directly observed without measurement.

6. Error Correction Challenges

Quantum error correction requires many extra qubits.

Diagram
Quantum Program
|
--------------------
| Noise |
| Decoherence |
| Errors |
--------------------
|
Reduced Accuracy

15. Explain Advantages of Quantum Algorithms Over Classical Algorithms

1. Faster Processing
Quantum algorithms can solve some problems significantly faster.

2. Quantum Parallelism
Superposition allows many computations simultaneously.

3. Efficient Searching
Grover's Algorithm searches databases faster than classical methods.

4. Powerful Factorization
Shor's Algorithm factors large numbers efficiently.

5. Better Optimization
Useful for:
●​ Scheduling
●​ Logistics
●​ Resource allocation

6. Improved Simulations
Can simulate molecules and quantum systems more accurately.

Comparison Table
Task Classical Algorithm Quantum Algorithm

Search O(N) O(√N)

Factorization Very Slow Much Faster

Optimization Complex More Efficient

Quantum Simulation Difficult Natural

 UNIT IV- Theoretical Computer Science and Cryptography
1. Explain Deterministic Computation with Suitable Example
Definition
Deterministic computation is a type of computation in which the same input always produces the
same output by following a fixed sequence of steps.
In a deterministic system, there is only one possible action at every stage of execution.

Characteristics
1.​ Predictable behavior.
2.​ Same input gives same output.
3.​ Fixed execution path.
4.​ No randomness involved.

Example
Consider:
Input = 5
Operation = Add 3
Output = 8
Every time input 5 is given, output will always be 8.

Flow Diagram
Input
|
V
Fixed Rules
|
V
Output

Real-Life Example
Calculator Operation:
7 + 5 = 12
The answer is always 12.

Applications
●​ Arithmetic calculations
●​ Database systems
●​ Operating systems
●​ Traditional computer programs

2. Explain Nondeterministic Computation and Its Significance

Definition
Nondeterministic computation is a computation model where multiple possible choices may exist at a
particular step.
The system can explore many computation paths simultaneously.

Characteristics
1.​ Multiple possible execution paths.
2.​ Not restricted to a single choice.
3.​ Useful for solving complex problems.
4.​ Basis of NP (Nondeterministic Polynomial Time) problems.

Example
Suppose we want to find a password from:
1234
5678
9876
4321
A deterministic computer checks one by one.
A nondeterministic model assumes all possibilities can be checked simultaneously.

Diagram
Start
|
-----------------
| | |
Path1 Path2 Path3
| | |
-----------------
|
Solution

Significance
1.​ Helps study computational complexity.
2.​ Forms basis of NP-complete problems.
3.​ Used in theoretical computer science.
4.​ Inspires quantum computing concepts.

3. Differentiate Between Deterministic and Nondeterministic Computations

Feature Deterministic Computation Nondeterministic Computation

Definition Single execution path Multiple execution paths

Output Fixed and predictable May have multiple possibilities

Decision Making One choice at a time Multiple choices simultaneously

Complexity Easier to implement Theoretical model

 Predictability High Lower

Example Calculator NP Problem Solver

Execution Sequential Parallel possibilities

Practical Systems Classical computers Mainly theoretical

4. Explain Probabilistic Computation with Example

Definition
Probabilistic computation uses randomness during computation.
The output is determined based on probabilities rather than fixed rules.

Characteristics
1.​ Uses random choices.
2.​ Different runs may produce different outputs.
3.​ Useful for approximation algorithms.
4.​ Faster for some complex problems.

Example: Coin Toss

Possible outcomes:
Head = 50%
Tail = 50%
Output cannot be predicted with certainty.

Diagram
Coin Toss
|
/\
Head Tail
50% 50%

Applications
●​ Randomized algorithms
●​ Machine learning
●​ Cryptography
●​ Simulations

5. Explain Quantum Computation and Its Characteristics

Definition
Quantum computation is computation performed using quantum mechanical principles such as
superposition, entanglement, and interference.
It uses qubits instead of classical bits.
Characteristics
1. Superposition
A qubit can exist in multiple states simultaneously.
2. Entanglement
Qubits become strongly correlated.
3. Interference
Probability amplitudes combine constructively or destructively.
4. Reversibility
Quantum operations are reversible.
5. Quantum Parallelism
Many computations can occur simultaneously.

Diagram
Qubit
|
Superposition
|
Entanglement
|
Quantum Gates
|
Measurement

Applications
●​ Cryptography
●​ Optimization
●​ Drug discovery
●​ Artificial Intelligence

6. Compare Classical and Quantum Computation Models

Feature Classical Computation Quantum Computation

Information Unit Bit Qubit

Values 0 or 1 0, 1, or superposition

Processing Sequential Parallel

Physics Classical Physics Quantum Mechanics

Entanglement Not available Available

Speed Lower for some problems Higher for certain problems

Gates Logic Gates Quantum Gates

 Example Laptop Quantum Computer

7. Explain Basics of Classical Cryptography

Definition
Cryptography is the science of protecting information from unauthorized access.

Main Components
Plaintext
Original message.
Encryption
Converting plaintext into ciphertext.
Ciphertext
Encrypted message.
Decryption
Converting ciphertext back into plaintext.
Key
Secret information used for encryption and decryption.

Diagram
Plaintext
|
Encryption Key
|
Ciphertext
|
Decryption Key
|
Plaintext

Example
Message:
HELLO
Encrypted as:
KHOOR
(using Caesar Cipher with shift 3)

Applications
●​ Banking
●​ Online shopping
●​ Email security

8. Explain Need for Quantum Cryptography

Problem with Classical Cryptography
Most classical cryptographic systems depend on mathematical difficulty.
Examples:
●​ RSA
●​ Diffie-Hellman
Future quantum computers may break these systems quickly.

Need for Quantum Cryptography

1.​ Provides higher security.
2.​ Detects eavesdropping.
3.​ Uses laws of quantum mechanics.
4.​ Secure against quantum attacks.

Diagram
Classical Security
|
Quantum Computers
|
Security Threat
|
Quantum Cryptography

Advantages
●​ Unconditional security.
●​ Eavesdropper detection.
●​ Future-proof communication.

9. Explain BB84 Quantum Key Distribution Protocol

Definition
BB84 is the first and most widely used Quantum Key Distribution (QKD) protocol.
Proposed by:
●​ Charles Bennett
●​ Gilles Brassard
in 1984.

Working
Step 1
Sender (Alice) generates random bits.
Step 2
Alice sends photons using random polarization bases.
Step 3
Receiver (Bob) measures photons using random bases.
Step 4
Alice and Bob compare bases.
Step 5
Matching results form the secret key.

Diagram
Alice
|
Photons
|
Quantum Channel
|
Bob

Security
Any eavesdropper changes photon states and gets detected.

Advantages
●​ Highly secure.
●​ Eavesdropping detection.
●​ Widely implemented.

10. Explain B92 Quantum Key Distribution Protocol

Definition
B92 is a simplified version of BB84 proposed by Bennett in 1992.

Working
Uses only two non-orthogonal quantum states instead of four states used in BB84.

Steps
1.​ Alice sends photons in two states.
2.​ Bob performs measurements.
3.​ Some measurements provide valid key bits.
4.​ Invalid measurements are discarded.

Diagram
Alice
|
Two Quantum States
|
Quantum Channel
|
Bob

Advantages
●​ Simpler implementation.
●​ Requires fewer states.
Disadvantages
●​ More sensitive to noise.
●​ Lower efficiency.

11. Explain EPR-Based Quantum Key Distribution Protocol

Definition
EPR-based QKD uses entangled particle pairs.
Based on the famous:
Einstein-Podolsky-Rosen Paradox

Working
Step 1
Create entangled photon pairs.
Step 2
One photon sent to Alice.
Step 3
Other photon sent to Bob.
Step 4
Both measure photons.
Step 5
Correlated results form secret key.

Diagram
Entangled Pair
|
--------
| |
Alice Bob
| |
Measure Measure

Security
Any interception disturbs entanglement and can be detected.

Advantages
●​ Extremely secure.
●​ Based on entanglement.
●​ Detects eavesdroppers effectively.

12. Compare BB84, B92, and EPR Protocols

Feature BB84 B92 EPR

Year 1984 1992 Entanglement-based

 Inventor Bennett & Brassard Bennett Based on EPR concept

States Used Four Two Entangled states

Complexity Medium Low High

Security High High Very High

Entanglement No No Yes

Efficiency High Medium Medium

Implementation Common Simple Complex

13. Explain Quantum Teleportation with Suitable Diagram

Definition
Quantum teleportation transfers the quantum state of a particle from one location to another without
physically moving the particle.

Requirements
1.​ Entangled particles.
2.​ Classical communication channel.
3.​ Quantum channel.

Working
Step 1
Alice and Bob share entangled qubits.
Step 2
Alice combines unknown state with her entangled qubit.
Step 3
Alice measures and sends classical information.
Step 4
Bob applies operations.
Step 5
Original state appears at Bob's side.

Diagram
Unknown State
|
Alice
|
Measurement
|
Classical Message
|
 V
Bob
|
Quantum Operation
|
Recovered State

Applications
●​ Quantum communication
●​ Quantum internet
●​ Distributed quantum computing

14. Discuss Advantages of Quantum Cryptography Over Classical Cryptography

1. Eavesdropping Detection
Any interception changes quantum states.

2. Security Based on Physics

Security relies on quantum mechanics, not mathematical assumptions.

3. Resistant to Quantum Attacks

Secure against future quantum computers.

4. Unconditional Security
Provides theoretically provable security.

5. Secure Key Distribution

Keys can be exchanged safely.

Comparison Table
Feature Classical Cryptography Quantum Cryptography

Security Basis Mathematics Quantum Mechanics

Eavesdropping Detection Difficult Immediate

Quantum Attack Resistance Weak Strong

Key Distribution Vulnerable Secure

Future Security Uncertain High

15. Explain Challenges in Implementing Quantum Cryptographic Systems

1. High Cost
Quantum communication devices are expensive.
2. Specialized Hardware
Requires:
●​ Photon generators
●​ Detectors
●​ Optical fibers

3. Transmission Loss
Photons may be lost over long distances.

4. Noise and Errors

Environmental disturbances affect signals.

5. Scalability Issues
Large-scale deployment remains difficult.

6. Infrastructure Requirements
Existing communication networks need modification.

Diagram
Quantum System
|
-------------------
| Noise |
| Signal Loss |
| Hardware Cost |
-------------------
|
Implementation Challenges
 UNIT V- Information Theory & Hardware

1. Explain Classical Information Theory and Shannon Entropy

Classical Information Theory
Definition
Classical Information Theory is a branch of mathematics and communication engineering developed
by Claude Shannon in 1948.
It deals with:
●​ Storage of information
●​ Transmission of information
●​ Compression of data
●​ Error detection and correction
The main objective is to send information efficiently and accurately through communication channels.

Basic Communication Model

Information Source
|
V
Encoder
|
V
Communication Channel
|
V
Decoder
|
V
Receiver

Example
Sending a message:
HELLO
through the internet or mobile network.

Shannon Entropy
Definition
Shannon Entropy measures the amount of uncertainty or information contained in a message.
Higher uncertainty → Higher information content.

Formula
H(X)=-\sum p(x)\log_2 p(x)
Where:
●​ H(X) = Entropy
●​ p(x) = Probability of occurrence
Example: Fair Coin Toss
Head = 0.5
Tail = 0.5

Entropy:
H = 1 bit
This means one bit of information is produced.

Importance
1.​ Measures information content.
2.​ Helps data compression.
3.​ Used in communication systems.
4.​ Foundation of modern digital communication.

2. Define Quantum Information and Explain von Neumann Entropy

Quantum Information
Definition
Quantum Information is information stored and processed using quantum systems such as qubits.
Unlike classical information:
●​ Classical information uses bits (0 or 1)
●​ Quantum information uses qubits (superposition of 0 and 1)

Example
A qubit can exist as:
|\psi\rangle=\alpha|0\rangle+\beta|1\rangle

von Neumann Entropy

Definition
The von Neumann Entropy measures uncertainty in a quantum state.
It is the quantum equivalent of Shannon entropy.

Formula
S(\rho)=-Tr(\rho\log_2\rho)
Where:
●​ S(ρ) = von Neumann entropy
●​ ρ = Density matrix
●​ Tr = Trace operation

Interpretation
●​ S = 0 → Pure quantum state
●​ S > 0 → Mixed quantum state

Example
Pure State:
|0⟩

Entropy:
S=0
Because there is no uncertainty.

Importance
1.​ Measures quantum uncertainty.
2.​ Used in quantum communication.
3.​ Helps analyze entanglement.
4.​ Important in quantum information theory.

3. Differentiate Between Shannon Entropy and von Neumann Entropy

Feature Shannon Entropy von Neumann Entropy

Introduced By Claude Shannon John von Neumann

System Type Classical Quantum

Measures Classical uncertainty Quantum uncertainty

Information Unit Bits Qubits

Formula H(X) = -Σp(x)log₂p(x) S(ρ) = -Tr(ρlog₂ρ)

State Representation Probability distribution Density matrix

Applications Communication systems Quantum communication

Pure State Entropy Not applicable Zero

4. Explain Classical Data Compression Techniques

Definition
Data Compression is the process of reducing the size of data to save storage space and transmission
bandwidth.

Types of Compression
1. Lossless Compression
Original data can be recovered exactly.
Examples:
●​ ZIP
●​ PNG
●​ Huffman Coding
2. Lossy Compression
Some information is lost permanently.
Examples:
●​ JPEG
●​ MP3
●​ MPEG

Huffman Coding Example

Characters:
A = 50%
B = 25%
C = 15%
D = 10%

More frequent characters get shorter codes.

A=0
B = 10
C = 110
D = 111

Diagram
Original Data
|
Compression
|
Compressed Data
|
Decompression
|
Original Data

Advantages
1.​ Saves storage space.
2.​ Reduces transmission time.
3.​ Improves network efficiency.

5. Explain Quantum Data Compression

Definition
Quantum Data Compression is the process of reducing the number of qubits required to represent
quantum information.

Principle
Quantum compression removes redundancy from quantum states while preserving information.
Schumacher Compression
The quantum equivalent of Huffman coding.
Proposed by:​
Benjamin Schumacher

Working
1.​ Analyze quantum state probabilities.
2.​ Identify redundant information.
3.​ Encode information using fewer qubits.
4.​ Recover original state later.

Diagram
Quantum States
|
Quantum Compression
|
Fewer Qubits
|
Quantum Decompression
|
Original Quantum States

Advantages
1.​ Saves quantum memory.
2.​ Efficient quantum communication.
3.​ Reduces hardware requirements.

6. Compare Classical and Quantum Data Compression

Feature Classical Compression Quantum Compression

Information Type Classical data Quantum states

Storage Unit Bits Qubits

Theory Shannon Theory Quantum Information Theory

Compression Method Huffman, ZIP Schumacher Compression

Data Representation Binary Quantum States

Complexity Lower Higher

Recovery Exact or Approximate Quantum State Reconstruction

Applications Files, Images Quantum Communication

7. Explain Error-Correcting Codes in Classical Systems
Definition
Error-correcting codes detect and correct errors during data transmission.

Need
Errors may occur because of:
●​ Noise
●​ Interference
●​ Hardware failures

Example: Hamming Code

Original Data:
1011

Extra parity bits are added.

1011010
Receiver detects and corrects errors.

Diagram
Data
|
Encoding
|
Transmission
|
Noise
|
Decoding
|
Correct Data

Applications
1.​ Computer memory.
2.​ Mobile communication.
3.​ Satellite communication.

8. Explain Quantum Error-Correcting Codes

Definition
Quantum Error Correction (QEC) protects qubits from errors caused by decoherence and noise.

Why Needed?
Qubits are very sensitive to environmental disturbances.

Types of Quantum Errors

Bit Flip Error
|0⟩ → |1⟩

Phase Flip Error

|+⟩ → |−⟩

Example: Three-Qubit Bit Flip Code

Original qubit:
|0⟩

Encoded as:
|000⟩

If one qubit changes:

|010⟩

Majority voting restores:

|000⟩

Diagram
Qubit
|
Encoding
|
Multiple Qubits
|
Error Detection
|
Correction

Importance
1.​ Reliable quantum computation.
2.​ Fault-tolerant systems.
3.​ Long quantum computations.

9. Discuss Goals and Challenges in Quantum Hardware Development

Goals
1. Increase Number of Qubits
Build large-scale quantum computers.
2. Improve Stability
Reduce decoherence.
3. Improve Accuracy
Reduce quantum errors.
4. Scalability
Support millions of qubits.

Challenges
1. Decoherence
Quantum states lose information quickly.
2. Noise
External disturbances create errors.
3. Cooling Requirements
Many systems require extremely low temperatures.
4. High Cost
Quantum hardware is expensive.
5. Error Correction
Requires many additional qubits.

Diagram
Quantum Hardware
|
--------------------
| Noise |
| Decoherence |
| Cost |
| Scalability |
--------------------

10. Explain Ion Trap Technology for Implementing Quantum Computers

Definition
Ion Trap Quantum Computing uses charged atoms (ions) as qubits.

Working
1.​ Ions are trapped using electromagnetic fields.
2.​ Laser beams manipulate ions.
3.​ Quantum gates operate on ions.
4.​ Measurement gives output.

Diagram
Laser
|
V
[ Ion ] [ Ion ] [ Ion ]
|
Electromagnetic Trap

Advantages
1.​ High accuracy.
 2.​ Long coherence time.
3.​ Reliable operations.

Disadvantages
1.​ Slow gate operations.
2.​ Difficult scalability.

11. Explain Linear Optics Approach for Quantum Computing

Definition
Linear optical quantum computing uses photons as qubits.

Components
1.​ Photons
2.​ Beam splitters
3.​ Mirrors
4.​ Detectors

Diagram
Photon
|
Beam Splitter
/\
/ \
Detector Detector

Advantages
1.​ Low noise.
2.​ Fast communication.
3.​ Suitable for quantum networks.

Disadvantages
1.​ Difficult photon control.
2.​ Scalability challenges.

12. Explain NMR-Based Quantum Computing

Definition
NMR (Nuclear Magnetic Resonance) Quantum Computing uses atomic nuclei as qubits.

Working
1.​ Molecules placed in magnetic field.
2.​ Radio-frequency pulses manipulate nuclei.
3.​ Quantum operations performed.
4.​ Signals measured.
Diagram
Magnetic Field
|
Molecule
|
RF Pulses
|
Measurement

Advantages
1.​ Well-understood technology.
2.​ Easy experimental setup.

Disadvantages
1.​ Difficult to scale.
2.​ Limited number of qubits.

13. Explain Superconducting Qubits in Quantum Computing

Definition
Superconducting qubits are electrical circuits operating at extremely low temperatures.
They are currently among the most widely used quantum hardware technologies.

Working
1.​ Circuit cooled near absolute zero.
2.​ Superconducting current forms qubits.
3.​ Microwave pulses perform operations.
4.​ Measurement provides output.

Diagram
Microwave Control
|
V
Superconducting Circuit
|
Cryogenic Cooling
|
Measurement
1.​ operations.
2.​ Easily integrated into chips.
3.​ Scalable architecture.

Disadvantages
1.​ Sensitive to noise.
2.​ Requires expensive cooling.
Examples
Used by:
●​ IBM
●​ Google
●​ Rigetti Computing

14. Compare Different Quantum Hardware Implementations

Feature Ion Trap Linear Optics NMR Superconducting Qubits

Qubit Type Ions Photons Atomic Superconducting Circuits

Nuclei

Control Method Lasers Optical Devices RF Pulses Microwave Pulses

Coherence Time Very High High Moderate Moderate

Gate Speed Slow Fast Moderate Very Fast

Scalability Moderate Difficult Poor Good

Noise Resistance High High Moderate Lower

Cooling Required Moderate No Extreme Moderate Very High

Cooling

Commercial Growing Research Limited Most Popular

Usage