{"id":"https://openalex.org/W1663218918","doi":"https://doi.org/10.1145/2698587","title":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","display_name":"Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems","publication_year":2015,"publication_date":"2015-06-26","ids":{"openalex":"https://openalex.org/W1663218918","doi":"https://doi.org/10.1145/2698587","mag":"1663218918"},"language":"en","primary_location":{"id":"doi:10.1145/2698587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2698587","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5045669197","display_name":"Andris Ambainis","orcid":"https://orcid.org/0000-0002-8716-001X"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Andris Ambainis","raw_affiliation_strings":["University of Waterloo","(University of Waterloo)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo","institution_ids":["https://openalex.org/I151746483"]},{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089274175","display_name":"William Gasarch","orcid":"https://orcid.org/0000-0003-3698-5991"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William Gasarch","raw_affiliation_strings":["University of Maryland, College Park, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, MD"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055114830","display_name":"Andrey Utis","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrey Utis","raw_affiliation_strings":["University of Maryland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5475,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.91638718,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"7","issue":"3","first_page":"1","last_page":"10"},"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.9997000098228455,"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/T10622","display_name":"Quantum Mechanics and Applications","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/alice-and-bob","display_name":"Alice and Bob","score":0.7800614833831787},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6936624050140381},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.6357563734054565},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5991120934486389},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.551463782787323},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5489674806594849},{"id":"https://openalex.org/keywords/quantum-information-science","display_name":"Quantum information science","score":0.5469304919242859},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5155958533287048},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5039986968040466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42136138677597046},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30237460136413574},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"Quantum entanglement","score":0.19968098402023315},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.16548827290534973},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1394956111907959}],"concepts":[{"id":"https://openalex.org/C127964579","wikidata":"https://www.wikidata.org/wiki/Q649676","display_name":"Alice and Bob","level":3,"score":0.7800614833831787},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6936624050140381},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.6357563734054565},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5991120934486389},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.551463782787323},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5489674806594849},{"id":"https://openalex.org/C5320026","wikidata":"https://www.wikidata.org/wiki/Q2122216","display_name":"Quantum information science","level":4,"score":0.5469304919242859},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5155958533287048},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5039986968040466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42136138677597046},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30237460136413574},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.19968098402023315},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.16548827290534973},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1394956111907959},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2698587","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2698587","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8911331200","display_name":"NetSE: Large: Collaborative Research: Contagion in Large Socio-Communication Networks","funder_award_id":"1010789","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":25,"referenced_works":["https://openalex.org/W605043455","https://openalex.org/W1521213514","https://openalex.org/W1583476325","https://openalex.org/W1964507566","https://openalex.org/W1997315904","https://openalex.org/W2010796327","https://openalex.org/W2012824096","https://openalex.org/W2020725861","https://openalex.org/W2028750115","https://openalex.org/W2030578446","https://openalex.org/W2044492449","https://openalex.org/W2047520864","https://openalex.org/W2080861403","https://openalex.org/W2088263428","https://openalex.org/W2097384191","https://openalex.org/W2106810140","https://openalex.org/W2129275337","https://openalex.org/W2146101030","https://openalex.org/W2152221459","https://openalex.org/W2153672863","https://openalex.org/W2168669679","https://openalex.org/W2340787257","https://openalex.org/W2914621247","https://openalex.org/W2953229616","https://openalex.org/W3023488886"],"related_works":["https://openalex.org/W3037084761","https://openalex.org/W2120222618","https://openalex.org/W2132559993","https://openalex.org/W2243645005","https://openalex.org/W3134161675","https://openalex.org/W2154150949","https://openalex.org/W2767455857","https://openalex.org/W3022052004","https://openalex.org/W1984126159","https://openalex.org/W2012824096"],"abstract_inverted_index":{"Alice":[0],"and":[1,61],"Bob":[2],"want":[3],"to":[4],"know":[5],"if":[6,85],"two":[7,86],"strings":[8,19,87],"of":[9,59,66,101],"length":[10],"n":[11,31,55,67],"are":[12,95],"almost":[13],"equal.":[14],"That":[15],"is,":[16],"do":[17],"the":[18,80,99,102],"differ":[20,88],"on":[21],"at":[22,53],"most":[23],"a":[24,29,63,91],"bits?":[25],"Let":[26],"0":[27],"\u2a7d":[28,30],"\u2212":[32,56,69],"1.":[33],"We":[34,77],"show":[35,79],"(1)":[36],"any":[37,42],"deterministic":[38],"protocol\u2014as":[39],"well":[40],"as":[41],"error-free":[43,72],"quantum":[44,75],"protocol":[45],"(":[46],"C":[47],"*":[48,74],"version)\u2014for":[49],"this":[50],"problem":[51],"requires":[52],"least":[54],"2":[57],"bits":[58],"communication,":[60],"(2)":[62],"lower":[64],"bound":[65],"/2":[68],"1":[70],"for":[71,83],"Q":[73],"protocols.":[76],"also":[78],"same":[81],"results":[82,94],"determining":[84],"in":[89],"exactly":[90],"bits.":[92],"Our":[93],"obtained":[96],"by":[97],"lower-bounding":[98],"ranks":[100],"appropriate":[103],"matrices.":[104]},"counts_by_year":[{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":2}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}