A comprehensive study of quantum arithmetic circuits

S Wang, X Li, WJB Lee, S Deb… - Philosophical …, 2025 - royalsocietypublishing.org
In recent decades, the field of quantum computing has experienced remarkable progress.
This progress is marked by the superior performance of many quantum algorithms …

Double-Logarithmic Depth Block-Encodings of Simple Finite Difference Method's Matrices

S Ty, R Vilmart, A Tahmasebimoradi… - arxiv preprint arxiv …, 2024 - arxiv.org
Solving differential equations is one of the most computationally expensive problems in
classical computing, occupying the vast majority of high-performance computing resources …

Measurement-based uncomputation of quantum circuits for modular arithmetic

A Luongo, AM Miti, V Narasimhachar… - arxiv preprint arxiv …, 2024 - arxiv.org
Measurement-based uncomputation (MBU) is a technique used to perform probabilistic
uncomputation of quantum circuits. We formalize this technique for the case of single-qubit …

Minimum Depth Quantum Modular Addition Through Carry-Save Architecture

S Wang, E Lim, X Li, J Feng… - 2024 IFIP/IEEE 32nd …, 2024 - ieeexplore.ieee.org
Shor's factorization algorithm, as one of the most significant achievements in quantum
computing, exhibits an exponential speedup compared to the corresponding classical …