{"id":"https://openalex.org/W7225418285","doi":"https://doi.org/10.21203/rs.3.rs-11229222/v1","title":"Exact Zero-Error Communication Complexity of an Entanglement-Assisted Quantum Learning Task","display_name":"Exact Zero-Error Communication Complexity of an Entanglement-Assisted Quantum Learning Task","publication_year":2026,"publication_date":"2026-11-06","ids":{"openalex":"https://openalex.org/W7225418285","doi":"https://doi.org/10.21203/rs.3.rs-11229222/v1"},"language":"en","primary_location":{"id":"doi:10.21203/rs.3.rs-11229222/v1","doi":"https://doi.org/10.21203/rs.3.rs-11229222/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11229222/v1","pdf_url":"https://www.researchsquare.com/article/rs-11229222/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Research Square","raw_type":"posted-content"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.researchsquare.com/article/rs-11229222/latest.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048764751","display_name":"David Vesterlund","orcid":"https://orcid.org/0009-0000-6455-1141","observed_orcids":["https://orcid.org/0009-0000-6455-1141"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"David Vesterlund","raw_affiliation_strings":["Vesterlund Ventures"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Vesterlund Ventures","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5048764751"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.5435000061988831,"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"}},"topics":[{"id":"https://openalex.org/T10020","display_name":"Quantum Information and Cryptography","score":0.5435000061988831,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.4350999891757965,"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.007300000172108412,"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/bell-pairs","display_name":"Bell pairs","score":0.8330000042915344},{"id":"https://openalex.org/keywords/total-domination-number","display_name":"total domination number","score":0.9909999966621399}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6970000267028809},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5799000263214111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5350000262260437},{"id":"https://openalex.org/C5274069","wikidata":"https://www.wikidata.org/wiki/Q2285707","display_name":"Categorical variable","level":2,"score":0.5123000144958496},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.48240000009536743},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.46540001034736633},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4390000104904175},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.42879998683929443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42149999737739563},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.3930000066757202},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3912000060081482},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3824999928474426},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.35260000824928284},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.33799999952316284},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C12269588","wikidata":"https://www.wikidata.org/wiki/Q132364","display_name":"Communications protocol","level":2,"score":0.31119999289512634},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2953999936580658},{"id":"https://openalex.org/C187486625","wikidata":"https://www.wikidata.org/wiki/Q2122176","display_name":"Quantum channel","level":4,"score":0.29490000009536743},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.2851000130176544},{"id":"https://openalex.org/C5320026","wikidata":"https://www.wikidata.org/wiki/Q2122216","display_name":"Quantum information science","level":4,"score":0.2847000062465668},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.27379998564720154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.26809999346733093},{"id":"https://openalex.org/C158156997","wikidata":"https://www.wikidata.org/wiki/Q1416645","display_name":"Models of communication","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2549999952316284},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.21203/rs.3.rs-11229222/v1","doi":"https://doi.org/10.21203/rs.3.rs-11229222/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11229222/v1","pdf_url":"https://www.researchsquare.com/article/rs-11229222/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Research Square","raw_type":"posted-content"}],"best_oa_location":{"id":"doi:10.21203/rs.3.rs-11229222/v1","doi":"https://doi.org/10.21203/rs.3.rs-11229222/v1","is_oa":true,"landing_page_url":"https://doi.org/10.21203/rs.3.rs-11229222/v1","pdf_url":"https://www.researchsquare.com/article/rs-11229222/latest.pdf","source":{"id":"https://openalex.org/S4306525896","display_name":"Research Square","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Research Square","raw_type":"posted-content"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7225418285.pdf","grobid_xml":"https://content.openalex.org/works/W7225418285.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W7127434480","https://openalex.org/W7203452846"],"related_works":["https://openalex.org/W7215091644","https://openalex.org/W2167595556","https://openalex.org/W1535334942","https://openalex.org/W2796455770","https://openalex.org/W2604835688","https://openalex.org/W7097856604","https://openalex.org/W7216388945","https://openalex.org/W3098665333","https://openalex.org/W4403686019","https://openalex.org/W7025339839"],"abstract_inverted_index":{"Abstract":[0],"Zhao":[1],"and":[2],"Deng":[3],"introduced":[4],"an":[5,56],"entanglement-assisted":[6],"learning":[7],"task":[8],"exhibiting":[9],"a":[10,17],"constant-versus-linear":[11],"separation":[12],"against":[13],"communication-bounded":[14],"classical":[15,31,36,49,62],"models:":[16],"quantum":[18],"protocol":[19],"with":[20,28],"\\(\\:2n\\)":[21],"preshared":[22],"Bell":[23],"pairs":[24],"achieves":[25],"perfect":[26,65],"success":[27,66],"zero":[29],"input-dependent":[30],"communication,":[32],"while":[33],"commonly":[34],"used":[35],"models":[37],"must":[38],"scale":[39],"linearly":[40],"to":[41],"achieve":[42],"nontrivial":[43],"accuracy.":[44],"The":[45],"exact":[46,57],"zero-error":[47],"one-way":[48,61],"communication":[50,63],"cost":[51],"was":[52],"unknown.":[53],"We":[54],"prove":[55],"reduction:":[58],"the":[59,68,71,76,81],"minimum":[60],"for":[64],"equals":[67],"logarithm":[69],"of":[70,80],"ternary-cube":[72],"covering":[73],"number,":[74],"equivalently":[75],"total":[77],"domination":[78],"number":[79],"categorical":[82],"power":[83],"\\(\\:{K}_{3}^{\\times\\:n}\\):":[84]},"counts_by_year":[],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-11-07T00:00:00"}