{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:51:51Z","timestamp":1743018711284,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030879921"},{"type":"electronic","value":"9783030879938"}],"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_12","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"177-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum Logical Depth and Shallowness of Streaming Data by One-Way Quantum\u00a0Finite-State Transducers (Preliminary\u00a0Report)"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Antunes, L., Fortnow, L., van Melkebeek, Vinodchandran, N.: Computational depth: concept and applications. Theor. Comput. Sci. 354, 391\u2013404 (2006)","DOI":"10.1016\/j.tcs.2005.11.033"},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/BF01011339","volume":"22","author":"P Benioff","year":"1980","unstructured":"Benioff, P.: The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers represented by Turing machines. J. Statist. Phys. 22, 563\u2013591 (1980)","journal-title":"J. Statist. Phys."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, C.H.: The Universal Turing Machine, A Half-Century Survey, chap. Logical Depth and Pysical Complexity, pp. 227\u2013257. Oxford University Press, Oxford (1988)","DOI":"10.1093\/oso\/9780198537748.003.0008"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26, 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jcss.2001.1765","volume":"63","author":"A Berthiaume","year":"2001","unstructured":"Berthiaume, A., van Dam, W., Laplante, S.: Quantum Kolmogorov complexity. J. Comput. System Sci. 63, 201\u2013221 (2001)","journal-title":"J. Comput. System Sci."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum Theory, the Church-Turing Principle, and the Universal Quantum Computer. Proc. R. Soc. Lond. Ser. A 400, 97\u2013117 (1985)","DOI":"10.1098\/rspa.1985.0070"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Deutsch, D.: Quantum computational networks. Proc. R. Soc. Lond. Ser A 425, 73\u201390 (1989)","DOI":"10.1098\/rspa.1989.0099"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Doty, D., Moser, P.: Feasible depth. In: Cooper, S.B., L\u00f6we, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 228\u2013237. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73001-9_24","DOI":"10.1007\/978-3-540-73001-9_24"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"6859","DOI":"10.1088\/0305-4470\/34\/35\/312","volume":"34","author":"P G\u00e1cs","year":"2001","unstructured":"G\u00e1cs, P.: Quantum algorithmic entropy. J. Phys. A Math. Gen. 34, 6859\u20136880 (2001)","journal-title":"J. Phys. A Math. Gen."},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Huffman, D.A.: Canonical forms for information-lossless finite-state logical machines. IRE Trans. Circ. Theory CT 6, 41\u201359 (1959)","DOI":"10.1109\/TCT.1959.1086614"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Jordon, L., Moser, P.: On the difference between finite-state and pushdown depth. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 187\u2013198. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_16","DOI":"10.1007\/978-3-030-38919-2_16"},{"key":"12_CR12","unstructured":"Jordon, L., Moser, P.: Pushdown and Lempel-Ziv depth (2020), Manuscript. arXiv:2009.64821v1"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0304-3975(94)00014-X","volume":"132","author":"DW Juedes","year":"1994","unstructured":"Juedes, D.W., Lathrop, J.I., Lutz, J.H.: Computational depth and reducibility. Theor. Comput. Sci. 132, 37\u201370 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation, Graduate Studies in Mathematics. Americal Mathematical Society, Providence (2002)","DOI":"10.1090\/gsm\/047"},{"key":"12_CR15","first-page":"1","volume":"1","author":"AN Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inf. Transmis. 1, 1\u20137 (1965)","journal-title":"Probl. Inf. Transmis."},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Li, M., Vit\u00e1nyi, P.M.: An Introduction to Kolmogorov Complexity and Its Applications, 3rd edn. Springer-Verlag, Berlin (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1","DOI":"10.1007\/978-0-387-49820-1"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Moser, P.: Polylog depth, highness and lowness for E. Inf. Comput. 271, 104483 (2020)","DOI":"10.1016\/j.ic.2019.104483"},{"key":"12_CR18","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2004.02.005","volume":"90","author":"H Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: Polynomial time quantum computation with advice. Inf. Process. Lett. 90, 195\u2013204 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"379\u2013423","key":"12_CR20","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. J. 27(379\u2013423), 623\u2013656 (1948)","journal-title":"Bell Syst. Tech. J."},{"issue":"6","key":"12_CR21","doi-asserted-by":"publisher","first-page":"2464","DOI":"10.1109\/18.945258","volume":"47","author":"PMB Vit\u00e1nyi","year":"2001","unstructured":"Vit\u00e1nyi, P.M.B.: Quantum Kolmogorov complexity based on classical descriptions. IEEE Trans. Inf. Theor. 47(6), 2464\u20132479 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1007\/3-540-48340-3_39","volume-title":"Mathematical Foundations of Computer Science 1999","author":"T Yamakami","year":"1999","unstructured":"Yamakami, T.: A foundation of programming a multi-tape quantum turing machine. In: Kuty\u0142owski, M., Pacholski, L., Wierzbicki, T. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 430\u2013441. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48340-3_39"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ic.2014.10.003","volume":"239","author":"T Yamakami","year":"2014","unstructured":"Yamakami, T.: One-way reversible and quantum finite-state automata with advice. Inf. Comput. 239, 122\u2013148 (2014)","journal-title":"Inf. Comput."},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-030-19311-9_20","volume-title":"Unconventional Computation and Natural Computation","author":"T Yamakami","year":"2019","unstructured":"Yamakami, T.: Relativizations of nonuniform quantum finite automata families. In: McQuillan, I., Seki, S. (eds.) UCNC 2019. LNCS, vol. 11493, pp. 257\u2013271. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19311-9_20"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"1546","DOI":"10.1017\/jsl.2020.45","volume":"85","author":"T Yamakami","year":"2020","unstructured":"Yamakami, T.: A schematic definition of quantum polynomial time computability. J. Symb. Logic 85, 1546\u20131587 (2020)","journal-title":"J. Symb. Logic"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Nonuniform families of polynomial-size quantum finite-state automata and quantum logarithmic-space computation with polynomial-size advice. Inf. Comput. (in press, 2021), A preliminary version appeared in the Proceedings of LATA 2019, LNCS, vol. 11417, pp. 134\u2013145 (2019). A complete and corrected version. arXiv:1907.02916","DOI":"10.1016\/j.ic.2021.104783"},{"key":"12_CR27","unstructured":"Yao, A.C.: Quantum circuit complexity. In: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (FOCS 1993), pp. 80\u201391 (1993)"},{"key":"12_CR28","doi-asserted-by":"crossref","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24, 530\u2013536 (1978)","DOI":"10.1109\/TIT.1978.1055934"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,10]],"date-time":"2023-11-10T21:13:25Z","timestamp":1699650805000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}