{"id":"https://openalex.org/W2154014559","doi":null,"title":"An Improved Quantum Algorithm for Searching an Ordered List","display_name":"An Improved Quantum Algorithm for Searching an Ordered List","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W2154014559","mag":"2154014559"},"language":"en","primary_location":{"id":"mag:2154014559","doi":null,"is_oa":false,"landing_page_url":"http://web.mit.edu/rsi/www/pdfs/papers/2003/2003-brianj.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"volume":null,"type":"article","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/A5071554664","display_name":"Brian Jacokes","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Brian Jacokes","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5071554664"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7847,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.86137593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"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.9980000257492065,"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.9980000257492065,"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.000699999975040555,"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"}},{"id":"https://openalex.org/T10622","display_name":"Quantum Mechanics and Applications","score":9.999999747378752e-05,"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-search-algorithms","display_name":"quantum search","score":0.8960000276565552},{"id":"https://openalex.org/keywords/grover-s-algorithm","display_name":"Grover's algorithm","score":0.75},{"id":"https://openalex.org/keywords/recursion","display_name":"recursion","score":0.37599998712539673},{"id":"https://openalex.org/keywords/query-complexity","display_name":"query complexity","score":0.8270000219345093},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.4009999930858612}],"concepts":[{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6943483948707581},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6022566556930542},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5312720537185669},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5037075877189636},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.4588220417499542},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4336444139480591},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4160478413105011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36442163586616516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35919490456581116},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2154014559","doi":null,"is_oa":false,"landing_page_url":"http://web.mit.edu/rsi/www/pdfs/papers/2003/2003-brianj.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1631356911","https://openalex.org/W2020918964","https://openalex.org/W2084652510","https://openalex.org/W2109924867","https://openalex.org/W2113077106","https://openalex.org/W2170120409"],"related_works":["https://openalex.org/W7098865041","https://openalex.org/W1947120330","https://openalex.org/W7095148131","https://openalex.org/W7214760044","https://openalex.org/W1973725012","https://openalex.org/W1771856893","https://openalex.org/W2115611948","https://openalex.org/W7135094527","https://openalex.org/W7764891","https://openalex.org/W168750380"],"abstract_inverted_index":{"The":[0],"best":[1,58],"known":[2],"quantum":[3],"algorithm":[4,36,49],"for":[5,31],"searching":[6],"an":[7,27,35],"ordered":[8],"list":[9],"of":[10],"N":[11,19,23,42,46,65],"items":[12],"is":[13,50],"recursive":[14],"and":[15],"requires":[16,38,63],"3":[17],"log52":[18],"\u2248":[20,43],"0.526":[21],"log2":[22,45,64],"queries.":[24,47,66],"We":[25],"find":[26],"improved":[28],"base":[29],"case":[30],"this":[32],"recursion,":[33],"yielding":[34],"that":[37],"only":[39],"4":[40],"log434":[41],"0.457":[44],"This":[48],"more":[51],"than":[52],"twice":[53],"as":[54,56],"fast":[55],"the":[57],"possible":[59],"classical":[60],"algorithm,":[61],"which":[62]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}