{"id":"https://openalex.org/W4376639494","doi":"https://doi.org/10.1145/3564246.3585208","title":"Quantum Free Games","display_name":"Quantum Free Games","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376639494","doi":"https://doi.org/10.1145/3564246.3585208"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585208","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585208","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585208","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585208","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023960652","display_name":"Anand Natarajan","orcid":"https://orcid.org/0000-0001-6850-0798"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Anand Natarajan","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108825718","display_name":"Tina Zhang","orcid":"https://orcid.org/0000-0002-7229-6686"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tina Zhang","raw_affiliation_strings":["Massachusetts Institute of Technology, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9314,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77995737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1603","last_page":"1616"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994000196456909,"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"}},{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9983000159263611,"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"}},{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5089585781097412},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5030404925346375},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4840249717235565},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4319559931755066},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41761913895606995},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3551449775695801},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.3237934112548828}],"concepts":[{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5089585781097412},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5030404925346375},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4840249717235565},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4319559931755066},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41761913895606995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3551449775695801},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.3237934112548828},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3564246.3585208","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585208","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585208","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/151054","is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/151054","pdf_url":"https://dspace.mit.edu/bitstream/1721.1/151054/1/3564246.3585208.pdf","source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Association for Computing Machinery","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"doi:10.1145/3564246.3585208","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3564246.3585208","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3564246.3585208","source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4376639494.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1631356911","https://openalex.org/W1903246862","https://openalex.org/W2009263142","https://openalex.org/W2019578639","https://openalex.org/W2045356657","https://openalex.org/W2047642496","https://openalex.org/W2088777464","https://openalex.org/W2109437253","https://openalex.org/W2115164346","https://openalex.org/W2144362128","https://openalex.org/W2148352980","https://openalex.org/W2148791594","https://openalex.org/W2253388016","https://openalex.org/W2530940551","https://openalex.org/W2559553876","https://openalex.org/W2610452584","https://openalex.org/W2627090645","https://openalex.org/W2761821748","https://openalex.org/W2774720496","https://openalex.org/W2942051472","https://openalex.org/W3100584152","https://openalex.org/W3102621335","https://openalex.org/W4205465518"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2980963558","https://openalex.org/W1882246857","https://openalex.org/W3103304230","https://openalex.org/W2185360082","https://openalex.org/W1992365905","https://openalex.org/W1976691234","https://openalex.org/W3212023493","https://openalex.org/W2090715877","https://openalex.org/W2572370460"],"abstract_inverted_index":{"The":[0],"complexity":[1,27,292],"of":[2,35,61,89,91,109,118,132,215,230,279,293,308,332],"free":[3,37,48,170,192],"games":[4,49,172,193],"with":[5,50,66,154,173,262],"two":[6,26,67],"or":[7],"more":[8],"classical":[9,36,191,199],"players":[10],"was":[11],"essentially":[12],"settled":[13],"by":[14,76],"Aaronson,":[15,185],"Impagliazzo,":[16],"and":[17,120,123,135,161,187,244,265,282,326,335],"Moshkovitz":[18,188],"(CCC\u201914).":[19],"In":[20,78],"the":[21,41,59,106,130,212,227,238,248,276,290,294,328,349],"quantum":[22,33,62],"world,":[23],"there":[24],"are":[25,73,176,194,318,337],"classes":[28],"that":[29,129,152,169,190,209,299,312,327,342],"can":[30,345],"be":[31,346],"considered":[32],"analogues":[34],"games:":[38],"(1)":[39,94],"AM*,":[40],"multiprover":[42],"interactive":[43],"proof":[44,64,71],"class":[45,60],"corresponding":[46],"to":[47,146,166,289,321],"entangled":[51,171,181],"players,":[52],"and,":[53],"somewhat":[54],"less":[55],"obviously,":[56],"(2)":[57,149],"BellQMA(2),":[58],"Merlin-Arthur":[63],"systems":[65],"unentangled":[68],"Merlins,":[69],"whose":[70,234],"states":[72,142],"separately":[74],"measured":[75],"Arthur.":[77],"this":[79,203],"work,":[80],"we":[81,251,297],"make":[82],"significant":[83,224],"progress":[84],"towards":[85],"a":[86,97,205,223,253,258,287],"tight":[87,144],"characterization":[88],"both":[90],"these":[92,343],"classes.":[93],"We":[95,150,201,340],"show":[96,151,189,202,298],"BellQMA(2)":[98],"protocol":[99,236,256,302],"for":[100,138,237,257,303],"3SAT":[101],"on":[102,127,275],"n":[103],"variables,":[104],"where":[105],"total":[107],"amount":[108],"communication":[110],"is":[111,143,164,222],"\u00d5(\u221an).":[112],"This":[113],"answers":[114],"an":[115,322],"open":[116],"question":[117,158,206],"Chen":[119],"Drucker":[121],"(2010)":[122],"also":[124],"shows,":[125],"conditional":[126],"ETH,":[128],"algorithm":[131],"Brand\u00e3o,":[133],"Christandl":[134],"Yard":[136],"(STOC\u201911)":[137],"optimizing":[139],"over":[140,226],"separable":[141],"up":[145,320],"logarithmic":[147],"factors.":[148],"AM*":[153,255],"nprovers":[155],"=":[156],"2,":[157],"length":[159],"O(1),":[160],"answer-length":[162],"log(n)":[163],"equal":[165],"RE,":[167],"i.e.":[168],"constant-sized":[174],"questions":[175,243,264],"as":[177,179,352],"powerful":[178],"general":[180,198],"games.":[182],"(In":[183],"contrast,":[184],"Impagliazzo":[186],"much":[195],"weaker":[196],"than":[197],"games.)":[200],"using":[204],"\u201chyper-compression\u201d":[207],"theorem":[208],"iteratively":[210],"applies":[211],"introspection":[213],"technique":[214],"Ji":[216,231],"et":[217,232],"al.":[218],"(2020).":[219],"Our":[220],"result":[221,229,278],"improvement":[225],"headline":[228,277],"al.,":[233],"MIP*":[235,301],"halting":[239,295],"problem":[240,296],"has":[241],"(n)-sized":[242],"answers.":[245],"(3)":[246],"By":[247],"same":[249],"techniques,":[250],"obtain":[252],"zero-gap":[254],"\u03a02":[259],"complete":[260],"language":[261],"constant-size":[263],"almost":[266],"logarithmically":[267],"(O(logn":[268],"\u00b7":[269],"log*":[270],"n))":[271],"large":[272],"answers,":[273],"improving":[274],"Mousavi,":[280,333],"Nezhadi":[281,334],"Yuen":[283,336],"(STOC\u201922).":[284],"(4)":[285],"Using":[286],"connection":[288],"nonuniform":[291],"any":[300],"RE":[304],"requires":[305],"\u03a9(logn)":[306],"bits":[307],"communication.":[309],"It":[310],"follows":[311],"our":[313],"results":[314],"in":[315,348],"item":[316],"3":[317],"optimal":[319],"O(log*":[323],"n)":[324],"factor,":[325],"gapless":[329],"compression":[330],"theorems":[331],"asymptotically":[338],"optimal.":[339],"conjecture":[341],"bounds":[344],"saturated":[347],"gapped":[350],"case":[351],"well.":[353]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2023-05-17T00:00:00"}