F Mozafari, H Riener, M Soeken… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
As each quantum algorithm requires a specific initial quantum state, quantum state preparation is an important task in quantum computing. The preparation of quantum states is …
H Riener - 2019 Forum for Specification and Design …, 2019 - ieeexplore.ieee.org
We present an exact approach to synthesize temporal-logic formulas in linear temporal logic (LTL) from a set of given positive and negative example traces. Our approach uses topology …
Quantum compilation is the task of translating a quantum algorithm implemented in a high- level quantum programming language into a technology-dependent instructions flow for a …
We propose a new three-level XOR-AND-XOR form for autosymmetric functions, called XORAX expression. In general, a Boolean function over variables is-autosymmetric if it can …
Exclusive-OR Sum-of-Products expressions (ESOPs) are vital for circuit synthesis of arithmetic functions and emerging technologies. The state-of-the-art ESOP extraction …
T Häner, M Soeken - arXiv preprint arXiv:2006.03845, 2020 - arxiv.org
The multiplicative depth of a logic network over the gate basis $\{\land,\oplus,\neg\} $ is the largest number of $\land $ gates on any path from a primary input to a primary output in the …
B Schmitt, G De Micheli - 2022 Design, Automation & Test in …, 2022 - ieeexplore.ieee.org
This work presents tweedledum-an extensible open-source library aiming at narrowing the gap between high-level algorithms and physical devices by enhancing the expressive …
Logic synthesis is a critical step in the Electronic Design Automation (EDA). Traditional global heuristic-based logic synthesis has many challenges as computing power keeps …