{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:59:53Z","timestamp":1743083993182,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031637414"},{"type":"electronic","value":"9783031637421"}],"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_10","type":"book-chapter","created":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T20:11:01Z","timestamp":1718655061000},"page":"134-147","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Property Testing Algorithm for\u00a0the\u00a0Concatenation of\u00a0Two Palindromes Language"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[]},{"given":"Danil","family":"Serov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,6,18]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Grier, D., Schaeffer, L.: A quantum query complexity trichotomy for regular languages. In: 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pp. 942\u2013965. IEEE (2019)","DOI":"10.1109\/FOCS.2019.00061"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.26599\/BDMA.2019.9020016","volume":"3","author":"F Ablayev","year":"2019","unstructured":"Ablayev, F., Ablayev, M., Huang, J.Z., Khadiev, K., Salikhova, N., Wu, D.: On quantum methods for machine learning problems Part I: quantum tools. Big Data Mining Anal. 3(1), 41\u201355 (2019)","journal-title":"Big Data Mining Anal."},{"key":"10_CR3","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.) Mesh Methods for Boundary-Value Problems and Applications. LNCSE, vol. 141, pp. 1\u201314. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-87809-2_1","DOI":"10.1007\/978-3-030-87809-2_1"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Akmal, S., Jin, C.: Near-optimal quantum algorithms for string problems. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2791\u20132832. SIAM (2022)","DOI":"10.1137\/1.9781611977073.109"},{"issue":"6","key":"10_CR5","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N Alon","year":"2001","unstructured":"Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput. 30(6), 1842\u20131862 (2001)","journal-title":"SIAM J. Comput."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. In: Proceedings of the International Congress of Mathematicians 2018, vol.\u00a04, pp. 3283\u20133304 (2018)","DOI":"10.1142\/9789813272880_0181"},{"key":"10_CR7","unstructured":"Ambainis, A., et al.: Quantum lower and upper bounds for 2D-grid and Dyck language. In: 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 170, pp. 8:1\u20138:14 (2020)"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/s11128-023-03910-9","volume":"22","author":"A Ambainis","year":"2023","unstructured":"Ambainis, A., et al.: Quantum bounds for 2d-grid and Dyck language. Quantum Inf. Process. 22(5), 194 (2023)","journal-title":"Quantum Inf. Process."},{"issue":"3 &4","key":"10_CR9","first-page":"251","volume":"17","author":"S Arunachalam","year":"2017","unstructured":"Arunachalam, S., de Wolf, R.: Optimizing the number of gates in quantum search. Quantum Inf. Comput. 17(3 &4), 251\u2013261 (2017)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24587-2_19","volume-title":"Algorithms and Computation","author":"V Arvind","year":"2003","unstructured":"Arvind, V., Schuler, R.: The quantum query complexity of 0-1 knapsack and associated claw problems. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, pp. 168\u2013177. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-24587-2_19"},{"issue":"1","key":"10_CR11","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11047-014-9441-x","volume":"14","author":"K Barr","year":"2015","unstructured":"Barr, K., Fleming, T., Kendon, V.: Simulation methods for quantum walks on graphs applied to formal language recognition. Nat. Comput. 14(1), 145\u2013156 (2015)","journal-title":"Nat. Comput."},{"issue":"5","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"10_CR13","unstructured":"Black, P.E.: Dictionary of algorithms and data structures| NIST. Technical report (1998)"},{"issue":"4\u20135","key":"10_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschr. Phys."},{"key":"10_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800191","volume-title":"Advanced Data Structures","author":"P Brass","year":"2008","unstructured":"Brass, P.: Advanced Data Structures, vol. 193. Cambridge University Press, Cambridge (2008)"},{"key":"10_CR16","unstructured":"Brassard, G., Hoyer, P., Tapp, A.: Quantum algorithm for the collision problem. arXiv preprint quant-ph\/9705002 (1997)"},{"issue":"5","key":"10_CR17","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1137\/S0097539704442416","volume":"37","author":"H Buhrman","year":"2008","unstructured":"Buhrman, H., Fortnow, L., Newman, I., R\u00f6hrig, H.: Quantum property testing. SIAM J. Comput. 37(5), 1387\u20131400 (2008)","journal-title":"SIAM J. Comput."},{"key":"10_CR18","unstructured":"Buhrman, H., Patro, S., Speelman, F.: A framework of quantum strong exponential-time hypotheses. In: 38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 187, pp. 19:1\u201319:19 (2021)"},{"key":"10_CR19","unstructured":"Childs, A.M., Kothari, R., Kovacs-Deak, M., Sundaram, A., Wang, D.: Quantum divide and conquer. arXiv preprint arXiv:2210.06419 (2022)"},{"key":"10_CR20","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. McGraw-Hill, New York (2001)"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"De\u00a0La\u00a0Briandais, R.: File searching using variable length keys. In: Papers presented at the the 3\u20135 March 1959, Western Joint Computer Conference, pp. 295\u2013298. ACM (1959)","DOI":"10.1145\/1457838.1457895"},{"issue":"6","key":"10_CR22","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/C-M.1977.217750","volume":"10","author":"W Diffie","year":"1977","unstructured":"Diffie, W., Hellman, M.E.: Special feature exhaustive cryptanalysis of the NBS data encryption standard. Computer 10(6), 74\u201384 (1977)","journal-title":"Computer"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Fischer, E.: The art of uninformed decisions: a primer to property testing. In: Current Trends in Theoretical Computer Science: The Challenge of the New Century Vol 1: Algorithms and Complexity Vol 2: Formal Models and Semantics, pp. 229\u2013263. World Scientific (2004)","DOI":"10.1142\/9789812562494_0014"},{"issue":"4","key":"10_CR24","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM (JACM) 45(4), 653\u2013750 (1998)","journal-title":"J. ACM (JACM)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 212\u2013219. ACM (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"10_CR26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.66.052314","volume":"66","author":"LK Grover","year":"2002","unstructured":"Grover, L.K.: Trade-offs in the quantum search algorithm. Phys. Rev. A 66(5), 052314 (2002)","journal-title":"Phys. Rev. A"},{"key":"10_CR27","unstructured":"Jordan, S.: Quantum algorithms zoo (2023). http:\/\/quantumalgorithmzoo.org\/"},{"key":"10_CR28","unstructured":"Kapralov, R., Khadiev, K., Mokut, J., Shen, Y., Yagafarov, M.: Fast classical and quantum algorithms for online k-server problem on trees. In: CEUR Workshop Proceedings, vol. 3072, pp. 287\u2013301 (2022)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Ilikaev, A.: Quantum algorithms for the most frequently string search, intersection of two string sequences and sorting of strings problems. In: International Conference on Theory and Practice of Natural Computing, pp. 234\u2013245 (2019)","DOI":"10.1007\/978-3-030-34500-6_17"},{"key":"10_CR30","unstructured":"Khadiev, K.: Lecture notes on quantum algorithms. arXiv preprint arXiv:2212.14205 (2022)"},{"issue":"3\u20134","key":"10_CR31","first-page":"267","volume":"24","author":"K Khadiev","year":"2024","unstructured":"Khadiev, K., Bosch-Machado, C.M., Chen, Z., Wu, J.: Quantum algorithms for the shortest common superstring and text assembling problems. Quantum Inf. Comput. 24(3\u20134), 267\u2013294 (2024)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Enikeeva, S.: Quantum version of self-balanced binary search tree with strings as keys and applications. In: International Conference on Micro- and Nano-Electronics 2021, vol. 12157, pp. 587\u2013594. International Society for Optics and Photonics, SPIE (2022)","DOI":"10.1117\/12.2624619"},{"issue":"3","key":"10_CR33","doi-asserted-by":"publisher","first-page":"377","DOI":"10.3390\/math10030377","volume":"10","author":"K Khadiev","year":"2022","unstructured":"Khadiev, K., Ilikaev, A., Vihrovs, J.: Quantum algorithms for some strings problems based on quantum string comparator. Mathematics 10(3), 377 (2022)","journal-title":"Mathematics"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Kravchenko, D.: Quantum algorithm for dyck language with multiple types of brackets. In: Unconventional Computation and Natural Computation, pp. 68\u201383 (2021)","DOI":"10.1007\/978-3-030-87993-8_5"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Khadiev, K., Machado, C.M.B.: Quantum algorithm for the shortest superstring problem. In: International Conference on Micro- and Nano-Electronics 2021, vol. 12157, pp. 579 \u2013 586. International Society for Optics and Photonics, SPIE (2022)","DOI":"10.1117\/12.2624618"},{"issue":"3","key":"10_CR36","doi-asserted-by":"publisher","first-page":"207","DOI":"10.33581\/1561-4085-2021-24-3-207-221","volume":"24","author":"K Khadiev","year":"2021","unstructured":"Khadiev, K., Remidovskii, V.: Classical and quantum algorithms for assembling a text from a dictionary. Nonlinear Phenomena Complex Syst. 24(3), 207\u2013221 (2021)","journal-title":"Nonlinear Phenomena Complex Syst."},{"issue":"4","key":"10_CR37","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1007\/s11047-021-09863-1","volume":"20","author":"K Khadiev","year":"2021","unstructured":"Khadiev, K., Remidovskii, V.: Classical and quantum algorithms for constructing text from dictionary problem. Nat. Comput. 20(4), 713\u2013724 (2021)","journal-title":"Nat. Comput."},{"issue":"22","key":"10_CR38","doi-asserted-by":"publisher","first-page":"4707","DOI":"10.3390\/math11224707","volume":"11","author":"K Khadiev","year":"2023","unstructured":"Khadiev, K., Savelyev, N., Ziatdinov, M., Melnikov, D.: Noisy tree data structures and quantum applications. Mathematics 11(22), 4707 (2023)","journal-title":"Mathematics"},{"key":"10_CR39","unstructured":"Knuth, D.: Searching and sorting, the art of computer programming, vol. 3 (1973)"},{"issue":"2","key":"10_CR40","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Jr., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"10_CR41","first-page":"1","volume":"85","author":"F Le Gall","year":"2022","unstructured":"Le Gall, F., Seddighin, S.: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems. Algorithmica 85, 1\u201336 (2022)","journal-title":"Algorithmica"},{"key":"10_CR42","doi-asserted-by":"crossref","unstructured":"Le\u00a0Gall, F., Seddighin, S.: Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems. In: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)","DOI":"10.1007\/s00453-022-01066-z"},{"issue":"1","key":"10_CR43","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/s00453-015-0060-4","volume":"77","author":"A Montanaro","year":"2017","unstructured":"Montanaro, A.: Quantum pattern matching fast on average. Algorithmica 77(1), 16\u201339 (2017)","journal-title":"Algorithmica"},{"key":"10_CR44","doi-asserted-by":"crossref","unstructured":"Montanaro, A., de\u00a0Wolf, R.: A survey of quantum property testing. Theory of Computing, pp. 1\u201381 (2016)","DOI":"10.4086\/toc.gs.2016.007"},{"key":"10_CR45","doi-asserted-by":"crossref","unstructured":"Newman, I.: Testing of function that have small width branching programs. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 251\u2013258. IEEE (2000)","DOI":"10.1109\/SFCS.2000.892112"},{"key":"10_CR46","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"10_CR47","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/rsa.10067","volume":"22","author":"M Parnas","year":"2003","unstructured":"Parnas, M., Ron, D., Rubinfeld, R.: Testing membership in parenthesis languages. Random Struct. Algor. 22(1), 98\u2013138 (2003)","journal-title":"Random Struct. Algor."},{"key":"10_CR48","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-0013-1","volume-title":"Handbook of Randomized Computing","author":"S Rajasekaran","year":"2001","unstructured":"Rajasekaran, S.: Handbook of Randomized Computing, vol. 9. Springer, New York (2001)"},{"issue":"1","key":"10_CR49","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S1570-8667(03)00010-8","volume":"1","author":"H Ramesh","year":"2003","unstructured":"Ramesh, H., Vinay, V.: String matching in $$\\text{ O }(\\sqrt{n}+ \\sqrt{m})$$ quantum time. J. Discrete Algorithms 1(1), 103\u2013110 (2003)","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"10_CR50","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput. 25(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."},{"key":"10_CR51","unstructured":"de\u00a0Wolf, R.: Quantum Computing and Communication Complexity. University of Amsterdam (2001)"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T01:37:38Z","timestamp":1732239458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63742-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031637414","9783031637421"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63742-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}