{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:43:12Z","timestamp":1740109392320,"version":"3.37.3"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T00:00:00Z","timestamp":1702339200000},"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":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s00224-023-10158-4","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T09:14:42Z","timestamp":1702372482000},"page":"1109-1123","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper Bounds on Communication in Terms of Approximate Rank"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9772-3966","authenticated-orcid":false,"given":"Anna","family":"G\u00e1l","sequence":"first","affiliation":[]},{"given":"Ridwan","family":"Syed","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"10158_CR1","doi-asserted-by":"crossref","unstructured":"Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. (1), 47\u201379 (2005)","DOI":"10.4086\/toc.2005.v001a004"},{"key":"10158_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N.: Perturbed identity matrices have high rank: proof and applications. Comb. Probab. Comput. (18), 3\u201315 (2009)","DOI":"10.1017\/S0963548307008917"},{"key":"10158_CR3","unstructured":"Alon, N., Lee, T., Shraibman, A.: The cover number of a matrix and its algorithmic applications. In: Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems and 18th international workshop on randomization and computation (APPROX-RANDOM), pp. 34\u201347 (2014)"},{"key":"10158_CR4","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 the 45th ACM symposium on theory of computing (STOC), pp. 675\u2013684 (2013)","DOI":"10.1145\/2488608.2488694"},{"key":"10158_CR5","unstructured":"Anshu, A., Ben-David, S., Garg, A., Jain, R., Kothari, R., Lee, T.: Separating quantum communication and approximate rank. In: Proceedings of the 32nd computational complexity conference, pp. 24:1\u201324:33 (2017)"},{"key":"10158_CR6","doi-asserted-by":"crossref","unstructured":"Anshu, A., Boddu, N.G., Touchette, D.: Quantum log-approximate-rank conjecture is also false. In: Proceedings of the 60th IEEE symposium on foundations of computer science (FOCS), pp. 982 \u2013 994 (2019)","DOI":"10.1109\/FOCS.2019.00063"},{"issue":"4","key":"10158_CR7","doi-asserted-by":"publisher","first-page":"22:1","DOI":"10.1145\/2629598","volume":"61","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson, E., Lovett, S., Ron-Zewi, N.: An additive combinatorics approach relating rank to communication complexity. J. ACM 61(4), 22:1-22:18 (2014)","journal-title":"J. ACM"},{"key":"10158_CR8","unstructured":"Bera, D.: Two-sided quantum amplitude amplification and exact-error algorithms. CoRR arXiv:1605.01828 (2016)"},{"issue":"3","key":"10158_CR9","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1007\/s00453-015-0093-8","volume":"76","author":"M Braverman","year":"2016","unstructured":"Braverman, M., Weinstein, O.: A discrepancy lower bound for information complexity. Algorithmica 76(3), 846\u2013864 (2016)","journal-title":"Algorithmica"},{"key":"10158_CR10","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16) (2001)","DOI":"10.1103\/PhysRevLett.87.167902"},{"key":"10158_CR11","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of the 30th ACM symposium on theory of computing (STOC), pp. 63\u201368 (1998)","DOI":"10.1145\/276698.276713"},{"key":"10158_CR12","doi-asserted-by":"crossref","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)","DOI":"10.1109\/CCC.2001.933879"},{"issue":"4","key":"10158_CR13","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/3396695","volume":"67","author":"A Chattopadhyay","year":"2020","unstructured":"Chattopadhyay, A., Mande, N.S., Sherif, S.: The log-approximate-rank conjecture is false. J. ACM 67(4), 23:1-23:28 (2020)","journal-title":"J. ACM"},{"key":"10158_CR14","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: Proceedings of the 21st conference on foundations of software technology and theoretical computer science (FSTTCS), pp. 171\u2013182 (2001)","DOI":"10.1007\/3-540-45294-X_15"},{"key":"10158_CR15","doi-asserted-by":"crossref","unstructured":"Gavinsky, D., Lovett, S.: En route to the log-rank conjecture: new reductions and equivalent formulations. In: Proceedings of the 41st international colloquium on automata, languages, and programming (ICALP), pp. 514\u2013524 (2014)","DOI":"10.1007\/978-3-662-43948-7_43"},{"issue":"6","key":"10158_CR16","doi-asserted-by":"publisher","first-page":"2435","DOI":"10.1137\/16M1059369","volume":"47","author":"M G\u00f6\u00f6s","year":"2018","unstructured":"G\u00f6\u00f6s, M., Pitassi, T., Watson, T.: Deterministic communication vs. partition number. SIAM J. Computing 47(6), 2435\u20132450 (2018)","journal-title":"SIAM J. Computing"},{"key":"10158_CR17","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th ACM symposium on the theory of computing (STOC), pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"10158_CR18","doi-asserted-by":"crossref","unstructured":"H\u00f8yer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Proceedings of the 19th annual symposium on theoretical aspects of computer science (STACS), pp. 299\u2013310 (2002)","DOI":"10.1007\/3-540-45841-7_24"},{"issue":"4","key":"10158_CR19","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 Mathematics 5(4), 545\u2013557 (1992)","journal-title":"SIAM J. Discrete Mathematics"},{"issue":"1","key":"10158_CR20","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. Computing 37(1), 20\u201346 (2007)","journal-title":"SIAM J. Computing"},{"key":"10158_CR21","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. Theoret. Comput. Sci. 156, 99\u2013117 (1996)","journal-title":"Theoret. Comput. Sci."},{"key":"10158_CR22","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication complexity. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511574948"},{"issue":"4","key":"10158_CR23","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":"10158_CR24","doi-asserted-by":"crossref","unstructured":"Lee, T., Shraibman, A.: An approximation algorithm for approximation rank. In: Proceedings of the 24th IEEE conference on computational complexity, pp. 351\u2013357 (2009)","DOI":"10.1109\/CCC.2009.25"},{"issue":"4","key":"10158_CR25","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":"10158_CR26","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":"10158_CR27","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":"10158_CR28","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 (FOCS), pp. 81\u201390 (1988)","DOI":"10.1109\/SFCS.1988.21924"},{"issue":"1","key":"10158_CR29","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/2724704","volume":"63","author":"S Lovett","year":"2016","unstructured":"Lovett, S.: Communication is bounded by root of rank. J. ACM 63(1), 1:1-1:9 (2016)","journal-title":"J. ACM"},{"key":"10158_CR30","unstructured":"Lovett, S.: Personal communication (2018)"},{"key":"10158_CR31","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 (STOC), pp. 330\u2013337 (1982)","DOI":"10.1145\/800070.802208"},{"key":"10158_CR32","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, vol. 305 of AMS contemporary mathematics series, American mathematical society (2002)","DOI":"10.1090\/conm\/305\/05215"},{"key":"10158_CR33","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":"10158_CR34","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information: 10th anniversary edn. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511976667"},{"issue":"4","key":"10158_CR35","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/BF01192527","volume":"15","author":"N Nisan","year":"1995","unstructured":"Nisan, N., Wigderson, A.: A note on rank vs. communication complexity. Combinatorica 15(4), 557\u2013566 (1995)","journal-title":"Combinatorica"},{"issue":"1","key":"10158_CR36","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":"10158_CR37","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. Theoret. Comput. Sci. 106(2), 385\u2013390 (1992)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10158_CR38","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1070\/IM2003v067n01ABEH000422","volume":"67","author":"A Razborov","year":"2003","unstructured":"Razborov, A.: Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics 67(1), 145\u2013159 (2003)","journal-title":"Izvestiya: Mathematics"},{"key":"10158_CR39","unstructured":"Rothvo\u00df, T.: A direct proof for Lovett\u2019s bound on the communication complexity of low rank matrices. CoRR, arXiv:1409.6366 (2014)"},{"key":"10158_CR40","doi-asserted-by":"crossref","unstructured":"Sinha, M., de Wolf, R.: Exponential separation between quantum communication and logarithm of approximate rank. In: Proceedings of the 60th IEEE symposium on foundations of computer science (FOCS), pp. 966\u2013981 (2019)","DOI":"10.1109\/FOCS.2019.00062"},{"key":"10158_CR41","doi-asserted-by":"crossref","unstructured":"Zhang, S.: Efficient quantum protocols for XOR functions. In: Proceedings of the 25th Annual ACM-SIAM symposium on discrete algorithms (SODA), pp. 1878\u20131885 (2014)","DOI":"10.1137\/1.9781611973402.136"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10158-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-023-10158-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-023-10158-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T09:52:53Z","timestamp":1729849973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-023-10158-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,12]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10158"],"URL":"https:\/\/doi.org\/10.1007\/s00224-023-10158-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2023,12,12]]},"assertion":[{"value":"15 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}