{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T02:04:11Z","timestamp":1780711451797,"version":"3.54.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156402","type":"print"},{"value":"9783032156419","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15641-9_21","type":"book-chapter","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T11:37:04Z","timestamp":1769773024000},"page":"307-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Algorithms for\u00a0Quantum Hashing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6367-0049","authenticated-orcid":false,"given":"Ilnar","family":"Zinnatullin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5151-9908","authenticated-orcid":false,"given":"Kamil","family":"Khadiev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"issue":"7","key":"21_CR1","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1134\/S199508021807003X","volume":"39","author":"MF Ablayev","year":"2018","unstructured":"Ablayev, M.F.: Efficient branching programs for quantum hash functions generated by small-biased sets. Lobachevskii J. Math. 39(7), 961\u2013966 (2018). https:\/\/doi.org\/10.1134\/S199508021807003X","journal-title":"Lobachevskii J. Math."},{"key":"21_CR2","unstructured":"Ablayev, F.M., Ablayev, M.F., Vasiliev, A.V.: Quantum Hashing: Effective Constructions. Lambert Academic Publishing, Saarbr\u00fccken, Germany (2023). in Russian"},{"key":"21_CR3","volume-title":"Quantum Hashing for Quantum Communications","author":"FM Ablayev","year":"2015","unstructured":"Ablayev, F.M., Vasiliev, A.V.: Quantum Hashing for Quantum Communications. LAMBERT Academic Publishing, Saarbr\u00fccken, Germany (2015). in Russian"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Ablayev, M., Khadiev, K., Salihova, N., Vasiliev, A.: Quantum algorithms for string processing. In: Badriev, I.B., Banderov, V., Lapin, S.A. (eds.) Proceedings of the 13th International Conference on Mesh Methods for Boundary-Value Problems and Applications. LNCSE, vol.\u00a0141, pp. 1\u201314. Springer, Cham, Switzerland (2022). https:\/\/doi.org\/10.1007\/978-3-030-87809-2_1","DOI":"10.1007\/978-3-030-87809-2_1"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Ablayev, F., Ablayev, M., Khadiev, K., Vasiliev, A.: Classical and quantum computations with restricted memory. In: B\u00f6ckenhauer, H.J., Komm, D., Unger, W. (eds.) Adventures Between Lower Bounds and Higher Altitudes: Essays Dedicated to Juraj Hromkovi\u010d on the Occasion of His 60th Birthday, LNCS, vol. 11011, pp. 129\u2013155. Springer, Cham, Switzerland (2018). https:\/\/doi.org\/10.1007\/978-3-319-98355-4_9","DOI":"10.1007\/978-3-319-98355-4_9"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"24","DOI":"10.3390\/quantum7020024","volume":"7","author":"F Ablayev","year":"2025","unstructured":"Ablayev, F., Khadiev, K., Vasiliev, A., Ziiatdinov, M.: Theory and applications of quantum hashing. Quantum Rep. 7(2), 24 (2025). https:\/\/doi.org\/10.3390\/quantum7020024","journal-title":"Quantum Rep."},{"issue":"12","key":"21_CR7","doi-asserted-by":"publisher","first-page":"1858","DOI":"10.3390\/math12121858","volume":"12","author":"F Ablayev","year":"2024","unstructured":"Ablayev, F., Salikhova, N., Ablayev, M.: Hybrid classical\u2013quantum text search based on hashing. Mathematics 12(12), 1858 (2024). https:\/\/doi.org\/10.3390\/math12121858","journal-title":"Mathematics"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","DOI":"10.1088\/1612-2011\/11\/2\/025202","volume":"11","author":"FM Ablayev","year":"2013","unstructured":"Ablayev, F.M., Vasiliev, A.V.: Cryptographic quantum hashing. Laser Phys. Lett. 11(2), 025202 (2013). https:\/\/doi.org\/10.1088\/1612-2011\/11\/2\/025202","journal-title":"Laser Phys. Lett."},{"key":"21_CR9","doi-asserted-by":"publisher","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: Strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS\u201998), pp. 332\u2013341. IEEE Computer Society (1998). https:\/\/doi.org\/10.1109\/SFCS.1998.743469","DOI":"10.1109\/SFCS.1998.743469"},{"issue":"20","key":"21_CR10","doi-asserted-by":"publisher","first-page":"1916","DOI":"10.1016\/j.tcs.2009.01.027","volume":"410","author":"A Ambainis","year":"2009","unstructured":"Ambainis, A., Nahimovs, N.: Improved constructions of quantum automata. Theor. Comput. Sci. 410(20), 1916\u20131922 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2009.01.027","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"21_CR11","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457\u20133467 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.52.3457","journal-title":"Phys. Rev. A"},{"issue":"16","key":"21_CR12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001). https:\/\/doi.org\/10.1103\/PhysRevLett.87.167902","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"21_CR13","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1103\/PhysRevA.51.1015","volume":"51","author":"DP DiVincenzo","year":"1995","unstructured":"DiVincenzo, D.P.: Two-bit gates are universal for quantum computation. Phys. Rev. A 51(2), 1015\u20131022 (1995). https:\/\/doi.org\/10.1103\/PhysRevA.51.1015","journal-title":"Phys. Rev. A"},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s11128-017-1799-0","volume":"17","author":"A Gainutdinova","year":"2018","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Unary probabilistic and quantum automata on promise problems. Quantum Inf. Process. 17(2), 28 (2018)","journal-title":"Quantum Inf. Process."},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Nondeterministic unitary obdds. In: Weil, P. (ed.) Computer Science - Theory and Applications - 12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, 8\u201312 June 2017, Proceedings. LNCS, vol. 10304, pp. 126\u2013140. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_13","DOI":"10.1007\/978-3-319-58747-9_13"},{"key":"21_CR16","doi-asserted-by":"crossref","unstructured":"Hyypp\u00e4, E.: Reducing leakage in single-qubit gates on superconducting quantum processors using analytical control pulse envelopes, 23 September 2024. https:\/\/www.meetiqm.com\/newsroom\/blog\/reducing-leakage-in-single-qubit-gates. Accessed 1 Oct 2024","DOI":"10.1103\/PRXQuantum.5.030353"},{"key":"21_CR17","doi-asserted-by":"publisher","unstructured":"Khadiev, K., Khadieva, A.: Two-way quantum and classical machines with small memory for online minimization problems. In: International Conference on Micro- and Nano-Electronics 2018. Proc. SPIE, vol. 11022, p. 110222T (2019). https:\/\/doi.org\/10.1117\/12.2522462","DOI":"10.1117\/12.2522462"},{"issue":"2","key":"21_CR18","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10773-019-04209-1","volume":"60","author":"K Khadiev","year":"2019","unstructured":"Khadiev, K., Khadieva, A.: Quantum online streaming algorithms with logarithmic memory. Int. J. Theor. Phys. 60(2), 608\u2013616 (2019). https:\/\/doi.org\/10.1007\/s10773-019-04209-1","journal-title":"Int. J. Theor. Phys."},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"143","DOI":"10.3390\/math10010143","volume":"10","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., Khadieva, A.: Quantum and classical log-bounded automata for the online disjointness problem. Mathematics 10(1), 143 (2022). https:\/\/doi.org\/10.3390\/math10010143","journal-title":"Mathematics"},{"issue":"4","key":"21_CR20","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11047-022-09904-3","volume":"22","author":"K Khadiev","year":"2023","unstructured":"Khadiev, K., Khadieva, A., Knop, A.: Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies. Nat. Comput. 22(4), 723\u2013736 (2023). https:\/\/doi.org\/10.1007\/s11047-022-09904-3","journal-title":"Nat. Comput."},{"key":"21_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.02.026","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., et al.: Two-way and one-way quantum and classical automata with advice for online minimization problems. Theor. Comput. Sci. (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.02.026","journal-title":"Theor. Comput. Sci."},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Khadieva, A., Salehi, \u00d6., Yakary\u0131lmaz, A.: A representative framework for implementing quantum finite automata on real devices. In: Cho, D.J., Kim, J. (eds.) Proceedings of the 21st International Conference on Unconventional Computation and Natural Computation (UCNC 2024), Pohang, South Korea, 17\u201321 June 2024. LNCS, vol. 14776, pp. 163\u2013177. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63742-1_12","DOI":"10.1007\/978-3-031-63742-1_12"},{"issue":"13","key":"21_CR23","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.132.130602","volume":"132","author":"B Koczor","year":"2024","unstructured":"Koczor, B., Morton, J.J.L., Benjamin, S.C.: Probabilistic interpolation of quantum rotation angles. Phys. Rev. Lett. 132(13), 130602 (2024). https:\/\/doi.org\/10.1103\/PhysRevLett.132.130602","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"21_CR24","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s00224-007-9097-3","volume":"45","author":"F Le Gall","year":"2009","unstructured":"Le Gall, F.: Exponential separation of quantum and classical online space complexity. Theory Comput. Syst. 45(2), 188\u2013202 (2009). https:\/\/doi.org\/10.1007\/s00224-007-9097-3","journal-title":"Theory Comput. Syst."},{"key":"21_CR25","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J.: Decompositions of general quantum gates. In: Shannon, S. (ed.) Trends in Quantum Computing Research, pp. 149\u2013172. Nova Science Publishers, New York, USA (2006)"},{"issue":"13","key":"21_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.93.130502","volume":"93","author":"M M\u00f6tt\u00f6nen","year":"2004","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J., Bergholm, V., Salomaa, M.M.: Quantum circuits for general multiqubit gates. Phys. Rev. Lett. 93(13), 130502 (2004). https:\/\/doi.org\/10.1103\/PhysRevLett.93.130502","journal-title":"Phys. Rev. Lett."},{"key":"21_CR27","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge, UK (2010)"},{"key":"21_CR28","doi-asserted-by":"publisher","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018). https:\/\/doi.org\/10.22331\/q-2018-08-06-79","DOI":"10.22331\/q-2018-08-06-79"},{"issue":"1","key":"21_CR29","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/681\/1\/012020","volume":"681","author":"A Vasiliev","year":"2016","unstructured":"Vasiliev, A.: A model of quantum communication device for quantum hashing. J. Phys: Conf. Ser. 681(1), 012020 (2016). https:\/\/doi.org\/10.1088\/1742-6596\/681\/1\/012020","journal-title":"J. Phys: Conf. Ser."},{"issue":"6","key":"21_CR30","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1134\/S1995080216060184","volume":"37","author":"A Vasiliev","year":"2016","unstructured":"Vasiliev, A.: Quantum hashing for finite abelian groups. Lobachevskii J. Math. 37(6), 753\u2013757 (2016). https:\/\/doi.org\/10.1134\/S1995080216060184","journal-title":"Lobachevskii J. Math."},{"issue":"Suppl. 1","key":"21_CR31","doi-asserted-by":"publisher","first-page":"S399","DOI":"10.1134\/S106373972360067X","volume":"52","author":"A Vasiliev","year":"2023","unstructured":"Vasiliev, A.: Constant-depth algorithm for quantum hashing. Russ. Microlectron. 52(Suppl. 1), S399\u2013S402 (2023). https:\/\/doi.org\/10.1134\/S106373972360067X","journal-title":"Russ. Microlectron."},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"1519212","DOI":"10.3389\/fcomp.2025.1519212","volume":"7","author":"M Ziiatdinov","year":"2025","unstructured":"Ziiatdinov, M., Khadieva, A., Khadiev, K.: Shallow implementation of quantum fingerprinting with application to quantum finite automata. Front. Comput. Sci. 7, 1519212 (2025). https:\/\/doi.org\/10.3389\/fcomp.2025.1519212","journal-title":"Front. Comput. Sci."},{"key":"21_CR33","doi-asserted-by":"publisher","unstructured":"Ziiatdinov, M., Khadieva, A., Yakary\u0131lmaz, A.: Gaps for shallow implementation of quantum finite automata. In: Proceedings of the 16th International Conference on Automata and Formal Languages (AFL 2023), pp. 269\u2013280. Electronic Proceedings in Theoretical Computer Science (2023). https:\/\/doi.org\/10.4204\/EPTCS.386.21","DOI":"10.4204\/EPTCS.386.21"},{"issue":"1","key":"21_CR34","doi-asserted-by":"publisher","first-page":"S390","DOI":"10.1134\/S1063739723600620","volume":"52","author":"I Zinnatullin","year":"2023","unstructured":"Zinnatullin, I., Khadiev, K., Khadieva, A.: Efficient implementation of amplitude form of quantum hashing using state-of-the-art quantum processors. Russ. Microlectron. 52(1), S390\u2013S394 (2023). https:\/\/doi.org\/10.1134\/S1063739723600620","journal-title":"Russ. Microlectron."},{"key":"21_CR35","unstructured":"Zinnatullin, I., Khadiev, K.: Efficient algorithms for quantum hashing. https:\/\/arxiv.org\/abs\/2507.07002 (2025). arXiv:2507.07002 [quant-ph]"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15641-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T11:37:05Z","timestamp":1769773025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15641-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156402","9783032156419"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15641-9_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webusers.i3s.univ-cotedazur.fr\/UCNC2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}