🧩 3-SAT with Grover's Algorithm
Watch Grover's search find the needle in the haystack — in about √N steps instead of N.
Opens a free Jupyter session on mybinder.org (via QuBins) — starting it can take a few minutes
git clone the repository, create the conda environment from environment.yml, and open 3sat.ipynb.Satisfiability — finding an assignment of true/false values that makes a logical formula true — is the classic example of a problem that is easy to check but, as far as anyone knows, hard to solve. This notebook takes a party guest-list puzzle and a small 3-SAT problem and solves them with Grover’s algorithm, the quantum search routine that finds a marked item among N possibilities in roughly √N steps instead of N.
You’ll see the problem encoded as a phase oracle, watch amplitude amplification concentrate probability on the solutions, and read the answer off a histogram. A small, clear example of a quantum algorithm that needs fewer oracle calls than trying every assignment — though real SAT solvers are much smarter than brute force.