Quantum Computing-Qubits
[Link]
Department of Electronics and Communication Engineering
–Sri Krishna College of Technology, Coimbatore
rajasekarkpr@[Link] & rajasekar.p@[Link] [Link]
January 6, 2025
[Link] (SKCT) Quantum January 6, 2025 1/1
Table of Contents
[Link] (SKCT) Quantum January 6, 2025 2/1
Objective and Course outcome
Objective I
To know the background of classical computing and quantum
computing.
To learn the fundamental concepts that underlie quantum
computation.
To explore the principles of quantum mechanics and its relevance to
Computer Science.
To understand the basic hardware and mathematical models of
quantum computation.
To acquire knowledge about the quantum information theory and its
theoretical foundations. .
[Link] (SKCT) Quantum January 6, 2025 3/1
Objective and Course outcome
Course Outcome I
1 Apply the foundational principles of quantum information and
comprehend its theoretical underpinnings.
2 Demonstrate a comprehensive understanding of the background and
principles of Quantum Mechanics.
3 Evaluate different computation models in the context of quantum
computing.
4 Model the circuits using quantum computation environments and
frameworks.
5 Explain and interpret quantum operations, including noise and
error-correction techniques.
[Link] (SKCT) Quantum January 6, 2025 4/1
Objective and Course outcome
syllabus I
Module 1 :QUANTUM COMPUTING BASIC CONCEPTS
Complex Numbers - Linear Algebra - Matrices and Operators - Global
Perspectives Postulates of Quantum Mechanics - Quantum Bits -
Representations of Qubits - Superpositions. Universal logic gates -
Basic single-qubit gates - Multiple qubit gates - Circuit development -
Quantum error correction .
Module 2: QUANTUM ALGORITHMS Quantum parallelism -
Deutsch’s algorithm - The Deutsch-Jozsa algorithm - Quantum
Fourier transform and its applications - Quantum Search Algorithms:
Grover’s Algorithm. Data compression - Shannon’s noiseless channel
coding theorem - Schumacher’s quantum noiseless channel coding
theorem - Classical information over noisy quantum channels.
[Link] (SKCT) Quantum January 6, 2025 5/1
Objective and Course outcome
syllabus II
Module 3: QUANTUM CRYPTOGRAPHY Classical
cryptography basic concepts - Private key cryptography - Shor’s
Factoring Algorithm - Quantum Key Distribution - BB84 - Ekart 91
[Link] (SKCT) Quantum January 6, 2025 6/1
Objective and Course outcome
Introduction I
Quantum bits (qubits) are the fundamental unit of quantum
computing.
Qubits differ from classical bits due to their ability to exist in a
superposition of states.
Entanglement and quantum gates are key components of quantum
computation.
[Link] (SKCT) Quantum January 6, 2025 7/1
Objective and Course outcome
Quantum Bits (Qubits)
Definition: A qubit is a two-level quantum system represented as:
|ψ⟩ = α |0⟩ + β |1⟩ , |α|2 + |β|2 = 1
|0⟩ and |1⟩: Basis states.
α, β: Complex probability amplitudes.
[Link] (SKCT) Quantum January 6, 2025 8/1
Objective and Course outcome
Superposition
A qubit can exist in a superposition of |0⟩ and |1⟩.
Measurement collapses the state into one of the basis states.
Example: Equal Superposition
1 1
|ψ⟩ = √ |0⟩ + √ |1⟩
2 2
Probability of |0⟩: | √12 |2 = 0.5
Probability of |1⟩: | √12 |2 = 0.5
[Link] (SKCT) Quantum January 6, 2025 9/1
Objective and Course outcome
Entanglement
Definition: Two or more qubits are entangled if their states are
interdependent.
1
|ψ⟩ = √ (|00⟩ + |11⟩)
2
Key Points:
Measurement of one qubit affects the state of the other.
Entanglement enables quantum protocols like teleportation and
superdense coding.
[Link] (SKCT) Quantum January 6, 2025 10 / 1
Objective and Course outcome
Bloch Sphere Representation
Geometrical Representation:
θ iϕ θ
|ψ⟩ = cos |0⟩ + e sin |1⟩
2 2
θ: Polar angle.
ϕ: Azimuthal angle.
[Link] (SKCT) Quantum January 6, 2025 11 / 1
Objective and Course outcome
Universal Logic Gates
1. Hadamard Gate (H):
1 1 1
H=√
2 1 −1
1 1
H |0⟩ = √ (|0⟩ + |1⟩), H |1⟩ = √ (|0⟩ − |1⟩)
2 2
2. CNOT Gate (Controlled-NOT):
1 0 0 0
0 1 0 0
CNOT = 0
0 0 1
0 0 1 0
[Link] (SKCT) Quantum January 6, 2025 12 / 1
Objective and Course outcome
Example: Creating Entanglement
Initial State: |ψ⟩ = |00⟩
1 Apply Hadamard to the first qubit:
1
H |00⟩ = √ (|00⟩ + |10⟩)
2
2 Apply CNOT gate:
1 1
CNOT √ (|00⟩ + |10⟩) = √ (|00⟩ + |11⟩)
2 2
Result: Bell state √1 (|00⟩ + |11⟩)
2
[Link] (SKCT) Quantum January 6, 2025 13 / 1
Objective and Course outcome
Conclusion
Qubits leverage superposition and entanglement to achieve
computational advantages.
Universal gates (Hadamard, CNOT) enable the implementation of
quantum algorithms.
Visual representations like the Bloch sphere help in understanding
quantum states.
[Link] (SKCT) Quantum January 6, 2025 14 / 1
Temporary page!
LATEX was unable to guess the total number of pages correctly. A
was some unprocessed data that should have been added to the
this extra page has been added to receive it.
If you rerun the document (without altering it) this surplus page
away, because LATEX now knows how many pages to expect for t
document.