{"id":"https://openalex.org/W2187615058","doi":null,"title":"The Complexity of Entangled Games","display_name":"The Complexity of Entangled Games","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2187615058","mag":"2187615058"},"language":"en","primary_location":{"id":"pmh:qt5v49k1z2","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/5v49k1z2","pdf_url":"http://www.escholarship.org/uc/item/5v49k1z2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vidick, Thomas. (2011). The Complexity of Entangled Games. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/5v49k1z2","raw_type":"dissertation"},"volume":null,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://www.escholarship.org/uc/item/5v49k1z2","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019616211","display_name":"Thomas Vidick","orcid":"https://orcid.org/0000-0002-6405-365X","observed_orcids":["https://orcid.org/0000-0002-6405-365X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Thomas Vidick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019616211"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":10,"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.8105000257492065,"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.8105000257492065,"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.08569999784231186,"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.039000000804662704,"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/local-correlation","display_name":"local correlation","score":0.7699999809265137},{"id":"https://openalex.org/keywords/mip","display_name":"MIP","score":0.9150000214576721},{"id":"https://openalex.org/keywords/nexptime","display_name":"NEXPTIME","score":0.6330000162124634},{"id":"https://openalex.org/keywords/parallel-repetition","display_name":"parallel repetition","score":0.9179999828338623},{"id":"https://openalex.org/keywords/quantum-interactive-proofs","display_name":"quantum interactive proofs","score":0.3449999988079071},{"id":"https://openalex.org/keywords/quantum-query-complexity","display_name":"quantum query complexity","score":0.414000004529953},{"id":"https://openalex.org/keywords/quantum-communication-complexity","display_name":"quantum communication complexity","score":0.7429999709129333}],"concepts":[{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.8059269189834595},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.609986424446106},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5966442823410034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5589193105697632},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4763879179954529},{"id":"https://openalex.org/C159718280","wikidata":"https://www.wikidata.org/wiki/Q5526353","display_name":"Gas meter prover","level":3,"score":0.4521224796772003},{"id":"https://openalex.org/C143095724","wikidata":"https://www.wikidata.org/wiki/Q515895","display_name":"Odds","level":3,"score":0.41274258494377136},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.33077701926231384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32471513748168945},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.31761783361434937},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.18840491771697998},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1757010817527771},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15686234831809998},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C151956035","wikidata":"https://www.wikidata.org/wiki/Q1132755","display_name":"Logistic regression","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:qt5v49k1z2","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/5v49k1z2","pdf_url":"http://www.escholarship.org/uc/item/5v49k1z2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vidick, Thomas. (2011). The Complexity of Entangled Games. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/5v49k1z2","raw_type":"dissertation"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.374.2097","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.374.2097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.berkeley.edu/Pubs/TechRpts/2013/EECS-2013-32.pdf","raw_type":"text"},{"id":"pmh:oai:berkeley.edu:28722-bk001482j67","doi":null,"is_oa":false,"landing_page_url":"http://techreports.lib.berkeley.edu/accessPages/EECS-2013-32.html","pdf_url":null,"source":{"id":"https://openalex.org/S7407050879","display_name":"UC Berkeley","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I95457486","host_organization_name":"University of California, Berkeley","host_organization_lineage":["https://openalex.org/I95457486"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"technical reports"},{"id":"pmh:oai:escholarship.org/ark:/13030/qt5v49k1z2","doi":null,"is_oa":false,"landing_page_url":"https://escholarship.org/uc/item/5v49k1z2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"etd"},{"id":"mag:2187615058","doi":null,"is_oa":false,"landing_page_url":"http://people.csail.mit.edu/vidick/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:qt5v49k1z2","doi":null,"is_oa":true,"landing_page_url":"http://www.escholarship.org/uc/item/5v49k1z2","pdf_url":"http://www.escholarship.org/uc/item/5v49k1z2","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Vidick, Thomas. (2011). The Complexity of Entangled Games. UC Berkeley: Computer Science. Retrieved from: http://www.escholarship.org/uc/item/5v49k1z2","raw_type":"dissertation"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2187615058.pdf","grobid_xml":"https://content.openalex.org/works/W2187615058.grobid-xml"},"referenced_works_count":131,"referenced_works":["https://openalex.org/W45431887","https://openalex.org/W267547959","https://openalex.org/W281238470","https://openalex.org/W1233382225","https://openalex.org/W1506311017","https://openalex.org/W1506703023","https://openalex.org/W1507028355","https://openalex.org/W1508777461","https://openalex.org/W1511716344","https://openalex.org/W1556285486","https://openalex.org/W1564025554","https://openalex.org/W1577111082","https://openalex.org/W1600412016","https://openalex.org/W1601613236","https://openalex.org/W1631356911","https://openalex.org/W1657558194","https://openalex.org/W1797136128","https://openalex.org/W1872835612","https://openalex.org/W1879643999","https://openalex.org/W1901622511","https://openalex.org/W1931557763","https://openalex.org/W1967175855","https://openalex.org/W1968372742","https://openalex.org/W1968453666","https://openalex.org/W1970259241","https://openalex.org/W1970278864","https://openalex.org/W1989051052","https://openalex.org/W1991877988","https://openalex.org/W1992499648","https://openalex.org/W1997685871","https://openalex.org/W1998918799","https://openalex.org/W1999502904","https://openalex.org/W2007661134","https://openalex.org/W2009005793","https://openalex.org/W2013821228","https://openalex.org/W2015179126","https://openalex.org/W2017636475","https://openalex.org/W2019578639","https://openalex.org/W2022068408","https://openalex.org/W2025323993","https://openalex.org/W2028406173","https://openalex.org/W2028815089","https://openalex.org/W2032606560","https://openalex.org/W2033439890","https://openalex.org/W2035009291","https://openalex.org/W2035532007","https://openalex.org/W2046716184","https://openalex.org/W2049918060","https://openalex.org/W2050190096","https://openalex.org/W2052866997","https://openalex.org/W2057069782","https://openalex.org/W2058302064","https://openalex.org/W2059943757","https://openalex.org/W2060474153","https://openalex.org/W2061106457","https://openalex.org/W2063130531","https://openalex.org/W2070437169","https://openalex.org/W2070683077","https://openalex.org/W2070767505","https://openalex.org/W2071083341","https://openalex.org/W2074447253","https://openalex.org/W2077372202","https://openalex.org/W2078325020","https://openalex.org/W2080132708","https://openalex.org/W2080578129","https://openalex.org/W2082647621","https://openalex.org/W2082730452","https://openalex.org/W2084499569","https://openalex.org/W2086653003","https://openalex.org/W2090418561","https://openalex.org/W2093419514","https://openalex.org/W2097206148","https://openalex.org/W2099340097","https://openalex.org/W2100827027","https://openalex.org/W2103539404","https://openalex.org/W2104965768","https://openalex.org/W2105098759","https://openalex.org/W2107642065","https://openalex.org/W2109672486","https://openalex.org/W2110824700","https://openalex.org/W2114382532","https://openalex.org/W2114473497","https://openalex.org/W2116397277","https://openalex.org/W2116921087","https://openalex.org/W2118143978","https://openalex.org/W2119901068","https://openalex.org/W2119913278","https://openalex.org/W2121059863","https://openalex.org/W2126581590","https://openalex.org/W2135273380","https://openalex.org/W2135453633","https://openalex.org/W2135830616","https://openalex.org/W2136735959","https://openalex.org/W2137955570","https://openalex.org/W2141107613","https://openalex.org/W2145821789","https://openalex.org/W2148352980","https://openalex.org/W2150560365","https://openalex.org/W2154198326","https://openalex.org/W2154300278","https://openalex.org/W2154386769","https://openalex.org/W2155618818","https://openalex.org/W2159131895","https://openalex.org/W2161327939","https://openalex.org/W2161666429","https://openalex.org/W2162685042","https://openalex.org/W2163137752","https://openalex.org/W2163710432","https://openalex.org/W2164253138","https://openalex.org/W2166302514","https://openalex.org/W2167927798","https://openalex.org/W2174563490","https://openalex.org/W2177980858","https://openalex.org/W2195657359","https://openalex.org/W2195967161","https://openalex.org/W2218607027","https://openalex.org/W2286067351","https://openalex.org/W2293988196","https://openalex.org/W2399892102","https://openalex.org/W2403732950","https://openalex.org/W2611055803","https://openalex.org/W2611161794","https://openalex.org/W2810738161","https://openalex.org/W2912359042","https://openalex.org/W2963851389","https://openalex.org/W3004537778","https://openalex.org/W3010301980","https://openalex.org/W3021537373","https://openalex.org/W3101747677","https://openalex.org/W3149588634","https://openalex.org/W4394664162"],"related_works":["https://openalex.org/W2148791594","https://openalex.org/W1152186744","https://openalex.org/W2761821748","https://openalex.org/W228077171","https://openalex.org/W7096842058","https://openalex.org/W4394656716","https://openalex.org/W2999186103","https://openalex.org/W4302287195","https://openalex.org/W1492881893","https://openalex.org/W4415318107"],"abstract_inverted_index":{"Entanglement":[0],"is":[1,172,273,283,293,340,378,601,650,667],"at":[2,143,215,274,364],"the":[3,47,78,81,102,104,144,165,173,177,201,206,218,262,288,297,306,329,337,345,359,368,395,400,457,462,474,488,494,512,537,557,566,602,608,613,632,654,661,674,692,707,726,734,758,761,768,793,798],"heart":[4,289],"of":[5,50,106,131,135,168,175,179,264,290,296,300,308,331,347,354,397,420,423,425,476,478,499,539,559,568,593,610,615,643,648,653,664,676,710,712,770,781,795],"quantum":[6,480,497,616,719,735,755],"mechanics.":[7,617],"The":[8,310,579,646],"nonlocal":[9,82,580],"correlations":[10,83,581],"that":[11,84,261,312,370,385,431,461,515,523,550,582,788],"can":[12,150,388,541,583,774],"be":[13,112,151,223,389,442,542,584,624,683,745,775],"obtained":[14],"from":[15,31,473,527,596],"space-time":[16],"separated":[17],"measurements":[18],"on":[19,139,164,328,556],"an":[20,70,238,294,365],"entangled":[21,170,182,243,271,332,437,443,587],"state":[22],"are":[23,245,435,469,516,524,551],"a":[24,39,67,74,224,232,249,318,322,341,355,375,379,404,417,445,479,500,573,576,590,628,640,670,678,713,754,786],"central":[25],"feature":[26],"which":[27,60,196,406,611,631,742],"provably":[28],"distinguish":[29],"it":[30,91,149,188,235],"local":[32],"theories.":[33],"This":[34,508,600],"dissertation":[35],"studies":[36],"entanglement":[37,51,85,210,398,426,486,540,560,743,796],"through":[38,200],"computational":[40,158,166],"viewpoint.":[41],"We":[42,127,383,402,448,618,737,763],"develop":[43,93],"new":[44,94,108,118,157,577],"insights":[45],"into":[46,521],"complex":[48],"nature":[49,134],"by":[52,259,410,529,586,635,731,751],"studying":[53],"its":[54,140,191,279],"role":[55],"in":[56,59,69,114,285,305,344,391,394,416,428,452,465,518,575,630,696,703,741,747,792],"multiplayer":[57,169,349],"games,":[58],"cooperating,":[61],"but":[62],"non-communicating,":[63],"players":[64,89,207,588,637],"interact":[65],"with":[66,270,444,487],"referee":[68,759],"attempt":[71],"to":[72,92,116,122,153,155,190,211,324,334,506,544,626,682,685,690,733,777],"win":[73],"pre-specified":[75],"game.":[76],"On":[77,101],"one":[79],"hand,":[80],"allows":[86],"may":[87,110,208,483,623,744],"enable":[88],"using":[90,766],"colluding":[95,216],"strategies,":[96],"defeating":[97],"previously":[98,124],"secure":[99,717],"protocols.":[100],"other,":[103],"richness":[105],"this":[107,132,253,257,291,313,450,621,723],"resource":[109],"also":[111,373,752],"exploited":[113,543,625],"order":[115,689],"design":[117,545,627],"protocols,":[119],"providing":[120],"solutions":[121],"problems":[123],"deemed":[125],"impossible.":[126],"explore":[128],"both":[129],"aspects":[130],"dual":[133],"entanglement,":[136,767],"putting":[137],"limits":[138,327],"strength":[141],"while":[142],"same":[145],"time":[146,234],"showing":[147,260],"how":[148,186,536,620],"put":[152],"profit":[154],"solve":[156],"problems.":[159],"A":[160],"major":[161],"unresolved":[162],"question":[163,240,258],"complexity":[167],"games":[171],"power":[174],"MIP*,":[176],"class":[178,227,263,769],"languages":[180,265],"having":[181,266],"multi-prover":[183,546],"interactive":[184,268,547,748],"proofs:":[185],"does":[187,789],"relate":[189],"purely":[192],"classical":[193,280,348],"analogue":[194],"MIP,":[195],"was":[197,407],"completely":[198],"characterized":[199],"fundamental":[202,342],"equation":[203],"MIP=NEXP?":[204],"Since":[205],"use":[209,449],"increase":[212],"their":[213],"odds":[214],"against":[217,336,496,718],"verifier,":[219],"MIP*":[220],"could":[221],"potentially":[222],"much":[225],"weaker":[226],"than":[228,248],"MIP.":[229],"Indeed,":[230],"for":[231,321,673],"long":[233,659],"has":[236],"been":[237,563],"open":[239],"whether":[241],"two":[242,433,453],"provers":[244,272,333],"more":[246],"useful":[247,702],"single":[250],"prover.":[251],"In":[252,456,490,688],"thesis":[254],"we":[255,459,492,534,705,724],"resolve":[256],"multiprover":[267],"proofs":[269],"least":[275],"as":[276,278,658,660],"large":[277,641],"counterpart:":[281],"NEXP":[282],"included":[284],"MIP*.":[286],"At":[287],"result":[292],"analysis":[295,567],"multilinearity":[298],"test":[299,314],"Babai,":[301],"Fortnow,":[302],"and":[303,412,414,565,699,760,783],"Lund":[304],"presence":[307,396,647,675],"entanglement.":[309],"fact":[311,369],"remains":[315],"sound":[316],"gives":[317],"systematic":[319],"way":[320],"verifier":[323],"impose":[325],"strong":[326],"ability":[330],"collude":[335],"verifier.Gap":[338],"amplification":[339,377,387],"primitive":[343],"study":[346,738],"games.":[350],"While":[351],"sequential":[352],"repetition":[353,372],"game":[356],"always":[357],"decreases":[358],"prover's":[360],"maximum":[361],"success":[362],"probability":[363],"exponential":[366],"rate,":[367],"parallel":[371,392],"achieves":[374],"gap":[376,386],"highly":[380],"non-trivial":[381],"fact.":[382],"show":[384,460,535,619,764],"performed":[390],"even":[393,472],"between":[399,757,797],"provers.":[401,489,799],"adapt":[403,725],"technique":[405],"originally":[408,504,729],"introduced":[409,730],"Feige":[411],"Kilian":[413],"results":[415],"polynomial":[418],"rate":[419],"amplification.The":[421],"phenomenon":[422,451,622],"monogamy":[424,538,558],"states,":[427],"first":[429,708],"approximation,":[430],"if":[432],"parties":[434],"maximally":[436],"then":[438],"they":[439],"cannot":[440],"simultaneously":[441],"third":[446],"party.":[447],"distinct":[454],"results.":[455],"first,":[458],"bits":[463,514,633,694],"generated":[464,517],"our":[466,519,569,697],"randomness-expansion":[467],"protocol":[468,520,570,629],"certifiably":[470],"random":[471,693],"point":[475],"view":[477],"adversary":[481],"who":[482],"share":[484],"prior":[485],"addition,":[491],"prove":[493],"security":[495,711],"adversaries":[498],"randomness-efficient":[501],"extractor":[502,716],"construction":[503],"due":[505],"Trevisan.":[507],"lets":[509],"us":[510],"transform":[511],"high-entropy":[513],"ones":[522],"almost":[525],"indistinguishable":[526],"uniform":[528],"any":[530],"adversary.":[531],"More":[532],"generally,":[533],"proof":[548,709,749,772],"systems":[549,750,773],"partially":[552],"entanglement-resistant.":[553],"Quantitative":[554],"bounds":[555],"have":[561],"generally":[562],"elusive,":[564],"demonstrates":[571,612],"such":[572],"bound":[574],"context.":[578],"created":[585],"provide":[589],"statistical":[591,671],"means":[592],"differentiating":[594],"them":[595,701],"classical,":[597],"unentangled":[598],"players.":[599,762],"main":[603],"idea":[604],"behind":[605],"Bell":[606],"inequalities,":[607],"violation":[609],"nonlocality":[614],"produced":[634,695],"successful":[636],"necessarily":[638],"contain":[639],"quantity":[642],"fresh":[644],"randomness.":[645],"randomness":[649],"guaranteed":[651],"irrespective":[652],"provers'":[655],"actual":[656],"strategy,":[657],"sole":[662],"constraint":[663],"no":[665],"signaling":[666],"respected.":[668],"Hence":[669],"certification":[672],"randomness,":[677],"feat":[679],"easily":[680],"seen":[681],"impossible":[684],"achieve":[686,722],"classically.":[687],"manipulate":[691],"protocol,":[698],"make":[700],"cryptography,":[704],"give":[706],"poly-logarithmic":[714],"seed":[715],"adversaries.":[720],"To":[721],"reconstruction":[727],"paradigm":[728],"Trevisan":[732],"setting.":[736],"other":[739],"ways":[740],"used":[746],"allowing":[753],"interaction":[756],"that,":[765],"QMIP*":[771],"parallelized":[776],"only":[778],"three":[779],"rounds":[780],"interaction,":[782],"made":[784],"public-coin,":[785],"property":[787],"not":[790],"hold":[791],"absence":[794]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}