{"id":"https://openalex.org/W2137370200","doi":"https://doi.org/10.1109/ccc.2003.1214419","title":"Quantum query complexity and semi-definite programming","display_name":"Quantum query complexity and semi-definite programming","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2137370200","doi":"https://doi.org/10.1109/ccc.2003.1214419","mag":"2137370200"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2003.1214419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","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/A5089197447","display_name":"Howard Barnum","orcid":"https://orcid.org/0000-0003-2336-6147"},"institutions":[{"id":"https://openalex.org/I1343871089","display_name":"Los Alamos National Laboratory","ror":"https://ror.org/01e41cf67","country_code":"US","type":"facility","lineage":["https://openalex.org/I1330989302","https://openalex.org/I1343871089","https://openalex.org/I198811213","https://openalex.org/I4210120050"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"H. Barnum","raw_affiliation_strings":["CCS-3 MS B256, Los Alamos National Laboratory, Los Alamos, NM, USA","Los Alamos National Labs, NM, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CCS-3 MS B256, Los Alamos National Laboratory, Los Alamos, NM, USA","institution_ids":["https://openalex.org/I1343871089"]},{"raw_affiliation_string":"Los Alamos National Labs, NM, USA","institution_ids":["https://openalex.org/I1343871089"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5030610930","display_name":"Michael Saks","orcid":"https://orcid.org/0000-0003-1659-7190"},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Saks","raw_affiliation_strings":["Department of Mathematics-Hill Center, Rutgers University, Piscataway, NJ, USA","School of Arts and Sciences, Mathematics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics-Hill Center, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"School of Arts and Sciences, Mathematics","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113860564","display_name":"M\u00e1ri\u00f3 Szegedy","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Szegedy","raw_affiliation_strings":["Department of Computer Science, Rutgers University, Piscataway, NJ, USA","School of Arts and Sciences, Computer Science"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA","institution_ids":["https://openalex.org/I102322142"]},{"raw_affiliation_string":"School of Arts and Sciences, Computer Science","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":11.1026,"has_fulltext":false,"cited_by_count":105,"citation_normalized_percentile":{"value":0.98318789,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"179","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":1.0,"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":1.0,"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/T10020","display_name":"Quantum Information and Cryptography","score":0.9973000288009644,"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/T13182","display_name":"Quantum-Dot Cellular Automata","score":0.9911999702453613,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.597235381603241},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.5638641715049744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5434366464614868},{"id":"https://openalex.org/keywords/qubit","display_name":"Qubit","score":0.5019292831420898},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.49837231636047363},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.49040913581848145},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.4668266177177429},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4623471796512604},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4599667191505432},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43984276056289673},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4100340008735657},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3848491609096527},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3664017915725708},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32469403743743896},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.19452553987503052},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.08882361650466919}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.597235381603241},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5638641715049744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5434366464614868},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.5019292831420898},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.49837231636047363},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.49040913581848145},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.4668266177177429},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4623471796512604},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4599667191505432},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43984276056289673},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4100340008735657},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3848491609096527},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3664017915725708},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32469403743743896},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.19452553987503052},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.08882361650466919},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ccc.2003.1214419","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2003.1214419","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.113.1101","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1101","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.mit.edu/sjordan/www/qread/bss.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W7764891","https://openalex.org/W1489353207","https://openalex.org/W1631356911","https://openalex.org/W1963753244","https://openalex.org/W1969454810","https://openalex.org/W1987152249","https://openalex.org/W2002372750","https://openalex.org/W2006290558","https://openalex.org/W2055529499","https://openalex.org/W2084652510","https://openalex.org/W2089334469","https://openalex.org/W2095618864","https://openalex.org/W2100440346","https://openalex.org/W2109924867","https://openalex.org/W2168676717","https://openalex.org/W2577865170","https://openalex.org/W2764347725","https://openalex.org/W2951730160","https://openalex.org/W3003414507","https://openalex.org/W3023478445","https://openalex.org/W3040996531","https://openalex.org/W3041308142","https://openalex.org/W3105866818","https://openalex.org/W3111297213","https://openalex.org/W4249667877"],"related_works":["https://openalex.org/W2409877639","https://openalex.org/W4388704119","https://openalex.org/W2910123824","https://openalex.org/W4213379151","https://openalex.org/W3206120658","https://openalex.org/W1889203613","https://openalex.org/W4281550036","https://openalex.org/W2035510778","https://openalex.org/W2766195849","https://openalex.org/W2158634152"],"abstract_inverted_index":{"We":[0],"reformulate":[1],"quantum":[2,30,108,151,164,189],"query":[3,109,152,165],"complexity":[4,166],"in":[5,81,84,115,188],"terms":[6],"of":[7,14,28,47,58,71,87,100,173,182,186],"inequalities":[8],"and":[9,42,49,76,91,137,175],"equations":[10],"for":[11,163],"a":[12,29,72,107,125,149,159,169,183],"set":[13],"positive":[15],"semidefinite":[16,120],"matrices.":[17],"Using":[18,154],"the":[19,26,45,55,59,68,85,88,97],"new":[20],"formulation":[21],"we:":[22],"1)":[23],"show":[24],"that":[25,65,102,133,167],"workspace":[27],"computer":[31],"can":[32,103],"be":[33,104,142],"limited":[34],"to":[35,93,112,123],"at":[36],"most":[37],"n+k":[38],"qubits":[39],"(where":[40],"n":[41],"k":[43],"are":[44],"number":[46],"input":[48,67],"output":[50],"bits":[51],"respectively)":[52],"without":[53],"reducing":[54],"computational":[56],"power":[57],"model;":[60],"2)":[61],"give":[62,179],"an":[63,77,180],"algorithm":[64,110],"on":[66],"truth":[69,89],"table":[70,90],"partial":[73],"Boolean":[74],"function":[75],"integer":[78],"t":[79,116],"runs":[80],"time":[82],"polynomial":[83],"size":[86],"estimates,":[92],"any":[94],"desired":[95],"accuracy,":[96],"minimum":[98],"probability":[99],"error":[101,145],"attained":[105],"by":[106,148],"attempts":[111],"evaluate":[113],"f":[114,140],"queries;":[117],"3)":[118],"use":[119],"programming":[121],"duality":[122],"formulate":[124],"dual":[126],"SDP":[127],"P/spl":[128],"circ/(f,":[129],"t,":[130],"/spl":[131,146],"epsi/)":[132],"is":[134],"feasible":[135],"if":[136,139],"only":[138],"cannot":[141],"evaluated":[143],"within":[144],"epsi/":[147],"t-step":[150],"algorithm.":[153],"this":[155],"SDP,":[156],"we":[157],"derive":[158],"general":[160],"lower":[161,170],"bound":[162,171],"encompasses":[168],"method":[172],"Ambainis":[174],"its":[176],"generalizations;":[177],"4)":[178],"interpretation":[181],"generalized":[184],"form":[185],"branching":[187],"computation.":[190]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}