Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
32 views2 pages

Document 6 (Class Notes) - Introduc

The document provides an introduction to quantum computing, highlighting the differences between classical bits and qubits, including concepts like superposition, entanglement, and interference. It discusses quantum gates and their functions, as well as practical applications such as cryptography and database search. Additionally, it mentions real-world quantum devices like IBM Qiskit and Google Sycamore.

Uploaded by

anonymousstiller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
32 views2 pages

Document 6 (Class Notes) - Introduc

The document provides an introduction to quantum computing, highlighting the differences between classical bits and qubits, including concepts like superposition, entanglement, and interference. It discusses quantum gates and their functions, as well as practical applications such as cryptography and database search. Additionally, it mentions real-world quantum devices like IBM Qiskit and Google Sycamore.

Uploaded by

anonymousstiller
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

Document 6: [Class Notes] – Introduction to Quantum Computing

Subject: Computer Science – Quantum Computing


Level: Undergraduate (B.Sc. / B.Tech.)

🧠 Topic: Basics of Quantum Computing


1. Classical vs. Quantum Bit (Qubit)

Classical bit: 0 or 1

Qubit: Superposition of 0 and 1

𝜓
∣

𝛼
=

∣
0
⟩

𝛽
+

∣
1
⟩
,

𝛼
∣

∣
2
+

𝛽
∣

∣
2
=
1
∣ψ⟩=α∣0⟩+β∣1⟩,∣α∣
2
+∣β∣
2
=1
2. Key Principles:

Superposition: A qubit can exist in multiple states at once.

Entanglement: Qubits can be linked such that the state of one affects the other.

Interference: Probabilities can cancel or reinforce based on phase.

3. Quantum Gates (unitary):

X gate (NOT): Flips the qubit

Hadamard gate (H): Creates superposition

CNOT gate: Conditional flip, key for entanglement

4. Use Cases:
Cryptography (Shor’s Algorithm: factor integers in polynomial time)

Database search (Grover’s Algorithm)

Drug discovery and materials simulation

5. Real-World Quantum Devices:

IBM Qiskit

Google Sycamore (53-qubit quantum supremacy test)

D-Wave (quantum annealing, not universal QC)

Homework:
Q1. Explain the difference between classical and quantum gates.
Q2. Why is decoherence a challenge in real quantum computers?

You might also like