{"id":"https://openalex.org/W2125389627","doi":"https://doi.org/10.1137/s0097539702405620","title":"Lower Bounds for Quantum Communication Complexity","display_name":"Lower Bounds for Quantum Communication Complexity","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2125389627","doi":"https://doi.org/10.1137/s0097539702405620","mag":"2125389627"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539702405620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702405620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018075693","display_name":"Hartmut Klauck","orcid":"https://orcid.org/0000-0003-1078-4593"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hartmut Klauck","raw_affiliation_strings":["CWI, P.O. Box 94079, 1090 GB Amsterdam, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CWI, P.O. Box 94079, 1090 GB Amsterdam, the Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5018075693"],"corresponding_institution_ids":["https://openalex.org/I1341640284"],"apc_list":null,"apc_paid":null,"fwci":15.0821,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.98792431,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"37","issue":"1","first_page":"20","last_page":"46"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9998999834060669,"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":0.9998999834060669,"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.9990000128746033,"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.9968000054359436,"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/communication-complexity","display_name":"Communication complexity","score":0.7686368823051453},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6715303063392639},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6441892385482788},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6245867013931274},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5945641398429871},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5638815760612488},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5592390298843384},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5368201732635498},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4861268997192383},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4515671730041504},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.42172157764434814},{"id":"https://openalex.org/keywords/quantum-information-science","display_name":"Quantum information science","score":0.41753053665161133},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4150305986404419},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41104668378829956},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20966336131095886},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.164348304271698},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.12747439742088318},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.08798697590827942}],"concepts":[{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.7686368823051453},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6715303063392639},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6441892385482788},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6245867013931274},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5945641398429871},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5638815760612488},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5592390298843384},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5368201732635498},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4861268997192383},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4515671730041504},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.42172157764434814},{"id":"https://openalex.org/C5320026","wikidata":"https://www.wikidata.org/wiki/Q2122216","display_name":"Quantum information science","level":4,"score":0.41753053665161133},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4150305986404419},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41104668378829956},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20966336131095886},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.164348304271698},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.12747439742088318},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.08798697590827942},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539702405620","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539702405620","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.721.5760","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.721.5760","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ntu.edu.sg/home/hklauck/LBQCC.pdf","raw_type":"text"},{"id":"pmh:oai:cds.cern.ch:506514","is_oa":false,"landing_page_url":"http://cds.cern.ch/record/506514","pdf_url":null,"source":{"id":"https://openalex.org/S4306402195","display_name":"CERN Document Server (European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1980223785","https://openalex.org/W2020725861","https://openalex.org/W2033216491","https://openalex.org/W2035957583","https://openalex.org/W2072684000","https://openalex.org/W2075106440","https://openalex.org/W2080861403","https://openalex.org/W2088263428","https://openalex.org/W2320692600"],"related_works":["https://openalex.org/W2963463650","https://openalex.org/W1524987448","https://openalex.org/W2766148426","https://openalex.org/W4297955154","https://openalex.org/W2101249745","https://openalex.org/W2079051917","https://openalex.org/W1982283204","https://openalex.org/W2565389498","https://openalex.org/W2124096260","https://openalex.org/W2163596802"],"abstract_inverted_index":{"We":[0,67,126],"prove":[1,128],"lower":[2,33,71,95,132,162],"bounds":[3,34,133,169],"on":[4,15,75,97,134,166],"the":[5,16,20,45,76,85,98,129,135,153,157],"bounded":[6,57,99,136],"error":[7,58,100,137],"quantum":[8,46,59,64,101,138,147],"communication":[9,31,60,65,102,139],"complexity.":[10,66],"Our":[11],"methods":[12,73],"are":[13,120,171],"based":[14,74,165],"Fourier":[17,77],"transform":[18],"of":[19,89,104,141],"considered":[21],"functions.":[22],"First":[23],"we":[24,51,155],"generalize":[25],"a":[26,90,94,112,145],"method":[27,164],"for":[28,84,143],"proving":[29],"classical":[30],"complexity":[32,61,103,140],"developed":[35],"by":[36,116,124],"Raz":[37],"[Comput.":[38],"Complexity,":[39],"5":[40],"(1995),":[41],"pp.":[42],"205\u2013221]":[43],"to":[44],"case.":[47],"Applying":[48],"this":[49],"method,":[50],"give":[52],"an":[53],"exponential":[54],"separation":[55],"between":[56],"and":[62,118],"nondeterministic":[63],"develop":[68],"several":[69],"other":[70],"bound":[72,96,163],"transform,":[78],"notably":[79],"showing":[80],"that":[81,170],"$\\sqrt{\\bar{s}(f)/\\log":[82],"n}$,":[83],"average":[86],"sensitivity":[87],"$\\bar{s}(f)$":[88],"function":[91],"f,":[92],"yields":[93,168],"$f((x":[105],"\\wedge":[106],"y)\\oplus":[107],"z)$,":[108],"where":[109],"x":[110],"is":[111,149],"Boolean":[113,121],"word":[114],"held":[115,123],"Alice":[117],"$y,z$":[119],"words":[122],"Bob.":[125],"then":[127],"first":[130],"large":[131],"functions,":[142],"which":[144],"polynomial":[146],"speedup":[148],"possible.":[150],"For":[151],"all":[152],"functions":[154],"investigate,":[156],"only":[158],"previously":[159],"applied":[160],"general":[161],"discrepancy":[167],"$O(\\log":[172],"n)$.":[173]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}