{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T17:29:22Z","timestamp":1771262962561,"version":"3.50.1"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T00:00:00Z","timestamp":1679097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T00:00:00Z","timestamp":1679097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100021713","name":"Universidad de Almer\u00eda","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100021713","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Current quantum computers have a limited number of resources and are heavily affected by internal and external noise. Therefore, small, noise-tolerant circuits are of great interest. With regard to circuit size, it is especially important to reduce the number of required qubits. Concerning to fault-tolerance, circuits entirely built with Clifford+T gates allow the use of error correction codes. However, the T-gate has an excessive cost, so circuits with a high number of T-gates should be avoided. This work focuses on optimising in such terms an operation that is widely used in larger circuits and algorithms: the calculation of the absolute-value of two\u2019s complement encoded integers. The proposed circuit halves the number of required T gates with respect to the best circuit currently available in the literature. Moreover, our circuit requires at least 2 qubits less than the other circuits for such an operation.<\/jats:p>","DOI":"10.1007\/s11227-023-05162-x","type":"journal-article","created":{"date-parts":[[2023,3,18]],"date-time":"2023-03-18T06:02:47Z","timestamp":1679119367000},"page":"12656-12670","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient design of a quantum absolute-value circuit using Clifford+T gates"],"prefix":"10.1007","volume":"79","author":[{"given":"Francisco","family":"Orts","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"El\u00edas F.","family":"Combarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio F.","family":"R\u00faa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio M.","family":"Puertas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,18]]},"reference":[{"key":"5162_CR1","doi-asserted-by":"crossref","unstructured":"Nielsen MA, Chuang I (2002) Quantum computation and quantum information. American Association of Physics Teachers","DOI":"10.1119\/1.1463744"},{"key":"5162_CR2","unstructured":"Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, pp. 124\u2013134. IEEE"},{"issue":"2","key":"5162_CR3","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover LK (1997) Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett 79(2):325","journal-title":"Phys Rev Lett"},{"key":"5162_CR4","doi-asserted-by":"publisher","first-page":"428","DOI":"10.22331\/q-2021-04-08-428","volume":"5","author":"A Gilliam","year":"2021","unstructured":"Gilliam A, Woerner S, Gonciulea C (2021) Grover adaptive search for constrained polynomial binary optimization. Quantum 5:428","journal-title":"Quantum"},{"key":"5162_CR5","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal H, Mu\u00f1oz-Coreas E, Khalus V (2021) Quantum circuit designs of carry lookahead adder optimized for T-count T-depth and qubits. Sustain Comput Inform Syst 29:100457","journal-title":"Sustain Comput Inform Syst"},{"issue":"6","key":"5162_CR6","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 DB (2021) T-count optimized quantum circuit designs for single-precision floating-point division. Electronics 10(6):703","journal-title":"Electronics"},{"issue":"6","key":"5162_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11433-021-1874-2","volume":"65","author":"H-S Li","year":"2022","unstructured":"Li H-S, Fan P, Xia H, Long G-L (2022) The circuit design and optimization of quantum multiplier and divider. Sci China Phys Mech Astron 65(6):1\u201315","journal-title":"Sci China Phys Mech Astron"},{"issue":"7","key":"5162_CR8","first-page":"1","volume":"19","author":"M-A Asadi","year":"2020","unstructured":"Asadi M-A, Mosleh M, Haghparast M (2020) An efficient design of reversible ternary full-adder\/full-subtractor with low quantum cost. Quant Inform Process 19(7):1\u201321","journal-title":"Quant Inform Process"},{"issue":"4","key":"5162_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s11128-009-0106-0","volume":"8","author":"M Mohammadi","year":"2009","unstructured":"Mohammadi M, Eshghi M (2009) On figures of merit in reversible and quantum logic designs. Quant Inform Process 8(4):297\u2013318","journal-title":"Quant Inform Process"},{"issue":"6","key":"5162_CR10","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MITP.2019.2943134","volume":"21","author":"H Thapliyal","year":"2019","unstructured":"Thapliyal H, Mu\u00f1oz-Coreas E (2019) Design of quantum computing circuits. IT Prof 21(6):22\u201326","journal-title":"IT Prof"},{"key":"5162_CR11","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 (2018) Halving the cost of quantum addition. Quantum 2:74","journal-title":"Quantum"},{"key":"5162_CR12","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2017.12.025","volume":"752","author":"F Yan","year":"2018","unstructured":"Yan F, Iliyasu AM, Guo Y, Yang H (2018) Flexible representation and manipulation of audio signals on quantum computers. Theor Comput Sci 752:71\u201385","journal-title":"Theor Comput Sci"},{"key":"5162_CR13","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jpdc.2022.03.011","volume":"164","author":"R Wong","year":"2022","unstructured":"Wong R, Chang W-L (2022) Fast quantum algorithm for protein structure prediction in hydrophobic-hydrophilic model. J Parall Distrib Comput 164:178\u2013190","journal-title":"J Parall Distrib Comput"},{"issue":"2","key":"5162_CR14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.4.023136","volume":"4","author":"K Nakaji","year":"2022","unstructured":"Nakaji K, Uno S, Suzuki Y, Raymond R, Onodera T, Tanaka T, Tezuka H, Mitsuda N, Yamamoto N (2022) Approximate amplitude encoding in shallow parameterized quantum circuits and its application to financial market indicators. Phys Rev Res 4(2):023136","journal-title":"Phys Rev Res"},{"key":"5162_CR15","volume-title":"Computer architecture: a quantitative approach","author":"JL Hennessy","year":"2011","unstructured":"Hennessy JL, Patterson DA (2011) Computer architecture: a quantitative approach. Elsevier, US"},{"key":"5162_CR16","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/11860.001.0001","volume-title":"Quantum computing for everyone","author":"C Bernhardt","year":"2019","unstructured":"Bernhardt C (2019) Quantum computing for everyone. Mit Press, US"},{"issue":"2","key":"5162_CR17","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/aa66eb","volume":"2","author":"A Paler","year":"2017","unstructured":"Paler A, Polian I, Nemoto K, Devitt SJ (2017) Fault-tolerant, high-level quantum circuits: form, compilation and description. Quant Sci Technol 2(2):025003","journal-title":"Quant Sci Technol"},{"issue":"1","key":"5162_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms3524","volume":"4","author":"SJ Devitt","year":"2013","unstructured":"Devitt SJ, Stephens AM, Munro WJ, Nemoto K (2013) Requirements for fault-tolerant factoring on an atom-optics quantum computer. Nat Commun 4(1):1\u20138","journal-title":"Nat Commun"},{"issue":"6","key":"5162_CR19","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 (2013) A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits. IEEE Trans Comput Aided Des Integr Circ Syst 32(6):818\u2013830","journal-title":"IEEE Trans Comput Aided Des Integr Circ Syst"},{"key":"5162_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102810","volume":"170","author":"F Orts","year":"2020","unstructured":"Orts F, Ortega G, Combarro EF, Garz\u00f3n EM (2020) A review on reversible quantum adders. J Netw Comput Appl 170:102810","journal-title":"J Netw Comput Appl"},{"key":"5162_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11227-022-04401-x","volume":"78","author":"F Orts","year":"2022","unstructured":"Orts F, Ortega G, Filatovas E, Garz\u00b4on ME (2022) Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders. J Supercomput 78:1\u201319","journal-title":"J Supercomput"},{"key":"5162_CR22","doi-asserted-by":"publisher","unstructured":"Kotiyal S, Thapliyal H, Ranganathan N (2014) 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 https:\/\/doi.org\/10.1109\/VLSID.2014.101","DOI":"10.1109\/VLSID.2014.101"},{"issue":"2","key":"5162_CR23","doi-asserted-by":"publisher","first-page":"208","DOI":"10.3923\/itj.2009.208.213","volume":"8","author":"MS Islam","year":"2009","unstructured":"Islam MS, Rahman M, Begum Z, Hafiz MZ (2009) Low cost quantum realization of reversible multiplier circuit. Inform Technol J 8(2):208\u2013213","journal-title":"Inform Technol J"},{"issue":"02","key":"5162_CR24","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1142\/S0218126609005083","volume":"18","author":"M Haghparast","year":"2009","unstructured":"Haghparast M, Mohammadi M, Navi K, Eshghi M (2009) Optimized reversible multiplier circuit. J Circ Syst Comput 18(02):311\u2013323","journal-title":"J Circ Syst Comput"},{"issue":"1","key":"5162_CR25","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-016-1481-y","volume":"16","author":"HM Babu","year":"2017","unstructured":"Babu HM et al (2017) Cost-efficient design of a quantum multiplier-accumulator unit. Quant Inform Process 16(1):1\u201338","journal-title":"Quant Inform Process"},{"issue":"5","key":"5162_CR26","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 (2018) Quantum circuit design of a T-count optimized integer multiplier. IEEE Trans Comput 68(5):729\u2013739","journal-title":"IEEE Trans Comput"},{"key":"5162_CR27","doi-asserted-by":"crossref","unstructured":"Sajadimanesh S, Faye, JPL, Atoofian E (2022) Practical approximate quantum multipliers for nisq devices. In: Proceedings of the 19th ACM International Conference on Computing Frontiers, pp. 121\u2013130","DOI":"10.1145\/3528416.3530244"},{"key":"5162_CR28","doi-asserted-by":"crossref","unstructured":"Dibbo SV, Babu HMH, Jamal L (2016) An efficient design technique of a quantum divider circuit. In: 2016 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2102\u20132105. IEEE","DOI":"10.1109\/ISCAS.2016.7538994"},{"issue":"2","key":"5162_CR29","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TETC.2019.2910870","volume":"9","author":"H Thapliyal","year":"2019","unstructured":"Thapliyal H, Munoz-Coreas E, Varun T, Humble TS (2019) Quantum circuit designs of integer division optimizing t-count and t-depth. IEEE Trans Emerg Top Comput 9(2):1045\u20131056","journal-title":"IEEE Trans Emerg Top Comput"},{"key":"5162_CR30","doi-asserted-by":"crossref","unstructured":"Khosropour A, Aghababa H, Forouzandeh B (2011) Quantum division circuit based on restoring division algorithm. In: 2011 Eighth International Conference on Information Technology: New Generations, pp. 1037\u20131040. IEEE","DOI":"10.1109\/ITNG.2011.177"},{"issue":"5","key":"5162_CR31","first-page":"1","volume":"21","author":"S Yuan","year":"2022","unstructured":"Yuan S, Gao S, Wen C, Wang Y, Qu H, Wang Y (2022) A novel fault-tolerant quantum divider and its simulation. Quant Inform Process 21(5):1\u201315","journal-title":"Quant Inform Process"},{"key":"5162_CR32","doi-asserted-by":"crossref","unstructured":"Jamal L, Babu HMH (2013) Efficient approaches to design a reversible floating point divider. In: 2013 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 3004\u20133007. IEEE","DOI":"10.1109\/ISCAS.2013.6572511"},{"issue":"7","key":"5162_CR33","first-page":"1","volume":"18","author":"L Gyongyosi","year":"2019","unstructured":"Gyongyosi L, Imre S (2019) Quantum circuit design for objective function maximization in gate-model quantum computers. Quant Inform Process 18(7):1\u201333","journal-title":"Quant Inform Process"},{"issue":"6","key":"5162_CR34","doi-asserted-by":"publisher","first-page":"2115","DOI":"10.1007\/s10773-021-04829-6","volume":"60","author":"R Zhou","year":"2021","unstructured":"Zhou R, Wan C (2021) Quantum image scaling based on bilinear interpolation with decimals scaling ratio. Int J Theoret Phys 60(6):2115\u20132144","journal-title":"Int J Theoret Phys"},{"issue":"10","key":"5162_CR35","first-page":"1","volume":"19","author":"S Wang","year":"2020","unstructured":"Wang S, Wang Z, Li W, Fan L, Cui G, Wei Z, Gu Y (2020) Quantum circuits design for evaluating transcendental functions based on a function-value binary expansion method. Quant Inform Process 19(10):1\u201331","journal-title":"Quant Inform Process"},{"key":"5162_CR36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.66.022313","author":"K Murali","year":"2002","unstructured":"Murali K, Sinha N, Mahesh TS, Levitt M, Ramanathan KV, Kumar A (2002) Quantum-information processing by nuclear magnetic resonance: experimental implementation of half-adder and subtractor operations using an oriented spin-7\/2 system. Phys Rev A. https:\/\/doi.org\/10.1103\/PhysRevA.66.022313","journal-title":"Phys Rev A"},{"issue":"22","key":"5162_CR37","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 (2002) Quantum full adder and subtractor. Electron Lett 38(22):1343\u20131344","journal-title":"Electron Lett"},{"key":"5162_CR38","doi-asserted-by":"crossref","unstructured":"Thapliyal H, Ranganathan N (2011) A new design of the reversible subtractor circuit. In: 2011 11th IEEE International Conference on Nanotechnology, pp. 1430\u20131435. IEEE","DOI":"10.1109\/NANO.2011.6144350"},{"key":"5162_CR39","doi-asserted-by":"crossref","unstructured":"Maity H, Biswas A, Pal A, Bhattacharjee AK (2018) Quantum cost optimized design of reversible 2\u2019s complement code converter. In: 2018 IEEE Electron Devices Kolkata Conference (EDKCON), pp. 122\u2013125. IEEE","DOI":"10.1109\/EDKCON.2018.8770220"},{"issue":"11","key":"5162_CR40","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/s11128-019-2447-7","volume":"18","author":"F Orts","year":"2019","unstructured":"Orts F, Ortega G, Garz\u00f3n E (2019) An optimized quantum circuit for converting from sign-magnitude to two\u2019s complement. Quant Inform Process 18(11):332","journal-title":"Quant Inform Process"},{"issue":"9\u201310","key":"5162_CR41","doi-asserted-by":"publisher","first-page":"747","DOI":"10.26421\/QIC20.9-10-3","volume":"20","author":"F Orts","year":"2020","unstructured":"Orts F, Ortega G, Garzon EM (2020) Efficient reversible quantum design of sign-magnitude to two\u2019s complement converters. Quant Inform Computat 20(9\u201310):747\u2013765","journal-title":"Quant Inform Computat"},{"key":"5162_CR42","volume-title":"Digital design and computer architecture","author":"SL Harris","year":"2015","unstructured":"Harris SL, Harris D (2015) Digital design and computer architecture. Morgan Kaufmann, US"},{"key":"5162_CR43","volume-title":"Computer organization and design mips edition: the hardware\/software interface","author":"DA Patterson","year":"2013","unstructured":"Patterson DA, Hennessy JL (2013) Computer organization and design mips edition: the hardware\/software interface. Newnes, US"},{"key":"5162_CR44","doi-asserted-by":"crossref","unstructured":"Markov IL, Saeedi M (2012) Constant-optimized quantum circuits for modular multiplication and exponentiation. arXiv preprint arXiv:1202.6614","DOI":"10.26421\/QIC12.5-6-1"},{"issue":"4","key":"5162_CR45","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1007\/s11227-016-1676-0","volume":"72","author":"H Jayashree","year":"2016","unstructured":"Jayashree H, Thapliyal H, Arabnia HR, Agrawal VK (2016) Ancilla-input and garbage-output optimized design of a reversible quantum integer multiplier. J Supercomput 72(4):1477\u20131493","journal-title":"J Supercomput"},{"issue":"1","key":"5162_CR46","first-page":"1","volume":"11","author":"C-C Lin","year":"2014","unstructured":"Lin C-C, Chakrabarti A, Jha NK (2014) Qlib: quantum module library. ACM J Emerg Technol Comput Syst (JETC) 11(1):1\u201320","journal-title":"ACM J Emerg Technol Comput Syst (JETC)"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05162-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05162-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05162-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T19:03:27Z","timestamp":1686337407000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05162-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,18]]},"references-count":46,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["5162"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05162-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,18]]},"assertion":[{"value":"4 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}