{"id":"https://openalex.org/W1998038170","doi":"https://doi.org/10.1109/ewdts.2013.6673095","title":"Quantum computing approach for shortest route finding","display_name":"Quantum computing approach for shortest route finding","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W1998038170","doi":"https://doi.org/10.1109/ewdts.2013.6673095","mag":"1998038170"},"language":"en","primary_location":{"id":"doi:10.1109/ewdts.2013.6673095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2013.6673095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"East-West Design & Test Symposium (EWDTS 2013)","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/A5044434351","display_name":"Vladimir Hahanov","orcid":"https://orcid.org/0000-0001-5312-5841"},"institutions":[{"id":"https://openalex.org/I107158390","display_name":"Kharkiv National University of Radio Electronics","ror":"https://ror.org/01ctj1b90","country_code":"UA","type":"education","lineage":["https://openalex.org/I107158390"]}],"countries":["UA"],"is_corresponding":true,"raw_author_name":"Vladimir Hahanov","raw_affiliation_strings":["Kharkov National University of Radioelectronics, Kharkov, Ukraine","Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine"],"affiliations":[{"raw_affiliation_string":"Kharkov National University of Radioelectronics, Kharkov, Ukraine","institution_ids":["https://openalex.org/I107158390"]},{"raw_affiliation_string":"Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine","institution_ids":["https://openalex.org/I107158390"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086816765","display_name":"Volodymyr Miz","orcid":null},"institutions":[{"id":"https://openalex.org/I107158390","display_name":"Kharkiv National University of Radio Electronics","ror":"https://ror.org/01ctj1b90","country_code":"UA","type":"education","lineage":["https://openalex.org/I107158390"]}],"countries":["UA"],"is_corresponding":false,"raw_author_name":"Volodymyr Miz","raw_affiliation_strings":["Kharkov National University of Radioelectronics, Kharkov, Ukraine","Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine"],"affiliations":[{"raw_affiliation_string":"Kharkov National University of Radioelectronics, Kharkov, Ukraine","institution_ids":["https://openalex.org/I107158390"]},{"raw_affiliation_string":"Kharkov Nat. Univ. of Radioelectron., Kharkov, Ukraine","institution_ids":["https://openalex.org/I107158390"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044434351"],"corresponding_institution_ids":["https://openalex.org/I107158390"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0668248,"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":"1","last_page":"4"},"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.992900013923645,"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.992900013923645,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.9726999998092651,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7672854661941528},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7390245795249939},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.7143776416778564},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5531705617904663},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.5361350178718567},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5286824107170105},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5259045362472534},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.4495292901992798},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4198307693004608},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30195310711860657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20643076300621033}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7672854661941528},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7390245795249939},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.7143776416778564},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5531705617904663},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5361350178718567},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5286824107170105},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5259045362472534},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4495292901992798},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4198307693004608},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30195310711860657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20643076300621033},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","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},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ewdts.2013.6673095","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ewdts.2013.6673095","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"East-West Design & Test Symposium (EWDTS 2013)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1602913450","https://openalex.org/W1670736568","https://openalex.org/W4293545141","https://openalex.org/W6636288969","https://openalex.org/W6637370784"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":{"In":[0],"this":[1,33],"paper":[2],"shortest":[3,36],"path":[4],"finding":[5],"approach":[6,10,26,34],"is":[7,11],"proposed.":[8],"This":[9],"based":[12],"on":[13],"graph":[14],"theory":[15],"and":[16,46,59],"uses":[17],"main":[18],"idea":[19],"of":[20],"the":[21],"quantum":[22],"computing.":[23],"Quantum":[24],"computing":[25],"allows":[27],"making":[28],"parallel":[29],"computations":[30],"faster.":[31],"Using":[32],"in":[35],"route":[37],"fining":[38],"problem":[39],"helps":[40],"to":[41,56],"find":[42],"several":[43,48],"ways":[44],"simultaneously":[45],"give":[47],"alternative":[49],"solutions":[50],"which":[51],"can":[52],"be":[53],"chosen":[54],"according":[55],"special":[57],"metrics":[58],"parameters.":[60]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}