Complete Quantum Computing Study Notes
From Basic Principles to Advanced Research Applications
2. Quantum Computing Core Concepts
2.1 Quantum Mechanics Fundamentals
Postulates of Quantum Mechanics
Quantum mechanics is built on several fundamental postulates that govern the behavior of quantum systems:
Postulate 1: State Description
- Any isolated physical system is associated with a complex vector space called the state space or Hilbert space
- The system is completely described by its state vector |ψ⟩, which is a unit vector in this space
- For a qubit: |ψ⟩ = α|0⟩ + β|1⟩ where |α|² + |β|² = 1
Postulate 2: Observables
- Observable physical quantities correspond to Hermitian operators acting on the state space
- The eigenvalues of these operators represent the possible results of measurements
- Common observables: position (x̂), momentum (p̂), energy (Ĥ), spin components (σₓ, σᵧ, σᵤ)
Postulate 3: Measurement
- When measuring observable M on state |ψ⟩, the probability of obtaining eigenvalue mᵢ is:
P(mᵢ) = |⟨mᵢ|ψ⟩|²
- After measurement, the system collapses to the corresponding eigenstate |mᵢ⟩
Postulate 4: Evolution
- The time evolution of a closed quantum system is described by the Schrödinger equation:
iℏ ∂|ψ⟩/∂t = Ĥ|ψ⟩
- For discrete time steps: |ψ(t+dt)⟩ = U(dt)|ψ(t)⟩ where U is a unitary operator
Quantum States, Superposition, and Measurement
Quantum States
- Pure states: |ψ⟩ = α|0⟩ + β|1⟩ (coherent superposition)
- Mixed states: Described by density matrices ρ = Σᵢ pᵢ|ψᵢ⟩⟨ψᵢ|
- Computational basis: {|0⟩, |1⟩} for single qubits
- Multi-qubit basis: {|00⟩, |01⟩, |10⟩, |11⟩} for two qubits
Superposition Principle
- Quantum systems can exist in linear combinations of basis states
- Key difference from classical systems: both states exist simultaneously
- Mathematical representation: |ψ⟩ = Σᵢ αᵢ|i⟩ where Σᵢ |αᵢ|² = 1
- Physical interpretation: amplitudes αᵢ encode probability information
Measurement Process
- Born rule: P(outcome i) = |⟨i|ψ⟩|²
- Measurement destroys superposition (wave function collapse)
- Post-measurement state: |ψ'⟩ = |i⟩ (eigenstate corresponding to measurement result)
- Projective measurements: M = Σᵢ mᵢ|mᵢ⟩⟨mᵢ|
Bloch Sphere Representation
Mathematical Foundation
- Any single qubit state can be written as: |ψ⟩ = cos(θ/2)|0⟩ + e^(iφ)sin(θ/2)|1⟩
- Parameters: θ ∈ [0,π] (polar angle), φ ∈ [0,2π) (azimuthal angle)
- Global phase can be ignored: only relative phase matters
Geometric Interpretation
- Unit sphere in 3D space with radius 1
- North pole: |0⟩ state, South pole: |1⟩ state
- Equator: Equal superposition states (|+⟩, |-⟩, |+i⟩, |-i⟩)
- Interior points represent mixed states (not accessible for pure states)
Key Properties
- Pure states: Surface of sphere
- Antipodal points: Orthogonal states
- Great circles: Paths of unitary evolution
- Rotations: Correspond to unitary transformations
2.2 Qubits and Quantum Gates
Qubits vs Classical Bits
Classical Bits
- Two definite states: 0 or 1
- Operations: AND, OR, NOT, XOR, etc.
- Information storage: n bits store one of 2ⁿ possible states
- Copying: Bits can be cloned perfectly
- Measurement: Non-destructive reading
Qubits (Quantum Bits)
- Infinite continuum of states: α|0⟩ + β|1⟩
- Complex amplitudes: α, β ∈ ℂ with |α|² + |β|² = 1
- Information capacity: n qubits can represent 2ⁿ states simultaneously
- No-cloning theorem: Arbitrary quantum states cannot be copied
- Measurement: Destructive, probabilistic outcomes
Key Advantages of Qubits
- Superposition: Parallel processing capabilities
- Entanglement: Non-local correlations
- Interference: Amplitude manipulation for computation
Single-Qubit Gates
Pauli Gates
X Gate (NOT Gate)
X = [0 1] |0⟩ → |1⟩
[1 0] |1⟩ → |0⟩
- Bit-flip operation
- 180° rotation around X-axis on Bloch sphere
Y Gate
Y = [0 -i] |0⟩ → i|1⟩
[i 0] |1⟩ → -i|0⟩
- Combined bit and phase flip
- 180° rotation around Y-axis
Z Gate (Phase Flip)
Z = [1 0] |0⟩ → |0⟩
[0 -1] |1⟩ → -|1⟩
- Phase-flip operation
- 180° rotation around Z-axis
Hadamard Gate (H)
H = 1/√2 [1 1] |0⟩ → (|0⟩ + |1⟩)/√2 = |+⟩
[1 -1] |1⟩ → (|0⟩ - |1⟩)/√2 = |-⟩
- Creates equal superposition
- 90° rotation around axis (X+Z)/√2
Phase Gates
S Gate (Phase Gate)
S = [1 0] |0⟩ → |0⟩
[0 i] |1⟩ → i|1⟩
T Gate (π/8 Gate)
T = [1 0 ] |0⟩ → |0⟩
[0 e^(iπ/4)] |1⟩ → e^(iπ/4)|1⟩
- 45° Z-rotation
- T² = S, T⁴ = Z
Multi-Qubit Gates
CNOT Gate (Controlled-X)
CNOT = [1 0 0 0] |00⟩ → |00⟩
[0 1 0 0] |01⟩ → |01⟩
[0 0 0 1] |10⟩ → |11⟩
[0 0 1 0] |11⟩ → |10⟩
- Two-qubit gate: control and target
- Creates entanglement: |+0⟩ → (|00⟩ + |11⟩)/√2
- Universal for classical computation (with single-qubit gates)
Controlled-Z Gate
CZ = [1 0 0 0] Phase flip on |11⟩ only
[0 1 0 0]
[0 0 1 0]
[0 0 0 -1]
- Symmetric: both qubits act as control
- Equivalent to CNOT up to single-qubit rotations
Toffoli Gate (CCNOT)
Toffoli = [1 0 0 0 0 0 0 0] |abc⟩ → |ab(c⊕(a∧b))⟩
[0 1 0 0 0 0 0 0]
[0 0 1 0 0 0 0 0]
[0 0 0 1 0 0 0 0] Only flips target when both
[0 0 0 0 1 0 0 0] controls are |1⟩
[0 0 0 0 0 1 0 0]
[0 0 0 0 0 0 0 1]
[0 0 0 0 0 0 1 0]
- Three-qubit gate: two controls, one target
- Universal for classical reversible computation
- Key building block for quantum algorithms
2.3 Quantum Circuits and Algorithms
Building Quantum Circuits
Circuit Model Fundamentals
- Quantum circuits represent quantum computations as sequences of gates
- Time flows left to right
- Horizontal lines represent qubits (wires)
- Boxes represent quantum gates
- Measurements typically at circuit end
Circuit Composition Rules
- Gates applied sequentially: U₂U₁|ψ⟩ (U₁ first, then U₂)
- Parallel gates on different qubits: U₁ ⊗ U₂
- Circuit depth: Maximum number of gates in any path
- Circuit width: Number of qubits
Universal Gate Sets
- Any quantum computation can be decomposed into universal gates
- Example sets: {H, T, CNOT}, {All single-qubit gates, CNOT}
- Solovay-Kitaev theorem: Efficient approximation of arbitrary unitaries
Quantum Parallelism and Measurement
Quantum Parallelism
- N qubits can represent 2ᴺ classical states simultaneously
- Quantum algorithms can process all states in parallel
- Challenge: Extracting useful information via measurement
Measurement Strategies
- Computational basis measurement: Projects onto {|0⟩, |1⟩}⊗ⁿ
- Observable measurement: General Hermitian operators
- Partial measurement: Measure subset of qubits
- Deferred measurement: Measurements can be moved to circuit end
Amplitude Amplification
- Key technique for quantum advantage
- Rotate amplitude distribution to increase success probability
- Used in Grover's algorithm and other quantum algorithms
Key Algorithms
Deutsch-Jozsa Algorithm
Problem Statement
- Given: Black-box function f: {0,1}ⁿ → {0,1}
- Promise: f is either constant (all outputs same) or balanced (half 0s, half 1s)
- Goal: Determine which case with minimum evaluations
Classical Solution
- Worst case: 2ⁿ⁻¹ + 1 function evaluations
- Best case: 2 evaluations (if lucky)
Quantum Solution
Circuit:
|0⟩⊗ⁿ ─ H⊗ⁿ ─ Uf ─ H⊗ⁿ ─ Measure
|1⟩ ─ H ─ ─ ─
Algorithm Steps
- Initialize: |0⟩⊗ⁿ|1⟩
- Apply Hadamard: Create uniform superposition
- Apply Oracle Uf: |x⟩|y⟩ → |x⟩|y ⊕ f(x)⟩
- Apply Hadamard to first register
- Measure: All zeros iff f is constant
Key Insight
- Single query achieves exponential speedup
- Interference amplifies global properties of function
Bernstein-Vazirani Algorithm
Problem Statement
- Given: Function f(x) = a·x (mod 2) for unknown string a
- Goal: Find the hidden string a
Classical Approach
- Need n queries: f(2⁰), f(2¹), ..., f(2ⁿ⁻¹)
- Each query reveals one bit of a
Quantum Solution
- Single query using same circuit structure as Deutsch-Jozsa
- Measurement directly yields string a
- Perfect example of quantum parallelism
Grover's Search Algorithm
Problem Statement
- Given: Unsorted database of N = 2ⁿ items
- One item satisfies search criterion (marked item)
- Goal: Find marked item
Classical Performance
- Expected queries: N/2
- Worst case: N queries
Quantum Algorithm Structure
|ψ⟩ = H⊗ⁿ|0⟩⊗ⁿ (uniform superposition)
Repeat √N times:
1. Apply Oracle O: |x⟩ → (-1)^f(x)|x⟩
2. Apply Diffusion operator D = 2|ψ⟩⟨ψ| - I
Geometric Interpretation
- State space spanned by |α⟩ (non-solutions) and |β⟩ (solutions)
- Each iteration rotates state vector by fixed angle
- After ~π√N/4 iterations, high probability of measuring solution
Performance
- Queries: O(√N) - quadratic speedup
- Optimal: Proven to be optimal for this problem
- Applications: Database search, optimization, cryptanalysis
Quantum Fourier Transform (QFT)
Mathematical Definition
- Classical DFT: X_k = Σⁿ⁻¹ⱼ₌₀ xⱼ ωᴺᵏʲ where ωN = e^(2πi/N)
- Quantum version: |j⟩ → (1/√N) Σᵏ₌₀ᴺ⁻¹ e^(2πijk/N)|k⟩
Circuit Implementation
For n-qubit QFT:
|j₁j₂...jₙ⟩ → |k₁k₂...kₙ⟩
Where |kₘ⟩ = (|0⟩ + e^(2πi×0.jₘjₘ₊₁...jₙ)|1⟩)/√2
Circuit Structure
- Apply Hadamard to each qubit
- Apply controlled phase rotations: CRₖ = diag(1,1,1,e^(2πi/2ᵏ))
- Swap qubits to reverse order
- Circuit depth: O(n²), much faster than classical O(n log n)
Applications
- Shor's algorithm (period finding)
- Quantum phase estimation
- Hidden subgroup problems
Shor's Algorithm
Problem Statement
- Input: Composite integer N
- Output: Non-trivial factor of N
- Applications: RSA cryptosystem, discrete logarithm
Algorithm Overview
- Classical preprocessing
- Check if N is even, prime power, or small
- Choose random a < N with gcd(a,N) = 1
- Quantum period finding
- Find period r of function f(x) = aˣ mod N
- Use QFT-based quantum algorithm
- Classical postprocessing
- If r is even and aʳ/² ≢ -1 (mod N), then:
- Factor = gcd(aʳ/² ± 1, N)
Quantum Subroutine (Period Finding)
Circuit:
|0⟩⊗ⁿ ─ H⊗ⁿ ─ Uf ─ QFT† ─ Measure
|0⟩⊗ᵐ ─ ─ ─ ─
Key Steps
- Create superposition: Σₓ|x⟩|0⟩
- Apply modular exponentiation: Σₓ|x⟩|aˣ mod N⟩
- Apply inverse QFT to first register
- Measure to extract period information
Complexity
- Classical: Sub-exponential but still hard for large N
- Quantum: Polynomial time O((log N)³)
- Practical impact: Breaks RSA if large quantum computers built
2.4 Quantum Entanglement and Teleportation
Entanglement and Bell States
Definition of Entanglement
- Quantum correlation that cannot be explained classically
- Composite system state cannot be written as product: |ψ⟩ ≠ |ψ₁⟩ ⊗ |ψ₂⟩
- Non-local phenomenon: Measurement on one part affects other instantaneously
Bell States (EPR Pairs)
|Φ⁺⟩ = (|00⟩ + |11⟩)/√2 (Most common)
|Φ⁻⟩ = (|00⟩ - |11⟩)/√2
|Ψ⁺⟩ = (|01⟩ + |10⟩)/√2
|Ψ⁻⟩ = (|01⟩ - |10⟩)/√2
Properties of Bell States
- Maximally entangled: Cannot be written as product states
- Orthonormal basis for two-qubit systems
- Symmetric under particle exchange (except for signs)
- Perfect correlations: Measuring one determines the other
Creating Bell States
Circuit for |Φ⁺⟩:
|0⟩ ─ H ─ ●─
|0⟩ ─ ─ ⊕─
Entanglement Measures
- Concurrence: C(ρ) ∈ [0,1], C = 1 for maximally entangled states
- Entanglement entropy: S(ρₐ) = -Tr(ρₐ log ρₐ)
- Negativity: Based on partial transpose operation
Quantum Teleportation Protocol
Scenario
- Alice has unknown qubit |ψ⟩ = α|0⟩ + β|1⟩
- Alice and Bob share entangled pair (|00⟩ + |11⟩)/√2
- Goal: Transfer |ψ⟩ to Bob without sending the qubit directly
Protocol Steps
- Initial state: |ψ⟩ₐ ⊗ (|00⟩ + |11⟩)ₐᵦ/√2
- Alice's Bell measurement:
- Apply CNOT and Hadamard to Alice's qubits
- Measure both Alice's qubits in computational basis
- Four possible outcomes: 00, 01, 10, 11
- Classical communication:
- Alice sends 2-bit measurement result to Bob
- Bob's correction:
- Based on Alice's result, Bob applies:
- 00: Do nothing (I)
- 01: Apply X gate
- 10: Apply Z gate
- 11: Apply XZ gates
Result: Bob's qubit is now in state |ψ⟩
Key Properties
- No cloning: Alice's original qubit is destroyed
- Classical communication required: Not faster than light
- Perfect fidelity: Exact state transfer (in principle)
- Requires pre-shared entanglement
Applications
- Quantum communication networks
- Quantum computing architectures
- Quantum error correction
Superdense Coding
Scenario
- Alice and Bob share Bell pair (|00⟩ + |11⟩)/√2
- Alice wants to send 2 classical bits using 1 qubit
Protocol
- Encoding: Alice applies operation based on 2-bit message:
- 00: Apply I → |Φ⁺⟩
- 01: Apply X → |Ψ⁺⟩
- 10: Apply Z → |Φ⁻⟩
- 11: Apply XZ → |Ψ⁻⟩
- Transmission: Alice sends her qubit to Bob
- Decoding: Bob performs Bell measurement on both qubits
- Measurement result directly gives Alice's 2-bit message
Information Capacity
- Classical: 1 qubit carries 1 bit of information
- Quantum (with entanglement): 1 qubit carries 2 bits
- Demonstrates utility of quantum correlations
2.5 Quantum Error Correction and Noise
Sources of Noise in Quantum Systems
Decoherence Mechanisms
Phase Decoherence (T₂ process)
- Caused by fluctuating magnetic/electric fields
- Destroys phase relationships between superposition components
- Preserves populations but destroys coherence
- Typical timescale: T₂ ~ 10⁻⁶ to 10⁻³ seconds
Amplitude Damping (T₁ process)
- Energy dissipation to environment
- |1⟩ → |0⟩ transitions (spontaneous emission)
- Changes both populations and coherences
- Typical timescale: T₁ ~ 10⁻⁵ to 10⁻² seconds
Environmental Noise Sources
- Thermal fluctuations: kᵦT >> ℏω for classical limit
- Electromagnetic field fluctuations
- Vibrations and mechanical instabilities
- Charge noise in semiconductor devices
- Magnetic field fluctuations
Gate Errors
- Over/under rotation: Imperfect pulse calibration
- Cross-talk: Unwanted interactions between qubits
- Leakage: Transitions to non-computational levels
- Control field noise: Amplitude and phase fluctuations
Quantum Error Correction Basics
Why Quantum Error Correction is Hard
- No-cloning theorem: Cannot copy quantum states for redundancy
- Measurement destroys superposition
- Errors are continuous, not discrete
- Need to correct both bit-flip and phase-flip errors simultaneously
Three-Qubit Bit-Flip Code
Encoding: |0⟩ → |000⟩, |1⟩ → |111⟩
Error model: Each qubit has probability p of bit-flip
Syndrome detection:
- Measure M₁ = Z₁Z₂, M₂ = Z₂Z₃
- Syndrome (s₁,s₂) indicates error location:
- (0,0): No error
- (1,1): Error on qubit 1
- (1,0): Error on qubit 2
- (0,1): Error on qubit 3
Correction: Apply X gate to identified error qubit
Performance: Corrects single bit-flip errors, fails for two or more errors
Three-Qubit Phase-Flip Code
Encoding: |+⟩ → |+++⟩, |-⟩ → |---⟩
Error detection: Similar to bit-flip but measure X₁X₂, X₂X₃
Correction: Apply Z gate to identified error qubit
Shor's Nine-Qubit Code
Motivation: Need to correct both bit-flip and phase-flip errors
Construction: Concatenated encoding
- Encode each qubit using 3-qubit phase-flip code: |0⟩ → |+++⟩, |1⟩ → |---⟩
- Encode each of these using 3-qubit bit-flip code
Logical codewords:
|0̄⟩ = (|000⟩ + |111⟩)⊗³/2^(3/2)
|1̄⟩ = (|000⟩ - |111⟩)⊗³/2^(3/2)
Error correction: Can correct any single-qubit error (bit-flip, phase-flip, or both)
Fault Tolerance and NISQ Model
Fault-Tolerant Quantum Computing
Threshold theorem: If physical error rate < threshold (~10⁻⁴), then arbitrarily long quantum computations possible with polynomial overhead
Requirements for fault tolerance:
- Error rates below threshold
- Universal set of fault-tolerant gates
- Fault-tolerant error correction
- Efficient classical processing
Surface Code
- Leading candidate for fault-tolerant QEC
- 2D lattice of qubits with local interactions
- Distance-d code uses ~d² physical qubits
- Logical error rate: (p/p_th)^((d+1)/2) where p is physical error rate
NISQ (Noisy Intermediate-Scale Quantum) Era
Characteristics:
- 50-1000 qubits
- Limited coherence times
- No full error correction
- Approximate quantum computing
NISQ Applications:
- Variational Quantum Eigensolvers (VQE)
- Quantum Approximate Optimization Algorithm (QAOA)
- Quantum machine learning
- Near-term quantum simulation
Error Mitigation Techniques:
- Zero-noise extrapolation
- Probabilistic error cancellation
- Symmetry verification
- Virtual distillation
2.6 Quantum Programming and Tools
Qiskit Framework
Installation and Setup
python
pip install qiskit
from qiskit import QuantumCircuit, QuantumRegister, ClassicalRegister
from qiskit import Aer, execute
from qiskit.visualization import plot_histogram
Basic Circuit Construction
python
# Create quantum circuit
qc = QuantumCircuit(2, 2) # 2 qubits, 2 classical bits
# Add gates
qc.h(0) # Hadamard on qubit 0
qc.cx(0, 1) # CNOT with control=0, target=1
qc.measure_all() # Measure all qubits
# Display circuit
print(qc)
qc.draw('mpl') # Matplotlib visualization
Quantum Registers and Advanced Circuits
python
# Separate quantum and classical registers
qreg = QuantumRegister(3, 'q')
creg = ClassicalRegister(3, 'c')
qc = QuantumCircuit(qreg, creg)
# Parameterized circuits
from qiskit.circuit import Parameter
theta = Parameter('θ')
qc.ry(theta, 0)
Simulating Quantum Circuits
Local Simulators
python
# Statevector simulator
backend = Aer.get_backend('statevector_simulator')
job = execute(qc, backend)
result = job.result()
statevector = result.get_statevector()
# QASM simulator (shot-based)
backend = Aer.get_backend('qasm_simulator')
job = execute(qc, backend, shots=1024)
result = job.result()
counts = result.get_counts()
plot_histogram(counts)
Noise Simulation
python
from qiskit.providers.aer.noise import NoiseModel, depolarizing_error
# Create noise model
noise_model = NoiseModel()
error_1q = depolarizing_error(0.001, 1) # 1-qubit error
error_2q = depolarizing_error(0.01, 2) # 2-qubit error
noise_model.add_all_qubit_quantum_error(error_1q, ['h', 'x', 'y', 'z'])
noise_model.add_all_qubit_quantum_error(error_2q, ['cx'])
# Run with noise
job = execute(qc, backend, noise_model=noise_model, shots=1024)
Running on IBM Quantum Platforms
Account Setup
python
from qiskit import IBMQ
IBMQ.save_account('YOUR_API_TOKEN')
IBMQ.load_account()
provider = IBMQ.get_provider(hub='ibm-q')
Backend Selection
python
# List available backends
backends = provider.backends()
print([backend.name() for backend in backends])
# Get backend properties
backend = provider.get_backend('ibmq_manila')
print(backend.configuration())
print(backend.properties())
# Check queue
print(backend.status())
Job Submission and Monitoring
python
# Submit job
job = execute(qc, backend, shots=1024)
print(f"Job ID: {job.job_id()}")
# Monitor job status
from qiskit.tools.monitor import job_monitor
job_monitor(job)
# Get results
result = job.result()
counts = result.get_counts()
3. Research-Specific Topics
3.1 Quantum Dots
What are Quantum Dots? Physical Principles
Definition and Basic Properties
Quantum dots are nanoscale semiconductor structures that confine electrons and holes in all three spatial dimensions, creating discrete energy levels similar to atoms. They are often called "artificial atoms" due to this quantized behavior.
Size Regime
- Typical dimensions: 1-100 nanometers
- Contains ~100-100,000 atoms
- Size comparable to electron wavelength (λ ~ h/p ~ 10-50 nm)
Material Systems
- Group IV: Silicon, germanium quantum dots
- III-V compounds: GaAs/AlGaAs, InAs/GaAs, InP/InGaP
- II-VI compounds: CdSe/ZnS, CdTe/CdSe
- Colloidal dots: Solution-processed nanocrystals
- Graphene quantum dots: Carbon-based 2D structures
Quantum Confinement and Energy Levels
Physical Origin of Confinement
When charge carriers (electrons/holes) are confined to dimensions smaller than their de Broglie wavelength, quantum effects dominate:
de Broglie wavelength: λ = h/p = h/√(2mE)
For electrons in semiconductors: λ ~ 10-50 nm at room temperature
Mathematical Description
1D Infinite Square Well Model
For a particle in a box of length L:
- Energy levels: Eₙ = n²π²ℏ²/(2mL²)
- Wavefunctions: ψₙ(x) = √(2/L) sin(nπx/L)
- Energy spacing: ΔE ∝ 1/L²
3D Spherical Quantum Dot
For a spherical dot of radius R:
- Energy levels: Eₙₗ = α²ₙₗℏ²/(2mR²)
- Ground state: E₁₀ = π²ℏ²/(2mR²)
- Degeneracy depends on angular momentum quantum numbers
Effective Mass Approximation
In semiconductors, use effective masses:
- Electron: mₑ* (typically 0.01-0.1 × free electron mass)
- Hole: mₕ