A Logarithmic Depth Quantum Carry-Lookahead Modulo $(2^n-1)$ Adder
Bhaskar Gaur, Edgard Mu\~noz-Coreas, Himanshu Thapliyal

TL;DR
This paper introduces a quantum carry-lookahead modulo $(2^n-1)$ adder with logarithmic depth, significantly reducing circuit complexity and noise, thereby improving quantum arithmetic performance on NISQ devices.
Contribution
It presents a novel quantum adder with O(log n) depth and a tree-based carry path, outperforming existing O(n) depth adders in noise resilience.
Findings
Achieves 47.21% higher QSFR on IBM Cairo for 4-qubit addition.
Reduces circuit depth from O(n) to O(log n), enhancing noise fidelity.
Demonstrates improved performance of quantum modulo addition circuits.
Abstract
Quantum Computing is making significant advancements toward creating machines capable of implementing quantum algorithms in various fields, such as quantum cryptography, quantum image processing, and optimization. The development of quantum arithmetic circuits for modulo addition is vital for implementing these quantum algorithms. While it is ideal to use quantum circuits based on fault-tolerant gates to overcome noise and decoherence errors, the current Noisy Intermediate Scale Quantum (NISQ) era quantum computers cannot handle the additional computational cost associated with fault-tolerant designs. Our research aims to minimize circuit depth, which can reduce noise and facilitate the implementation of quantum modulo addition circuits on NISQ machines. This work presents quantum carry-lookahead modulo adder (QCLMA), which is designed to receive two n-bit numbers and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum-Dot Cellular Automata · Quantum Computing Algorithms and Architecture · Coding theory and cryptography
