{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:17:29Z","timestamp":1760203049436,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_34","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"426-438","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Complexity Bounds of Constant-Space Quantum Computation"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1137\/S0097539795293639","volume":"26","author":"LM Adleman","year":"1997","unstructured":"Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum computability. SIAM J. Comput. 26, 1524\u20131540 (1997)","journal-title":"SIAM J. Comput."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS 1998, pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifier I: the power of interaction. J. ACM 39, 800\u2013828 (1992)","journal-title":"J. ACM"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"34_CR5","unstructured":"Macarie, I.: Closure properties of stochastic languages. Technical Report No.441, Computer Science Department, University of Rochester (1993)"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BF02679455","volume":"30","author":"II Macarie","year":"1997","unstructured":"Macarie, I.I.: Multihead two-way probabilistic finite automata. Theory Comput. Syst. 30, 91\u2013109 (1997)","journal-title":"Theory Comput. Syst."},{"key":"34_CR7","unstructured":"Mahajan, M., Vinay, V.: Determinant: combinatorics, algorithms, and complexity. Chicago J. Theoret. Comput. Sci. 1997, Article no. 1997\u20135 (1997)"},{"key":"34_CR8","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.: Quantum automata and quantum grammar. Theor. Comput. Sci. 237, 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"34_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcss.2008.12.001","volume":"75","author":"H Nishimura","year":"2009","unstructured":"Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems. J. Comput. System Sci. 75, 255\u2013269 (2009)","journal-title":"J. Comput. System Sci."},{"key":"34_CR10","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inform. Control 6, 230\u2013244 (1963)","journal-title":"Inform. Control"},{"key":"34_CR11","unstructured":"Stolarsky, K.B.: Algebraic Numbers and Diophantine Approximations. Marcel Dekker (1974)"},{"key":"34_CR12","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/s00037-003-0177-8","volume":"12","author":"J Watrous","year":"2003","unstructured":"Watrous, J.: On the complexity of simulating space-bounded quantum computations. Computational Complexity 12, 48\u201384 (2003)","journal-title":"Computational Complexity"},{"key":"34_CR13","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"209","author":"A Yakaryilmaz","year":"2011","unstructured":"Yakaryilmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inf. Comput. 209, 873\u2013892 (2011)","journal-title":"Inf. Comput."},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1142\/S0129054103002047","volume":"14","author":"T Yamakami","year":"2003","unstructured":"Yamakami, T.: Analysis of quantum functions. Internat. J. Found. Comput. Sci. 14, 815\u2013852 (2003)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Yamakami, T., Yao, A.C.: NQP$$_{\\mathbb{C}}={\\rm co}\\text{-C}_{=}{\\rm P}$$. Inf. Process. Lett. 71, 63\u201369 (1999)","DOI":"10.1016\/S0020-0190(99)00084-8"},{"key":"34_CR16","unstructured":"Yao, A.C.: Class Note. Unpublished. Princeton University (1998)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T09:30:10Z","timestamp":1748511010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_34"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}