{"id":"https://openalex.org/W1599157970","doi":"https://doi.org/10.1007/978-3-540-27836-8_42","title":"Quantum Query Complexity of Some Graph Problems","display_name":"Quantum Query Complexity of Some Graph Problems","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1599157970","doi":"https://doi.org/10.1007/978-3-540-27836-8_42","mag":"1599157970"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-27836-8_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5029270613","display_name":"Christoph D\u00fcrr","orcid":"https://orcid.org/0000-0001-8103-5333"},"institutions":[{"id":"https://openalex.org/I102197404","display_name":"Universit\u00e9 Paris-Sud","ror":"https://ror.org/028rypz17","country_code":"FR","type":"education","lineage":["https://openalex.org/I102197404"]},{"id":"https://openalex.org/I4210144804","display_name":"Laboratoire de Recherche en Informatique","ror":"https://ror.org/04e3ktk27","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102197404","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210144804","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Christoph D\u00fcrr","raw_affiliation_strings":["Laboratoire de Recherche en Informatique, UMR 8623, Universit\u00e9 Paris-Sud, 91405, Orsay, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique, UMR 8623, Universit\u00e9 Paris-Sud, 91405, Orsay, France","institution_ids":["https://openalex.org/I4210144804","https://openalex.org/I102197404"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027519305","display_name":"Mark Heiligman","orcid":null},"institutions":[{"id":"https://openalex.org/I130440993","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32","country_code":"US","type":"government","lineage":["https://openalex.org/I130440993","https://openalex.org/I1330347796"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mark Heiligman","raw_affiliation_strings":["Advanced Research and Development Activity, Suite 6644, National Security Agency, 9800 Savage Road, Fort Meade, Maryland, 20755, USA"],"affiliations":[{"raw_affiliation_string":"Advanced Research and Development Activity, Suite 6644, National Security Agency, 9800 Savage Road, Fort Meade, Maryland, 20755, USA","institution_ids":["https://openalex.org/I130440993"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006422517","display_name":"Peter H\u00f8yer","orcid":"https://orcid.org/0000-0001-9877-268X"},"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":"Peter H\u00f8yer","raw_affiliation_strings":["Dept. of Computer Science, Univ. of Calgary, Alberta, Canada"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Univ. of Calgary, Alberta, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022852175","display_name":"Mehdi Mhalla","orcid":"https://orcid.org/0000-0003-4178-5396"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mehdi Mhalla","raw_affiliation_strings":["Laboratoire Leibniz, Institut IMAG, Grenoble, France"],"affiliations":[{"raw_affiliation_string":"Laboratoire Leibniz, Institut IMAG, Grenoble, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5029270613"],"corresponding_institution_ids":["https://openalex.org/I102197404","https://openalex.org/I4210144804"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":5.9123,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.97455157,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"481","last_page":"493"},"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.9896000027656555,"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.9835000038146973,"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/adjacency-matrix","display_name":"Adjacency matrix","score":0.8065375089645386},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5927420854568481},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5714013576507568},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.5351150035858154},{"id":"https://openalex.org/keywords/adjacency-list","display_name":"Adjacency list","score":0.4962027668952942},{"id":"https://openalex.org/keywords/maxima-and-minima","display_name":"Maxima and minima","score":0.4690715968608856},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4579640030860901},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4470481872558594},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4372679591178894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42114701867103577},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.398100882768631},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32332026958465576},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30655401945114136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2905775308609009},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2690723240375519}],"concepts":[{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.8065375089645386},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5927420854568481},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5714013576507568},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.5351150035858154},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.4962027668952942},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.4690715968608856},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4579640030860901},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4470481872558594},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4372679591178894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42114701867103577},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.398100882768631},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32332026958465576},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30655401945114136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2905775308609009},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2690723240375519},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/978-3-540-27836-8_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-27836-8_42","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.252.5480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.252.5480","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/0401091v2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.252.9434","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.252.9434","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/0401091v1.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00123645v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00123645","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2006, 35 (6), pp.1310-1328","raw_type":"Journal articles"},{"id":"pmh:oai:cds.cern.ch:706251","is_oa":false,"landing_page_url":"http://cds.cern.ch/record/706251","pdf_url":null,"source":{"id":"https://openalex.org/S2765065519","display_name":"CERN Bulletin","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4327876864","host_organization_name":"CERN Publications","host_organization_lineage":["https://openalex.org/P4327876864"],"host_organization_lineage_names":["CERN Publications"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W55528112","https://openalex.org/W1489273657","https://openalex.org/W1541629428","https://openalex.org/W1872909421","https://openalex.org/W1965680834","https://openalex.org/W1980669364","https://openalex.org/W2006290558","https://openalex.org/W2009948449","https://openalex.org/W2017927472","https://openalex.org/W2020918964","https://openalex.org/W2029029634","https://openalex.org/W2054665888","https://openalex.org/W2071346873","https://openalex.org/W2084652510","https://openalex.org/W2117872989","https://openalex.org/W2127259150","https://openalex.org/W2160185408","https://openalex.org/W2266371753","https://openalex.org/W3041308142","https://openalex.org/W3106020145","https://openalex.org/W3106123690","https://openalex.org/W3217033513"],"related_works":["https://openalex.org/W2418231958","https://openalex.org/W2099915933","https://openalex.org/W3116169590","https://openalex.org/W4213150077","https://openalex.org/W1703428550","https://openalex.org/W4380840098","https://openalex.org/W2044443696","https://openalex.org/W2503538928","https://openalex.org/W3101281637","https://openalex.org/W2390742649"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}