Unit1_Introduction to Quantum Computing
Unit1_Introduction to Quantum Computing
Introduction to Quantum
Computing
Insights into physical systems for energy production and advanced technologies.
3. Future of Technology:
Sample Problems:
1/6
1. Optimization Problem:
Suppose you are scheduling shifts for 100 employees while minimizing overlaps and
adhering to preferences. Classical methods may take hours or days; quantum
algorithms aim to solve such problems in minutes.
2. Simulating a Molecule:
Simulate the electronic structure of a complex molecule like FeMoco (important for
nitrogen fixation). Classical methods struggle; quantum methods scale efficiently.
2. Microsoft:
3. Rigetti Computing:
4. D-Wave:
5. Google:
6. Others:
2/6
IonQ: Focuses on trapped ion technology for high-precision qubits.
1980s:
1990s: Shor’s and Grover’s algorithms demonstrated the power of quantum computing.
3/6
Entanglement: Correlation between qubits where the state of one qubit depends on
another.
Multi-Qubit States:
1 0
Single-qubit basis: ∣0⟩ = [ ], ∣1⟩ = [ ].
0 1
Orthogonality:
⟨0∣1⟩ = 0
4/6
Hilbert Space: Complex vector space for quantum states.
0 1 0 −i 1 0
σx = [ ] , σy = [ ] , σz = [ ]
1 0 i 0 0 −1
ψ1 φ 1
ψ1 φ 2
∣ψ⟩ ⊗ ∣φ⟩ =
ψ2 φ 1
ψ2 φ 2
U †U = I
Projector: Projects state onto a subspace:
P = ∣ψ⟩⟨ψ∣
Outer Product:
∣ψ⟩⟨φ∣
A∣v⟩ = λ∣v⟩
5/6
1
2. Bloch Sphere Problem: Represent the state ∣ψ⟩ = (∣0⟩ + ∣1⟩) on the Bloch Sphere.
2
1 0
A=[ ]
0 −1
6/6