The EPFL logic synthesis libraries

M Soeken, H Riener, W Haaswijk, E Testa… - arXiv preprint arXiv …, 2018 - arxiv.org
We present a collection of modular open source C++ libraries for the development of logic
synthesis applications. These libraries can be used to develop applications for the design of …

Efficient boolean methods for preparing uniform quantum states

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 …

[PDF][PDF] 基于布尔可满足性的精确逻辑综合综述

储著飞, 潘鸿洋 - 电子与信息学报, 2023 - jeit.ac.cn
逻辑综合是电子设计自动化(EDA) 的重要步骤, 随着算力逐渐提升和新的计算范式不断涌现,
传统基于全局启发式算法的逻辑综合面临新的挑战. 启发式算法面临的主要问题是得到一个次优 …

Exact synthesis of LTL properties from traces

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 …

Boolean satisfiability in quantum compilation

M Soeken, G Meuli, B Schmitt… - … of the Royal …, 2020 - royalsocietypublishing.org
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 …

Xor-and-xor logic forms for autosymmetric functions and applications to quantum computing

A Bernasconi, A Berti, V Ciriani… - … on Computer-Aided …, 2022 - ieeexplore.ieee.org
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 …

Don't-care aware ESOP extraction via reduced decomposition-tree exploration

CY Wei, JHR Jiang - 2023 60th ACM/IEEE Design Automation …, 2023 - ieeexplore.ieee.org
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 …

Lowering the T-depth of quantum circuits by reducing the multiplicative depth of logic networks

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 …

Tweedledum: a compiler companion for quantum computing

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 …

Survey on Exact Logic Synthesis Based on Boolean SATisfiability

Z CHU, H PAN - 电子与信息学报, 2023 - jeit.ac.cn
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 …