Pattern recognition for quantum algorithms
Context: Software for gate-based quantum computers is comparable to early classical software from the 1960s. Circuits are designed close to hardware and for specific problem instances. Modern software engineering concepts such as patterns are hardly known.
Goal: The aim of this work is to evaluate the first proposals of patterns for quantum computers. The insights gained could be used in follow-up work for automated pattern recognition and creation of a taxonomy of quantum algorithms. For this purpose, a number of quantum algorithms (e.g., using the Grover or the Shor algorithm) are to be analyzed and, if necessary, implemented. Recurring elements in the algorithm should be identified using a provided pattern catalog.
Requirements: Python (optional)
Helpful Knowledge: Quantum Computing