Funktionen

Print[PRINT]
.  Home  .  Lehre  .  Studentische Arbeiten  .  Bachelorarbeiten  .  Ausschreibung

Quantum Circuit Synthesis – Evaluating Methods for Reversible Logic Functions in their Suitability for Irreversible Logic Functions

Abstract

Quantum circuit synthesis is a key area of research as quantum computing transitions from theory to practical application. This thesis explores methods for the synthesis of quantum circuits from Boolean functions, with a primary focus on understanding how techniques developed for reversible Boolean functions (e.g., permutations) can be adapted for irreversible ones. Identifying methods that have the potential to be used in an automated and standardized way that require as little manual interventions as possible is thus an important task to which this thesis aims to contribute to. Automating the translation process is crucial not only for scalability and efficiency but also for minimizing errors, ensuring consistency, enabling hardware adaptability, and facilitating optimization, all of which are essential for advancing industrial applications and research in quantum computing.
This thesis conducts a review of existing methods for quantum circuit synthesis, analyzing and comparing them based on metrics such as gate count, circuit depth, and ease of automation. As a starting point, transformation-based approaches such as the MMD algorithm, named after its authors (Miller, Maslov and Dueck) and known for its influence and simplicity, will be studied. Its foundational role in the literature and subsequent advancements make it a valuable case study. Additionally, methods that are already used in automated contexts for other applications such as optimization or general problem-solving could be of particular interest. Building on methods incorporating techniques successfully used in other applications ensures practicality and offers the advantage of knowledge gained from experience. Thus, methods leveraging established algorithms or automation processes—such as approaches using SAT solvers or sorting algorithms—will be analyzed for their adaptability and potential for generalization.
By reviewing and evaluating methods for quantum circuit synthesis this thesis aims to provide a clearer understanding of the strengths and limitations of current techniques and highlight potential starting points for future improvements. Ultimately, this work seeks to contribute to the broader goal of developing efficient, standardized, and automated frameworks for quantum circuit synthesis by examining how methods for reversible circuit synthesis can be adapted and used for irreversible circuit synthesis, which are essential for advancing practical quantum computing applications.

Aufgabensteller:
Prof. Dr. D. Kranzlmüller

Dauer der Arbeit:

  • Bachelorarbeiten: 3 Monate

Anzahl Bearbeiter: 1

Betreuer: