{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T15:48:58Z","timestamp":1749916138776,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T00:00:00Z","timestamp":1708041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004504","name":"Lietuvos Mokslo Taryba","doi-asserted-by":"publisher","award":["S-MIP-21-53"],"award-info":[{"award-number":["S-MIP-21-53"]}],"id":[{"id":"10.13039\/501100004504","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s11227-024-05916-1","type":"journal-article","created":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T11:02:39Z","timestamp":1708081359000},"page":"12527-12542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum circuits for computing Hamming distance requiring fewer T gates"],"prefix":"10.1007","volume":"80","author":[{"given":"Francisco","family":"Orts","sequence":"first","affiliation":[]},{"given":"Gloria","family":"Ortega","sequence":"additional","affiliation":[]},{"given":"El\u00edas F.","family":"Combarro","sequence":"additional","affiliation":[]},{"given":"Ignacio F.","family":"R\u00faa","sequence":"additional","affiliation":[]},{"given":"Ester M.","family":"Garz\u00f3n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,16]]},"reference":[{"issue":"7285","key":"5916_CR1","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1038\/nature08812","volume":"464","author":"TD Ladd","year":"2010","unstructured":"Ladd TD, Jelezko F, Laflamme R, Nakamura Y, Monroe C, O\u2019Brien JL (2010) Quantum computers. Nature 464(7285):45\u201353","journal-title":"Nature"},{"issue":"2","key":"5916_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor PW (1999) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev 41(2):303\u2013332","journal-title":"SIAM Rev"},{"key":"5916_CR3","doi-asserted-by":"crossref","unstructured":"Grover LK (1996) A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp 212\u2013219","DOI":"10.1145\/237814.237866"},{"key":"5916_CR4","unstructured":"Farhi E, Goldstone J, Gutmann S, Sipser M (2000) Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106"},{"issue":"22","key":"5916_CR5","doi-asserted-by":"publisher","first-page":"5188","DOI":"10.1103\/PhysRevLett.86.5188","volume":"86","author":"R Raussendorf","year":"2001","unstructured":"Raussendorf R, Briegel HJ (2001) A one-way quantum computer. Phys Rev Lett 86(22):5188","journal-title":"Phys Rev Lett"},{"key":"5916_CR6","volume-title":"Quantum computation and quantum information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen MA, Chuang IL (2010) Quantum computation and quantum information. Cambridge University Press, Cambridge, UK"},{"key":"5916_CR7","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":"5916_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1146\/annurev-conmatphys-031119-050651","volume":"11","author":"G Torlai","year":"2020","unstructured":"Torlai G, Melko RG (2020) Machine-learning quantum states in the NISQ era. Ann Rev Condens Matter Phys 11:325\u2013344","journal-title":"Ann Rev Condens Matter Phys"},{"issue":"3","key":"5916_CR9","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1080\/00107514.2019.1667078","volume":"60","author":"J Roffe","year":"2019","unstructured":"Roffe J (2019) Quantum error correction: an introductory guide. Contemp Phys 60(3):226\u2013245","journal-title":"Contemp Phys"},{"issue":"1","key":"5916_CR10","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","journal-title":"Phys Rev A"},{"key":"5916_CR11","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 4:226","journal-title":"Quantum"},{"issue":"11","key":"5916_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(11):13323\u201341","journal-title":"J Supercomput"},{"issue":"8","key":"5916_CR13","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, Filatovas E, Garz\u00f3n EM (2021) Optimal fault-tolerant quantum comparators for image binarization. J Supercomput 77(8):8433\u20138444","journal-title":"J Supercomput"},{"issue":"3\u20134","key":"5916_CR14","first-page":"318","volume":"15","author":"N Wiebe","year":"2015","unstructured":"Wiebe N, Kapoor A, Svore KM (2015) Quantum nearest-neighbor algorithms for machine learning. Quantum Inf Comput 15(3\u20134):318\u2013358","journal-title":"Quantum Inf Comput"},{"key":"5916_CR15","volume-title":"Coding and information theory","author":"RW Hamming","year":"1986","unstructured":"Hamming RW (1986) Coding and information theory. Prentice-Hall Inc, New Jersey, US"},{"key":"5916_CR16","unstructured":"Norouzi M, Fleet DJ, Salakhutdinov RR (2012) Hamming distance metric learning. Adv Neural Inform Process Syst, 25"},{"key":"5916_CR17","doi-asserted-by":"crossref","unstructured":"Zhang L, Zhang Y, Tang J, Lu K, Tian Q (2013) Binary code ranking with weighted Hamming distance. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp 1586\u20131593","DOI":"10.1109\/CVPR.2013.208"},{"key":"5916_CR18","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.future.2019.11.034","volume":"105","author":"R Taheri","year":"2020","unstructured":"Taheri R, Ghahramani M, Javidan R, Shojafar M, Pooranian Z, Conti M (2020) Similarity-based android malware detection using Hamming distance of static binary features. Futur Gener Comput Syst 105:230\u2013247","journal-title":"Futur Gener Comput Syst"},{"key":"5916_CR19","doi-asserted-by":"publisher","first-page":"767","DOI":"10.22331\/q-2022-07-20-767","volume":"6","author":"N Raveendran","year":"2022","unstructured":"Raveendran N, Rengaswamy N, Rozpedek F, Raina A, Jiang L, Vasi\u0107 B (2022) Finite rate QLDPC-GKP coding scheme that surpasses the CSS Hamming bound. Quantum 6:767","journal-title":"Quantum"},{"issue":"1","key":"5916_CR20","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/s42484-020-00017-7","volume":"2","author":"K Kathuria","year":"2020","unstructured":"Kathuria K, Ratan A, McConnell M, Bekiranov S (2020) Implementation of a Hamming distance-like genomic quantum classifier using inner products on ibmqx2 and ibmq_16_melbourne. Quantum Mach Intell 2(1):7","journal-title":"Quantum Mach Intell"},{"issue":"1","key":"5916_CR21","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/s11128-021-03361-0","volume":"21","author":"J Li","year":"2022","unstructured":"Li J, Lin S, Yu K, Guo G (2022) Quantum K-nearest neighbor classification algorithm based on Hamming distance. Quantum Inf Process 21(1):18","journal-title":"Quantum Inf Process"},{"key":"5916_CR22","doi-asserted-by":"crossref","unstructured":"Chomboon K, Chujai P, Teerarassamee P, Kerdprasop K, Kerdprasop N (2015) An empirical study of distance metrics for K-nearest neighbor algorithm. In: Proceedings of the 3rd International Conference on Industrial Application Engineering, Vol 2","DOI":"10.12792\/iciae2015.051"},{"issue":"5","key":"5916_CR23","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, Margolus N, Shor P, Sleator T, Smolin JA, Weinfurter H (1995) Elementary gates for quantum computation. Phys Rev A 52(5):3457","journal-title":"Phys Rev A"},{"key":"5916_CR24","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, Massachusetts, USA"},{"key":"5916_CR25","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. Springer","DOI":"10.1007\/978-3-319-08494-7_13"},{"issue":"6","key":"5916_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 (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"},{"issue":"10","key":"5916_CR27","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":"5916_CR28","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"},{"key":"5916_CR29","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. Quantum Inf Process 8:297\u2013318","journal-title":"Quantum Inf Process"},{"issue":"6","key":"5916_CR30","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 Professional 21(6):22\u201326","journal-title":"IT Professional"},{"key":"5916_CR31","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"},{"key":"5916_CR32","volume-title":"Computer organization and design arm edition: the hardware software interface","author":"DA Patterson","year":"2016","unstructured":"Patterson DA, Hennessy JL (2016) Computer organization and design arm edition: the hardware software interface. Morgan kaufmann, Massachusetts, USA"},{"issue":"25","key":"5916_CR33","doi-asserted-by":"publisher","first-page":"1790","DOI":"10.1049\/el:20031202","volume":"39","author":"D Maslov","year":"2003","unstructured":"Maslov D, Dueck GW (2003) Improved quantum cost for N-bit Toffoli gates. Electron Lett 39(25):1790\u20131791","journal-title":"Electron Lett"},{"issue":"5","key":"5916_CR34","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":"5916_CR35","unstructured":"Gosset D, Kliuchnikov V, Mosca M, Russo V (2013) An algorithm for the T-count. arXiv preprint arXiv:1308.4134"},{"issue":"6","key":"5916_CR36","doi-asserted-by":"publisher","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):260311","journal-title":"Sci China Phys Mech Astron"},{"key":"5916_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3170008","volume":"3","author":"T Satoh","year":"2022","unstructured":"Satoh T, Oomura S, Sugawara M, Yamamoto N (2022) Pulse-engineered controlled-v gate and its applications on superconducting quantum device. IEEE Trans Quantum Eng 3:1\u201310","journal-title":"IEEE Trans Quantum Eng"},{"issue":"9","key":"5916_CR38","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1109\/TCAD.2005.858352","volume":"25","author":"WN Hung","year":"2006","unstructured":"Hung WN, Song X, Yang G, Yang J, Perkowski M (2006) Optimal synthesis of multiple output boolean functions using a set of quantum gates by symbolic reachability analysis. IEEE Trans Comput Aided Des Integr Circuits Syst 25(9):1652\u20131663","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"5916_CR39","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":"5916_CR40","doi-asserted-by":"crossref","unstructured":"Orts F, Ortega G, Garz\u00f3n EM (2022) Studying the cost of N-qubit Toffoli gates. In: International Conference on Computational Science, pp 122\u2013128. Springer","DOI":"10.1007\/978-3-031-08760-8_10"},{"key":"5916_CR41","doi-asserted-by":"crossref","unstructured":"Thapliyal H (2016) Mapping of subtractor and adder-subtractor circuits on reversible quantum gates. In: Transactions on Computational Science XXVII, pp 10\u201334. Springer, New York, USA","DOI":"10.1007\/978-3-662-50412-3_2"},{"key":"5916_CR42","unstructured":"Qiskit contributors (2023) Qiskit: An open-source framework for quantum computing. 10.5281\/zenodo.2573505"},{"key":"5916_CR43","doi-asserted-by":"publisher","first-page":"2770","DOI":"10.1007\/s11227-020-03376-x","volume":"77","author":"G Carrascal","year":"2021","unstructured":"Carrascal G, Del Barrio AA, Botella G (2021) First experiences of teaching quantum computing. J Supercomput 77:2770\u20132799","journal-title":"J Supercomput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05916-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-024-05916-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-024-05916-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T10:42:24Z","timestamp":1717497744000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-024-05916-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,16]]},"references-count":43,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["5916"],"URL":"https:\/\/doi.org\/10.1007\/s11227-024-05916-1","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2024,2,16]]},"assertion":[{"value":"11 January 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 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"}}]}}