{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T20:26:44Z","timestamp":1779222404004,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030592660","type":"print"},{"value":"9783030592677","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-59267-7_24","type":"book-chapter","created":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T19:02:33Z","timestamp":1602442953000},"page":"275-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Space Complexity of Streaming Algorithms on Universal Quantum Computers"],"prefix":"10.1007","author":[{"given":"Yanglin","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuyi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,9]]},"reference":[{"issue":"2","key":"24_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2005.04.003","volume":"203","author":"F Ablayev","year":"2005","unstructured":"Ablayev, F., Gainutdinova, A., Karpinski, M., Moore, C., Pollett, C.: On the computational power of probabilistic and quantum branching program. Inf. Comput. 203(2), 145\u2013162 (2005)","journal-title":"Inf. Comput."},{"key":"24_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-319-09704-6_6","volume-title":"Descriptional Complexity of Formal Systems","author":"F Ablayev","year":"2014","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 53\u201364. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09704-6_6"},{"key":"24_CR3","unstructured":"Ablayev, F., Khasianov, A., Vasiliev, A.: On complexity of quantum branching programs computing equality-like Boolean functions. Electronic Colloquium on Computational Complexity (2010)"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing. STOC (1996)","DOI":"10.1145\/237814.237823"},{"issue":"7","key":"24_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ipl.2012.01.001","volume":"112","author":"A Ambainis","year":"2012","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Superiority of exact quantum automata for promise problems. Inf. Process. Lett. 112(7), 289\u2013291 (2012)","journal-title":"Inf. Process. Lett."},{"key":"24_CR6","unstructured":"Babai, L., Kimmel, P.G.: Randomized simultaneous messages: solution of a problem of Yao in communication complexity. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity. CCC (1997)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87, 167902 (2001)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"24_CR8","first-page":"81","volume":"6","author":"CM Dawson","year":"2006","unstructured":"Dawson, C.M., Nielsen, M.A.: The Solovay-Kitaev algorithm. Quantum Inf. Comput. 6(1), 81\u201395 (2006)","journal-title":"Quantum Inf. Comput."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: Proceedings of the Thirty-Ninth Annual ACM Symposium on Theory of Computing. STOC (2007)","DOI":"10.1145\/1250790.1250866"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"240502","DOI":"10.1103\/PhysRevLett.116.240502","volume":"116","author":"JY Guan","year":"2016","unstructured":"Guan, J.Y., et al.: Observation of quantum fingerprinting beating the classical limit. Phys. Rev. Lett. 116, 240502 (2016)","journal-title":"Phys. Rev. Lett."},{"issue":"9","key":"24_CR11","doi-asserted-by":"publisher","first-page":"4445","DOI":"10.1063\/1.1495899","volume":"43","author":"AW Harrow","year":"2002","unstructured":"Harrow, A.W., Recht, B., Chuang, I.L.: Efficient discrete approximations of quantum gates. J. Math. Phys. 43(9), 4445\u20134451 (2002)","journal-title":"J. Math. Phys."},{"issue":"2","key":"24_CR12","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1147\/rd.312.0249","volume":"31","author":"RM Karp","year":"1987","unstructured":"Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249\u2013260 (1987)","journal-title":"IBM J. Res. Dev."},{"key":"24_CR13","unstructured":"Khadiev, K., Khadieva, A., Kravchenko, D., Rivosh, A.: Quantum versus Classical Online Algorithms with Advice and Logarithmic Space (2017)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"1377","DOI":"10.1134\/S1995080218090421","volume":"39","author":"K Khadiev","year":"2017","unstructured":"Khadiev, K., Khadieva, A., Mannapov, I.: Quantum online algorithms with respect to space complexity. Lobachevskii J. Math. 39, 1377\u20131387 (2017)","journal-title":"Lobachevskii J. Math."},{"key":"24_CR15","unstructured":"Khadiev, K., Ziatdinov, M., Mannapov, I., Khadieva, A., Yamilov, R.: Quantum Online Streaming Algorithms with Constant Number of Advice Bits (2018)"},{"key":"24_CR16","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/047","volume-title":"Classical and Quantum Computation","author":"AY Kitaev","year":"2002","unstructured":"Kitaev, A.Y., Shen, A., Vyalyi, M.N.: Classical and Quantum Computation. American Mathematical Society, Boston (2002)"},{"key":"24_CR17","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/s00224-007-9097-3","volume":"45","author":"F Le Gall","year":"2009","unstructured":"Le Gall, F.: Exponential separation of quantum and classical online space complexity. Theory Comput. Syst. 45, 188\u2013202 (2009)","journal-title":"Theory Comput. Syst."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedy, M.: Public vs. private coin flips in one round communication games (extended abstract). In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing. STOC (1996)","DOI":"10.1145\/237814.238004"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1103\/PhysRevLett.79.321","volume":"79","author":"MA Nielsen","year":"1997","unstructured":"Nielsen, M.A., Chuang, I.L.: Programmable quantum gate arrays. Phys. Rev. Lett. 79, 321 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"24_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information: 10th, Anniversary Edition","author":"MA Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th, Anniversary Edition. Cambridge University Press, Cambridge (2010)"},{"issue":"1","key":"24_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.tcs.2004.12.031","volume":"334","author":"M Sauerhoff","year":"2005","unstructured":"Sauerhoff, M., Sieling, D.: Quantum branching programs and space-bounded nonuniform quantum complexity. Theoret. Comput. Sci. 334(1), 177\u2013225 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"24_CR22","unstructured":"Watrous, J.H.: Space-bounded quantum computation. Ph.D. thesis, The University of Wisconsin, Madison (1998)"},{"key":"24_CR23","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Some complexity questions related to distributive computing (preliminary report). In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing. STOC (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59267-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:10:10Z","timestamp":1710353410000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-59267-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030592660","9783030592677"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59267-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"9 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Changsha","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tamc2020.csu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}