Reversible logic circuits have been historically motivated by theoretical research in low-
power electronics as well as practical improvement of bit manipulation transforms in …

The use of kernel functions is a common technique to extract important features from
datasets. A quantum computer can be used to estimate kernel entries as transition …

In recent decades, the field of quantum computing has experienced remarkable progress.
This progress is marked by the superior performance of many quantum algorithms …

Most work in quantum circuit optimization has been performed in isolation from the results of
quantum fault-tolerance. Here we present a polynomial-time algorithm for optimizing …

The quantum Fourier transform offers an interesting way to perform arithmetic operations on
a quantum computer. We review existing quantum Fourier transform adders and multipliers …

We determine the cost of performing Shor's algorithm for integer factorization on a ternary
quantum computer, using two natural models of universal fault-tolerant computing:(i) a …

Quantum circuits of many qubits are extremely difficult to realize; thus, the number of qubits
is an important metric in a quantum circuit design. Further, scalable and reliable quantum …

Shor's factoring algorithm is one of the most anticipated applications of quantum computing.
However, the limited capabilities of today's quantum computers only permit a study of Shor's …

Current quantum computer designs will not scale. To scale beyond small prototypes,
quantum architectures will likely adopt a modular approach with clusters of tightly connected …

In this paper, we study the close relationship between Reed-Muller codes and single-qubit
phase gates from the perspective of T-count optimization. We prove that minimizing the …