P6: Novel quantum algorithms via classical cryptography

Members: Prof. Dr. Jens Eisert (FU Berlin), Prof. Dr. Jean-Pierre Seifert (TU Berlin)

There exists a significant gap in the current research landscape between theoretical advancements in quantum computing and their practical applications. While much of the theoretical work has demonstrated the potential for quantum advantages, these insights often remain abstract and disconnected from real-world problems. These issues will be comprehensively tackled in WP 1 and WP 2. Along the way, substantial quantum software will be developed.

Our project proposal aims to bridge this gap by making quantum advantages more accessible and directly relevant to practical applications – by bringing ideas of cryptography and quantum computing together.

Specifically, we seek to identify the underlying structures and characteristics of specific problem instances that enable quantum advantages, providing a clearer and more explicit understanding of when and why quantum methods outperform classical approaches. By focusing on the explicit identification of these key structures, our goal is not only to uncover which ingredients contribute to the quantum speedup but also to develop strategies for leveraging these insights in practical settings. Ultimately, this research will help to refine our understanding of quantum computing’s potential, guiding the development of more efficient quantum algorithms and facilitating their deployment in real-world applications.