Lower Bounds for Quantum Algorithms on Independent Set and Subgraph Isomorphism

This project is a basic explanation of the paper Quantum Algorithms and Lower Bounds for Independent Set and Subgraph Isomorphism Problem by S. Dorn in my own words, elaborating on and explaining points that were glossed over in the original paper. The algorithms have been kept intact, the proof of lower bounds have also not been fundamentally changed. The purpose of this paper is to give the lower bounds for computing graph problems, mainly independent set and subgraph isomorphism.