37 citations · 73 across the 4 of their papers we have counts for
4 papers
Quantum Circuits for GCD Computation with Depth and O(n) Ancillae
Mehdi Saeedi, Igor L. Markov
GCD computations and variants of the Euclidean algorithm enjoy broad uses in both classical and quantum algorithms. In this paper, we propose quantum circuits for GCD computation w…
Constant-Factor Optimization of Quantum Adders on 2D Quantum Architectures
Mehdi Saeedi, Alireza Shafaei, Massoud Pedram
Quantum arithmetic circuits have practical applications in various quantum algorithms. In this paper, we address quantum addition on 2-dimensional nearest-neighbor architectures ba…
Faster Quantum Number Factoring via Circuit Synthesis
Igor L. Markov, Mehdi Saeedi
A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. We reduce this bottleneck by customizing reversible…
Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost
Robert Wille, Mehdi Saeedi, Rolf Drechsler
Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or qua…