Unit III - Introduction To Quantum Computing
Unit III - Introduction To Quantum Computing
ac
∣ψ1 ⟩ ⊗ ∣ψ2 ⟩ = [ ] ⊗ [ ] =
a c ad
b d bc
bd
For n-qubit systems, tensor products generate a 2n -dimensional state space.
Example:
1 0
Combining ∣0⟩ = [ ] and ∣1⟩ = [ ]:
0 1
0
1
∣0⟩ ⊗ ∣1⟩ = ∣01⟩ =
0
1/6
General Form:
For n qubits:
2n −1
∣ψ⟩ = ∑ αi ∣i⟩,
where ∑ ∣αi ∣2 = 1
i=0
3.3 Superposition
Superposition allows a qubit to exist in a combination of the ∣0⟩ and ∣1⟩ states.
Mathematics:
Example:
1
H∣0⟩ = (∣0⟩ + ∣1⟩)
2
3.4 Entanglement
Entanglement creates strong correlations between qubits, where the state of one qubit
depends on the state of another, regardless of distance.
2/6
1
∣ψ+ ⟩ = (∣00⟩ + ∣11⟩)
2
3.5 Decoherence
Decoherence describes the loss of quantum coherence due to interaction with the
environment, transitioning quantum states into classical mixtures.
Key Points:
Protocol:
1
1. Alice and Bob share an entangled pair ∣ψAB ⟩
= 2
(∣00⟩ + ∣11⟩).
2. Alice measures her qubit and the qubit to be teleported.
Proof Sketch:
3/6
U (∣ψ⟩ ⊗ ∣e⟩) = ∣ψ⟩ ⊗ ∣ψ⟩
= (⟨ψ∣φ⟩)2 ,
⟨ψ∣φ⟩ contradicting linearity.
Protocol:
2. Alice applies a unitary operation (e.g., I, X, Z, Y ) based on the two classical bits she
wants to send.
Mathematical Definition:
2n −1
1
QFT(∣x⟩) = ∑ e 2πixk/2n
∣k ⟩
2n k=0
Example:
4/6
For n = 2, QFT acts on the basis states:
1
∣0⟩ → (∣0⟩ + ∣1⟩ + ∣2⟩ + ∣3⟩)
2
Circuit Representation:
2. Apply controlled-phase gates to entangle the first qubit with the rest.
1. Apply H to qubit 1.
2. Phase Estimation:
3. Signal Processing:
5/6
These notes provide an in-depth understanding of advanced quantum concepts, designed
for higher-level undergraduate students, combining theory, mathematical rigor, and practical
applications.
6/6