Efficient Floating-point Division Quantum Circuit using Newton-Raphson Division

S. S. Gayathri, R. Kumar, Samiappan Dhanalakshmi · 2022 · Journal of Physics: Conference Series 2335

| 编号 QM021 | 主题 模运算与乘法 | 链接 DOI 10.1088/1742-6596/2335/1/012058 |

摘要

摘要保留原文（英文）

摘要取自 Crossref 出版方元数据，未作翻译，以保证与原文一致。

The development of quantum algorithms is facilitated by quantum circuit designs. A floating-point number can represent a wide range of values and is extremely useful in digital signal processing. A quantum circuit model to implement the floating-point division problem using the Newton-Raphson division algorithm is proposed in this paper. The proposed division circuit offers a significant savings in T-gates and qubits used in the circuit design when correlated with the state of art works proposed on fast division algorithms. The qubits savings are estimated around 17% and 20%, T-count savings are around 59.03% and 20.31%. Similarly, T-depth savings is estimated around 77.45% and 24.33% over the existing works.

适用范围

本文处理的是浮点除法，不是 Shor 算法所需的精确整数模除法，也不能当作”模乘逆元量子线路”的依据。

本站词条在引用该文献时，会以 wikilink（sources/QM021）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。