{"id":"https://openalex.org/W7214110283","doi":"https://doi.org/10.48550/arxiv.2609.25680","title":"$\\mathsf{BQP} \\subseteq \\mathsf{IP}$ Does Not Relativize","display_name":"$\\mathsf{BQP} \\subseteq \\mathsf{IP}$ Does Not Relativize","publication_year":2026,"publication_date":"2026-09-22","ids":{"openalex":"https://openalex.org/W7214110283","doi":"https://doi.org/10.48550/arxiv.2609.25680"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.25680","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.25680","pdf_url":"https://arxiv.org/pdf/2609.25680","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.25680","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007781126","display_name":"Adam Bouland","orcid":"https://orcid.org/0000-0002-8556-8337","observed_orcids":["https://orcid.org/0000-0002-8556-8337"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bouland, Adam","raw_affiliation_strings":["Department of Computer Science , Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125625046","display_name":"Andrew Huang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Huang, Andrew","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science , University of California , Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science , University of California , Berkeley","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083428352","display_name":"Anand Natarajan","orcid":"https://orcid.org/0000-0003-3648-3844","observed_orcids":["https://orcid.org/0000-0003-3648-3844","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":"Natarajan, Anand","raw_affiliation_strings":["Department of Computer Science , Massachusetts Institute of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120577361","display_name":"Itay Shalit","orcid":"https://orcid.org/0009-0000-1050-2555","observed_orcids":["https://orcid.org/0009-0000-1050-2555"]},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shalit, Itay","raw_affiliation_strings":["Department of Computer Science , Stanford University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Stanford University","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049425955","display_name":"Avishay Tal","orcid":"https://orcid.org/0000-0002-0375-6554","observed_orcids":["https://orcid.org/0000-0002-0375-6554"]},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tal, Avishay","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science , University of California , Berkeley"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science , University of California , Berkeley","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":1,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9175000190734863,"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.9175000190734863,"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.04740000143647194,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.0210999995470047,"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/bqp","display_name":"BQP","score":0.6389999985694885},{"id":"https://openalex.org/keywords/interactive-proof-systems","display_name":"interactive proofs","score":0.7310000061988831},{"id":"https://openalex.org/keywords/oracle-separation","display_name":"oracle separation","score":0.7680000066757202},{"id":"https://openalex.org/keywords/relativization","display_name":"relativization","score":0.9340000152587891},{"id":"https://openalex.org/keywords/interactive-protocols","display_name":"interactive protocols","score":0.46000000834465027},{"id":"https://openalex.org/keywords/convex-functions","display_name":"convex functions","score":0.6269999742507935},{"id":"https://openalex.org/keywords/quantum-verification","display_name":"quantum verification","score":0.3179999887943268}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7430999875068665},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7182999849319458},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5989999771118164},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.5458999872207642},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5322999954223633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48489999771118164},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.48069998621940613},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4343999922275543},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41690000891685486},{"id":"https://openalex.org/C94284585","wikidata":"https://www.wikidata.org/wiki/Q228184","display_name":"Random oracle","level":4,"score":0.4113999903202057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3935999870300293},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.3610000014305115},{"id":"https://openalex.org/C176329583","wikidata":"https://www.wikidata.org/wiki/Q191943","display_name":"Zero-knowledge proof","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.30889999866485596},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.30309998989105225},{"id":"https://openalex.org/C182359184","wikidata":"https://www.wikidata.org/wiki/Q1756942","display_name":"Partial function","level":2,"score":0.29429998993873596},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2928999960422516},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.28769999742507935},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.2833000123500824},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2809999883174896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2766999900341034},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.2676999866962433},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.25920000672340393},{"id":"https://openalex.org/C7720571","wikidata":"https://www.wikidata.org/wiki/Q1136880","display_name":"Power of two","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.25200000405311584}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.25680","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.25680","pdf_url":"https://arxiv.org/pdf/2609.25680","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.25680","doi":"https://doi.org/10.48550/arxiv.2609.25680","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.25680","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.25680","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.25680","pdf_url":"https://arxiv.org/pdf/2609.25680","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"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/G5458084689","display_name":"CAREER: An Analytical Lens on Quantum Advantage and Pseudorandomness","funder_award_id":"2145474","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7323825548","display_name":"CAREER: New Frontiers of Quantum Pseudorandomness and Complexity","funder_award_id":"2440805","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8414531481","display_name":"CAREER:Exploring the power of quantum protocols for interactive proofs","funder_award_id":"2339948","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"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214110283.pdf","grobid_xml":"https://content.openalex.org/works/W7214110283.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W7154451996"],"related_works":["https://openalex.org/W7154451996","https://openalex.org/W7154685810","https://openalex.org/W2408107348","https://openalex.org/W3216227660","https://openalex.org/W1995363082","https://openalex.org/W7220428076","https://openalex.org/W3217540793","https://openalex.org/W2811500110","https://openalex.org/W7214435502","https://openalex.org/W2347130195"],"abstract_inverted_index":{"We":[0],"construct":[1],"an":[2],"oracle":[3,34],"relative":[4],"to":[5,24,45,66,116,123],"which":[6],"$\\mathsf{BQP}":[7],"\\not\\subseteq":[8],"\\mathsf{IP}$,":[9],"resolving":[10],"a":[11,41,84,101,110,145,181],"long-standing":[12],"open":[13],"question":[14,42],"in":[15,130],"quantum":[16,86,196],"complexity":[17],"theory.":[18],"Together":[19],"with":[20,72,97,137],"recent":[21],"work":[22,29],"due":[23],"Aaronson":[25,155],"et":[26],"al.,":[27],"our":[28],"also":[30],"gives":[31],"the":[32,53,63,73,125,131,150,185],"first":[33,139],"separation":[35,49],"between":[36],"$\\mathsf{IP}$":[37],"and":[38,61,100,140,143,156],"$\\mathsf{MIP}$,":[39],"answering":[40],"dating":[43],"back":[44],"Fortnow's":[46],"thesis.":[47],"Our":[48,104,161],"is":[50,65,70,81,106],"based":[51,107],"on":[52,108,174],"Forrelation":[54,151],"problem,":[55],"where":[56],"given":[57],"Boolean":[58],"functions":[59,136],"$f$":[60,69],"$g$,":[62],"goal":[64],"determine":[67],"if":[68],"correlated":[71],"Fourier":[74],"spectrum":[75],"of":[76,127,187,195],"$g$.":[77],"While":[78],"this":[79],"task":[80],"solvable":[82],"by":[83,134,154],"query-efficient":[85],"algorithm,":[87],"we":[88],"show":[89],"that":[90,149,164],"it":[91],"admits":[92],"no":[93],"classical":[94,167,193],"interactive":[95,128,168],"protocol":[96,169],"polynomial":[98],"communication":[99],"polynomial-query":[102],"verifier.":[103],"proof":[105],"(i)":[109],"new":[111],"structural":[112],"result":[113],"showing":[114],"how":[115],"approximate":[117],"Avg-Max":[118],"circuits":[119],"(which":[120],"are":[121],"well-known":[122],"capture":[124],"power":[126],"proofs":[129],"oracular":[132],"setting)":[133],"convex":[135],"small":[138],"second":[141],"derivatives":[142],"(ii)":[144],"novel":[146],"analysis":[147],"establishing":[148],"distribution":[152],"suggested":[153],"Ambainis":[157],"fools":[158],"such":[159],"functions.":[160],"results":[162],"imply":[163],"any":[165],"prover-efficient":[166],"for":[170,184],"$\\mathsf{BQP}$":[171],"must":[172],"rely":[173],"non-relativizing":[175],"techniques.":[176],"This":[177],"might":[178],"serve":[179],"as":[180],"partial":[182],"explanation":[183],"lack":[186],"progress":[188],"towards":[189],"doubly-efficient,":[190],"unconditionally":[191],"sound":[192],"verification":[194],"computation.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-24T00:00:00"}