Quantum Circuit Designs of Integer Division Optimizing T-count and T-depth
Himanshu Thapliyal, Edgard Mu\~noz-Coreas, T. S. S. Varun, Travis S., Humble

TL;DR
This paper presents two optimized quantum circuits for integer division that significantly reduce T-count and qubit usage, crucial for fault-tolerant quantum computing with limited qubits.
Contribution
The paper introduces two novel quantum division circuits based on restoring and non-restoring algorithms, optimized for T-count, T-depth, and qubit efficiency.
Findings
Restoring division circuit reduces T-count by up to 91.69%.
Non-restoring division circuit reduces T-count by up to 90.37%.
Both designs have linear T-depth.
Abstract
Quantum circuits for mathematical functions such as division are necessary to use quantum computers for scientific computing. Quantum circuits based on Clifford+T gates can easily be made fault-tolerant but the T gate is very costly to implement. The small number of qubits available in existing quantum computers adds another constraint on quantum circuits. As a result, reducing T-count and qubit cost have become important optimization goals. The design of quantum circuits for integer division has caught the attention of researchers and designs have been proposed in the literature. However, these designs suffer from excessive T gate and qubit costs. Many of these designs also produce significant garbage output resulting in additional qubit and T gate costs to eliminate these outputs. In this work, we propose two quantum integer division circuits. The first proposed quantum integer…
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.
