Project 1: Sudoku Solver using Grover's search algorithm
This solves a 2^2 by 2^2 Sudoku using the Grover search algorithm. The code begins with the Sudoku, with some entries empty. It searches through possible solutions for each of 12 row/column/block, marking and then amplifying solutions that match the non-empty entries. The final solution matches all 12.

https://github.com/CatCan55/SudokuGrover

Project 2: Non-Boolean Quantum Amplitude Amplification example
This is a toy example of an adaptation by Prasanth Shyamsundar arXiv: 2102.04975 of Grover's algorithm. Instead of marking solutions to a search by flipping the sign on correct solutions e^{i x pi x 1} and preserving the sign on wrong solutions e^{i x pi x 0}, we allow e^{i x pi x x} for any x between 0 and 1, where x closer to 1 is amplified more than x closer to 0.

https://github.com/CatCan55/Non-Boolean-Quantum-Amplitude-Amplification

Thanks to Ákos, Cindy, Jeremiah, Ming-Wei, Gemini, Claude for guidance on these projects.