{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T03:12:28Z","timestamp":1771038748864,"version":"3.50.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T00:00:00Z","timestamp":1710288000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123278OB-I00"],"award-info":[{"award-number":["PID2021-123278OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123278OB-I00"],"award-info":[{"award-number":["PID2021-123278OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123278OB-I00"],"award-info":[{"award-number":["PID2021-123278OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["PID2021-123278OB-I00"],"award-info":[{"award-number":["PID2021-123278OB-I00"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"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":[[2024,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Quantum comparators hold substantial significance in the scientific community as fundamental components in a wide array of algorithms. In this research, we present an innovative approach where we explore the realm of comparator circuits, specifically focussing on three distinct circuit designs present in the literature. These circuits are notable for their use of T-gates, which have gained significant attention in circuit design due to their ability to enable the utilisation of error-correcting codes. However, it is important to note that T-gates come at a considerable computational cost. One of the key contributions of our work is the optimisation of the quantum gates used within these circuits. We articulate the proposed circuits employing Clifford+T gates, facilitating error correction code implementation. Additionally, we minimise T-gate usage, thereby reducing computational costs and fortifying circuit robustness against errors and environmental disturbances-essential for mitigating the effects of internal and external noise. Our methodology employs a bottom-up examination of comparator circuits, initiating with a detailed study of their gates. Subsequently, we systematically dissect the functions of these gates, thereby advancing towards a comprehensive understanding of the circuit\u2019s overall functionality. This meticulous examination forms the foundation of our research, enabling us to identify areas where optimisations can be made to improve their performance.<\/jats:p>","DOI":"10.1007\/s11227-024-05959-4","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:33:49Z","timestamp":1710362029000},"page":"13900-13917","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Lowering the cost of quantum comparator circuits"],"prefix":"10.1007","volume":"80","author":[{"given":"Laura M.","family":"Donaire","sequence":"first","affiliation":[]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Orts","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,13]]},"reference":[{"key":"5959_CR1","doi-asserted-by":"crossref","unstructured":"Nielsen MI, Chuang I (2011) Quantum computation and quantum information, 10th anniversary edn. Cambridge University Press, Cambridge","DOI":"10.1017\/CBO9780511976667"},{"issue":"7779","key":"5959_CR2","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute F, Arya K, Babbush R et al (2019) Quantum supremacy using a programmable superconducting processor. Nature 574(7779):505\u2013510","journal-title":"Nature"},{"key":"5959_CR3","unstructured":"Azure M (2021) What is quantum computing? https:\/\/azure.microsoft.com\/en-us\/overview\/what-is-quantum-computing\/"},{"key":"5959_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill J (2018) Quantum computing in the NISQ era and beyond. Quantum 2:79","journal-title":"Quantum"},{"key":"5959_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45933-2","volume-title":"Fundamentals of Quantum Information: Quantum Computation, Communication. Decoherence and All That","author":"D Heiss","year":"2002","unstructured":"Heiss D (2002) Fundamentals of Quantum Information: Quantum Computation, Communication. Decoherence and All That. Springer, Berlin"},{"key":"5959_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2020.102810","volume":"170","author":"F Orts","year":"2020","unstructured":"Orts F, Ortega G, Fern\u00e1ndez-Combarro E, Garz\u00f3n EM (2020) A review on reversible quantum adders. J Netw Comput Appl 170:102810","journal-title":"J Netw Comput Appl"},{"key":"5959_CR7","volume-title":"Mapping of subtractor and adder-subtractor circuits on reversible quantum gates","author":"H Thapliyal","year":"2016","unstructured":"Thapliyal H (2016) Mapping of subtractor and adder-subtractor circuits on reversible quantum gates, vol 9570. Springer, Berlin"},{"issue":"38","key":"5959_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1751-8113\/43\/38\/382002","volume":"43","author":"MK Thomsen","year":"2010","unstructured":"Thomsen MK, Gl\u00fcck R, Axelsen HB (2010) Reversible arithmetic logic unit for quantum arithmetic. J Phys A: Math Theor 43(38):382002","journal-title":"J Phys A: Math Theor"},{"key":"5959_CR9","doi-asserted-by":"publisher","first-page":"8433","DOI":"10.1007\/s11227-020-03576-5","volume":"77","author":"F Orts","year":"2021","unstructured":"Orts F, Ortega G, Cucura A, Fern\u00e1ndez-Combarro E, Garz\u00f3n EM (2021) Optimal fault-tolerant quantum comparators for image binarization. J Supercomput 77:8433\u20138444","journal-title":"J Supercomput"},{"key":"5959_CR10","doi-asserted-by":"publisher","first-page":"226","DOI":"10.22331\/q-2020-02-06-226","volume":"4","author":"A P\u00e9rez-Salinas","year":"2020","unstructured":"P\u00e9rez-Salinas A, Cervera-Lierta A, Gil-Fuster E, Latorre JI (2020) Data re-uploading for a universal quantum classifier. Quantum J 4:226","journal-title":"Quantum J"},{"issue":"5","key":"5959_CR11","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1007\/s11128-014-0843-6","volume":"14","author":"J Wang","year":"2015","unstructured":"Wang J, Jiang N, Wang L (2015) Quantum image translation. Quantum Inf Process 14(5):1589\u20131604","journal-title":"Quantum Inf Process"},{"key":"5959_CR12","doi-asserted-by":"publisher","first-page":"13323","DOI":"10.1007\/s11227-022-04401-x","volume":"78","author":"F Orts","year":"2022","unstructured":"Orts F, Ortega G, Filatovas E, Garz\u00f3n EM (2022) Implementation of three efficient 4-digit fault-tolerant quantum carry lookahead adders. J Supercomput 78:13323\u201313341","journal-title":"J Supercomput"},{"key":"5959_CR13","doi-asserted-by":"publisher","first-page":"205","DOI":"10.22331\/q-2019-12-02-205","volume":"3","author":"D Litinski","year":"2019","unstructured":"Litinski D (2019) Magic state distillation: not as costly as you think. Quantum 3:205","journal-title":"Quantum"},{"issue":"1","key":"5959_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.22364\/bjmc.2019.7.1.08","volume":"7","author":"F Orts","year":"2019","unstructured":"Orts F, Ortega G, Garz\u00f3n EM (2019) A faster half subtractor circuit using reversible quantum gates. Baltic J Modern Comput 7(1):99\u2013111","journal-title":"Baltic J Modern Comput"},{"key":"5959_CR15","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. The MIT Press, Cambridge"},{"issue":"3","key":"5959_CR16","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0020-0190(00)00084-3","volume":"75","author":"P Boykin","year":"2000","unstructured":"Boykin P, Mor T, Pulver M et al (2000) A new universal and fault-tolerant quantum basis. Inf Process Lett 75(3):101\u2013107","journal-title":"Inf Process Lett"},{"issue":"1","key":"5959_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","volume":"57","author":"D Gottesman","year":"1998","unstructured":"Gottesman D (1998) Theory of fault-tolerant quantum computation. Phys Rev A 57(1):127\u2013137","journal-title":"Phys Rev A"},{"key":"5959_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/s11128-020-02816-0","author":"P Niemann","year":"2020","unstructured":"Niemann P, Wille R, Drechsler R (2020) Advanced exact synthesis of Clifford+T circuits. Quantum Inf Process. https:\/\/doi.org\/10.1007\/s11128-020-02816-0","journal-title":"Quantum Inf Process"},{"issue":"6","key":"5959_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 Circuits Syst 32(6):818\u2013830","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5959_CR20","doi-asserted-by":"crossref","unstructured":"Miller DM, Soeken M, Drechsler R (2014) Mapping NCV circuits to optimized Clifford+T Circuits. In: International conference on reversible computation, pp 163\u2013175","DOI":"10.1007\/978-3-319-08494-7_13"},{"issue":"10","key":"5959_CR21","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 (2014) Polynomial-time T-depth optimization of Clifford+T circuits via matroid partitioning. IEEE Trans Comput Aided Des Integr Circuits Syst 33(10):1476\u20131489","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5959_CR22","volume":"29","author":"H Thapliyal","year":"2021","unstructured":"Thapliyal H, Mu\u00f1oz-Coreas E, Vladislav K (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"},{"key":"5959_CR23","doi-asserted-by":"publisher","first-page":"592","DOI":"10.22331\/q-2021-11-26-592","volume":"5","author":"P Czarnik","year":"2021","unstructured":"Czarnik P, Arrasmith A, Coles PJ, Cincio L (2021) Error mitigation with Clifford quantum-circuit data. Quantum 5:592","journal-title":"Quantum"},{"issue":"2","key":"5959_CR24","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 S (2017) Fault-tolerant, high-level quantum circuits: form, compilation and description. Quantum Sci Technol 2(2):025003","journal-title":"Quantum Sci Technol"},{"issue":"5","key":"5959_CR25","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.62.052316","volume":"62","author":"X Zhou","year":"2000","unstructured":"Zhou X, Leung DW, Chuang IL (2000) Methodology for quantum logic gate construction. Phys Rev A 62(5):052316","journal-title":"Phys Rev A"},{"key":"5959_CR26","volume-title":"Dancing with Qubits: how quantum computing works and how it can change the world","author":"RS Sutor","year":"2019","unstructured":"Sutor RS (2019) Dancing with Qubits: how quantum computing works and how it can change the world. Packt Publishing Ltd, Birmingham"},{"key":"5959_CR27","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1098\/rspa.2000.0585","volume":"456","author":"D Deutsch","year":"2000","unstructured":"Deutsch D, Hayden P (2000) Information flow in entangled quantum systems. R Soc 456:1759\u20131774","journal-title":"R Soc"},{"issue":"5","key":"5959_CR28","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco A, Bennett CH, Cleve R, DiVincenzo DP et al (1995) Elementary gates for quantum computation. Phys Rev A 52(5):3457\u20133467","journal-title":"Phys Rev A"},{"key":"5959_CR29","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.optlastec.2019.04.007","volume":"117","author":"Chen N Chanderkanta","year":"2019","unstructured":"Chanderkanta Chen N, Kaushik BK, Kumar S (2019) Implementation of reversible peres gate using electro-optic effect inside lithium-niobate based Mach-Zehnder interferometers. Opt Laser Technol 117:28\u201337","journal-title":"Opt Laser Technol"},{"issue":"3","key":"5959_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2491682","volume":"9","author":"H Thapliyal","year":"2013","unstructured":"Thapliyal H, Ranganathan N (2013) Design of efficient reversible logic-based binary and BCD adder circuits. ACM J Emerg Technol Comput Syst 9(3):1\u201331","journal-title":"ACM J Emerg Technol Comput Syst"},{"key":"5959_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11433-020-1582-8","volume":"63","author":"HS Li","year":"2020","unstructured":"Li HS, Fan P, Xia H, Peng H, Long G (2020) Efficient quantum arithmetic operation circuits for quantum image processing. Sci China Phys Mech Astron 63:1\u201313","journal-title":"Sci China Phys Mech Astron"},{"key":"5959_CR32","doi-asserted-by":"crossref","unstructured":"Thapliyal H, Ranganathan N, Ferreira R (2010) Design of a comparator tree based on reversible logic. In: 2010 10th IEEE Conference on Nanotechnology, pp 1113\u20131116","DOI":"10.1109\/NANO.2010.5697872"},{"key":"5959_CR33","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":"5959_CR34","doi-asserted-by":"crossref","unstructured":"Thapliyal H, Ranganathan N (2009) Design of efficient reversible binary subtractors based on a new reversible gate. In: 2009 IEEE Computer Society Annual Symposium on VLSI, pp 229\u2013234","DOI":"10.1109\/ISVLSI.2009.49"},{"issue":"25","key":"5959_CR35","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2009","unstructured":"Maslov D, Dueck G (2009) Improved quantum cost for n-bit Toffoli gates. IEE Electron Lett 39(25):1790\u20131791","journal-title":"IEE Electron Lett"},{"key":"5959_CR36","doi-asserted-by":"crossref","unstructured":"Kalita G, Saikia N (2015) Reversible comparator circuit using a new reversible gate. In: Proceedings of the Sixth International Conference on Computer and Communication Technology 2015","DOI":"10.1145\/2818567.2818685"},{"issue":"1","key":"5959_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2298\/FUEE0901001A","volume":"22","author":"A Al-Rabadi","year":"2009","unstructured":"Al-Rabadi A (2009) Closed-system quantum logic network implementation of the Viterbi algorithm. Facta Universitatis Series Electronics and Energetics 22(1):1\u201333","journal-title":"Facta Universitatis Series Electronics and Energetics"},{"issue":"12","key":"5959_CR38","doi-asserted-by":"publisher","first-page":"3727","DOI":"10.1007\/s10773-018-3886-0","volume":"57","author":"H Xia","year":"2018","unstructured":"Xia H, Li HS, Zhang H (2018) An efficient design of reversible multi-bit quantum comparator via only a single ancillary bit. Int J Theor Phys 57(12):3727\u20133744","journal-title":"Int J Theor Phys"},{"issue":"7","key":"5959_CR39","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 HS et al (2019) Novel multi-bit quantum comparators and their application in image binarization. Quantum Inf Process 18(7):229","journal-title":"Quantum Inf Process"},{"key":"5959_CR40","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/s10825-022-01858-0","volume":"21","author":"H Maity","year":"2022","unstructured":"Maity H (2022) Design and implementation of a two-qubit quantum comparator circuit (Q-CC). J Comput Electron 21:530\u2013534","journal-title":"J Comput Electron"},{"key":"5959_CR41","unstructured":"Pathak A (2013) Non-Hermitian quantum gates are more common than Hermitian quantum gates"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05959-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-05959-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05959-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,10]],"date-time":"2024-06-10T11:16:28Z","timestamp":1718018188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-05959-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,13]]},"references-count":41,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["5959"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-05959-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,13]]},"assertion":[{"value":"3 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2024","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"}}]}}