{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:54:17Z","timestamp":1778255657500,"version":"3.51.4"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031637414","type":"print"},{"value":"9783031637421","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63742-1_12","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:11:01Z","timestamp":1718655061000},"page":"163-177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Representative Framework for\u00a0Implementing Quantum Finite Automata on\u00a0Real Devices"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4125-2151","authenticated-orcid":false,"given":"Aliya","family":"Khadieva","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2033-2881","authenticated-orcid":false,"given":"\u00d6zlem","family":"Salehi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2372-252X","authenticated-orcid":false,"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"key":"12_CR1","unstructured":"Getting started with native gates. https:\/\/ionq.com\/docs\/getting-started-with-native-gates"},{"key":"12_CR2","unstructured":"IBMQ backends. https:\/\/quantum-computing.ibm.com\/services\/resources"},{"key":"12_CR3","unstructured":"Transpiler. https:\/\/qiskit.org\/documentation\/apidoc\/transpiler.html"},{"issue":"6","key":"12_CR4","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1134\/S199508021606007X","volume":"37","author":"F Ablayev","year":"2016","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. Lobachevskii J. Math. 37(6), 670\u2013682 (2016)","journal-title":"Lobachevskii J. Math."},{"issue":"4","key":"12_CR5","first-page":"860","volume":"4","author":"F Ablayev","year":"2016","unstructured":"Ablayev, F., Ablayev, M., Vasiliev, A., Ziatdinov, M.: Quantum fingerprinting and quantum hashing. Computational and cryptographical aspects. Balt. J. Mod. Comput. 4(4), 860 (2016)","journal-title":"Balt. J. Mod. Comput."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS 1998, pp. 332\u2013341. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"issue":"20","key":"12_CR7","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. Theoret. Comput. Sci. 410(20), 1916\u20131922 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing. In: \u00c9ric Pin, J. (ed.) Handbook of Automata Theory, vol.\u00a02, chap.\u00a039, pp. 1457\u20131493 (2021)","DOI":"10.4171\/automata-2\/17"},{"key":"12_CR9","unstructured":"Bak\u00f3, B., Glos, A., Salehi, \u00d6., Zimbor\u00e1s, Z.: Near-optimal circuit design for variational quantum optimization. arXiv preprint arXiv:2209.03386 (2022)"},{"issue":"5","key":"12_CR10","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 (1995)","journal-title":"Phys. Rev. A"},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77980-1_1","volume-title":"Computational Science \u2013 ICCS 2021","author":"U Birkan","year":"2021","unstructured":"Birkan, U., Salehi, \u00d6., Olejar, V., Nurlu, C., Yakary\u0131lmaz, A.: Implementing quantum finite automata algorithms on noisy devices. In: Paszynski, M., Kranzlm\u00fcller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) ICCS 2021. LNCS, vol. 12747, pp. 3\u201316. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77980-1_1"},{"issue":"16","key":"12_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)","journal-title":"Phys. Rev. Lett."},{"key":"12_CR13","unstructured":"K\u0101lis, M.: Kvantu Algoritmu Realiz\u0101cija Fizisk\u0101 Kvantu Dator\u0101. Master\u2019s thesis, University of Latvia (2018)"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-319-58747-9_16","volume-title":"Computer Science \u2013 Theory and Applications","author":"K Khadiev","year":"2017","unstructured":"Khadiev, K., Khadieva, A.: Reordering method and hierarchies for quantum and classical ordered binary decision diagrams. In: Weil, P. (ed.) CSR 2017. LNCS, vol. 10304, pp. 162\u2013175. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-58747-9_16"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/s10773-019-04209-1","volume":"60","author":"K Khadiev","year":"2021","unstructured":"Khadiev, K., Khadieva, A.: Quantum online streaming algorithms with logarithmic memory. Int. J. Theor. Phys. 60, 608\u2013616 (2021)","journal-title":"Int. J. Theor. Phys."},{"issue":"1","key":"12_CR16","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)","journal-title":"Mathematics"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1007\/s11047-022-09904-3","volume":"22","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., Khadieva, A., Knop, A.: Exponential separation between quantum and classical ordered binary decision diagrams, reordering method and hierarchies. Nat. Comput. 22, 723\u2013736 (2022)","journal-title":"Nat. Comput."},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"6379","DOI":"10.1038\/s41598-022-10339-0","volume":"12","author":"TJ Maldonado","year":"2022","unstructured":"Maldonado, T.J., Flick, J., Krastanov, S., Galda, A.: Error rate reduction of single-qubit gates via noise-aware decomposition into native gates. Sci. Rep. 12(1), 6379 (2022)","journal-title":"Sci. Rep."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.96.022330","volume":"96","author":"DC McKay","year":"2017","unstructured":"McKay, D.C., Wood, C.J., Sheldon, S., Chow, J.M., Gambetta, J.M.: Efficient $$Z$$ gates for quantum computing. Phys. Rev. A 96(2), 022330 (2017)","journal-title":"Phys. Rev. A"},{"issue":"1\u20132","key":"12_CR20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoret. Comput. Sci. 237(1\u20132), 275\u2013306 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR21","unstructured":"M\u00f6tt\u00f6nen, M., Vartiainen, J.J.: Decompositions of general quantum gates. Trends in Quantum Computing Research (2006)"},{"key":"12_CR22","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, USA (2011)","edition":"10"},{"key":"12_CR23","unstructured":"O\u2019Gorman, B., Huggins, W.J., Rieffel, E.G., Whaley, K.B.: Generalized swap networks for near-term quantum computing. arXiv preprint arXiv:1905.05118 (2019)"},{"key":"12_CR24","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.: Quantum computing in the NISQ era and beyond. Quantum 2, 79\u2013590 (2018)","journal-title":"Quantum"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Qiskit contributors: Qiskit: an open-source framework for quantum computing (2023). https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11128-010-0201-2","volume":"10","author":"M Saeedi","year":"2011","unstructured":"Saeedi, M., Wille, R., Drechsler, R.: Synthesis of quantum circuits for linear nearest neighbor architectures. Quantum Inf. Process. 10, 355\u2013377 (2011)","journal-title":"Quantum Inf. Process."},{"key":"12_CR27","unstructured":"Salehi, \u00d6., Yakary\u0131lmaz, A.: Cost-efficient QFA algorithm for quantum computers. CoRR abs\/2107.02262 (2021). https:\/\/arxiv.org\/abs\/2107.02262"},{"issue":"10","key":"12_CR28","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.127.100501","volume":"127","author":"M Takita","year":"2021","unstructured":"Takita, M., Inoue, K., Lekuch, S., Minev, Z.K., Chow, J.M., Gambetta, J.M.: Exploiting dynamic quantum circuits in a quantum algorithm with superconducting qubits. Phys. Rev. Lett. 127(10), 100501 (2021)","journal-title":"Phys. Rev. Lett."},{"key":"12_CR29","doi-asserted-by":"crossref","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). EPTCS, vol.\u00a0386, pp. 269\u2013280 (2023)","DOI":"10.4204\/EPTCS.386.21"},{"issue":"Suppl 1","key":"12_CR30","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(Suppl 1), S390\u2013S394 (2023)","journal-title":"Russ. Microlectron."}],"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-031-63742-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T01:37:21Z","timestamp":1732239441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63742-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637414","9783031637421"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63742-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"18 June 2024","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":"Pohang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/ucnc-2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}