{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T07:30:51Z","timestamp":1783150251069,"version":"3.54.6"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031643088","type":"print"},{"value":"9783031643095","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-64309-5_25","type":"book-chapter","created":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:01:49Z","timestamp":1719871309000},"page":"311-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum First-Order Logics that\u00a0Capture Logarithmic-Time\/Space Quantum Computability"],"prefix":"10.1007","author":[{"given":"Tomoyuki","family":"Yamakami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"DAM Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC$$^1$$. J. Comput. System Sci. 41, 274\u2013306 (1990)","journal-title":"J. Comput. System Sci."},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/1968621","volume":"37","author":"G Birkhoff","year":"1936","unstructured":"Birkhoff, G., von Neumann, J.: The logic of quantum mechanics. Ann. Math. 37, 823\u2013843 (1936)","journal-title":"Ann. Math."},{"key":"25_CR3","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":"25_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1142\/S0219749904000067","volume":"2","author":"O Brunet","year":"2004","unstructured":"Brunet, O., Jorrand, P.: Dynamic quantum logic for quantum programs. Int. J. Quantum Inf. 2, 45\u201354 (2004)","journal-title":"Int. J. Quantum Inf."},{"key":"25_CR5","unstructured":"Fagin, R.: Gneralized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computation (ed. R. Karp), SIAM-AMS Proc. 7, pp. 27\u201341 (1974)"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0019-9958(84)80062-5","volume":"61","author":"Y Gurevich","year":"1984","unstructured":"Gurevich, Y., Lewis, H.R.: A logic for constant-depth circuits. Inform. Control 61, 65\u201374 (1984)","journal-title":"Inform. Control"},{"key":"25_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-031-30829-1_8","volume-title":"FoSSaCS 2023","author":"E Hainry","year":"2023","unstructured":"Hainry, E., P\u00e9choux, R., Silva, M.: A programmming language characterizing quantum polynomial time. In: Kupferman, O., Sobocinski, P. (eds.) FoSSaCS 2023. LNCS, vol. 13992, pp. 156\u2013175. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30829-1_8"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Inform. Control 68, 86\u2013104 (1986)","journal-title":"Inform. Control"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1137\/0216051","volume":"16","author":"N Immerman","year":"1987","unstructured":"Immerman, N.: Languages that capture complexity classes. SIAM J. Comput. 16, 760\u2013778 (1987)","journal-title":"SIAM J. Comput."},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Immerman, N.: Expressiblity as a compelxity measure: results and directions. In: SICT 1987, pp. 194\u2013202 (1987)","DOI":"10.1109\/PSCT.1987.10319271"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1137\/0218043","volume":"18","author":"N Immerman","year":"1989","unstructured":"Immerman, N.: Expressibility and parallel complexity. SIAM J. Comput. 18, 625\u2013638 (1989)","journal-title":"SIAM J. Comput."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Kitaev, A.Y. , Shen, A.H., Vyalyi, M.N.: Classical and Quantumn Computation (Graduate Studies in Mathematics). Am. Math. Soc. (2002)","DOI":"10.1090\/gsm\/047"},{"key":"25_CR13","unstructured":"Kornell, A.: Discrete quantum structures. arXiv:2004.04377v6 (2022)"},{"key":"25_CR14","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":"25_CR15","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Quantum NP and a quantum hierarchy. In: IFIP TCS 2002, The International Federation for Information Processing, vol. 96(Track 1), pp. 323\u2013336 (2002)","DOI":"10.1007\/978-0-387-35608-2_27"},{"key":"25_CR16","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. Int. J. Fund. Comput. Sci. 14, 815\u2013852 (2003)","journal-title":"Int. J. Fund. Comput. Sci."},{"key":"25_CR17","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. Symbolic Logic 85, 1546\u20131587 (2020)","journal-title":"J. Symbolic Logic"},{"key":"25_CR18","doi-asserted-by":"publisher","first-page":"104783","DOI":"10.1016\/j.ic.2021.104783","volume":"286","author":"T Yamakami","year":"2022","unstructured":"Yamakami, T.: Nonuniform families of polynomial-size quantum finite automata and quantum logarithmic-space computation with polynomial-size advice. Inf. Comput. 286, 104783 (2022)","journal-title":"Inf. Comput."},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Yamakami, T.: Expressing power of elementary quantum recursion schemes for quantum logarithmic-time computability. In: WoLLIC 2022, LNCS, vol. 13468, pp. 88\u2013104, Springer (2022). A corrected and expanded version under a slightly different title is available at arXiv:2311.15884","DOI":"10.1007\/978-3-031-15298-6_6"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00165-018-0465-3","volume":"31","author":"M Ying","year":"2019","unstructured":"Ying, M.: Toward automatic verification of quantum programs. Form. Asp. Comput. 31, 3\u201325 (2019)","journal-title":"Form. Asp. Comput."},{"key":"25_CR21","unstructured":"Ying, M.: Birkhoff-von Newmann quantum logic as an assertion language for quantum programs. Available at arXiv: 2205.01955v1 (2022)"}],"container-title":["Lecture Notes in Computer Science","Twenty Years of Theoretical and Practical Synergies"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-64309-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,1]],"date-time":"2024-07-01T22:03:57Z","timestamp":1719871437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64309-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031643088","9783031643095"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64309-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"2 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CiE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Computability in Europe","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cie2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}