Quantum computing is regarded as a promising paradigm that may overcome the current
computational power bottlenecks in the post-Moore era. The increasing maturity of quantum …

Existing quantum compilers optimize quantum circuits by applying circuit transformations
designed by experts. This approach requires significant manual effort to design and …

Near-term quantum computers are expected to work in an environment where each
operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied …

Optimizing quantum circuits is challenging due to the very large search space of functionally
equivalent circuits and the necessity of applying transformations that temporarily decrease …

In order to characterize and benchmark computational hardware, software, and algorithms, it
is essential to have many problem instances on-hand. This is no less true for quantum …

Quantum programs exhibit inherent non-deterministic behavior, which poses more
significant challenges for error discovery compared to classical programs. While several …

This paper presents the Pauli-based Circuit Optimization, Analysis, and Synthesis Toolchain
(PCOAST), a framework for quantum circuit optimizations based on the commutative …

Quantum algorithms and simulations often require the preparation of complex states through
sequences of 2-qubit gates. For a generic quantum state, the number of required gates …

Optimizing quantum circuits is critical for enhancing computational speed and mitigating
errors caused by quantum noise. Effective optimization must be achieved without …

The formulation of quantum programs in terms of the fewest number of gate operations is
crucial to retrieve meaningful results from the noisy quantum processors accessible these …