{"id":"https://openalex.org/W2949894459","doi":null,"title":"BQP and the Polynomial Hierarchy","display_name":"BQP and the Polynomial Hierarchy","alternate_titles":[],"publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2949894459","mag":"2949894459"},"language":"en","primary_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/54236","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/54236","pdf_url":null,"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,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"parent_works":[],"lineage":["https://openalex.org/W2949894459"],"child_works_count":0,"type":"preprint","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/54236","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020769134","display_name":"Scott Aaronson","orcid":"https://orcid.org/0000-0003-1333-4045","observed_orcids":["https://orcid.org/0000-0003-1333-4045"]},"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":true,"contributor_roles":[],"raw_author_name":"Scott Aaronson","raw_affiliation_strings":["MIT  Cambridge MA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT  Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020769134"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":14,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9526000022888184,"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.9526000022888184,"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.041099999099969864,"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.0013000000035390258,"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/bqp","display_name":"BQP","score":0.9869999885559082},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"polynomial hierarchy","score":0.9929999709129333},{"id":"https://openalex.org/keywords/quantum-computing","display_name":"quantum computing","score":0.48399999737739563},{"id":"https://openalex.org/keywords/oracle-separation","display_name":"oracle separation","score":0.7239999771118164},{"id":"https://openalex.org/keywords/ac0","display_name":"AC0","score":0.7020000219345093},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"pseudorandomness","score":0.7940000295639038},{"id":"https://openalex.org/keywords/fourier-analysis","display_name":"Fourier analysis","score":0.7260000109672546},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"circuit complexity","score":0.7680000066757202}],"concepts":[{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.7305775284767151},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.5675511360168457},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.566361665725708},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.5625067353248596},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5367895364761353},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5092552900314331},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.4949890971183777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4726138412952423},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.45750004053115845},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44052615761756897},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42786288261413574},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4013800323009491},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.3413311839103699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3353191912174225},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2817026972770691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1607426106929779},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.1431688368320465},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:dspace.mit.edu:1721.1/54236","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/54236","pdf_url":null,"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,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.767.2353","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.767.2353","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0910.4698.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/54236","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/54236","pdf_url":null,"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,"listed_in":[],"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-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W50958263","https://openalex.org/W337018396","https://openalex.org/W1529232181","https://openalex.org/W1543584257","https://openalex.org/W1554987852","https://openalex.org/W1558847040","https://openalex.org/W1592854296","https://openalex.org/W1888513637","https://openalex.org/W2006290558","https://openalex.org/W2017290750","https://openalex.org/W2020029222","https://openalex.org/W2033216491","https://openalex.org/W2040813148","https://openalex.org/W2040958198","https://openalex.org/W2042194938","https://openalex.org/W2044667552","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2077202644","https://openalex.org/W2093786499","https://openalex.org/W2093796999","https://openalex.org/W2106828252","https://openalex.org/W2116006830","https://openalex.org/W2121048498","https://openalex.org/W2122780600","https://openalex.org/W2124646923","https://openalex.org/W2137005141","https://openalex.org/W2145860679","https://openalex.org/W2290439792","https://openalex.org/W2741390383","https://openalex.org/W2913788899","https://openalex.org/W3021537373","https://openalex.org/W3023478445","https://openalex.org/W3100206777"],"related_works":["https://openalex.org/W3217540793","https://openalex.org/W7097727476","https://openalex.org/W3216227660","https://openalex.org/W2097232651","https://openalex.org/W2811500110","https://openalex.org/W4390647477","https://openalex.org/W6904017505","https://openalex.org/W1833797457","https://openalex.org/W7096707687","https://openalex.org/W7098670006"],"abstract_inverted_index":{"The":[0,120],"relationship":[1],"between":[2],"BQP":[3,99],"and":[4,42,113],"PH":[5,101],"has":[6],"been":[7],"an":[8,51,94],"open":[9,136],"problem":[10,54,57,77,97],"since":[11],"the":[12,28,105],"earliest":[13],"days":[14],"of":[15,117],"quantum":[16,22,82],"computing.":[17],"We":[18],"present":[19],"evidence":[20],"that":[21,48,62,78,93],"computers":[23],"can":[24],"solve":[25],"problems":[26],"outside":[27],"entire":[29],"polynomial":[30],"hierarchy,":[31],"by":[32,132],"relating":[33],"this":[34],"question":[35],"to":[36],"topics":[37],"in":[38,65,69,81,87],"circuit":[39],"complexity,":[40],"pseudorandomness,":[41],"Fourier":[43],"analysis.":[44],"First,":[45],"we":[46,91,110],"show":[47,92],"there":[49],"exists":[50],"oracle":[52,95],"relation":[53,76],"(i.e.,":[55],"a":[56,74],"with":[58],"many":[59],"valid":[60],"outputs)":[61],"is":[63,79,115],"solvable":[64,80],"BQP,":[66],"but":[67,85],"not":[68,86],"PH.":[70],"This":[71],"also":[72],"yields":[73],"non-oracle":[75],"logarithmic":[83],"time,":[84],"AC[superscript":[88],"0].":[89],"Second,":[90],"decision":[96],"separating":[98],"from":[100,104],"would":[102],"follow":[103],"Generalized":[106],"Linial-Nisan":[107,122],"Conjecture,":[108],"which":[109,114],"formulate":[111],"here":[112],"likely":[116],"independent":[118],"interest.":[119],"original":[121],"Conjecture":[123],"(about":[124],"pseudorandomness":[125],"against":[126],"constant-depth":[127],"circuits)":[128],"was":[129],"recently":[130],"proved":[131],"Braverman,":[133],"after":[134],"being":[135],"for":[137],"twenty":[138],"years.":[139]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2949894459","counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2019-06-27T00:00:00"}
