Recherche

Afficher tous les résultats pour

Accueil

Personne

Mathias Soeken

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (81)

LUT-Based Hierarchical Reversible Logic Synthesis

Giovanni De Micheli, Mathias Soeken

We present a synthesis framework to map logic networks into quantum circuits for quantum computing. The synthesis framework is based on lookup-table (urn networks, which play a key role in conventional logic synthesis. Establishing a connection between LUT ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019

Structural Rewriting in XOR-Majority Graphs

Giovanni De Micheli, Mathias Soeken, Zhufei Chu

In this paper, we present a structural rewriting method for a recently proposed XOR-Majority graph (XMG), which has exclusive-OR (XOR), majority-of-three (MAJ), and inverters as primitives. XMGs are an extension of Majority-Inverter Graphs (MIGs). Previous ...

ASSOC COMPUTING MACHINERY2019

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

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

We present a constructive method to create quantum circuits that implement oracles vertical bar x vertical bar y |0 (k) -> vertical bar x vertical bar y circle plus f(x)vertical bar 0 (k) for n-variable Boolean functions f with low T-count. In our method f ...

IEEE2019

Compiling Permutations for Superconducting QPUs

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes, Fereshte Mozafari Ghoraba

In this paper we consider the compilation of quantum state permutations into quantum gates for physical quantum computers. A sequence of generic single-target gates, which realize the input permutation, are extracted using a decomposition based reversible ...

IEEE2019

Scalable Generic Logic Synthesis: One Approach to Rule Them All

Giovanni De Michele, Luca Gaetano Amarù, Winston Jason Haaswijk, Eleonora Testa, Mathias Soeken, Heinz Riener

ACM2019

Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa, Mathias Soeken

Reducing the number of AND gates plays a central role in many cryptography and security applications. We propose a logic synthesis algorithm and tool to minimize the number of AND gates in a logic network composed of AND, XOR, and inverter gates. Our appro ...

ASSOC COMPUTING MACHINERY2019

Scaling-up ESOP Synthesis for Quantum Compilation

Giovanni De Micheli, Mathias Soeken, Bruno Schmitt Antunes

Today's rapid advances in quantum computing hardware call for scalable synthesis methods to map combinational logic represented as multi-level Boolean networks (e.g., an and inverter graph, AIG) to quantum circuits. Such synthesis process must yield revers ...

IEEE2019

Reversible Pebbling Game for Quantum Memory Management

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

Quantum memory management is becoming a pressing problem, especially given the recent research effort to develop new and more complex quantum algorithms. The only existing automatic method for quantum states clean-up relies on the availability of many extr ...

IEEE2019

Exact Synthesis of Boolean Functions in Majority-of-five Forms

Giovanni De Micheli, Winston Jason Haaswijk, Mathias Soeken, Zhufei Chu

Recent studies show that majority-based logic synthesis is beneficial for both traditional and nanotechnology digital designs. However, most of the existing synthesis algorithms for majority logic generate majority-of-three (M-3) networks. The optimization ...

IEEE2019

Resource constrained oracle synthesis for quantum circuits

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

2019

ROS : Resource Constrained Oracle Synthesis for Quantum Computers

Giovanni De Micheli, Giulia Meuli, Mathias Soeken

We present a complete automatic synthesis framework for oracle functions—a central part in many quantum algorithms. The proposed framework for resource-constrained oracle synthesis (ROS) is an LUT-based hierarchical method where every step is specifically ...

2019

Evaluation Of Crystal Structures With Partial Occupancies Using Boolean Satisfiability Techniques In Struplox

Mathias Soeken

INT UNION CRYSTALLOGRAPHY2019

Reversible Pebble Games For Reducing Qubits In Hierarchical Quantum Circuit Synthesis

Giovanni De Micheli, Anupam Chattopadhyay, Mathias Soeken, Debjyoti Bhattacharjee

Hierarchical reversible logic synthesis can find quantum circuits for large combinational functions. The price for a better scalability compared to functional synthesis approaches is the requirement for many additional qubits to store temporary results of ...

IEEE2019

The Complexity of Self-Dual Monotone 7-Input Functions

Giovanni De Micheli, Winston Jason Haaswijk, Eleonora Testa, Mathias Soeken

The study of the complexity of Boolean functions has recently found applications in logic synthesis and optimization algorithms, as for instance in logic rewriting. Previous works have focused on the minimum length of Boolean chains for functions up to 5 i ...

2019

Mapping Monotone Boolean Functions into Majority

Giovanni De Micheli, Luca Gaetano Amarù, Winston Jason Haaswijk, Eleonora Testa, Mathias Soeken

We consider the problem of decomposing monotone Boolean functions into majority-of-three operations, with a particular focus on decomposing the majority-n function. When targeting monotone Boolean functions, Shannon's expansion can be expressed by a single ...

2018

Logic Synthesis for Established and Emerging Computing

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa, Mathias Soeken

Logic synthesis is an enabling technology to realize integrated computing systems, and it entails solving computationally intractable problems through a plurality of heuristic techniques. A recent push toward further formalization of synthesis problems has ...

2018

Practical Exact Synthesis

Giovanni De Micheli, Luca Gaetano Amarù, Winston Jason Haaswijk, Eleonora Testa, Mathias Soeken

In this paper, we discuss recent advances in exact synthesis, considering both their efficient implementation and various applications in which they can he employed. We emphasize on solving exact synthesis through Boolean satisfiability (SAT) encodings. Di ...

IEEE2018

Logic Synthesis for RRAM-Based In-Memory Computing

Pierre-Emmanuel Julien Marc Gaillardon, Mathias Soeken

2018

Size Optimization of MIGs with an Application to QCA and STMG Technologies

Giovanni De Micheli, Luca Gaetano Amarù, Eleonora Testa, Mathias Soeken, Heinz Riener

Majority-inverter graphs (MIGs) are a logic representation with remarkable algebraic and Boolean properties that enable efficient logic optimizations beyond the capabilities of traditional logic representations. Further, since many nano-emerging technologi ...

ASSOC COMPUTING MACHINERY2018

The complexity of error metrics

Mathias Soeken

Approximate computing exploits the fact that many applications do not require the results to be exact but not to exceed a threshold in a given error metric. Algorithms in approximate computing require to compute the error of the approximation in order to m ...

ELSEVIER SCIENCE BV2018

Page 2 sur 5