# Overview

Here is an overview of paths through the quantum computing section.

Anything which is extra credit should be skipped until the end. Nothing cumulatively builds on these and so to reach the plateau of this assignment and to maximize points you should leave them until the end!

## Shor's Algorithm

Week 1: Build a quantum computing simulator

Week 2: Master Phase Estimation

Week 3: Shor's Algorithm

## Universality

We have heard that you can build any unitary matrix $U$ from H,P, CNOT. Work through here how this works:

## Other Extensions

None of these are written yet but with a little googling you could do them.

• Quantum Algorithms:
• Use your quantum simulator to simulate and learn about Grover's Algorithm
• Use your quantum simulator to simulate Quantum Counting
• Use your quantum simulator to do time-evolutiomn of quantum systems and use phase estimation to find their ground states.
• Spins
• A single spin in a magnetic field
• Two spins in a magnetic field
• Two spins with a Heisenberg coupling between them
• Hopping Electrons
• A tight binding model
• Quantum Chemistry
• Hamiltonian Simulation: There are a huge number of works on simulating Hamiltonians.
• Trotter breakup
• Graph Color Breakup
• Fractionalized excitations
• Quantum Variational Approaches
• How powerful are quantum computers?
• (Subsets of ) quantum computers are weak. Write a classical simulator which simulates
• Circuits which stay low in entanglement
• Circuits with no two-qubit gates
• Circuits with low entanglement
• $H^n$ plus CNOT and phase gates and toffelli
• Stabilizer circuits
• Match Gates
• Quantum computers are not too powerful (i.e. BQP in PSPACE)
• Entanglement, Causality, and reduced density matrices
• Adiabatic Quantum Computing for optimization and state preparation
• Quantum Protocols:
• Quantum Key Distribution
• Teleportation
• Quantum Error Correction