{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:18:44Z","timestamp":1770970724636,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T00:00:00Z","timestamp":1768176000000},"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":["Quantum Inf Process"],"DOI":"10.1007\/s11128-025-05047-3","type":"journal-article","created":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T06:14:46Z","timestamp":1768198486000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A finite state automaton for quantum computing"],"prefix":"10.1007","volume":"25","author":[{"given":"YoungMin","family":"Kwon","sequence":"first","affiliation":[]},{"given":"Gul","family":"Agha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,12]]},"reference":[{"key":"5047_CR1","doi-asserted-by":"crossref","unstructured":"Kwon, Y., Agha, G.: Bounded quantum regular language generator. In: IEEE International Conference on Quantum Computing and Engineering, pp. 580\u2013590. (2023)","DOI":"10.1109\/QCE57702.2023.00072"},{"key":"5047_CR2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A Aho","year":"2006","unstructured":"Aho, A., Ullman, J., Sethi, R., Lam, M.: Compilers: Principles, Techniques, and Tools, 2nd edn. Addison Wesley, Boston, MA, USA (2006)","edition":"2"},{"key":"5047_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511805172","volume-title":"Digital Integrated Circuit Design: from VLSI Architectures to CMOS Fabrication","author":"H Kaeslin","year":"2008","unstructured":"Kaeslin, H.: Digital Integrated Circuit Design: from VLSI Architectures to CMOS Fabrication, 1st edn. Cambridge University Press, Cambridge, UK (2008)","edition":"1"},{"key":"5047_CR4","doi-asserted-by":"crossref","unstructured":"Kwon, Y., Kim, E.: Bounded model checking of hybrid systems for control. In: IEEE Transactions on Automatic Control, 60, pp. 2961\u20132976. IEEE, New York, NY, USA (2015)","DOI":"10.1109\/TAC.2015.2417839"},{"key":"5047_CR5","volume-title":"Elements of the Theory of Computation","author":"H Lewis","year":"1998","unstructured":"Lewis, H., Papadimitriou, C.H.: Elements of the Theory of Computation, 2nd edn. Prentice-Hall, Upper Saddle River, NJ (1998)","edition":"2"},{"key":"5047_CR6","doi-asserted-by":"crossref","unstructured":"De\u00a0Wulf, M., Doyen, L., Henzinger, T.A., Raskin, J.-F.: Antichains: A new algorithm for checking universality of finite automata. In: Computer Aided Verification, 4144, pp. 17\u201330. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11817963_5"},{"issue":"1","key":"5047_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1145\/2480359.2429124","volume":"48","author":"F Bonchi","year":"2013","unstructured":"Bonchi, F., Pous, D.: Checking nfa equivalence with bisimulations up to congruence. SIGPLAN Not. 48(1), 457\u2013468 (2013)","journal-title":"SIGPLAN Not."},{"key":"5047_CR8","doi-asserted-by":"publisher","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 66\u201375 (1997). https:\/\/doi.org\/10.1109\/SFCS.1997.646094","DOI":"10.1109\/SFCS.1997.646094"},{"issue":"1","key":"5047_CR9","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), 275\u2013306 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00191-1","journal-title":"Theoret. Comput. Sci."},{"key":"5047_CR10","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1038\/s41534-019-0163-x","volume":"5","author":"Y Tian","year":"2019","unstructured":"Tian, Y., Feng, T., Luo, M., Zheng, S., Zhou, X.: Experimental demonstration of quantum finite automaton. npj Quant. Inf. 5, 56 (2019). https:\/\/doi.org\/10.1038\/s41534-019-0163-x","journal-title":"npj Quant. Inf."},{"key":"5047_CR11","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E Clarke","year":"2001","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods Syst. Des. 19, 7\u201334 (2001)","journal-title":"Formal Methods Syst. Des."},{"key":"5047_CR12","doi-asserted-by":"publisher","unstructured":"A-tA-v et. al: Qiskit: an open-source framework for quantum computing (2021). https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"issue":"6","key":"5047_CR13","doi-asserted-by":"publisher","first-page":"710","DOI":"10.1109\/TCAD.2003.811448","volume":"22","author":"VV Shende","year":"2003","unstructured":"Shende, V.V., Prasad, A.K., Markov, I.L., Hayes, J.P.: Synthesis of reversible logic circuits. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 22(6), 710\u2013722 (2003). https:\/\/doi.org\/10.1109\/TCAD.2003.811448","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"5047_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9579-4","volume-title":"Towards a Design Flow for Reversible Logic","author":"R Wille","year":"2010","unstructured":"Wille, R., Drechsler, R.: Towards a Design Flow for Reversible Logic. Springer, Dordrecht (2010)"},{"key":"5047_CR15","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 (2018)","journal-title":"Quantum"},{"key":"5047_CR16","unstructured":"Choi, C.Q.: Ibm unveils 433-qubit osprey chip $$>$$ next year entanglement hits the kilo-scale with big blue\u2019s 1,121-qubit condor. IEEE Spectrum (2022)"},{"key":"5047_CR17","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1038\/d41586-023-03854-1","volume":"624","author":"D Castelvecchi","year":"2023","unstructured":"Castelvecchi, D.: Ibm releases first-ever 1,000-qubit quantum chip. Nature 624, 238 (2023)","journal-title":"Nature"},{"key":"5047_CR18","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)"},{"key":"5047_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.physrep.2024.03.002","volume":"1068","author":"K Blekos","year":"2023","unstructured":"Blekos, K., Brand, D., Ceschini, A., Chou, C.-H., Li, R.-H., Pandya, K., Summer, A.: A review on quantum approximate optimization algorithm and its variants. Phys. Rep. 1068, 1\u201366 (2023)","journal-title":"Phys. Rep."},{"key":"5047_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3389\/fphy.2014.00005","volume":"2","author":"A Lucas","year":"2014","unstructured":"Lucas, A.: Ising formulations of many np problems. Front. Phys. 2, 1\u201327 (2014)","journal-title":"Front. Phys."},{"key":"5047_CR21","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020)","journal-title":"Phys. Rev. X"},{"key":"5047_CR22","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ins.2022.11.020","volume":"619(C)","author":"Y Ruan","year":"2023","unstructured":"Ruan, Y., Yuan, Z., Xue, X., Liu, Z.: Quantum approximate optimization for combinatorial problems with constraints. Inf. Sci. 619(C), 98\u2013125 (2023)","journal-title":"Inf. Sci."},{"key":"5047_CR23","doi-asserted-by":"crossref","unstructured":"Marsh, S., Wang, J.B.: A quantum walk-assisted approximate algorithm for bounded np optimisation problems. Quantum Information Processing 18(61) (2019)","DOI":"10.1007\/s11128-019-2171-3"},{"key":"5047_CR24","doi-asserted-by":"publisher","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. Association for Computing Machinery, New York, NY, USA (1996). https:\/\/doi.org\/10.1145\/237814.237866","DOI":"10.1145\/237814.237866"},{"key":"5047_CR25","volume-title":"Model Checking","author":"EM Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, London, Cambridge (1999)"},{"key":"5047_CR26","unstructured":"Somenzi, F.: CUDD: CU decision diagram package release 2.4.1 (2005). http:\/\/vlsi.Colorado.edu\/"},{"key":"5047_CR27","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1126\/science.1057726","volume":"292","author":"E Farhi","year":"2001","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Lapan, J., Preda, A.L.D.: A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem. Science 292, 472\u2013475 (2001)","journal-title":"Science"},{"key":"5047_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.-K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Combinatorial Optimization 28, 58\u201381 (2014)","journal-title":"J. Combinatorial Optimization"},{"key":"5047_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3478519","volume":"2","author":"S Hadfield","year":"2021","unstructured":"Hadfield, S.: On the representation of boolean and real functions as hamiltonians for quantum computing. ACM Trans. Quant. Comput. 2, 1\u201321 (2021)","journal-title":"ACM Trans. Quant. Comput."},{"key":"5047_CR30","first-page":"83","volume":"1","author":"AR Conn","year":"1997","unstructured":"Conn, A.R., Scheinberg, K., Toint, P.L.: On the convergence of derivative-free methods for unconstrained optimization. Approx. Theory Optimization: Tributes MJD Powell 1, 83\u2013108 (1997)","journal-title":"Approx. Theory Optimization: Tributes MJD Powell"},{"key":"5047_CR31","unstructured":"SciPy: COBYLA. https:\/\/docs.scipy.org\/doc\/scipy\/reference\/optimize.minimize-cobyla.html"},{"key":"5047_CR32","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":"5047_CR33","doi-asserted-by":"crossref","unstructured":"Brassard, G., Hoyer, P., Tapp, A.: Quantum counting. In: Automata. Languages and Programming, pp. 820\u2013831. Springer, Berlin, Heidelberg (1998)","DOI":"10.1007\/BFb0055105"},{"key":"5047_CR34","unstructured":"LLC, R..C.: Rigetti announces public availability of ankaa-2 system with a 2.5x performance improvement compared to previous qpus. In: GlobeNewswire News Room (Press Release) (2024)"},{"key":"5047_CR35","unstructured":"Chow, J., Dial, O., Gambetta, J.: IBM Quantum breaks the 100-qubit processor barrier (2021). https:\/\/www.ibm.com\/quantum\/blog\/127-qubit-quantum-processor-eagle"},{"key":"5047_CR36","unstructured":"IonQ: Forte (2023). https:\/\/ionq.com\/quantum-systems\/forte"},{"key":"5047_CR37","unstructured":"Continuum: H2 (2023). https:\/\/www.quantinuum.com\/products-solutions\/quantinuum-systems\/system-model-h2"},{"key":"5047_CR38","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1109\/32.588521","volume":"23","author":"GJ Holzmann","year":"1997","unstructured":"Holzmann, G.J.: The model checker spin. IEEE Trans. Software Eng. 23, 279\u2013295 (1997)","journal-title":"IEEE Trans. Software Eng."},{"key":"5047_CR39","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TSE.2010.80","volume":"37","author":"Y Kwon","year":"2011","unstructured":"Kwon, Y., Agha, G.: Verifying the evolution of probability distributions governed by a DTMC. IEEE Trans. Software Eng. 37, 126\u2013141 (2011)","journal-title":"IEEE Trans. Software Eng."},{"key":"5047_CR40","unstructured":"Kwon, Y., Agha, G.: iLTLChecker: A probabilistic model checker for multiple DTMCs. In: International Conference on the Quantitative Evaluation of Systems (QEST). IEEE Computer Society, Washington, DC, USA (2005)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-025-05047-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-025-05047-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T07:25:52Z","timestamp":1770967552000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-025-05047-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,12]]},"references-count":40,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["5047"],"URL":"https:\/\/doi.org\/10.1007\/s11128-025-05047-3","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,12]]},"assertion":[{"value":"9 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2026","order":3,"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 no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"22"}}