This project explores two foundational components of quantum computation: quantum search and quantum error correction, implemented through a 4×4 Sudoku solver using Grover’s algorithm and a full simulation of the 5-qubit quantum error-correcting code. In the Sudoku project, each cell is encoded with two qubits, and Grover’s amplitude-amplification framework is used to phase-mark valid grid configurations satisfying all row, column, and box constraints. The QEC project implements the stabilizer code, encoding arbitrary logical states, injecting random Pauli noise, extracting 4-bit syndromes, and applying controlled recovery to study logical fidelity as a function of the physical error rate. Together, these two projects demonstrate practical and end-to-end realizations of quantum search, providing a strong foundation for future work.

Project 1: https://github.com/stinson-l/Grover-Algorithm-4-x-4-Soduku
Project 2: https://github.com/stinson-l/Five-Qubit_Quantum_Error