REVIEW 4 cited by
A Comprehensive Study of Quantum Arithmetic Circuits
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A Comprehensive Study of Quantum Arithmetic Circuits
read the original abstract
In recent decades, the field of quantum computing has experienced remarkable progress. This progress is marked by the superior performance of many quantum algorithms compared to their classical counterparts, with Shor's algorithm serving as a prominent illustration. Quantum arithmetic circuits, which are the fundamental building blocks in numerous quantum algorithms, have attracted much attention. Despite extensive exploration of various designs in the existing literature, researchers remain keen on developing novel designs and improving existing ones. In this review article, we aim to provide a systematically organized and easily comprehensible overview of the current state-of-the-art in quantum arithmetic circuits. Specifically, this study covers fundamental operations such as addition, subtraction, multiplication, division and modular exponentiation. We delve into the detailed quantum implementations of these prominent designs and evaluate their efficiency considering various objectives. We also discuss potential applications of presented arithmetic circuits and suggest future research directions.
Forward citations
Cited by 4 Pith papers
-
Tailor Made Embeddings for Quantum Machine Learning
A variational autoencoder learns quantum embeddings compressing ImageNet into 13 qubits and achieving 98.5% accuracy on MNIST 3-vs-5 classification with a quantum circuit, close to classical baselines and far above na...
-
Quantum algorithm for solving differential equations using SLAC derivatives
Presents LCU block-encodings for SLAC derivative operators, applies Shannon wavelets and preconditioning, and obtains O(d n^3 α^(k) log(1/ε)) gate complexity for d-dimensional PDEs via QLSA.
-
A Polylogarithmic-Depth Quantum Multiplier
Quantum integer multiplier with O(log^2 n) circuit depth and T-depth via parallel partial products and binary adder tree in the Clifford+T model.
-
Quantum algorithm for solving differential equations using SLAC derivatives
Efficient quantum block-encodings of SLAC first-order derivative and Laplacian operators are built with LCU, state preparation, wavelet multi-scale transforms, and preconditioning to solve PDEs via QLSA with analyzed ...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.