Scribd
Upload
2 views

Quantum Computing

Uploaded by

akucer1
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Quantum Computing

Uploaded by

akucer1
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Advanced Quantum Computing - Class Notes

Chapter 1: Fundamentals of Quantum Computing

1. Introduction to Quantum Computing


 Quantum computing utilizes the principles of quantum mechanics to perform
computations.
 Key differences from classical computing:
o Uses qubits instead of bits.

o Exploits superposition, entanglement, and quantum


interference.
2. Qubits and Quantum States
 A qubit can exist in a state |0⟩, |1⟩, or any linear combination (superposition):
o |ψ⟩ = α|0⟩ + β|1⟩, where |α|^2 + |β|^2 = 1.

 Unlike classical bits, qubits represent probabilities until measured.


3. Quantum Gates
 Analogous to classical logic gates but operate on qubits.
 Examples of single-qubit gates:
o X gate: Flips the state of the qubit (|0⟩ ↔ |1⟩).

o H gate (Hadamard): Creates superposition: |0⟩ → (|0⟩ + |1⟩)/√2.

o Z gate: Introduces a phase shift.

 Multi-qubit gates:
o CNOT (Controlled NOT): Flips the target qubit based on the state of
the control qubit.
o SWAP gate: Exchanges the states of two qubits.

4. Quantum Circuits
 A quantum algorithm is implemented as a sequence of quantum gates.
 Circuit diagram example for a simple 2-qubit system:
o Start with |00⟩.

o Apply H gate to qubit 1.

o Apply CNOT with qubit 1 as control and qubit 2 as target.

5. Quantum Entanglement
 Two or more qubits are entangled when their states are interdependent.
 Example:
o Bell state: |ψ⟩ = (|00⟩ + |11⟩)/√2.

o Measuring one qubit immediately determines the state of the other.

6. Quantum Measurement
 Measurement collapses a qubit’s state into one of its basis states (|0⟩ or |1⟩).
 Probabilities are given by the squared magnitudes of the coefficients (|α|^2, |
β|^2).
7. Quantum Algorithms
 Quantum computers excel in specific tasks through algorithms that leverage
quantum principles.
 Examples:
o Shor’s Algorithm: Efficiently factors large numbers.

o Grover’s Algorithm: Speeds up unstructured search problems.

o Quantum Fourier Transform: Used in many quantum algorithms.

8. Example Problem: Simple Quantum Circuit


 Problem: Create a Bell state using a 2-qubit system.
o Steps:

1. Start with |00⟩.


2. Apply H gate to qubit 1: |ψ⟩ = (|00⟩ + |10⟩)/√2.
3. Apply CNOT with qubit 1 as control and qubit 2 as target: |ψ⟩ = (|
00⟩ + |11⟩)/√2.
o Result: The two qubits are now entangled.

9. Homework
 Simulate a quantum circuit that applies Grover’s algorithm for a 2-qubit
database search.
 Research the implications of quantum error correction in practical quantum
computers.
 Explore the role of decoherence in quantum computation.

Summary
 Quantum computing introduces a paradigm shift in computation by utilizing
qubits and quantum mechanics.
 Key concepts include quantum gates, circuits, entanglement, and quantum
algorithms.
Next Class Preview
 Chapter 2: Quantum Error Correction and Noise Mitigation

You might also like