A1 Journal article (refereed)
A Novel and Efficient square root Computation Quantum Circuit for Floating-point Standard (2022)

Gayathri, S.S., Kumar, R., Haghparast, M., & Dhanalakshmi, S. (2022). A Novel and Efficient square root Computation Quantum Circuit for Floating-point Standard. International Journal of Theoretical Physics, 61, Article 234. https://doi.org/10.1007/s10773-022-05222-7

JYU authors or editors

Publication details

All authors or editors: Gayathri, S. S.; Kumar, R.; Haghparast, Majid; Dhanalakshmi, Samiappan

Journal or series: International Journal of Theoretical Physics

ISSN: 0020-7748

eISSN: 1572-9575

Publication year: 2022

Publication date: 20/09/2022

Volume: 61

Article number: 234

Publisher: Springer

Publication country: United States

Publication language: English

DOI: https://doi.org/10.1007/s10773-022-05222-7

Publication open access: Not open

Publication channel open access: 

Publication is parallel published (JYX): https://jyx.jyu.fi/handle/123456789/85692

Abstract

It is imperative that quantum computing devices perform floating-point arithmetic operations. This paper presents a circuit design for floating-point square root operations designed using classical Babylonian algorithm. The proposed Babylonian square root, is accomplished using Clifford+T operations. This work focuses on realizing the square root circuit by employing the bit Restoring and bit Non-restoring division algorithms as two different approaches. The multiplier of the proposed circuit uses an improved structure of Toom-cook 2.5 multiplier by optimizing the T-gate count of the multiplier. It is determined from the analysis that the proposed square root circuit employing slow-division algorithms results in a T-count reduction of 80.51% and 72.65% over the existing work. The proposed circuit saves a significant number of ancillary qubits, resulting in a qubit cost savings of 61.67 % When compared to the existing work.

Keywords: quantum computing; arithmetic; calculation models; algorithms

Free keywords: quantum arithmetic circuits; T-count; T-depth; floating-point square root; Babylonian square root; quantum computing; integer division

Contributing organizations

Ministry reporting: Yes

Reporting Year: 2022

JUFO rating: 1