乐胖代购免代理版

{"id":"https://openalex.org/W2009948449","doi":"https://doi.org/10.1145/780542.780552","title":"Exponential algorithmic speedup by a quantum walk","display_name":"Exponential algorithmic speedup by a quantum walk","publication_year":2003,"publication_date":"2003-06-09","ids":{"openalex":"https://openalex.org/W2009948449","doi":"https://doi.org/10.1145/780542.780552","mag":"2009948449"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/780542.780552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"preprint","type_crossref":"proceedings-article","indexed_in":["crossref","datacite"],"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/A5018837979","display_name":"Andrew M. Childs","orcid":"https://orcid.org/0000-0002-9903-837X"},"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":false,"raw_author_name":"Andrew M. Childs","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001743971","display_name":"Richard Cleve","orcid":null},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Richard Cleve","raw_affiliation_strings":["University of Calgary, Calgary, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"University of Calgary, Calgary, Alberta, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025876328","display_name":"E. Deotto","orcid":null},"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":false,"raw_author_name":"Enrico Deotto","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036253306","display_name":"Edward Farhi","orcid":null},"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":false,"raw_author_name":"Edward Farhi","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022783879","display_name":"Sam Gutmann","orcid":null},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sam Gutmann","raw_affiliation_strings":["Northeastern University, Boston (MA)#TAB#"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston (MA)#TAB#","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061644327","display_name":"Daniel A. Spielman","orcid":"https://orcid.org/0000-0002-8958-879X"},"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":false,"raw_author_name":"Daniel A. Spielman","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA,"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA,","institution_ids":["https://openalex.org/I63966007"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":781,"citation_normalized_percentile":{"value":0.995218,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":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.9944,"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.9887,"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/quantum-walk","display_name":"Quantum walk","score":0.9408183},{"id":"https://openalex.org/keywords/quantum-fourier-transform","display_name":"Quantum Fourier transform","score":0.5685487},{"id":"https://openalex.org/keywords/quantum-sort","display_name":"Quantum sort","score":0.53778154},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5287133},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.44675824}],"concepts":[{"id":"https://openalex.org/C140058369","wikidata":"https://www.wikidata.org/wiki/Q7269113","display_name":"Quantum walk","level":4,"score":0.9408183},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.7433183},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.6219581},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5795468},{"id":"https://openalex.org/C59500034","wikidata":"https://www.wikidata.org/wiki/Q1464944","display_name":"Quantum Fourier transform","level":5,"score":0.5685487},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5461281},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.53778154},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5287133},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.44675824},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.44390857},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43966135},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.4209922},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36072433},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.34328604},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.13660094},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.12363711},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.10559413}],"mesh":[],"locations_count":2,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1145/780542.780552","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},{"is_oa":false,"landing_page_url":"https://api.datacite.org/dois/10.48550/arxiv.quant-ph/0209131","pdf_url":null,"source":{"id":"https://openalex.org/S4393179698","display_name":"DataCite API","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_indexed_in_scopus":false,"is_core":false,"host_organization":"https://openalex.org/I4210145204","host_organization_name":"DataCite","host_organization_lineage":["https://openalex.org/I4210145204"],"host_organization_lineage_names":["DataCite"],"type":"metadata"},"license":null,"license_id":null,"version":null}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":["https://openalex.org/W2009948449","https://openalex.org/W3099549380"],"referenced_works_count":36,"referenced_works":["https://openalex.org/W1519689626","https://openalex.org/W1520302490","https://openalex.org/W1521931189","https://openalex.org/W1566033350","https://openalex.org/W1605715226","https://openalex.org/W1631356911","https://openalex.org/W1854045309","https://openalex.org/W1872909421","https://openalex.org/W1966092221","https://openalex.org/W1967088292","https://openalex.org/W1967900748","https://openalex.org/W1975528636","https://openalex.org/W1982397733","https://openalex.org/W1993688167","https://openalex.org/W2010265317","https://openalex.org/W2033216491","https://openalex.org/W2040792108","https://openalex.org/W2050334794","https://openalex.org/W2054665888","https://openalex.org/W2055201875","https://openalex.org/W2066153786","https://openalex.org/W2079692740","https://openalex.org/W2097358487","https://openalex.org/W2101697221","https://openalex.org/W2117584890","https://openalex.org/W2120062331","https://openalex.org/W2139322641","https://openalex.org/W2148132004","https://openalex.org/W2168676717","https://openalex.org/W2801179766","https://openalex.org/W2962738101","https://openalex.org/W3016843226","https://openalex.org/W3023478445","https://openalex.org/W3101846364","https://openalex.org/W3111297213","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4288089639","https://openalex.org/W4237826702","https://openalex.org/W4226523431","https://openalex.org/W4224937327","https://openalex.org/W3114654323","https://openalex.org/W3101908302","https://openalex.org/W2990041953","https://openalex.org/W2982217778","https://openalex.org/W2155794351","https://openalex.org/W1980834277"],"abstract_inverted_index":{"We":[0,49,63],"construct":[1],"a":[2,15,20,29,37,76],"black":[3,60],"box":[4,61],"graph":[5],"traversal":[6],"problem":[7,72,88],"that":[8,81],"can":[9,85],"be":[10],"solved":[11],"exponentially":[12],"faster":[13],"on":[14,19,28,45],"quantum":[16,24,32,42,46,55,68],"computer":[17],"than":[18],"classical":[21,83],"computer.":[22],"The":[23],"algorithm":[25,84],"is":[26],"based":[27,44],"continuous":[30],"time":[31],"walk,":[33],"and":[34],"thus":[35],"employs":[36],"different":[38],"technique":[39],"from":[40],"previous":[41],"algorithms":[43],"Fourier":[47],"transforms.":[48],"show":[50,65],"how":[51,66],"to":[52],"implement":[53],"the":[54,87],"walk":[56,69],"efficiently":[57],"in":[58,89],"our":[59,71],"setting.":[62],"then":[64],"this":[67],"solves":[70],"by":[73],"rapidly":[74],"traversing":[75],"graph.":[77],"Finally,":[78],"we":[79],"prove":[80],"no":[82],"solve":[86],"subexponential":[90],"time.":[91]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2009948449","counts_by_year":[{"year":2024,"cited_by_count":34},{"year":2023,"cited_by_count":69},{"year":2022,"cited_by_count":32},{"year":2021,"cited_by_count":63},{"year":2020,"cited_by_count":56},{"year":2019,"cited_by_count":43},{"year":2018,"cited_by_count":34},{"year":2017,"cited_by_count":36},{"year":2016,"cited_by_count":36},{"year":2015,"cited_by_count":43},{"year":2014,"cited_by_count":38},{"year":2013,"cited_by_count":36},{"year":2012,"cited_by_count":24}],"updated_date":"2025-01-19T21:29:20.176395","created_date":"2016-06-24"}