{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,25]],"date-time":"2024-03-25T18:07:33Z","timestamp":1711390053734},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"13","license":[{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T00:00:00Z","timestamp":1650326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"the growth project of young scientific and technological talents in colleges and universities of Guizhou Province","award":["KY[2019]157"],"award-info":[{"award-number":["KY[2019]157"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s00500-022-07063-2","type":"journal-article","created":{"date-parts":[[2022,4,19]],"date-time":"2022-04-19T11:03:04Z","timestamp":1650366184000},"page":"5965-5974","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Decompositions of average probability uninitialized sequential quantum machines"],"prefix":"10.1007","volume":"26","author":[{"given":"Feidan","family":"Huang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,19]]},"reference":[{"key":"7063_CR1","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A Ambainis","year":"2002","unstructured":"Ambainis A, Watrous J (2002) Two-way finite automata with quantum and classical states. Theor Comput Sci 287:299\u2013311","journal-title":"Theor Comput Sci"},{"key":"7063_CR2","first-page":"125","volume":"67","author":"A Ambainis","year":"2015","unstructured":"Ambainis A, Yakaryilmaz A (2015) Automata and quantum computing. Comput Sci 67:125\u2013128","journal-title":"Comput Sci"},{"key":"7063_CR3","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/j.jcss.2021.05.002","volume":"122","author":"PC Bell","year":"2021","unstructured":"Bell PC, Hirvensalo M (2021) On injectivity of quantum finite automata. J Comput Syst Sci 122:19\u201333","journal-title":"J Comput Syst Sci"},{"key":"7063_CR4","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P Benioff","year":"1980","unstructured":"Benioff P (1980) The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines. J Stat Phys 22:563\u2013591","journal-title":"J Stat Phys"},{"key":"7063_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsh","year":"1985","unstructured":"Deutsh D (1985) Quantum theory, the Church-Turing principle and the universal quantum computer. Proc R Soc Lond A 400:97\u2013117","journal-title":"Proc R Soc Lond A"},{"key":"7063_CR6","doi-asserted-by":"publisher","first-page":"368","DOI":"10.22331\/q-2020-11-30-368","volume":"4","author":"T Farrelly","year":"2020","unstructured":"Farrelly T (2020) A review of quantum cellular automata. Quantum 4:368\u2013426","journal-title":"Quantum"},{"key":"7063_CR7","first-page":"467","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman RP (1982) Simulating physics with computers. J Stat Phys 21:467\u2013488","journal-title":"J Stat Phys"},{"key":"7063_CR8","first-page":"326","volume":"79","author":"L Grover","year":"1997","unstructured":"Grover L (1997) Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett 79:326\u2013328","journal-title":"Phys Rev Lett"},{"key":"7063_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1017\/S0960129515000158","volume":"27","author":"J Gruska","year":"2017","unstructured":"Gruska J, Qiu D, Zheng S (2017) Generalizations of the distributed Deutsch\u2013Jozsa promise problem. Math Struct Comput Sci 27:311\u2013331","journal-title":"Math Struct Comput Sci"},{"key":"7063_CR10","doi-asserted-by":"publisher","first-page":"2151","DOI":"10.1023\/A:1003692611402","volume":"39","author":"S Gudder","year":"2000","unstructured":"Gudder S (2000) Quantum computers. Int J Theor Phys 39:2151\u20132177","journal-title":"Int J Theor Phys"},{"key":"7063_CR11","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1007\/s10773-019-04031-9","volume":"58","author":"F Huang","year":"2019","unstructured":"Huang F (2019) On coverings of products of uninitialized sequential quantum machines. Int J Theor Phys 58:1418\u20131440","journal-title":"Int J Theor Phys"},{"key":"7063_CR12","unstructured":"Huang F, Xie Zh, Deng Z, Yang J (2017a) Algebraic properties of uninitialized sequential quantum machines. Chin J Eng Math 34:262\u2013282"},{"key":"7063_CR13","unstructured":"Huang F, Deng Z, Yang J (2017b) Products of sequential quantum machines and their matrix forms. Fuzzy Syst Math 31:127\u2013146"},{"key":"7063_CR14","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.tcs.2006.03.001","volume":"358","author":"L Li","year":"2006","unstructured":"Li L, Qiu D (2006) Determination of equivalence between quantum sequential machines. Theor Comput Sci 358:65\u201374","journal-title":"Theor Comput Sci"},{"key":"7063_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2008.03.021","volume":"403","author":"L Li","year":"2008","unstructured":"Li L, Qiu D (2008) Determining the equivalence for one-way quantum finite automata. Theor Comput Sci 403:42\u201351","journal-title":"Theor Comput Sci"},{"key":"7063_CR16","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1016\/j.tcs.2008.08.026","volume":"410","author":"L Li","year":"2009","unstructured":"Li L, Qiu D (2009) A note on quantum sequential machines. Theor Comput Sci 410:2529\u20132535","journal-title":"Theor Comput Sci"},{"key":"7063_CR17","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0304-3975(95)00004-G","volume":"145","author":"O Maler","year":"1995","unstructured":"Maler O (1995) A decomposition theorem for probabilistic transition systems. Theor Comput Sci 145:391\u2013396","journal-title":"Theor Comput Sci"},{"key":"7063_CR18","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.ic.2012.07.002","volume":"218","author":"P Mateus","year":"2012","unstructured":"Mateus P, Qiu D, Li L (2012) On the complexity of minimizing probabilistic and quantum automata. Inf Comput 218:36\u201353","journal-title":"Inf Comput"},{"key":"7063_CR19","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1051\/ita:2006007","volume":"40","author":"C Mereghetti","year":"2006","unstructured":"Mereghetti C, Palano B (2006) Quantum finite automata with control language. RAIRO-Theor Inf Appl 40:315\u2013332","journal-title":"RAIRO-Theor Inf Appl"},{"key":"7063_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 JP (2000) Quantum automata and quantum grammars. Theor Comput Sci 237:275\u2013306","journal-title":"Theor Comput Sci"},{"key":"7063_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-021-03021-3","volume":"20","author":"P Nimbe","year":"2021","unstructured":"Nimbe P, Weyori BA, Adekoya AF (2021) Models in quantum computing: a systematic review. Quantum Inf Process 20:1\u201361","journal-title":"Quantum Inf Process"},{"key":"7063_CR22","volume-title":"Introduction to probabilistic automata","author":"A Paz","year":"1971","unstructured":"Paz A (1971) Introduction to probabilistic automata. Academic Press, New York"},{"key":"7063_CR23","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1023\/A:1015731405826","volume":"41","author":"D Qiu","year":"2002","unstructured":"Qiu D (2002) Characterization of sequential quantum machines. Int J Theor Phys 41:811\u2013822","journal-title":"Int J Theor Phys"},{"key":"7063_CR24","doi-asserted-by":"publisher","first-page":"1627","DOI":"10.1023\/A:1021031915281","volume":"41","author":"D Qiu","year":"2002","unstructured":"Qiu D (2002) Quantum pushdown automata. Int J Theor Phys 41:1627\u20131639","journal-title":"Int J Theor Phys"},{"key":"7063_CR25","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ic.2003.11.003","volume":"190","author":"D Qiu","year":"2004","unstructured":"Qiu D (2004) Automata theory based on quantum logic: some characterizations. Inf Comput 190:179\u2013195","journal-title":"Inf Comput"},{"key":"7063_CR26","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2007.05.026","volume":"386","author":"D Qiu","year":"2007","unstructured":"Qiu D (2007) Automata theory based on quantum logic: reversibilities and pushdown automata. Theor Comput Sci 386:38\u201356","journal-title":"Theor Comput Sci"},{"key":"7063_CR27","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s11704-008-0022-y","volume":"2","author":"D Qiu","year":"2008","unstructured":"Qiu D, Li L (2008) An overview of quantum computation models: quantum automata. Front Comput Sci China 2:193\u2013207","journal-title":"Front Comput Sci China"},{"key":"7063_CR28","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.tcs.2003.08.007","volume":"312","author":"D Qiu","year":"2004","unstructured":"Qiu D, Ying M (2004) Characterizations of quantum automata. Theor Comput Sci 312:479\u2013489","journal-title":"Theor Comput Sci"},{"key":"7063_CR29","doi-asserted-by":"publisher","first-page":"3006","DOI":"10.1016\/j.tcs.2009.03.040","volume":"410","author":"D Qiu","year":"2009","unstructured":"Qiu D, Yu S (2009) Hierarchy and equivalence of multi-letter quantum finite automata. Theor Comput Sci 410:3006\u20133017","journal-title":"Theor Comput Sci"},{"key":"7063_CR30","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00236-011-0139-6","volume":"48","author":"D Qiu","year":"2011","unstructured":"Qiu D, Li L, Zou X, Mateus P, Gruska J (2011) Multi-letter quantum finite automata: decidability of the equivalence and minimization of states. Acta Inf 48:271\u2013290","journal-title":"Acta Inf"},{"key":"7063_CR31","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor PW (1997) Polynomial-Time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484\u20131509","journal-title":"SIAM J Comput"},{"key":"7063_CR32","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ijar.2020.11.002","volume":"129","author":"H Wang","year":"2021","unstructured":"Wang H, Zhao L, Li P (2021) Nondeterministic finite automata based on quantum logic: language equivalence relation and robustness. Int J Approx Reason 129:20\u201340","journal-title":"Int J Approx Reason"},{"key":"7063_CR33","first-page":"47","volume":"45","author":"Z Wu","year":"2009","unstructured":"Wu Z, Deng P, Yi Z (2009) Products and decomposition of probabilistic finite automata. Comput Eng Appl 45:47\u201350","journal-title":"Comput Eng Appl"},{"key":"7063_CR34","first-page":"2691","volume":"50","author":"Z Xie","year":"2013","unstructured":"Xie Z, Zhai Y, Deng P, Yi Z (2013) Algebraic properties of probabilistic finite state automata. J Comput Res Dev 50:2691\u20132698","journal-title":"J Comput Res Dev"},{"key":"7063_CR35","doi-asserted-by":"crossref","unstructured":"Ying M (2000) Automata theory based on quantum logic i. Int J Theor Phys 39:985\u2013995","DOI":"10.1023\/A:1003642222321"},{"key":"7063_CR36","doi-asserted-by":"crossref","unstructured":"Ying M (2000) Automata theory based on quantum logic ii. Int J Theor Phys 39:2545\u20132557","DOI":"10.1023\/A:1026453524064"},{"key":"7063_CR37","doi-asserted-by":"crossref","unstructured":"Zheng S, Li L, Qiu D (2011) Two-tape finite automata with quantum and classical states. Int J Theor Phys 50:1262\u20131281","DOI":"10.1007\/s10773-010-0582-0"},{"key":"7063_CR38","doi-asserted-by":"crossref","unstructured":"Zheng S, Qiu D, Gruska J et al (2013) State succinctness of two-way finite automata with quantum and classical states. Theor Comput ence 499:98\u2013112","DOI":"10.1016\/j.tcs.2013.06.005"},{"key":"7063_CR39","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1051\/ita\/2014003","volume":"48","author":"S Zheng","year":"2014","unstructured":"Zheng S, Gruska J, Qiu D (2014) On the state complexity of semi-quantum finite automata. Theor Inf Appl 48:187\u2013207","journal-title":"Theor Inf Appl"},{"key":"7063_CR40","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ic.2015.02.003","volume":"241","author":"S Zheng","year":"2015","unstructured":"Zheng S, Qiu D, Gruska J (2015) Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. Inf Comput 241:197\u2013214","journal-title":"Inf Comput"},{"key":"7063_CR41","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/j.tcs.2016.12.025","volume":"666","author":"S Zheng","year":"2017","unstructured":"Zheng S, Li L, Qiu D, Gruska J (2017) Promise problems solved by quantum and classical finite automata. Theor Comput Sci 666:48\u201364","journal-title":"Theor Comput Sci"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07063-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-07063-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-07063-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T13:27:44Z","timestamp":1654867664000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-07063-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,19]]},"references-count":41,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["7063"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-07063-2","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,19]]},"assertion":[{"value":"21 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":2,"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 that they have no conflict interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}