{"id":"https://openalex.org/W7211990334","doi":"https://doi.org/10.48550/arxiv.2609.07945","title":"Promises should be taken seriously: On relativization with promise problems","display_name":"Promises should be taken seriously: On relativization with promise problems","publication_year":2026,"publication_date":"2026-09-07","ids":{"openalex":"https://openalex.org/W7211990334","doi":"https://doi.org/10.48550/arxiv.2609.07945"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.07945","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07945","pdf_url":"https://arxiv.org/pdf/2609.07945","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.07945","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5114647698","display_name":"David Miloschewsky","orcid":"https://orcid.org/0009-0005-8965-678X","observed_orcids":["https://orcid.org/0009-0005-8965-678X"]},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Miloschewsky, David","raw_affiliation_strings":["Department of Computer Science , Stony Brook University , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Stony Brook University , USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114336526","display_name":"Supartha Podder","orcid":"https://orcid.org/0009-0004-6455-0252","observed_orcids":["https://orcid.org/0009-0004-6455-0252"]},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Podder, Supartha","raw_affiliation_strings":["Department of Computer Science , Stony Brook University , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science , Stony Brook University , USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056653308","display_name":"Dorian Rudolph","orcid":"https://orcid.org/0000-0002-2440-7388","observed_orcids":["https://orcid.org/0000-0002-2440-7388"]},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Rudolph, Dorian","raw_affiliation_strings":["Department of Computer Science and","Institute for Photonic Quantum Systems (PhoQS) , Paderborn University , Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and","institution_ids":[]},{"raw_affiliation_string":"Institute for Photonic Quantum Systems (PhoQS) , Paderborn University , Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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.46070000529289246,"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.46070000529289246,"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.3986999988555908,"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.058400001376867294,"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/relativization","display_name":"relativization","score":0.9520000219345093},{"id":"https://openalex.org/keywords/promise-problems","display_name":"promise problems","score":0.9369999766349792},{"id":"https://openalex.org/keywords/counting-hierarchy","display_name":"counting hierarchy","score":0.5509999990463257},{"id":"https://openalex.org/keywords/pp","display_name":"PP","score":0.5360000133514404},{"id":"https://openalex.org/keywords/post-selection","display_name":"post-selection","score":0.7080000042915344},{"id":"https://openalex.org/keywords/counting-classes","display_name":"counting classes","score":0.3100000023841858},{"id":"https://openalex.org/keywords/oracle-separation","display_name":"oracle separation","score":0.3199999928474426}],"concepts":[{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.7373999953269958},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.734000027179718},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6743999719619751},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6360999941825867},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6051999926567078},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5471000075340271},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.5192999839782715},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3846000134944916},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3239000141620636},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3165999948978424},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30000001192092896},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.27309998869895935},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.25999999046325684},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25529998540878296}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.07945","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07945","pdf_url":"https://arxiv.org/pdf/2609.07945","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.07945","doi":"https://doi.org/10.48550/arxiv.2609.07945","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.07945","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.07945","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.07945","pdf_url":"https://arxiv.org/pdf/2609.07945","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7211990334.pdf","grobid_xml":"https://content.openalex.org/works/W7211990334.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2285066784","https://openalex.org/W4388962799","https://openalex.org/W2052292580","https://openalex.org/W2964031227","https://openalex.org/W2811500110","https://openalex.org/W1678491550","https://openalex.org/W4404350854","https://openalex.org/W1498101850","https://openalex.org/W3175597358","https://openalex.org/W7098323769"],"abstract_inverted_index":{"Relativization":[0],"is":[1,18,155,210],"concerned":[2],"with":[3,7],"comparing":[4],"computational":[5],"models":[6],"black-box":[8,16],"access":[9,17,54],"to":[10,22,111,118,130,165,170,203],"an":[11,82,163],"oracle.":[12],"For":[13],"promise":[14,27,77,171,183],"problems,":[15],"not":[19,64,109],"canonical":[20],"due":[21],"inputs":[23],"outside":[24],"of":[25,46,49,60,198],"the":[26,47,50,57,74,120,124,187,196],"being":[28],"unconstrained.":[29],"We":[30],"study":[31],"two":[32],"semantics":[33],"for":[34,106,179,212],"such":[35,85],"access.":[36],"Under":[37],"robust":[38,158],"queries,":[39],"a":[40,61,181],"machine":[41,62],"must":[42],"correctly":[43],"answer":[44],"regardless":[45],"completion":[48],"problem,,":[51],"while":[52],"loose":[53,116],"requires":[55],"that":[56,86,104,148,208],"internal":[58],"choices":[59],"do":[63],"change":[65],"based":[66],"on":[67,123],"off-promise":[68],"queries.":[69,159],"Our":[70],"first":[71],"result":[72],"separates":[73],"language":[75],"and":[76,175],"settings.":[78],"Namely,":[79],"we":[80,114,146,161,214],"construct":[81],"oracle":[83],"$O$":[84],"$\\mathsf{P}^O":[87],"=":[88,90,97,143,217],"\\mathsf{BQP}^O":[89],"\\mathsf{AWPP}^O$,":[91],"but":[92,99],"$\\mathsf{PromiseBQP}^O\\not\\subseteq\\mathsf{PromiseP}^O_{\\mathsf{/poly}}$.":[93],"In":[94],"particular,":[95],"$\\mathsf{BPP}^O":[96],"\\mathsf{BQP}^O$,":[98],"$\\mathsf{PromiseBQP}^O":[100],"\\neq":[101],"\\mathsf{PromiseBPP}^O$,":[102],"showing":[103,207],"results":[105,169],"languages":[107],"need":[108],"transfer":[110],"promises.":[112],"Next,":[113],"use":[115],"queries":[117],"strengthen":[119],"upper":[121],"bound":[122],"Quantum-Classical":[125],"Polynomial":[126],"Hierarchy":[127],"from":[128],"$\\mathsf{P}^{\\mathsf{PP}^{\\mathsf{PP}}}$":[129],"$\\mathsf{QCPH}":[131],"\\subseteq":[132,135,192],"\\mathsf{BP\\cdot":[133],"PP}":[134],"\\mathsf{PromiseBPP}^{\\mathsf{PP}}$.":[136],"The":[137],"same":[138],"proof":[139],"also":[140],"shows":[141],"$\\mathsf{PP}^\\mathsf{PromiseBQP}":[142],"\\mathsf{PP}$.":[144,218],"Additionally,":[145],"show":[147],"$\\mathsf{PromiseBQP}$,":[149],"even":[150],"when":[151],"given":[152],"quantum":[153],"advice,":[154],"self-low":[156],"under":[157],"Finally,":[160],"exhibit":[162],"obstruction":[164],"transferring":[166],"language-level":[167],"counting":[168,188],"classes.":[172],"Although":[173],"$\\mathsf{AWPP}$":[174],"$\\mathsf{APP}$":[176],"are":[177],"low":[178,211],"$\\mathsf{PP}$,":[180],"corresponding":[182],"analogue":[184],"would":[185],"collapse":[186],"hierarchy":[189],"as":[190],"$\\mathsf{GapP}":[191],"\\mathsf{FP}^{\\mathsf{PromiseAWPP}}$.":[193],"This":[194],"motivates":[195],"introduction":[197],"$\\mathsf{PromisePostBQP^*}$,":[199],"which":[200],"restricts":[201],"$\\mathsf{PostBQP}$":[202],"input-indepencent":[204],"postselection.":[205],"By":[206],"it":[209],"\\PP,":[213],"obtain":[215],"$\\mathsf{PP}^{\\mathsf{PromiseYQP^*}}":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-10T00:00:00"}