activity
20132024
most citedAssessing requirements to scale to practical quantum advantage

67 citations · 203 across the 22 of their papers we have counts for

collaborators
Showing cs.ETShow all

5 papers · 1 filter

cs.ET2020

ROS: Resource-constrained Oracle Synthesis for Quantum Computers

Giulia Meuli, Mathias Soeken, Martin Roetteler +1

We present a completely automatic synthesis framework for oracle functions, a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthe…

cs.ET2015★ 1 cited

Self-Inverse Functions and Palindromic Circuits

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

We investigate the subclass of reversible functions that are self-inverse and relate them to reversible circuits that are equal to their reverse circuit, which are called palindrom…

cs.ET2014★ 4 cited

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

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

The synthesis of reversible functions has been an intensively studied research area in the last decade. Since almost all proposed approaches rely on representations of exponential…

cs.ET2014★ 3 cited

Embedding of Large Boolean Functions for Reversible Logic

Mathias Soeken, Robert Wille, Oliver Keszocze +2

Reversible logic represents the basis for many emerging technologies and has recently been intensively studied. However, most of the Boolean functions of practical interest are irr…

cs.ET2014★ 7 cited

A framework for reversible circuit complexity

Mathias Soeken, Nabila Abdessaied, Rolf Drechsler

Reversible single-target gates are a generalization of Toffoli gates which are a helpful formal representation for the description of synthesis algorithms but are too general for a…