We significantly reduce the cost of factoring integers and computing discrete logarithms in
finite fields on a quantum computer by combining techniques from Shor 1994, Griffiths-Niu …

The quantum computer has been claimed to show more quantum advantage than the
classical computer in solving some specific problems. Many companies and research …

With quantum computers of significant size now on the horizon, we should understand how
to best exploit their initially limited abilities. To this end, we aim to identify a practical problem …

Implementing a gate-based quantum algorithm on an noisy intermediate scale quantum
(NISQ) device has several challenges that arise from the fact that such devices are noisy …

Reversible adders are essential circuits in quantum computing systems. They are a
fundamental part of the algorithms implemented for such systems, where Shor's celebrated …

Encouraged by growing computing power and algorithmic development, machine learning
technologies have become powerful tools for a wide variety of application areas, spanning …

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 …

In the race to build scalable quantum computers, minimizing the resource consumption of
their full stack to achieve a target performance becomes crucial. It mandates a synergy of …

Performance of cryptanalytic quantum search algorithms is mainly inferred from query
complexity which hides overhead induced by an implementation. To shed light on …

This paper examines the asymptotic performance of multiplication and the cost of quantum
implementation for the Naive schoolbook, Karatsuba, and Toom-Cook methods in the …