{"id":"https://openalex.org/W4376651353","doi":"https://doi.org/10.1145/3564246.3585129","title":"Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory","display_name":"Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory","publication_year":2023,"publication_date":"2023-05-16","ids":{"openalex":"https://openalex.org/W4376651353","doi":"https://doi.org/10.1145/3564246.3585129"},"language":"en","primary_location":{"id":"doi:10.1145/3564246.3585129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585129","pdf_url":null,"source":null,"license":null,"license_id":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060366332","display_name":"Qipeng Liu","orcid":"https://orcid.org/0000-0002-3994-7061"},"institutions":[{"id":"https://openalex.org/I4210107338","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I4210107338"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qipeng Liu","raw_affiliation_strings":["Simons Institute for the Theory of Computing, Berkeley, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Simons Institute for the Theory of Computing, Berkeley, USA","institution_ids":["https://openalex.org/I4210107338"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5021239979","display_name":"Wei Zhan","orcid":"https://orcid.org/0000-0002-7167-6353"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wei Zhan","raw_affiliation_strings":["Princeton University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.971,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.79873061,"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":"1097","last_page":"1110"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9977999925613403,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9937000274658203,"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/computer-science","display_name":"Computer science","score":0.5604493021965027},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5384234189987183},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5133096575737},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.4386396110057831},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37459877133369446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3314535617828369},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3270165026187897},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.19632768630981445},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1463945508003235}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5604493021965027},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5384234189987183},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5133096575737},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4386396110057831},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37459877133369446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3314535617828369},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3270165026187897},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.19632768630981445},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1463945508003235}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3564246.3585129","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3564246.3585129","pdf_url":null,"source":null,"license":null,"license_id":null,"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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3077665131","display_name":"QLCI-CI: NSF Quantum Leap Challenge Institute for Present and Future Quantum Computing","funder_award_id":"2016245","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G394576491","display_name":null,"funder_award_id":"OMA-2016245","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4319323250","display_name":null,"funder_award_id":"HR00112020023","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4924380218","display_name":"AF: Small: Computational Complexity Lower Bounds: Time, Space and Communication","funder_award_id":"2007462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4999567174","display_name":null,"funder_award_id":"OMA-2016245,CCF-1714779,CCF-2007462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G57144956","display_name":"AF: Small: Lower Bounds for Computational Models, and Relations to Other Topics in Computational Complexity","funder_award_id":"1714779","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6566558260","display_name":null,"funder_award_id":"HR00112020023","funder_id":"https://openalex.org/F4320334164","funder_display_name":"Simons Institute for the Theory of Computing, University of California Berkeley"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W231056255","https://openalex.org/W1530248577","https://openalex.org/W1547785251","https://openalex.org/W1585065779","https://openalex.org/W1587406858","https://openalex.org/W1592393009","https://openalex.org/W1848033392","https://openalex.org/W1968372742","https://openalex.org/W2019358670","https://openalex.org/W2045152465","https://openalex.org/W2078134499","https://openalex.org/W2125529777","https://openalex.org/W2133817484","https://openalex.org/W2145765524","https://openalex.org/W2145840445","https://openalex.org/W2155166173","https://openalex.org/W2626222921","https://openalex.org/W2649051464","https://openalex.org/W2769279287","https://openalex.org/W2783378791","https://openalex.org/W2903586563","https://openalex.org/W2945428111","https://openalex.org/W2962750290","https://openalex.org/W2963951786","https://openalex.org/W2982169647","https://openalex.org/W3005666252","https://openalex.org/W3006823398","https://openalex.org/W3021537373","https://openalex.org/W3040455916","https://openalex.org/W3103870741","https://openalex.org/W3104065018","https://openalex.org/W3126688003","https://openalex.org/W3202425833","https://openalex.org/W3203243761","https://openalex.org/W3214111496","https://openalex.org/W4213235348","https://openalex.org/W4285183207"],"related_works":["https://openalex.org/W4388704119","https://openalex.org/W2910123824","https://openalex.org/W3206120658","https://openalex.org/W4213379151","https://openalex.org/W2911278742","https://openalex.org/W3121338985","https://openalex.org/W1889203613","https://openalex.org/W4281550036","https://openalex.org/W2181040799","https://openalex.org/W2035510778"],"abstract_inverted_index":{"In":[0,169,221],"a":[1,51,110,248,299,304,355,403,415,469],"work":[2],"by":[3,277,311],"Raz":[4],"(J.":[5],"ACM":[6],"and":[7,47,99,126,155,193,264,303,349,368,481],"FOCS":[8],"16),":[9],"it":[10],"was":[11],"proved":[12],"that":[13,44,49,109,185,334,339,363,414,451,461],"any":[14,186,340,364],"algorithm":[15,188,239,306,365],"for":[16,50,121,147,196,228,323,372,429],"parity":[17,197,229,455],"learning":[18,56,73,135,150,165,175,198,230,238,270,288,305,374,431,456],"on":[19,141,199,432,454,457],"n":[20,200,254,458,483],"bits":[21,25,205,211,385,477,484],"requires":[22,202],"either":[23,58,203,380],"\u03a9(n2)":[24,204],"of":[26,35,40,54,102,113,132,144,160,180,206,212,219,251,314,342,344,357,386,393,418,425,441,468,478,485],"classical":[27,55,60,76,81,122,134,164,174,191,207,246,269,367,387,426,479],"memory":[28,61,115,123,146,162,192,208,214,250,371,420,427,480,487],"or":[29,63,124,209,215,389,396],"an":[30,216],"exponential":[31,217],"number":[32,218],"(in":[33],"\u200dn)":[34],"random":[36,297,315,399],"samples.":[37,220],"A":[38,281,327],"line":[39],"recent":[41,139],"works":[42,71],"continued":[43],"research":[45,140],"direction":[46],"showed":[48],"large":[52],"collection":[53],"tasks,":[57],"super-linear":[59],"size":[62,252,424],"super-polynomially":[64],"many":[65,267],"samples":[66,125,316],"are":[67,336,452],"needed.":[68],"All":[69],"these":[70,87,433],"consider":[72],"algorithms":[74],"as":[75],"branching":[77],"programs,":[78],"which":[79],"perform":[80],"computation":[82],"within":[83],"bounded":[84],"memory.":[85,104,182],"However,":[86],"results":[88,410,436],"do":[89],"not":[90],"capture":[91],"all":[92],"physical":[93],"computational":[94],"models,":[95],"remarkably,":[96],"quantum":[97,103,114,145,149,161,181,187,194,213,249,369,394,419,470,486],"computers":[98],"the":[100,107,119,130,133,138,142,158,178,224,233,237,245,278,286,373,412,423,447,466],"use":[101],"It":[105],"leaves":[106],"possibility":[108,413],"small":[111,416],"piece":[112],"could":[116],"significantly":[117,421],"reduce":[118],"need":[120],"thus":[127],"completely":[128],"change":[129],"nature":[131],"task.":[136,289],"Despite":[137],"necessity":[143],"intrinsic":[148],"problems":[151],"like":[152],"shadow":[153],"tomography":[154],"purity":[156],"testing,":[157],"role":[159],"in":[163,177,242,446,465],"tasks":[166,176],"remains":[167,231],"obscure.":[168],"this":[170],"work,":[171],"we":[172,275],"study":[173],"presence":[179,467],"We":[183,361],"prove":[184,362],"with":[189,366,472],"both,":[190],"memory,":[195,247,388,395],"bits,":[201],"\u03a9(n)":[210],"other":[222,268],"words,":[223],"memory-sample":[225],"lower":[226],"bound":[227],"qualitatively":[232],"same,":[234],"even":[235,464],"if":[236],"can":[240],"use,":[241],"addition":[243],"to":[244,266,308,377,401],"c":[253,475,482],"(for":[255,488],"some":[256,489],"constant":[257,490],"c>0).":[258,491],"Our":[259,409,435],"result":[260],"is":[261,293,328],"more":[262],"general":[263],"applies":[265],"tasks.":[271],"Following":[272],"previous":[273],"works,":[274],"represent":[276],"matrix":[279],"M:":[280],"\u00d7":[282],"X":[283],"\u2192":[284],"{\u22121,1}":[285],"following":[287],"An":[290],"unknown":[291],"x":[292,310],"sampled":[294],"uniformly":[295,330],"at":[296,331,345,350,358,406,473],"from":[298],"concept":[300],"class":[301],"X,":[302],"tries":[307],"uncover":[309],"seeing":[312],"streaming":[313],"(ai,":[317],"bi":[318],"=":[319],"M(ai,":[320],"x))":[321],"where":[322],"every":[324],"i,":[325],"ai\u2208":[326],"chosen":[329],"random.":[332],"Assume":[333],"k,\u2113,r":[335],"integers":[337],"such":[338],"submatrix":[341],"M":[343,378],"least":[346,351,407],"2\u2212k\u00b7|A|":[347],"rows":[348],"2\u2212\u2113\u00b7|X|":[352],"columns,":[353],"has":[354],"bias":[356],"most":[359,474],"2\u2212r.":[360],"hybrid":[370],"problem":[375],"corresponding":[376],"needs":[379],"(1)":[381],"\u03a9(k":[382],"\u00b7":[383],"\u2113)":[384],"(2)":[390],"\u03a9(r)":[391],"qubits":[392],"(3)":[397],"2\u03a9(r)":[398],"samples,":[400],"achieve":[402],"success":[404],"probability":[405],"2\u2212O(r).":[408],"refute":[411],"amount":[417],"reduces":[422],"needed":[428],"efficient":[430],"problems.":[434],"also":[437],"imply":[438],"improved":[439],"security":[440,462],"several":[442],"existing":[443],"cryptographical":[444],"protocols":[445],"bounded-storage":[448],"model":[449],"(protocols":[450],"based":[453],"bits),":[459],"proving":[460],"holds":[463],"adversary":[471],"n2":[476]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}