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

Quantum Information Processing

T-count optimized quantum circuit for floating point addition and multiplication

S. S. Gayathri, R. Kumar, Samiappan Dhanalakshmi, Brajesh Kumar Kaushik

Published Nov 1, 2021• 7 citations
Publisher
DOI
10.1007/s11128-021-03296-6

Related papers

Quantum Circuits for Floating-Point Arithmetic

Thomas Häner, Mathias Soeken, Martin Roetteler +1 more

arXiv:1807.02023•Lecture notes in computer science•Jan 1, 2018•45 citations

A Novel and Efficient square root Computation Quantum Circuit for Floating-point Standard

S. S. Gayathri, R. Kumar, Majid Haghparast +1 more

International Journal of Theoretical Physics•Sep 20, 2022•8 citations

Toffoli gate count optimized space-efficient quantum circuit for binary field multiplication

Sunyeop Kim, Insung Kim, Seonggyeom Kim +1 more

Quantum Information Processing•Sep 30, 2024•5 citations

T-Count Optimized Quantum Circuit Designs for Single-Precision Floating-Point Division

S. S. Gayathri, R. Kumar, Samiappan Dhanalakshmi +2 more

The implementation of quantum computing processors for scientific applications includes quantum floating points circuits for arithmetic operations. This work adopts the standard division algorithms for floating-point numbers with restoring, non-restoring, and Goldschmidt division algorithms for single-precision inputs. The design proposals are carried out while using the quantum Clifford+T gates set, and resource estimates in terms of numbers of qubits, T-count, and T-depth are provided for the proposed circuits. By improving the leading zero detector (LZD) unit structure, the proposed division circuits show a significant reduction in the T-count when compared to the existing works on floating-point division.

Electronics•Mar 17, 2021•26 citations

An Efficient Quantum Addition Circuit

良徳 川田, Yoshinori Kawata, 智 田湯 +2 more

•Mar 1, 2008•0 citations

The implementation of the enhanced quantum floating-point adder

Shantao Zhao, Hai-Sheng Li, Guiqiong Li +1 more

The quantum adder is a vital arithmetic operation for quantum algorithms. However, the existing quantum floating-point adders only considered the case of two normal numbers. In this paper, we propose an enhanced quantum floating-point adder based on IEEE 754 standard. First, we divide quantum floating-point adders into four cases: the normal case, subnormal case, mixed case, and special case. Then, we propose a result-sign and mantissa-sign determining unit to avoid conversion from sign-magnitude to two complements. Moreover, we design a new quantum leading zero detector with the optimized T-depth and T-count. Comparison results reveal that the proposed floating-point adder has lower circuit width, T-depth, and T-count than the current works.

Modern Physics Letters A•Aug 30, 2022•3 citations
The implementation of quantum computing processors for scientific applications includes quantum floating points circuits for arithmetic operations. This work adopts the standard division algorithms for floating-point numbers with restoring, non-restoring, and Goldschmidt division algorithms for single-precision inputs. The design proposals are carried out while using the quantum Clifford+T gates set, and resource estimates in terms of numbers of qubits, T-count, and T-depth are provided for the proposed circuits. By improving the leading zero detector (LZD) unit structure, the proposed division circuits show a significant reduction in the T-count when compared to the existing works on floating-point division.
The quantum adder is a vital arithmetic operation for quantum algorithms. However, the existing quantum floating-point adders only considered the case of two normal numbers. In this paper, we propose an enhanced quantum floating-point adder based on IEEE 754 standard. First, we divide quantum floating-point adders into four cases: the normal case, subnormal case, mixed case, and special case. Then, we propose a result-sign and mantissa-sign determining unit to avoid conversion from sign-magnitude to two complements. Moreover, we design a new quantum leading zero detector with the optimized T-depth and T-count. Comparison results reveal that the proposed floating-point adder has lower circuit width, T-depth, and T-count than the current works.