{"id":"https://openalex.org/W1971200845","doi":"https://doi.org/10.1109/focs.2012.18","title":"Learning-Graph-Based Quantum Algorithm for k-Distinctness","display_name":"Learning-Graph-Based Quantum Algorithm for k-Distinctness","publication_year":2012,"publication_date":"2012-10-01","ids":{"openalex":"https://openalex.org/W1971200845","doi":"https://doi.org/10.1109/focs.2012.18","mag":"1971200845"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2012.18","doi":"https://doi.org/10.1109/focs.2012.18","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.18","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"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/A5033491812","display_name":"Aleksandrs Belovs","orcid":"https://orcid.org/0009-0004-1625-108X","observed_orcids":["https://orcid.org/0009-0004-1625-108X"]},"institutions":[{"id":"https://openalex.org/I91123046","display_name":"University of Latvia","ror":"https://ror.org/05g3mes96","country_code":"LV","type":"education","lineage":["https://openalex.org/I91123046"]}],"countries":["LV"],"is_corresponding":true,"raw_author_name":"Aleksandrs Belovs","raw_affiliation_strings":["Faculty of Computing, University of Latvia, Riga, Latvia","Fac. of Comput., Univ. of Latvia, Riga, Latvia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Computing, University of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]},{"raw_affiliation_string":"Fac. of Comput., Univ. of Latvia, Riga, Latvia","institution_ids":["https://openalex.org/I91123046"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5033491812"],"corresponding_institution_ids":["https://openalex.org/I91123046"],"apc_list":null,"apc_paid":null,"fwci":6.7425,"has_fulltext":false,"cited_by_count":78,"citation_normalized_percentile":{"value":0.97810253,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"207","last_page":"216"},"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.0003000000142492354,"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.0003000000142492354,"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.8100000023841858},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.9070000052452087},{"id":"https://openalex.org/keywords/query-complexity-lower-bounds","display_name":"query complexity lower bounds","score":0.4819999933242798}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6191346645355225},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6004965901374817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5413195490837097},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4724562466144562},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4681463837623596},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.460823655128479},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs.2012.18","doi":"https://doi.org/10.1109/focs.2012.18","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2012.18","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 53rd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320323297","display_name":"Latvijas Universitate","ror":"https://ror.org/05g3mes96"},{"id":"https://openalex.org/F4320338080","display_name":"European Social Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W103828875","https://openalex.org/W1561344775","https://openalex.org/W1564709644","https://openalex.org/W1704619525","https://openalex.org/W1727340102","https://openalex.org/W1751325145","https://openalex.org/W1800146307","https://openalex.org/W1969454810","https://openalex.org/W2006096862","https://openalex.org/W2010275623","https://openalex.org/W2012496360","https://openalex.org/W2020918964","https://openalex.org/W2023316152","https://openalex.org/W2034038586","https://openalex.org/W2035627701","https://openalex.org/W2058286540","https://openalex.org/W2066651691","https://openalex.org/W2102687371","https://openalex.org/W2112553910","https://openalex.org/W2113364475","https://openalex.org/W2949381943","https://openalex.org/W2950439447","https://openalex.org/W2951396255","https://openalex.org/W2951698954","https://openalex.org/W2952496423","https://openalex.org/W2964030075","https://openalex.org/W3041308142","https://openalex.org/W3103161513","https://openalex.org/W4234252375"],"related_works":["https://openalex.org/W1800146307","https://openalex.org/W7152075051","https://openalex.org/W3013553164","https://openalex.org/W2165264713","https://openalex.org/W127744604","https://openalex.org/W7098958998","https://openalex.org/W2162225525","https://openalex.org/W7014517168","https://openalex.org/W2774040291","https://openalex.org/W3139488178"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,10,24],"quantum":[3],"algorithm":[4,18,39],"solving":[5],"the":[6,16,31,38,46,49],"k-distinctness":[7],"problem":[8],"in":[9],"less":[11],"number":[12],"of":[13],"queries":[14],"than":[15],"previous":[17],"by":[19,34],"Ambainis.":[20],"The":[21],"construction":[22],"uses":[23],"modified":[25],"learning":[26],"graph":[27],"approach.":[28],"Compared":[29],"to":[30],"recent":[32],"paper":[33],"Belovs":[35],"and":[36,48],"Lee,":[37],"doesn't":[40],"require":[41],"any":[42],"prior":[43],"information":[44],"on":[45],"input,":[47],"complexity":[50],"analysis":[51],"is":[52],"much":[53],"simpler.":[54]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}