top of page

Your certificate is now private

CertificateBackground.png

Certificate of Completion

ErdosHorizontal.png

THIS ACKNOWLEDGES THAT

HAS COMPLETED THE FALL 2026 QUANTUM COMPUTING BOOT CAMP

Ben Clark

Roman Holowinsky, PhD

November 15, 2026

DIRECTOR

DATE

clear.png

TEAM

Ben Clark

Ben Clark

clear.png

Project 1: Used Grover's algorithm to solve sudoku for an N^2 x N^2 sudoku board. The method was successful (although there are some quirks that need to be worked out with the 9x9 board due to encoding oddities), but -- especially for large sudoku boards -- the algorithm can only handle a few empty cells. This is because more ancilla qubits are required to build the oracle to check where the valid solution is. However, in the future, if more fault-tolerant qubits are available on a quantum computer, this method may well beat out traditional backtracking approaches in algorithmic complexity.
https://github.com/BenRClark/Grover_Sudoku

Project 2: Use block encoding and QSVT to invert a matrix with high condition number. We are particularly looking at the case of using matrix inversions as a filter to block out jamming signals while maintaining the ability to accurately read an intended signal. The method was successful, but its complexity far exceeds classical computers for any jammer of considerable strength. The project was interesting, but until we have miniaturized quantum computers that could have about 60 fault-tolerant qubits, then the classical methods will continue to be better.
https://github.com/BenRClark/Quantum_MVDR

Screen Shot 2022-06-03 at 11.31.35 AM.png
github URL

©2017-2026 by The Erdős Institute.

bottom of page