Quantum computing leverages superposition and entanglement to solve specific complex computational problems faster than classical computing systems. This project demonstrated the practical application of quantum algorithms by using Grover’s Search Algorithm to solve a Minesweeper logic puzzle. Grover’s algorithm provides a quadratic speedup over classical searches for unstructured data. Using Qiskit in a Google Colab environment, a game board was mapped to a multi-qubit circuit featuring a custom phase-inverting operation and a diffuser. Running the algorithm on simulated environments and cloud-accessible IBM Quantum hardware successfully identified the hidden mine locations. Through probabilistic amplification, the quantum circuit identified the solution states without the exhaustive iteration required classically. In addition to technical results, I will present my personal experience navigating this research fellowship—moving from foundational readings to formulating and executing real quantum code to solve an actual problem. I will reflect on the technical hurdles overcome, the profound shift in my systemic thinking, the core lessons learned, and my overall personal growth throughout this project. This work was supported by the Research Experiences for High School Students (REHSS) program under the NSF SPARK-ND grant at Minot State University, highlighting how high school students can successfully engage in university-level quantum science.