4.7 Article

Quantum Circuit Designs of Integer Division Optimizing T-count and T-depth

Journal

IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTING
Volume 9, Issue 2, Pages 1045-1056

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TETC.2019.2910870

Keywords

Logic gates; Qubit; Fault tolerance; Fault tolerant systems; Computers; Image restoration; Quantum computing; quantum circuits; integer division; restoring division; non-restoring division; clifford plus T gates; quantum arithmetic

Funding

  1. U.S. Department of Energy [DE-AC0500OR22725]
  2. Department of Energy, Office of Science Early Career Research Program

Ask authors/readers for more resources

Quantum circuits for mathematical functions like division are essential for scientific computing using quantum computers. Designs based on Clifford+T gates can be made fault-tolerant easily but the costly T gate poses a challenge. Existing quantum computers have limited qubits, adding another constraint to quantum circuits design. Proposed integer division circuits aim to optimize T-count, T-depth, and qubit usage, with significant improvements compared to existing designs. These optimized designs are also applied in quantum image processing, showcasing their practicality in real-world applications.
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 division circuit is based on the restoring division algorithm and the second proposed design implements the non-restoring division algorithm. Both proposed designs are optimized in terms of T-count, T-depth and qubits. Both proposed quantum circuit designs are based on (i) a quantum subtractor, (ii) a quantum adder-subtractor circuit, and (iii) a novel quantum conditional addition circuit. Our proposed restoring division circuit achieves average T-count savings from 79.03 to 91.69 percent compared to the existing works. Our proposed non-restoring division circuit achieves average T-count savings from 49.22 to 90.03 percent compared to the existing works. Further, both our proposed designs have linear T-depth. We also illustrate the application of the proposed quantum division circuits in quantum image processing with a case study of quantum bilinear interpolation.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available