Optimization problems are ubiquitous in industrial contexts. In scheduling and routing, for example, one must ensure that a reasonable solution is found. While such problems are extremely important, they are also difficult and, in most cases, cannot be solved optimally. From the perspective of computational complexity, almost all these optimization problems are usually NP-complete, which means that classical computers cannot find the optimal solution in polynomial time. Therefore, some time ago quantum computers were suggested as a new way to tackle these highly important problems. While there is strong belief that even quantum computers cannot solve all instances in polynomial time either, there is evidence that they can approximate instances that are on the other side hard to solve on classical supercomputers. This workshop aims to explore the potential and limitations of quantum computers in addressing optimization problems.

Submit your abstract:

Please sign in to submit your abstract. Please note that signing in or submitting an abstract does not automatically register you for the event — conference registration will open in January 2026.

Please sign

Forgot your Password Reset

Enter security code (required)

Login

Remember Me

Don't have an account? Create an Account