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 条
  • [41] Quantum Circuits for Floating-Point Arithmetic
    Haener, Thomas
    Soeken, Mathias
    Roetteler, Martin
    Svore, Krysta M.
    REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 162 - 174
  • [42] Floating-point accumulation circuit for matrix applications
    Bodnar, Michael R.
    Humphrey, John R.
    Curt, Petersen F.
    Prather, Dennis W.
    FCCM 2006: 14TH ANNUAL IEEE SYMPOSIUM ON FIELD-PROGRAMMABLE CUSTOM COMPUTING MACHINES, PROCEEDINGS, 2006, : 303 - +
  • [43] CIRCUIT FINDS A FLOATING-POINT NUMBERS MSB
    JENG, JC
    EDN, 1985, 30 (15) : 246 - 246
  • [44] A circuit for exact summation of floating-point numbers
    Muller, M
    Rub, C
    Rulling, W
    INFORMATION PROCESSING LETTERS, 1996, 57 (03) : 159 - 163
  • [45] A PROPOSED STANDARD FOR BINARY FLOATING-POINT ARITHMETIC
    STEVENSON, D
    COMPUTER, 1981, 14 (03) : 51 - 62
  • [46] Fast floating point square root
    Hain, TF
    Mercer, DB
    AMCS '05: Proceedings of the 2005 International Conference on Algorithmic Mathematics and Computer Science, 2005, : 33 - 39
  • [47] Variable-Precision Approximate Floating-Point Multiplier for Efficient Deep Learning Computation
    Zhang, Hao
    Ko, Seok-Bum
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2022, 69 (05) : 2503 - 2507
  • [48] Scaling up and down of 3-D floating-point data in quantum computation
    Xu, Meiyu
    Lu, Dayong
    Sun, Xiaoyun
    SCIENTIFIC REPORTS, 2022, 12 (01)
  • [49] Scaling up and down of 3-D floating-point data in quantum computation
    Meiyu Xu
    Dayong Lu
    Xiaoyun Sun
    Scientific Reports, 12
  • [50] SQUARE ROOTING ALGORITHMS FOR INTEGER AND FLOATING-POINT NUMBERS
    HASHEMIAN, R
    IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (08) : 1025 - 1029