A key challenge in realizing fault-tolerant quantum computers is circuit optimization.
Focusing on the most expensive gates in fault-tolerant quantum computation (namely, the T …

Among the cost metrics characterizing a quantum circuit, the $ T $-count stands out as one
of the most crucial as its minimization is particularly important in various areas of quantum …

Quantum squaring operation is a useful building block in implementing quantum algorithms
such as linear regression, regularized least squares algorithm, order-finding algorithm …

Hamiltonian simulation represents an important module in a large class of quantum
algorithms and simulations such as quantum machine learning, quantum linear algebra …

In this paper, we introduce Qsyn, a novel quantum circuit synthesis (QCS) framework
designed to facilitate the research, development, testing, and experimentation of QCS …

We present an efficient algorithm to reduce the number of non-Clifford gates in quantum
circuits and the number of parametrized rotations in parametrized quantum circuits. The …

Quantum computing is finding promising applications in optimization, machine learning and
physics, leading to the development of various models for representing quantum …

We propose several methods for optimizing the number of qubits in a quantum circuit while
preserving the number of non-Clifford gates. One of our approaches consists in reversing, as …

Quantum square root operation is a useful building block in implementing important
quantum algorithms such as the Harrow–Hassidim–Lloyd (HHL) algorithm, algorithms in …

A Complete Bibliography of ACM Transactions on Quantum Computing (TQC) Page 1 A
Complete Bibliography of ACM Transactions on Quantum Computing (TQC) Nelson HF …