{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T19:51:43Z","timestamp":1780084303088,"version":"3.54.0"},"reference-count":66,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T00:00:00Z","timestamp":1635724800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s11128-021-03296-6","type":"journal-article","created":{"date-parts":[[2021,11,9]],"date-time":"2021-11-09T08:02:36Z","timestamp":1636444956000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["T-count optimized quantum circuit for floating point addition and multiplication"],"prefix":"10.1007","volume":"20","author":[{"given":"S. S.","family":"Gayathri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6746-5214","authenticated-orcid":false,"given":"R.","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samiappan","family":"Dhanalakshmi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brajesh Kumar","family":"Kaushik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"3296_CR1","doi-asserted-by":"publisher","unstructured":"Liu, W., Wu, Q., Shen, J., Zhao, J., Zidan, M., Tong, L.: An optimized quantum minimum searching algorithm with sure-success probability and its experiment simulation with Cirq. J. Ambient Intell. Humaniz. Comput. 12, 1\u201310 (2021). https:\/\/doi.org\/10.1007\/s12652-020-02840-z","DOI":"10.1007\/s12652-020-02840-z"},{"issue":"35","key":"3296_CR2","doi-asserted-by":"publisher","first-page":"2050401","DOI":"10.1142\/S0217984920504011","volume":"34","author":"M Zidan","year":"2020","unstructured":"Zidan, M.: A novel quantum computing model based on entanglement degree. Mod. Phys. Lett. B 34(35), 2050401 (2020)","journal-title":"Mod. Phys. Lett. B"},{"key":"3296_CR3","doi-asserted-by":"publisher","first-page":"103536","DOI":"10.1016\/j.rinp.2020.103536","volume":"21","author":"M Zidan","year":"2021","unstructured":"Zidan, M., Eleuch, H., Abdel-Aty, M.: Non-classical computing problems: toward novel type of quantum computing problems. Results Phys. 21, 103536 (2021)","journal-title":"Results Phys."},{"key":"3296_CR4","doi-asserted-by":"publisher","first-page":"102549","DOI":"10.1016\/j.rinp.2019.102549","volume":"15","author":"M Zidan","year":"2019","unstructured":"Zidan, M., Abdel-Aty, A.-H., Nguyen, D.M., Mohamed, A.S., Al-Sbou, Y., Eleuch, H., Abdel-Aty, M.: A quantum algorithm based on entanglement measure for classifying Boolean multivariate function into novel hidden classes. Results Phys. 15, 102549 (2019)","journal-title":"Results Phys."},{"issue":"1","key":"3296_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10773-018-3910-4","volume":"58","author":"DM Nguyen","year":"2019","unstructured":"Nguyen, D.M., Kim, S.: Quantum key distribution protocol based on modified generalization of Deutsch\u2013Jozsa algorithm in d-level quantum system. Int. J. Theor. Phys. 58(1), 71\u201382 (2019)","journal-title":"Int. J. Theor. Phys."},{"issue":"3","key":"3296_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03047-7","volume":"20","author":"C-W Tsai","year":"2021","unstructured":"Tsai, C.-W., Lin, J., Yang, C.-W.: Cryptanalysis and improvement in semi-quantum private comparison based on Bell states. Quantum Inf. Process. 20(3), 1\u201314 (2021)","journal-title":"Quantum Inf. Process."},{"issue":"8","key":"3296_CR7","doi-asserted-by":"publisher","first-page":"763","DOI":"10.3390\/e21080763","volume":"21","author":"A Sagheer","year":"2019","unstructured":"Sagheer, A., Zidan, M., Abdelsamea, M.M.: A novel autonomous perceptron model for pattern classification applications. Entropy 21(8), 763 (2019)","journal-title":"Entropy"},{"key":"3296_CR8","doi-asserted-by":"crossref","unstructured":"Zidan, M., Abdel-Aty, A.-H., El-Sadek, A., Zanaty, E., Abdel-Aty, M.: Low-cost autonomous perceptron neural network inspired by quantum computation. In: AIP Conference Proceedings, vol. 1905, AIP Publishing LLC, p. 020005 (2017)","DOI":"10.1063\/1.5012145"},{"issue":"7","key":"3296_CR9","doi-asserted-by":"publisher","first-page":"1277","DOI":"10.3390\/app9071277","volume":"9","author":"M Zidan","year":"2019","unstructured":"Zidan, M., Abdel-Aty, A.-H., El-shafei, M., Feraig, M., Al-Sbou, Y., Eleuch, H., Abdel-Aty, M.: Quantum classification algorithm based on competitive learning neural network and entanglement measure. Appl. Sci. 9(7), 1277 (2019)","journal-title":"Appl. Sci."},{"issue":"3","key":"3296_CR10","doi-asserted-by":"publisher","first-page":"2809","DOI":"10.3233\/JIFS-179566","volume":"38","author":"A-H Abdel-Aty","year":"2020","unstructured":"Abdel-Aty, A.-H., Kadry, H., Zidan, M., Al-Sbou, Y., Zanaty, E., Abdel-Aty, M.: A quantum classification algorithm for classification incomplete patterns based on entanglement measure. J. Intell. Fuzzy Syst. 38(3), 2809\u20132816 (2020)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"3296_CR11","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz-Coreas, E., Thapliyal, H.: Design of quantum circuits for cryptanalysis and image processing applications. In: 2019 IEEE Computer Society Annual Symposium on VLSI (ISVLSI), pp. 360\u2013365. IEEE (2019)","DOI":"10.1109\/ISVLSI.2019.00072"},{"issue":"3","key":"3296_CR12","doi-asserted-by":"publisher","first-page":"032308","DOI":"10.1103\/PhysRevA.100.032308","volume":"100","author":"P Andr\u00e9s-Mart\u00ednez","year":"2019","unstructured":"Andr\u00e9s-Mart\u00ednez, P., Heunen, C.: Automated distribution of quantum circuits via hypergraph partitioning. Phys. Rev. A 100(3), 032308 (2019)","journal-title":"Phys. Rev. A"},{"issue":"21","key":"3296_CR13","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.120.210501","volume":"120","author":"EF Dumitrescu","year":"2018","unstructured":"Dumitrescu, E.F., McCaskey, A.J., Hagen, G., Jansen, G.R., Morris, T.D., Papenbrock, T., Pooser, R.C., Dean, D.J., Lougovski, P.: Cloud quantum computing of an atomic nucleus. Phys. Rev. Lett. 120(21), 210501 (2018)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"3296_CR14","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10676-017-9439-z","volume":"19","author":"R De Wolf","year":"2017","unstructured":"De Wolf, R.: The potential impact of quantum computers on society. Ethics Inf. Technol. 19(4), 271\u2013276 (2017)","journal-title":"Ethics Inf. Technol."},{"issue":"5","key":"3296_CR15","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1103\/PhysRevLett.68.557","volume":"68","author":"CH Bennett","year":"1992","unstructured":"Bennett, C.H., Brassard, G., Mermin, N.D.: Quantum cryptography without Bells theorem. Phys. Rev. Lett. 68(5), 557 (1992)","journal-title":"Phys. Rev. Lett."},{"key":"3296_CR16","doi-asserted-by":"crossref","unstructured":"Muller JM. et al. (2010) Hardware Implementation of Floating-Point Arithmetic. In: Handbook of Floating-Point Arithmetic. Birkh\u00e4user Boston. https:\/\/doi.org\/10.1007\/978-0-8176-4705-6_9","DOI":"10.1007\/978-0-8176-4705-6_9"},{"key":"3296_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-007-2987-2","volume-title":"Guide to FPGA Implementation of Arithmetic Functions","author":"J-P Deschamps","year":"2012","unstructured":"Deschamps, J.-P., Sutter, G.D., Cant\u00f3, E.: Guide to FPGA Implementation of Arithmetic Functions, vol. 149. Springer, Berlin (2012)"},{"key":"3296_CR18","doi-asserted-by":"crossref","unstructured":"Funke S. (2009) Of What Use Is Floating-Point Arithmetic in Computational Geometry?. In: Albers S., Alt H., N\u00e4her S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-03456-5_23 (2009)","DOI":"10.1007\/978-3-642-03456-5_23"},{"key":"3296_CR19","doi-asserted-by":"crossref","unstructured":"Papageorgiou, A., Traub, J.: Quantum algorithms for continuous problems and their applications. Quantum Inf. Comput. Chem. 154, 151\u2013178 (2014)","DOI":"10.1002\/9781118742631.ch06"},{"issue":"5","key":"3296_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1109\/TC.2018.2882774","volume":"68","author":"E Mu\u00f1oz-Coreas","year":"2018","unstructured":"Mu\u00f1oz-Coreas, E., Thapliyal, H.: Quantum circuit design of a t-count optimized integer multiplier. IEEE Trans. Comput. 68(5), 729\u2013739 (2018)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"3296_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/qmetro-2017-0001","volume":"4","author":"R Li","year":"2017","unstructured":"Li, R., Alvarez-Rodriguez, U., Lamata, L., Solano, E.: Approximate quantum adders with genetic algorithms: an IBM quantum experience. Quantum Meas. Quantum Metrol. 4(1), 1\u20137 (2017)","journal-title":"Quantum Meas. Quantum Metrol."},{"key":"3296_CR22","unstructured":"Draper, T.G., Kutin, S.A., Rains, E.M., Svore, K.M.: A logarithmic-depth quantum carry-lookahead adder. arXiv:0406.142 [quant-ph]"},{"issue":"3","key":"3296_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3264816","volume":"14","author":"E Munoz-Coreas","year":"2018","unstructured":"Munoz-Coreas, E., Thapliyal, H.: T-count and qubit optimized quantum circuit design of the non-restoring square root algorithm. ACM J. Emerg. Technol. Comput. Syst.: JETC 14(3), 1\u201315 (2018)","journal-title":"ACM J. Emerg. Technol. Comput. Syst.: JETC"},{"key":"3296_CR24","unstructured":"Bhaskar, M.K., Hadfield, S., Papageorgiou, A., Petras, I.: Quantum algorithms and circuits for scientific computing. arXiv:1511.08253"},{"issue":"10","key":"3296_CR25","doi-asserted-by":"publisher","first-page":"1476","DOI":"10.1109\/TCAD.2014.2341953","volume":"33","author":"M Amy","year":"2014","unstructured":"Amy, M., Maslov, D., Mosca, M.: Polynomial-time T-depth optimization of Clifford+ T circuits via matroid partitioning. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1476\u20131489 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"6","key":"3296_CR26","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TCAD.2013.2244643","volume":"32","author":"M Amy","year":"2013","unstructured":"Amy, M., Maslov, D., Mosca, M., Roetteler, M.: A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(6), 818\u2013830 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"3296_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms3524","volume":"4","author":"S Devitt","year":"2013","unstructured":"Devitt, S., Stephens, A., Munro, W., Nemoto, K.: Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nat Commun 4, 1\u20138 (2013)","journal-title":"Nat Commun"},{"issue":"2","key":"3296_CR28","doi-asserted-by":"publisher","first-page":"025003","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"A Paler","year":"2017","unstructured":"Paler, A., Polian, I., Nemoto, K., Devitt, S.J.: Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Sci. Technol. 2(2), 025003 (2017). https:\/\/doi.org\/10.1088\/2058-9565\/aa66eb","journal-title":"Quantum Sci. Technol."},{"issue":"5","key":"3296_CR29","doi-asserted-by":"publisher","first-page":"052316","DOI":"10.1103\/PhysRevA.62.052316","volume":"62","author":"X Zhou","year":"2000","unstructured":"Zhou, X., Leung, D.W., Chuang, I.L.: Methodology for quantum logic gate construction. Phys. Rev. A 62(5), 052316 (2000)","journal-title":"Phys. Rev. A"},{"key":"3296_CR30","unstructured":"Cuccaro, S.A., Draper, T.G., Kutin, S.A., Moulton, D.P.: A new quantum ripple-carry addition circuit. arXiv:0410.184 [quant-ph]"},{"key":"3296_CR31","unstructured":"Takahashi, Y., Tani, S., Kunihiro, N.: Quantum addition circuits and unbounded fan-out. arXiv:0910.2530"},{"key":"3296_CR32","doi-asserted-by":"crossref","unstructured":"Kotiyal, S., Thapliyal, H., Ranganathan, N.: Circuit for reversible quantum multiplier based on binary tree optimizing ancilla and garbage bits. In: 2014 27th International Conference on VLSI Design and 2014 13th International Conference on Embedded Systems, pp. 545\u2013550. IEEE (2014)","DOI":"10.1109\/VLSID.2014.101"},{"issue":"1","key":"3296_CR33","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/s11128-016-1455-0","volume":"16","author":"HMH Babu","year":"2017","unstructured":"Babu, H.M.H.: Cost-efficient design of a quantum multiplier-accumulator unit. Quantum Inf. Process. 16(1), 30 (2017)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"3296_CR34","doi-asserted-by":"publisher","first-page":"012311","DOI":"10.1103\/PhysRevA.98.012311","volume":"98","author":"S Dutta","year":"2018","unstructured":"Dutta, S., Bhattacharjee, D., Chattopadhyay, A.: Quantum circuits for Toom\u2013Cook multiplication. Phys. Rev. A 98(1), 012311 (2018)","journal-title":"Phys. Rev. A"},{"key":"3296_CR35","doi-asserted-by":"crossref","unstructured":"Dibbo, S.V., Babu, H.M.H., Jamal, L.: An efficient design technique of a quantum divider circuit, In: 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2102\u20132105. IEEE (2016)","DOI":"10.1109\/ISCAS.2016.7538994"},{"issue":"2","key":"3296_CR36","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1049\/iet-cds.2016.0071","volume":"11","author":"M Mohammadi","year":"2017","unstructured":"Mohammadi, M., Gorgin, S., Mohammadi, M.: Design of non-restoring divider in quantum-dot cellular automata technology. IET Circuits Devices Syst. 11(2), 135\u2013141 (2017)","journal-title":"IET Circuits Devices Syst."},{"key":"3296_CR37","doi-asserted-by":"publisher","unstructured":"Thapliyal, H., Munoz-Coreas, E., Varun, T., Humble, T.: Quantum circuit designs of integer division optimizing T-count and T-depth. IEEE Trans. Emerg. Top. Comput 9(2), 1045\u20131056 (2021). https:\/\/doi.org\/10.1109\/TETC.2019.2910870","DOI":"10.1109\/TETC.2019.2910870"},{"key":"3296_CR38","doi-asserted-by":"crossref","unstructured":"Dutta, S., Tavva, Y., Bhattacharjee, D., Chattopadhyay, A.: Efficient quantum circuits for square-root and inverse square-root. In: 2020 33rd International Conference on VLSI Design and 2020 19th International Conference on Embedded Systems (VLSID), pp. 55\u201360. IEEE (2020)","DOI":"10.1109\/VLSID49098.2020.00027"},{"key":"3296_CR39","unstructured":"Nguyen, T.D., Van Meter, R.: A space-efficient design for reversible floating point adder in quantum computing. arXiv:1306.3760"},{"key":"3296_CR40","doi-asserted-by":"crossref","unstructured":"Haener, T., Soeken, M., Roetteler, M., Svore, K.M.: Quantum circuits for floating-point arithmetic. In: International Conference on Reversible Computation, pp. 162\u2013174. Springer (2018)","DOI":"10.1007\/978-3-319-99498-7_11"},{"issue":"6","key":"3296_CR41","doi-asserted-by":"publisher","first-page":"703","DOI":"10.3390\/electronics10060703","volume":"10","author":"S Gayathri","year":"2021","unstructured":"Gayathri, S., Kumar, R., Dhanalakshmi, S., Dooly, G., Duraibabu, D.B.: T-count optimized quantum circuit designs for single-precision floating-point division. Electronics 10(6), 703 (2021)","journal-title":"Electronics"},{"key":"3296_CR42","doi-asserted-by":"crossref","unstructured":"Clader, B.D., Jacobs, B.C., Sprouse, C.R.: Quantum algorithm to calculate electromagnetic scattering cross sections. In: The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting, OSA Technical Digest (online) (Optical Society of America, 2013), paper W6.26.","DOI":"10.1364\/QIM.2013.W6.26"},{"issue":"15","key":"3296_CR43","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103(15), 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3296_CR44","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum algorithms for supervised and unsupervised machine learning. arXiv:1307.0411"},{"key":"3296_CR45","doi-asserted-by":"crossref","unstructured":"Jain, J., Agrawal, R.: Design and development of efficient reversible floating point arithmetic unit, In: 2015 Fifth International Conference on Communication Systems and Network Technologies, pp. 811\u2013815. IEEE (2015)","DOI":"10.1109\/CSNT.2015.215"},{"key":"3296_CR46","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1016\/j.micpro.2017.01.002","volume":"51","author":"A AnanthaLakshmi","year":"2017","unstructured":"AnanthaLakshmi, A., Sudha, G.F.: A novel power efficient 0.64-GFlops fused 32-bit reversible floating point arithmetic unit architecture for digital signal processing applications. Microprocess. Microsyst. 51, 366\u2013385 (2017)","journal-title":"Microprocess. Microsyst."},{"issue":"3","key":"3296_CR47","first-page":"161","volume":"48","author":"A Kamaraj","year":"2018","unstructured":"Kamaraj, A., Marichamy, P.: Design of fault-tolerant reversible floating point division. Inf. MIDEM 48(3), 161\u2013172 (2018)","journal-title":"Inf. MIDEM"},{"issue":"6","key":"3296_CR48","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1016\/j.jsc.2005.11.001","volume":"41","author":"Z Wan","year":"2006","unstructured":"Wan, Z.: An algorithm to solve integer linear systems exactly using numerical methods. J. Symb. Comput. 41(6), 621\u2013632 (2006)","journal-title":"J. Symb. Comput."},{"issue":"1\u20133","key":"3296_CR49","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/0920-5632(95)00432-9","volume":"41","author":"BR Greene","year":"1995","unstructured":"Greene, B.R.: Lectures on quantum geometry. Nucl. Phys. B Proc. Suppl. 41(1\u20133), 92\u2013150 (1995)","journal-title":"Nucl. Phys. B Proc. Suppl."},{"key":"3296_CR50","unstructured":"Dervovic, D., Herbster, M., Mountney, P., Severini, S., Usher, N., Wossnig, L.: Quantum linear systems algorithms: a primer. arXiv:1802.08227"},{"issue":"3","key":"3296_CR51","first-page":"031007","volume":"2","author":"NC Jones","year":"2012","unstructured":"Jones, N.C., Van Meter, R., Fowler, A.G., McMahon, P.L., Kim, J., Ladd, T.D., Yamamoto, Y.: Layered architecture for quantum computing. Phys. Rev. X 2(3), 031007 (2012)","journal-title":"Phys. Rev. X"},{"issue":"1","key":"3296_CR52","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1088\/2058-9565\/aad604","volume":"4","author":"LE Heyfron","year":"2018","unstructured":"Heyfron, L.E., Campbell, E.T.: An efficient quantum compiler that reduces T count. Quantum Sci. Technol. 4(1), 015004 (2018)","journal-title":"Quantum Sci. Technol."},{"key":"3296_CR53","doi-asserted-by":"crossref","unstructured":"Miller, D.M., Soeken, M., Drechsler, R.: Mapping NCV circuits to optimized Clifford+T circuits. In: International Conference on Reversible Computation, pp. 163\u2013175. Springer (2014)","DOI":"10.1007\/978-3-319-08494-7_13"},{"key":"3296_CR54","doi-asserted-by":"crossref","unstructured":"Nielsen, M. A., Chuang, I. L. (2011). Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge","DOI":"10.1017\/CBO9780511976667"},{"key":"3296_CR55","doi-asserted-by":"publisher","first-page":"74","DOI":"10.22331\/q-2018-06-18-74","volume":"2","author":"C Gidney","year":"2018","unstructured":"Gidney, C.: Halving the cost of quantum addition. Quantum 2, 74 (2018)","journal-title":"Quantum"},{"issue":"1","key":"3296_CR56","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s10773-018-3921-1","volume":"58","author":"R Montaser","year":"2019","unstructured":"Montaser, R., Younes, A., Abdel-Aty, M.: New design of reversible full adder\/subtractor using R gate. Int. J. Theor. Phys. 58(1), 167\u2013183 (2019)","journal-title":"Int. J. Theor. Phys."},{"issue":"22","key":"3296_CR57","doi-asserted-by":"publisher","first-page":"1343","DOI":"10.1049\/el:20020949","volume":"38","author":"K-W Cheng","year":"2002","unstructured":"Cheng, K.-W., Tseng, C.-C.: Quantum full adder and subtractor. Electron. Lett. 38(22), 1343\u20131344 (2002)","journal-title":"Electron. Lett."},{"key":"3296_CR58","doi-asserted-by":"crossref","unstructured":"Thapliyal, H., Ranganathan, N.: A new design of the reversible subtractor circuit. In: 2011 11th IEEE International Conference on Nanotechnology, pp. 1430\u20131435. IEEE (2011)","DOI":"10.1109\/NANO.2011.6144350"},{"issue":"9","key":"3296_CR59","first-page":"302","volume":"39","author":"D Wang","year":"2012","unstructured":"Wang, D., Liu, Z.-H., Zhu, W.-N., Li, S.-Z.: Design of quantum comparator based on extended general Toffoli gates with multiple targets. Comput. Sci. 39(9), 302\u2013306 (2012)","journal-title":"Comput. Sci."},{"issue":"1","key":"3296_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/FUEE0901001A","volume":"22","author":"AN Al-Rabadi","year":"2009","unstructured":"Al-Rabadi, A.N.: Closed-system quantum logic network implementation of the viterbi algorithm. Facta Univ. Ser. Electron. Energ. 22(1), 1\u201333 (2009)","journal-title":"Facta Univ. Ser. Electron. Energ."},{"key":"3296_CR61","doi-asserted-by":"crossref","unstructured":"Thapliyal, H., Ranganathan, N., Ferreira, R.: Design of a comparator tree based on reversible logic. In: 10th IEEE International Conference on Nanotechnology, pp. 1113\u20131116. IEEE (2010)","DOI":"10.1109\/NANO.2010.5697872"},{"issue":"7","key":"3296_CR62","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11128-019-2334-2","volume":"18","author":"H Xia","year":"2019","unstructured":"Xia, H., Li, H., Zhang, H., Liang, Y., Xin, J.: Novel multi-bit quantum comparators and their application in image binarization. Quantum Inf. Process. 18(7), 229 (2019)","journal-title":"Quantum Inf. Process."},{"issue":"1","key":"3296_CR63","first-page":"17","volume":"7","author":"DS Oliveira","year":"2007","unstructured":"Oliveira, D.S., Ramos, R.V.: Quantum bit string comparator: circuits and applications. Quantum Comput. Comput 7(1), 17\u201326 (2007)","journal-title":"Quantum Comput. Comput"},{"issue":"2","key":"3296_CR64","first-page":"1103","volume":"2","author":"S Paidi","year":"2012","unstructured":"Paidi, S., Sreerama, R., Neelima, K.: A novel high speed leading zero counter for floating point units. Int. J. Eng. Res. Appl.: IJERA 2(2), 1103\u20131105 (2012)","journal-title":"Int. J. Eng. Res. Appl.: IJERA"},{"key":"3296_CR65","doi-asserted-by":"crossref","unstructured":"H\u00e4ner, T., Jaques, S., Naehrig, M., Roetteler, M., Soeken, M.: Improved quantum circuits for elliptic curve discrete logarithms. In: International Conference on Post-Quantum Cryptography, pp. 425\u2013444. Springer (2020)","DOI":"10.1007\/978-3-030-44223-1_23"},{"issue":"6","key":"3296_CR66","doi-asserted-by":"publisher","first-page":"062325","DOI":"10.1103\/PhysRevA.79.062325","volume":"79","author":"MM Wilde","year":"2009","unstructured":"Wilde, M.M.: Quantum-shift-register circuits. Phys. Rev. A 79(6), 062325 (2009)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03296-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03296-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,14]],"date-time":"2023-01-14T18:58:51Z","timestamp":1673722731000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03296-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11]]},"references-count":66,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["3296"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03296-6","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11]]},"assertion":[{"value":"3 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"378"}}