Mathias Soeken

From MaRDI portal
Person:491239

Available identifiers

zbMath Open soeken.mathiasDBLP20/3466WikidataQ102416100 ScholiaQ102416100MaRDI QIDQ491239

List of research outcomes





PublicationDate of PublicationType
An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions2024-01-23Paper
Improved quantum circuits for elliptic curve discrete logarithms2022-10-13Paper
https://portal.mardi4nfdi.de/entity/Q50206322022-01-06Paper
https://portal.mardi4nfdi.de/entity/Q50206332022-01-06Paper
Boolean satisfiability in quantum compilation2021-06-15Paper
A spectral algorithm for 3-valued function equivalence classification2021-01-15Paper
Mapping Monotone Boolean Functions into Majority2019-08-13Paper
The complexity of error metrics2018-10-19Paper
Pairs of majority-decomposing functions2018-10-19Paper
Quantum circuits for floating-point arithmetic2018-10-17Paper
SAT-based {CNOT, \(T\)} quantum circuit synthesis2018-10-17Paper
Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics2016-09-30Paper
Technology mapping for single target gate based circuits using Boolean functional decomposition2016-09-30Paper
Heuristic NPN classification for large functions using AIGs and LEXSAT2016-09-05Paper
A fast symbolic transformation based algorithm for reversible logic synthesis2016-08-10Paper
Enumeration of reversible functions and its application to circuit complexity2016-08-10Paper
Complexity of reversible circuits and their quantum implementations2016-02-18Paper
Property checking of quantum circuits using quantum multiple-valued decision diagrams2015-11-30Paper
Using \(\pi\)DDs in the design of reversible circuits2015-11-30Paper
Ancilla-free synthesis of large reversible functions using binary decision diagrams2015-08-24Paper
Translating between the roots of the identity in quantum computers2015-03-30Paper
Self-Inverse Functions and Palindromic Circuits2015-02-20Paper
Quantum circuit optimization by Hadamard gate reduction2014-09-02Paper
Mapping NCV Circuits to Optimized Clifford+T Circuits2014-09-02Paper
Upper bounds for reversible circuits based on Young subgroups2014-04-17Paper
Reducing the Depth of Quantum Circuits Using Additional Circuit Lines2013-12-17Paper
White dots do matter: rewriting reversible logic circuits2013-12-17Paper
Encoding OCL data types for SAT-based verification of UML/OCL models2011-07-07Paper

Research outcomes over time

This page was built for person: Mathias Soeken