{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T06:33:51Z","timestamp":1774593231242,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030879921","type":"print"},{"value":"9783030879938","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87993-8_5","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"68-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantum Algorithm for Dyck Language with Multiple Types of Brackets"],"prefix":"10.1007","author":[{"given":"Kamil","family":"Khadiev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Kravchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"5_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":"5_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":"5_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Understanding quantum algorithms via query complexity. In: Proceedings of the International Conference of Mathematics 2018, vol. 4, pp. 3283\u20133304 (2018)","DOI":"10.1142\/9789813272880_0181"},{"key":"5_CR4","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), volume 170 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 8:1\u20138:14 (2020)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s11047-014-9441-x","volume":"14","author":"K Barr","year":"2014","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 (2014). https:\/\/doi.org\/10.1007\/s11047-014-9441-x","journal-title":"Nat. Comput."},{"issue":"4\u20135","key":"5_CR6","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":"5_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"5_CR8","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), volume 187 of Leibniz International Proceedings in Informatics (LIPIcs), pp. 19:1\u201319:19 (2021)"},{"key":"5_CR9","unstructured":"D\u00fcrr, C., H\u00f8yer, P.: A quantum algorithm for finding the minimum. arXiv:quant-ph\/9607014 (1996)"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-020-02939-4","volume":"20","author":"A Glos","year":"2021","unstructured":"Glos, A., Nahimovs, N., Balakirev, K., Khadiev, K.: Upper bounds on the probability of finding marked connected components using quantum walks. Quantum Inf. Process. 20(1), 1\u201323 (2021)","journal-title":"Quantum Inf. Process."},{"key":"5_CR11","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"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/3-540-45061-0_25","volume-title":"Automata, Languages and Programming","author":"P H\u00f8yer","year":"2003","unstructured":"H\u00f8yer, P., Mosca, M., de Wolf, R.: Quantum search on bounded-error inputs. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 291\u2013299. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_25"},{"key":"5_CR13","unstructured":"Jordan, S.: Quantum algorithms zoo (2021). http:\/\/quantumalgorithmzoo.org\/"},{"key":"5_CR14","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":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-030-19955-5_20","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Kravchenko","year":"2019","unstructured":"Kravchenko, D., Khadiev, K., Serov, D.: On the quantum and classical complexity of solving subtraction games. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 228\u2013236. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_20"},{"key":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-030-19311-9_13","volume-title":"Unconventional Computation and Natural Computation","author":"K Khadiev","year":"2019","unstructured":"Khadiev, K., Safina, L.: Quantum algorithm for dynamic programming approach for DAGs. Applications for Zhegalkin polynomial evaluation and some problems on DAGs. In: McQuillan, I., Seki, S. (eds.) UCNC 2019. LNCS, vol. 11493, pp. 150\u2013163. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19311-9_13"},{"key":"5_CR17","unstructured":"Khadiev, K., Mannapov, I., Safina, L.: The quantum version of classification decision tree constructing algorithm c5. 0. CEUR Workshop Proceedings 2500 (2019)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-030-61739-4_6","volume-title":"Reachability Problems","author":"D Kravchenko","year":"2020","unstructured":"Kravchenko, D., Khadiev, K., Serov, D., Kapralov, R.: Quantum-over-classical advantage in\u00a0solving multiplayer games. In: Schmitz, S., Potapov, I. (eds.) RP 2020. LNCS, vol. 12448, pp. 83\u201398. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61739-4_6"},{"key":"5_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","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, New York (2010)"},{"issue":"1","key":"5_CR20","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 Struc. Alg. 22(1), 98\u2013138 (2003)","journal-title":"Random Struc. Alg."}],"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-030-87993-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:39:42Z","timestamp":1633930782000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 October 2021","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":"Espoo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ucnc2021.cs.aalto.fi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}