Quantum Circuit Design of Integer Division Optimizing Ancillary Qubits and T-Count

TL;DR

This paper introduces a Clifford+T gate-based quantum circuit for integer division that optimizes ancillary qubits and T-count, using a restoring division algorithm with improved resource efficiency.

Contribution

It presents a novel quantum circuit design for integer division that reduces ancillary qubits by 50% and T-count by 90% compared to previous Fourier transform-based methods.

Findings

50% reduction in ancillary qubits

90% reduction in T-count

Based on restoring division algorithm

Abstract

In this paper, we present Clifford+T gates based quantum circuit design of integer division having $n$ ancillary qubits. The proposed quantum circuit is based on restoring division algorithm. The proposed quantum circuit of integer division consists of (i) quantum circuitry of conditional addition operation, (ii) quantum circuitry of integer subtraction. To design ancillary and T-count optimized design of quantum integer division, the optimized quantum circuit design of integer conditional addition operation and integer subtraction are presented. The proposed quantum integer division circuitry has 50\% improvement in terms of ancillary qubits, and 90\% improvement in terms of T-count compared to the existing design of integer quantum division based on quantum fourier transform.