{"id":"https://openalex.org/W2986878972","doi":"https://doi.org/10.1007/s00037-022-00232-7","title":"Quantum versus Randomized Communication Complexity, with Efficient Players","display_name":"Quantum versus Randomized Communication Complexity, with Efficient Players","publication_year":2022,"publication_date":"2022-10-28","ids":{"openalex":"https://openalex.org/W2986878972","doi":"https://doi.org/10.1007/s00037-022-00232-7","mag":"2986878972"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-022-00232-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-022-00232-7","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1911.02218","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043669506","display_name":"Uma Girish","orcid":"https://orcid.org/0000-0003-3055-9406"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Uma Girish","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Princeton University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Department of Computer Science, Princeton University, Princeton, NJ, USA","Princeton University, Princeton, United States"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, Princeton, United States","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049425955","display_name":"Avishay Tal","orcid":"https://orcid.org/0000-0002-0375-6554"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Avishay Tal","raw_affiliation_strings":["Department of Electrical\nEngineering and Computer\nSciences, University of California, Berkeley, Berkeley, CA, USA","University of California at Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical\nEngineering and Computer\nSciences, University of California, Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California at Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043669506"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":0.1161,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48634065,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"31","issue":"2","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6195825338363647},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.5658252239227295},{"id":"https://openalex.org/keywords/quantum-information-science","display_name":"Quantum information science","score":0.5469619631767273},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.5234441161155701},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5102670192718506},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.49835872650146484},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.49268442392349243},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.48644113540649414},{"id":"https://openalex.org/keywords/quantum-capacity","display_name":"Quantum capacity","score":0.4754454791545868},{"id":"https://openalex.org/keywords/quantum-network","display_name":"Quantum network","score":0.4455820918083191},{"id":"https://openalex.org/keywords/quantum-sort","display_name":"Quantum sort","score":0.44105178117752075},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.4262884855270386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3430272340774536},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.18498623371124268},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1633235514163971}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6195825338363647},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.5658252239227295},{"id":"https://openalex.org/C5320026","wikidata":"https://www.wikidata.org/wiki/Q2122216","display_name":"Quantum information science","level":4,"score":0.5469619631767273},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5234441161155701},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5102670192718506},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.49835872650146484},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.49268442392349243},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.48644113540649414},{"id":"https://openalex.org/C41241483","wikidata":"https://www.wikidata.org/wiki/Q7269015","display_name":"Quantum capacity","level":5,"score":0.4754454791545868},{"id":"https://openalex.org/C186468114","wikidata":"https://www.wikidata.org/wiki/Q836478","display_name":"Quantum network","level":4,"score":0.4455820918083191},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.44105178117752075},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4262884855270386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3430272340774536},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.18498623371124268},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1633235514163971},{"id":"https://openalex.org/C204787440","wikidata":"https://www.wikidata.org/wiki/Q188504","display_name":"Alternative medicine","level":2,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C142724271","wikidata":"https://www.wikidata.org/wiki/Q7208","display_name":"Pathology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00037-022-00232-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-022-00232-7","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1911.02218","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.02218","pdf_url":"https://arxiv.org/pdf/1911.02218","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:2986878972","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1911.02218v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:drops-oai.dagstuhl.de:13593","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2021.54","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.1911.02218","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1911.02218","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"doi:10.4230/lipics.itcs.2021.54","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.itcs.2021.54","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1911.02218","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1911.02218","pdf_url":"https://arxiv.org/pdf/1911.02218","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1724386851","display_name":"AF: Medium: Collaborative Research: Exploiting Opportunities in Pseudorandomness","funder_award_id":"1763311","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G57144956","display_name":"AF: Small: Lower Bounds for Computational Models, and Relations to Other Topics in Computational Complexity","funder_award_id":"1714779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1508084091","https://openalex.org/W1891181203","https://openalex.org/W1991730713","https://openalex.org/W1995363082","https://openalex.org/W2000070319","https://openalex.org/W2062881383","https://openalex.org/W2080861403","https://openalex.org/W2086290259","https://openalex.org/W2092871850","https://openalex.org/W2137005141","https://openalex.org/W2148488235","https://openalex.org/W2274974221","https://openalex.org/W2561228181","https://openalex.org/W2792338823","https://openalex.org/W2892917696","https://openalex.org/W2942961654","https://openalex.org/W2952315951","https://openalex.org/W3102754027","https://openalex.org/W3137706500"],"related_works":["https://openalex.org/W3134293981","https://openalex.org/W2038517502","https://openalex.org/W2024538784","https://openalex.org/W2398950586","https://openalex.org/W2786360049","https://openalex.org/W1551883060","https://openalex.org/W2385059840","https://openalex.org/W1979375944","https://openalex.org/W3107030154","https://openalex.org/W2074258120","https://openalex.org/W1796488250","https://openalex.org/W2340947353","https://openalex.org/W2964213477","https://openalex.org/W3133653374","https://openalex.org/W2563368560","https://openalex.org/W3092353817","https://openalex.org/W1669891050","https://openalex.org/W2950569914","https://openalex.org/W3106678930","https://openalex.org/W3187572861"],"abstract_inverted_index":{"We":[0],"study":[1],"a":[2,65,96,213,326,392,401],"new":[3],"type":[4],"of":[5,85,110,134,149,163,208,218,234,251,256,285,321,328,343,373,394],"separations":[6,13,233,271,281,294,310,342],"between":[7,53,187],"quantum":[8,18,36,54,66,98,147,161,188,228,235,261,273,289,314,330,345,356],"and":[9,55,61,114,154,170,189,236,267,331,376],"classical":[10,56,125,190,222,237,332,350,361],"communication":[11,57,101,137,191,238,333,346,351,357,362,374],"complexity,":[12,192,334,375],"that":[14,29,282,286,295],"are":[15,23,71,291,296],"obtained":[16,63,212],"using":[17,64,398],"protocols":[19,315],"where":[20,68],"all":[21,69],"parties":[22,70,144,258,274,290],"efficient":[24,288],",":[25,88,130],"in":[26,145,220,226,243,259,268,370],"the":[27,49,108,111,146,155,183,206,221,224,249,254,257,260,272,292,340,371,395],"sense":[28],"they":[30,324,336],"can":[31,92,157],"be":[32,93,158,277],"implemented":[33,159],"by":[34,95,160,194],"small":[35],"circuits,":[37],"with":[38,100,131,316],"oracle":[39,173],"access":[40,174],"to":[41,175,205,248,276,312],"their":[42,176],"inputs.":[43],"Our":[44,364,386],"main":[45],"result":[46,202],"qualitatively":[47,181],"matches":[48],"strongest":[50,184],"known":[51,185],"separation":[52,186,327],"complexity":[58,102,138,239,347,352,358],"Gavinsky":[59,195],"(2016)":[60],"is":[62,199,203,230,367,377,389],"protocol":[67,99,112,127,148,229,262],"efficient.":[72],"More":[73],"precisely,":[74],"we":[75,283],"give":[76,339],"an":[77],"explicit":[78],"partial":[79],"Boolean":[80],"function":[81,387],"f":[82,91,129,388],"over":[83],"inputs":[84],"length":[86],"N":[87,104,119,166],"such":[89],"that:":[90],"computed":[94],"simultaneous-message":[97,344],"polylog(":[103,118,165],")":[105,120,167],"(where":[106,168],"at":[107,139,317],"beginning":[109],"Alice":[113,169],"Bob":[115,153,171],"also":[116],"have":[117,172,240,287],"entangled":[121],"EPR":[122],"pairs).":[123],"Any":[124],"randomized":[126],"for":[128],"any":[132],"number":[133],"rounds,":[135],"has":[136,263],"least":[140,318],"\\(\\tilde{\\Omega}\\left(N^{1/4}\\right)\\)":[141],".":[142],"All":[143],"Item":[150,197],"(1)":[151],"(Alice,":[152],"referee)":[156],"circuits":[162],"size":[164],"inputs).":[177],"Items":[178],"(1),":[179],"(2)":[180],"match":[182],"proved":[193],"(2016).":[196],"(3)":[198],"new.":[200],"(Our":[201],"incomparable":[204],"one":[207],"Gavinsky.":[209],"While":[210],"he":[211],"quantitatively":[214],"better":[215],"lower":[216],"bound":[217],"\\(\\Omega\\left(N^{1/2}\\right)\\)":[219],"case,":[223],"referee":[225],"his":[227],"inefficient).":[231],"Exponential":[232],"been":[241,265],"studied":[242],"numerous":[244],"previous":[245,270],"works,":[246],"but":[247,335],"best":[250],"our":[252],"knowledge":[253],"efficiency":[255],"not":[264,338],"addressed,":[266],"most":[269],"seem":[275,311],"inefficient.":[278],"The":[279],"only":[280],"know":[284],"recent":[293],"based":[297,378,390],"on":[298,379,391],"lifting":[299],"G\u00f6\u00f6s":[300],"et":[301,305],"al.":[302,306],"(2017),":[303],"Chattopadhyay":[304],"(2019a).":[307],"However,":[308],"these":[309],"require":[313],"two":[319],"rounds":[320],"communication,":[322],"so":[323],"imply":[325],"two-way":[329,349,360],"do":[337],"stronger":[341],"vs.":[348,359],"(or":[353],"even":[354],"one-way":[355],"complexity).":[363],"proof":[365],"technique":[366],"completely":[368],"new,":[369],"context":[372],"techniques":[380],"from":[381],"Raz":[382],"&":[383],"Tal":[384],"(2019).":[385],"lift":[393],"forrelation":[396],"problem,":[397],"xor":[399],"as":[400],"gadget.":[402]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}