{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T19:51:02Z","timestamp":1770753062216,"version":"3.50.0"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030794156","type":"print"},{"value":"9783030794163","type":"electronic"}],"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-79416-3_7","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T18:03:46Z","timestamp":1623866626000},"page":"116-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Upper Bounds on Communication in Terms of Approximate Rank"],"prefix":"10.1007","author":[{"given":"Anna","family":"G\u00e1l","sequence":"first","affiliation":[]},{"given":"Ridwan","family":"Syed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.4086\/toc.2005.v001a004","volume":"1","author":"S Aaronson","year":"2005","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. 1, 47\u201379 (2005)","journal-title":"Theory Comput."},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S0963548307008917","volume":"18","author":"N Alon","year":"2009","unstructured":"Alon, N.: Perturbed identity matrices have high rank: proof and applications. Comb. Probab. Comput. 18, 3\u201315 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Lee, T., Shraibman, A., Vempala, S.: The approximate rank of a matrix and its algorithmic applications. In: Proceedings of STOC 2013, pp. 675-684 (2013)","DOI":"10.1145\/2488608.2488694"},{"key":"7_CR4","unstructured":"Anshu, A., Ben-David, S., Garg, A., Jain, R., Kothari, R., Lee, T.: Separating quantum communication and approximate rank. In: Computational Complexity Conference, vol. 24, no. 1\u201324 p. 33 (2017)"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Anshu, A., Boddu, D.T.: Quantum log-approximate-rank conjecture is also false. In: Proceedings of FOCS 2019, pp. 982\u2013994 (2019)","DOI":"10.1109\/FOCS.2019.00063"},{"key":"7_CR6","unstructured":"Bera, D.: Two-sided quantum amplitude amplification and exact-error algorithms. CoRR abs\/1605.01828 (2016)"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/s00453-015-0093-8","volume":"76","author":"M Braverman","year":"2015","unstructured":"Braverman, M., Weinstein, O.: A discrepancy lower bound for information complexity. Algorithmica 76(3), 846\u2013864 (2015). https:\/\/doi.org\/10.1007\/s00453-015-0093-8","journal-title":"Algorithmica"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001)","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of 30th STOC, pp. 63\u201368 (1998)","DOI":"10.1145\/276698.276713"},{"key":"7_CR10","unstructured":"Buhrman, H., de Wolf, R.: Communication complexity lower bounds by polynomials. In: Proceedings of the 16th IEEE Conference on Computational Complexity, pp. 120\u2013130 (2001)"},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A., Mande, N.S., Sherif, S.: The log-approximate-rank conjecture is false. J. ACM 67(4), 23:1\u201323:28 (2020)","DOI":"10.1145\/3396695"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Forster, J., Krause, M., Lokam, S.V., Mubarakzjanov, R., Schmitt, N., Simon, H.U.: Relations between communication complexity, linear arrangements, and computational complexity. In: FSTTCS: Foundations of Software Technology and Theoretical Computer Science, vol. 21, pp. 171\u2013182 (2001)","DOI":"10.1007\/3-540-45294-X_15"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Lovett, S.: En route to the log-rank conjecture: New reductions and equivalent formulations, In: Proceedings of ICALP 2014, pp. 514\u2013524 (2014)","DOI":"10.1007\/978-3-662-43948-7_43"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Pitassi, T., Watson, T.: Deterministic Communication vs. Partition Number. In: Proceedings of FOCS 2015, pp. 1077\u20131088 (2015)","DOI":"10.1109\/FOCS.2015.70"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., de\u00a0Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Proceedings of STACS 2002, pp. 299\u2013310 (2002)","DOI":"10.1007\/3-540-45841-7_24"},{"issue":"4","key":"7_CR17","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1137\/0405044","volume":"5","author":"B Kalyanasundaram","year":"1992","unstructured":"Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discrete Math. 5(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0097539702405620","volume":"37","author":"H Klauck","year":"2007","unstructured":"Klauck, H.: Lower bounds for quantum communication complexity. SIAM J. Comput. 37(1), 20\u201346 (2007)","journal-title":"SIAM J. Comput."},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00005-4","volume":"156","author":"M Krause","year":"1996","unstructured":"Krause, M.: Geometric arguments yield better bounds for threshold circuits and distributed computing. Theor. Comput. Sci. 156, 99\u2013117 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR20","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"issue":"4","key":"7_CR21","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1561\/0400000040","volume":"3","author":"T Lee","year":"2009","unstructured":"Lee, T., Shraibman, A.: Lower bounds in communication complexity. Found. Trends Theor. Comput. Sci. 3(4), 263\u2013398 (2009)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A.: An approximation algorithm for approximation rank. In: IEEE Conference on Computational Complexity, pp. 351\u2013357 (2009)","DOI":"10.1109\/CCC.2009.25"},{"issue":"4","key":"7_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s00493-007-2160-5","volume":"27","author":"N Linial","year":"2007","unstructured":"Linial, N., Mendelson, S., Schechtman, G., Shraibman, A.: Complexity measures of sign matrices. Combinatorica 27(4), 439\u2013463 (2007)","journal-title":"Combinatorica"},{"issue":"1\u20132","key":"7_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1017\/S0963548308009656","volume":"18","author":"N Linial","year":"2009","unstructured":"Linial, N., Shraibman, A.: Learning complexity vs communication complexity. Comb. Probab. Comput. 18(1\u20132), 227\u2013245 (2009)","journal-title":"Comb. Probab. Comput."},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1002\/rsa.20232","volume":"34","author":"N Linial","year":"2009","unstructured":"Linial, N., Shraibman, A.: Lower bounds in communication complexity based on factorization norms. Random Struct. Algorithms 34, 368\u2013394 (2009)","journal-title":"Random Struct. Algorithms"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Saks, M.: M\u00f6bius functions and communication complexity. In: Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pp. 81\u201390. IEEE (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Lovett, S.: Communication is bounded by root of rank. J. ACM 63(1) pp. 1:1\u20131:9 (2016)","DOI":"10.1145\/2724704"},{"key":"7_CR28","unstructured":"Lovett, S.: Personal communication (2018)"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E.: Las Vegas is better than determinism in VLSI and distributed computing. In: Proceedings of the 14th ACM Symposium on the Theory of Computing, pp. 330\u2013337 (1982)","DOI":"10.1145\/800070.802208"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Mosca, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume, volume 305 of AMS Contemporary Mathematics Series. American Mathematical Society (2002)","DOI":"10.1090\/conm\/305\/05215"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I Newman","year":"1991","unstructured":"Newman, I.: Private versus common random bits in communication complexity. Inf. Process. Lett. 39, 67\u201371 (1991)","journal-title":"Inf. Process. Lett."},{"key":"7_CR32","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"MA Nielsen","year":"2011","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition, 10th edn. Cambridge University Press, New York (2011)","edition":"10"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Nisan, N., Wigderson, A.: A note on rank vs. communication complexity. Combinatorica 15(4), 557\u2013566 (1995)","DOI":"10.1007\/BF01192527"},{"issue":"1","key":"7_CR34","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R Paturi","year":"1986","unstructured":"Paturi, R., Simon, J.: Probabilistic communication complexity. J. Comput. Syst. Sci. 33(1), 106\u2013123 (1986)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR35","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0304-3975(92)90260-M","volume":"106","author":"A Razborov","year":"1992","unstructured":"Razborov, A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106(2), 385\u2013390 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Math. 67(1), 145\u2013159 (2003)","DOI":"10.1070\/IM2003v067n01ABEH000422"},{"key":"7_CR37","unstructured":"Rothvo\u00df, T.: direct proof for Lovett\u2019s bound on the communication complexity of low rank matrices. CoRR, abs\/1409.6366 (2014)"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Sinha, M., de Wolf, R.: Exponential separation between quantum communication and logarithm of approximate rank. In: Proceedings of FOCS 2019, pp. 966\u2013981 (2019)","DOI":"10.1109\/FOCS.2019.00062"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, S.: Efficient quantum protocols for XOR functions. In: Proceedings of SODA 2014, pp. 1878\u20131885 (2014)","DOI":"10.1137\/1.9781611973402.136"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79416-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T23:19:58Z","timestamp":1623971998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79416-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030794156","9783030794163"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79416-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sochi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","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":"csr2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2021\/","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":"68","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":"28","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":"41% - 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.1","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":"9.2","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)"}}]}}