Screenshot Developed at Qualcomm Institute to explore practical quantum advantage in combinatorial optimization. Encodes nonogram puzzles as Boolean satisfiability problems and solves them using both a classical brute-force solver and a Grover-based quantum solver that achieves a quadratic speedup over classical search. Features a browser-based UI with a canvas puzzle editor, real-time probability histograms, and side-by-side classical vs. quantum comparison. Validated on real IBM quantum hardware — a 2x2 puzzle achieved 32.3% correct-state probability versus 6.25% random chance. The codebase follows SOLID principles with a clean solver abstraction layer, and includes comprehensive tests covering Boolean encoding, solver correctness, and hardware integration.
