Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Science China Physics Mechanics and Astronomy

The circuit design and optimization of quantum multiplier and divider

Hai-Sheng Li, Ping Fan, Haiying Xia, Gui‐Lu Long

Published Apr 8, 2022• 30 citations
Publisher
DOI
10.1007/s11433-021-1874-2

Related papers

Designs of the divider and special multiplier optimizing T and CNOT gates

Ping Fan, Hai-Sheng Li

Abstract Quantum circuits for multiplication and division are necessary for scientific computing on quantum computers. Clifford + T circuits are widely used in fault-tolerant realizations. T gates are more expensive than other gates in Clifford + T circuits. But neglecting the cost of CNOT gates may lead to a significant underestimation. Moreover, the small number of qubits available in existing quantum devices is another constraint on quantum circuits. As a result, reducing T-count, T-depth, CNOT-count, CNOT-depth, and circuit width has become the important optimization goal. We use 3-bit Hermitian gates to design basic arithmetic operations. Then, we present a special multiplier and a divider using basic arithmetic operations, where ‘special’ means that one of the two operands of multiplication is non-zero. Next, we use new rules to optimize the Clifford + T circuits of the special multiplier and divider in terms of T-count, T-depth, CNOT-count, CNOT-depth, and circuit width. Comparative analysis shows that the proposed multiplier and divider have lower T-count, T-depth, CNOT-count, and CNOT-depth than the current works. For instance, the proposed 32-bit divider achieves improvement ratios of 40.41 percent, 31.64 percent, 45.27 percent, and 65.93 percent in terms of T-count, T-depth, CNOT-count, and CNOT-depth compared to the best current work. Further, the circuit widths of the proposed n -bit multiplier and divider are 3 n . I.e., our multiplier and divider reach the minimum width of multipliers and dividers, keeping an operand unchanged.

EPJ Quantum Technology•Feb 23, 2024•5 citations

Quantum circuit optimization of an integer divider

Francisco José Orts, Remigijus Paulavičius, Ernestas Filatovas

Journal of Systems and Software•May 10, 2024•8 citations

Study on Single Flux Quantum Floating-Point Divider Based on Goldschmidt's Algorithm

Akiyoshi Sanada, Yuki Yamanashi, Nobuyuki Yoshikawa

We investigate a Goldschmidt's single flux quantum (SFQ) floating-point divider that is suitable for the implementation using the bit-serial pipelined SFQ circuit. We designed the bit-serial SFQ divider that outputs the 11-bit quotient. The simulation results show correct operation at the frequency of 50-GHz and bias margin of 80%–125%. We also estimated dependence of latency and the number of Josephson junctions on accuracy of outputs. According to the estimation, double-precision SFQ divider can be designed using 27 000 Josephson junctions, which can be implemented on one chip using the current SFQ circuit fabrication technology. Because of the small circuit area and multiplier-based hardware architecture, the investigated divider can be applied to build an SFQ graphical processing unit.

IEEE Transactions on Applied Superconductivity•Mar 18, 2019•10 citations

Quantum Circuits: Design and Optimization

George A. Kevrekidis

•Aug 17, 2018•0 citations

An Efficient Quantum Circuit Design: Properties and Optimization Techniques

Mamtha Prajapati, Kalyan Babu Killana

Smart innovation, systems and technologies•Oct 17, 2024•4 citations

Reversible Binary Comparator

Hafiz Md. Hasan Babu

This chapter presents an n-bit comparator that has fewer gates; it also produces less garbage outputs, quantum cost, and delay. With the help of properties, the efficiency of reversible logic synthesis of an n-bit comparator are proved. A binary comparator compares the magnitude of two binary numbers to determine whether they are equal or one is greater/less than the other. To construct the optimized n-bit comparator, two reversible gates are introduced, namely Babu-Jamal-Saleheen gate and Hasan-Lafifa-Nazir gate. The reversible binary comparator circuit can be used in designing different reversible circuits such as reversible processing unit, complex arithmetic circuits, communication systems, etc. Thus, the concept of designing reversible binary comparator will help in designing the reversible subtractor, multiplier, divider, and various adder circuits.

Wiley eBooks•Aug 28, 2020•0 citations
Abstract Quantum circuits for multiplication and division are necessary for scientific computing on quantum computers. Clifford + T circuits are widely used in fault-tolerant realizations. T gates are more expensive than other gates in Clifford + T circuits. But neglecting the cost of CNOT gates may lead to a significant underestimation. Moreover, the small number of qubits available in existing quantum devices is another constraint on quantum circuits. As a result, reducing T-count, T-depth, CNOT-count, CNOT-depth, and circuit width has become the important optimization goal. We use 3-bit Hermitian gates to design basic arithmetic operations. Then, we present a special multiplier and a divider using basic arithmetic operations, where ‘special’ means that one of the two operands of multiplication is non-zero. Next, we use new rules to optimize the Clifford + T circuits of the special multiplier and divider in terms of T-count, T-depth, CNOT-count, CNOT-depth, and circuit width. Comparative analysis shows that the proposed multiplier and divider have lower T-count, T-depth, CNOT-count, and CNOT-depth than the current works. For instance, the proposed 32-bit divider achieves improvement ratios of 40.41 percent, 31.64 percent, 45.27 percent, and 65.93 percent in terms of T-count, T-depth, CNOT-count, and CNOT-depth compared to the best current work. Further, the circuit widths of the proposed n -bit multiplier and divider are 3 n . I.e., our multiplier and divider reach the minimum width of multipliers and dividers, keeping an operand unchanged.
We investigate a Goldschmidt's single flux quantum (SFQ) floating-point divider that is suitable for the implementation using the bit-serial pipelined SFQ circuit. We designed the bit-serial SFQ divider that outputs the 11-bit quotient. The simulation results show correct operation at the frequency of 50-GHz and bias margin of 80%–125%. We also estimated dependence of latency and the number of Josephson junctions on accuracy of outputs. According to the estimation, double-precision SFQ divider can be designed using 27 000 Josephson junctions, which can be implemented on one chip using the current SFQ circuit fabrication technology. Because of the small circuit area and multiplier-based hardware architecture, the investigated divider can be applied to build an SFQ graphical processing unit.
This chapter presents an n-bit comparator that has fewer gates; it also produces less garbage outputs, quantum cost, and delay. With the help of properties, the efficiency of reversible logic synthesis of an n-bit comparator are proved. A binary comparator compares the magnitude of two binary numbers to determine whether they are equal or one is greater/less than the other. To construct the optimized n-bit comparator, two reversible gates are introduced, namely Babu-Jamal-Saleheen gate and Hasan-Lafifa-Nazir gate. The reversible binary comparator circuit can be used in designing different reversible circuits such as reversible processing unit, complex arithmetic circuits, communication systems, etc. Thus, the concept of designing reversible binary comparator will help in designing the reversible subtractor, multiplier, divider, and various adder circuits.