Fast Quantum Algorithms for Hard Optimization Problems

This project aims to develop quantum computing algorithms that solve hard optimization problems faster than classical algorithms on traditional hardware. Under standard assumptions, classical methods typically require exponential time to solve such problems. The project will investigate which hard optimization problems can theoretically overcome these exponential lower bounds. The novel methods developed for this purpose will then be implemented and experimentally evaluated.