We present an exact synthesis approach for computing Exclusive-or Sum-of-Products
(ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our …

Exclusive-or sum-of-products (ESOP) expressions are used as intermediate representations
in quantum circuit synthesis flows, and their complexity impacts the number of gates of the …

With more and more powerful quantum computers becoming available, there is an
increasing interest in the efficient mapping of a given quantum circuit to a particular quantum …

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 …

Current noisy intermediate-scale quantum (NISQ) devices can only execute small circuits
with shallow depth, as they are still constrained by the presence of noise: quantum gates …

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 …

Most quantum algorithms assume some specific initial state in superposition of basis states
before performing the desired application-specific computations. The preparation of such …

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 …

We propose a flow for automated quantum compilation. Our flow takes a Boolean function
implemented in Python as input and translates it into a format appropriate for reversible logic …

In order to make the most of the increasing computational power of recently developed
quantum computers, it is crucial to perform an efficient mapping of a given quantum circuit …