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

被引:0
|
作者
Gayathri S S
R. Kumar
Majid Haghparast
Samiappan Dhanalakshmi
机构
[1] SRM Institute of Science and Technology,Department of Electronics and Communication Engineering, College of Engineering and Technology, Faculty of Engineering and Technology
[2] University of Jyväskylä,Faculty of Information Technology
来源
International Journal of Theoretical Physics | / 61卷
关键词
Quantum arithmetic circuits; T-count; T-depth; Floating-point square root; Babylonian square root; Quantum Computing; Integer division;
D O I
暂无
中图分类号
学科分类号
摘要
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.
引用
收藏
相关论文
共 50 条
  • [1] A Novel and Efficient square root Computation Quantum Circuit for Floating-point Standard
    Gayathri, S. S.
    Kumar, R.
    Haghparast, Majid
    Dhanalakshmi, Samiappan
    INTERNATIONAL JOURNAL OF THEORETICAL PHYSICS, 2022, 61 (09)
  • [2] Efficient Floating-Point Square Root and Reciprocal Square Root Algorithms
    Moroz, Leonid
    Samotyy, Volodymyr
    Wegrzyn, Mariusz
    Dzelendzyak, Ulyana
    PROCEEDINGS OF THE THE 11TH IEEE INTERNATIONAL CONFERENCE ON INTELLIGENT DATA ACQUISITION AND ADVANCED COMPUTING SYSTEMS: TECHNOLOGY AND APPLICATIONS (IDAACS'2021), VOL 1, 2021, : 552 - 559
  • [3] A novel approximation scheme for floating-point square root and inverse square root for FPGAs
    Pennestri, Pietro
    Huang, Yanqiu
    Alachiotis, Nikolaos
    2022 11TH INTERNATIONAL CONFERENCE ON MODERN CIRCUITS AND SYSTEMS TECHNOLOGIES (MOCAST), 2022,
  • [4] SIMPLIFIED FLOATING-POINT DIVISION AND SQUARE ROOT
    Viitanen, Timo
    Jaaskelainen, Pekka
    Esko, Otto
    Takala, Jarmo
    2013 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2013, : 2707 - 2711
  • [5] A Low-Cost High Radix Floating-Point Square-Root Circuit
    Yang, Yuheng
    Yuan, Qing
    Liu, Jian
    ELECTRONICS, 2021, 10 (16)
  • [6] Verification of the Decimal Floating-Point Square Root Operation
    Ahmed, Amr Sayed
    Fahmy, Hossam
    Kuehne, Ulrich
    2014 19TH IEEE EUROPEAN TEST SYMPOSIUM (ETS 2014), 2014,
  • [7] Faster floating-point square root for integer processors
    Jeannerod, Claude-Pierre
    Knochel, Herve
    Monat, Christophe
    Revy, Guillaume
    2007 INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS, 2007, : 324 - +
  • [8] FLOATING-POINT COMPUTATION
    STERBENZ, P
    TRANSACTIONS OF THE NEW YORK ACADEMY OF SCIENCES, 1974, 36 (06): : 591 - 591
  • [9] Low Latency Floating-Point Division and Square Root Unit
    Bruguera, Javier D.
    IEEE TRANSACTIONS ON COMPUTERS, 2020, 69 (02) : 274 - 287
  • [10] Stupid is as Stupid Does: Taking the Square Root of the Square of a Floating-Point Number
    Boldo, Sylvie
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2015, 317 : 27 - 32