Let $\{0,1\}^n$ be the set of all binary bitstrings of length $n$. Suppose that one is given a black-box oracle function $f(x):\{0,1\}^n\rightarrow\{0,1\}^{n-1}$ with ...

This repository contains the code for my final project in quantum computing. The project focuses on implementing Simon's Algorithm, a quantum algorithm that solves Simon's problem exponentially faster ...