Logic Synthesis for Quantum Computing

Mathias Soeken, Martin Roetteler, Nathan Wiebe +1

Self-Inverse Functions and Palindromic Circuits

Mathias Soeken, Michael Kirkedal Thomsen, Gerhard W. Dueck +1

Ancilla-free synthesis of large reversible functions using binary decision diagrams

Mathias Soeken, Laura Tague, Gerhard W. Dueck +1

Quantum circuits for floating-point arithmetic

Thomas Häner, Mathias Soeken, Martin Roetteler +1

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Giulia Meuli, Mathias Soeken, Earl Campbell +2

The paper proposes a constructive method to synthesize quantum oracle circuits for Boolean functions with low T-count by leveraging the multiplicative complexity of the function an…

Programming Quantum Computers Using Design Automation

Mathias Soeken, Thomas Häner, Martin Roetteler

Reversible Pebbling Game for Quantum Memory Management

Giulia Meuli, Mathias Soeken, Martin Roetteler +2

Embedding of Large Boolean Functions for Reversible Logic

Mathias Soeken, Robert Wille, Oliver Keszocze +2

Translating between the roots of the identity in quantum computers

Wouter Castryck, Jeroen Demeyer, Alexis De Vos +2

On quantum circuits employing roots of the Pauli matrices

Mathias Soeken, D. Michael Miller, Rolf Drechsler

Design Automation and Design Space Exploration for Quantum Computers

Mathias Soeken, Martin Roetteler, Nathan Wiebe +1

A framework for reversible circuit complexity

Mathias Soeken, Nabila Abdessaied, Rolf Drechsler