{"id":"https://openalex.org/W2116377806","doi":null,"title":"Robust Quantum Algorithms and Polynomials","display_name":"Robust Quantum Algorithms and Polynomials","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2116377806","mag":"2116377806"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.251.3401","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.251.3401","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/quant-ph/0309220v1.pdf","raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":[],"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/A5083983355","display_name":"Harry Buhrman","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005870042","display_name":"Ilan Newman","orcid":"https://orcid.org/0000-0002-4845-4111","observed_orcids":["https://orcid.org/0000-0002-4845-4111"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ilan Newman","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4845-4111","affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034932874","display_name":"Hein R\u00f6hrig","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hein R\u00f6hrig","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5066563480","display_name":"Ronald de Wolf","orcid":"https://orcid.org/0000-0001-5147-6090","observed_orcids":["https://orcid.org/0000-0001-5147-6090"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"de Ronald Wolf","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"593","last_page":"604"},"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.9984999895095825,"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.9984999895095825,"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.0005000000237487257,"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.0005000000237487257,"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/quantum-query-complexity","display_name":"quantum query complexity","score":0.8429999947547913},{"id":"https://openalex.org/keywords/multilinear-polynomials","display_name":"multilinear polynomials","score":0.7639999985694885},{"id":"https://openalex.org/keywords/boolean-function-approximation","display_name":"Boolean function approximation","score":0.7879999876022339},{"id":"https://openalex.org/keywords/polynomial-degree","display_name":"polynomial degree","score":0.546999990940094},{"id":"https://openalex.org/keywords/parity-function","display_name":"parity function","score":0.6579999923706055},{"id":"https://openalex.org/keywords/noise-robustness","display_name":"noise robustness","score":0.3619999885559082}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5381795763969421},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4992208480834961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.41710036993026733},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3243946433067322},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1724686324596405},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.15134236216545105}],"mesh":[],"locations_count":6,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.251.3401","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.251.3401","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/quant-ph/0309220v1.pdf","raw_type":"text"},{"id":"mag:2116377806","doi":null,"is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/robust-quantum-algorithms-and-polynomials(90024af5-6fdf-4e87-8a29-e429c2628f50).html","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},{"id":"pmh:cwi:oai:cwi.nl:16383","doi":null,"is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/16383","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:oai:cwi.nl:16383","doi":null,"is_oa":false,"landing_page_url":"https://ir.cwi.nl/pub/16383","pdf_url":null,"source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/90024af5-6fdf-4e87-8a29-e429c2628f50","doi":null,"is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/robust-quantum-algorithms-and-polynomials(90024af5-6fdf-4e87-8a29-e429c2628f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Buhrman, H M, Newman, I, R\u00f6hrig, H P & de Wolf, R M 2005, Robust Quantum Algorithms and Polynomials. in Proceedings of STACS 2005. vol. 3404, Stuttgart, pp. 593-604, STACS 2005, 24/02/05.","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/90024af5-6fdf-4e87-8a29-e429c2628f50","doi":null,"is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/robust-quantum-algorithms-and-polynomials(90024af5-6fdf-4e87-8a29-e429c2628f50).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of STACS 2005, 3404, 593 - 604","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1618756527","https://openalex.org/W2012496360","https://openalex.org/W2038435918","https://openalex.org/W2084652510","https://openalex.org/W2122780600","https://openalex.org/W2168377622","https://openalex.org/W2340787257"],"related_works":["https://openalex.org/W1859250467","https://openalex.org/W7096403559","https://openalex.org/W3037548944","https://openalex.org/W2962787320","https://openalex.org/W7098437430","https://openalex.org/W7211884025","https://openalex.org/W2173487837","https://openalex.org/W7098802782","https://openalex.org/W7096929050","https://openalex.org/W7096455530"],"abstract_inverted_index":{"We":[0,21,65],"study":[1],"the":[2,15,29,71],"complexity":[3],"of":[4,73],"robust":[5,24],"quantum":[6,25,46],"algorithms.":[7],"These":[8],"still":[9],"work":[10],"with":[11,32,49,54],"high":[12,33],"probability":[13,34],"if":[14],"n":[16],"input":[17,31],"bits":[18],"are":[19],"noisy.":[20],"exhibit":[22],"a":[23],"algorithm":[26],"that":[27,40,76],"recovers":[28],"complete":[30],"using":[35],"O(n)":[36,50],"queries.":[37],"This":[38],"implies":[39],"every":[41],"n-bit":[42],"function":[43],"can":[44],"be":[45],"computed":[47],"robustly":[48,77],"queries,":[51],"which":[52],"contrasts":[53],"Feige":[55],"et":[56],"al.\u2019s":[57],"\u2126(n":[58],"log":[59],"n)":[60],"classical":[61],"bound":[62],"for":[63],"PARITY.":[64],"also":[66],"give":[67],"similar":[68],"bounds":[69],"on":[70],"degrees":[72],"multilinear":[74],"polynomials":[75],"approximate":[78],"Boolean":[79],"functions.":[80],"1":[81]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2016-06-24T00:00:00"}