{"id":"https://openalex.org/W3160385022","doi":"https://doi.org/10.1145/3519269","title":"Time- and Query-optimal Quantum Algorithms Based on Decision Trees","display_name":"Time- and Query-optimal Quantum Algorithms Based on Decision Trees","publication_year":2022,"publication_date":"2022-03-28","ids":{"openalex":"https://openalex.org/W3160385022","doi":"https://doi.org/10.1145/3519269","mag":"3160385022"},"language":"en","primary_location":{"id":"doi:10.1145/3519269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519269","pdf_url":null,"source":{"id":"https://openalex.org/S4210170170","display_name":"ACM Transactions on Quantum Computing","issn_l":"2643-6809","issn":["2643-6809","2643-6817"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Quantum Computing","raw_type":"journal-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/A5004602538","display_name":"Salman Beigi","orcid":"https://orcid.org/0000-0003-3588-4662"},"institutions":[{"id":"https://openalex.org/I4210136738","display_name":"Iranian Center for Quantum Technologies","ror":"https://ror.org/03p4ncr63","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210136738"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Salman Beigi","raw_affiliation_strings":["QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran","institution_ids":["https://openalex.org/I4210136738"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068062089","display_name":"Leila Taghavi","orcid":"https://orcid.org/0000-0002-1723-9144"},"institutions":[{"id":"https://openalex.org/I4210136738","display_name":"Iranian Center for Quantum Technologies","ror":"https://ror.org/03p4ncr63","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210136738"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Leila Taghavi","raw_affiliation_strings":["QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran"],"raw_orcid":"https://orcid.org/0000-0002-1723-9144","affiliations":[{"raw_affiliation_string":"QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran","institution_ids":["https://openalex.org/I4210136738"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079894440","display_name":"Artin Tajdini","orcid":null},"institutions":[{"id":"https://openalex.org/I4210136738","display_name":"Iranian Center for Quantum Technologies","ror":"https://ror.org/03p4ncr63","country_code":"IR","type":"facility","lineage":["https://openalex.org/I4210136738"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Artin Tajdini","raw_affiliation_strings":["QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"QuOne Lab, Phanous Research and Innovation Centre, Tehran, Iran","institution_ids":["https://openalex.org/I4210136738"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4210136738"],"apc_list":null,"apc_paid":null,"fwci":0.3483,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.62587984,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"3","issue":"4","first_page":"1","last_page":"31"},"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.989300012588501,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.984499990940094,"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/algorithm","display_name":"Algorithm","score":0.6579117774963379},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6560406684875488},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6121025085449219},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5757585167884827},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.49021202325820923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48455777764320374},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4820469319820404},{"id":"https://openalex.org/keywords/sort","display_name":"sort","score":0.47314465045928955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4618711769580841},{"id":"https://openalex.org/keywords/quantum-sort","display_name":"Quantum sort","score":0.4555285573005676},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.4411436915397644},{"id":"https://openalex.org/keywords/decision-tree-model","display_name":"Decision tree model","score":0.4193595051765442},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41706928610801697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39625319838523865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3612857758998871},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35513997077941895},{"id":"https://openalex.org/keywords/decision-tree","display_name":"Decision tree","score":0.24254468083381653},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.14829620718955994},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09325554966926575},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.07709535956382751},{"id":"https://openalex.org/keywords/quantum-error-correction","display_name":"Quantum error correction","score":0.07446122169494629}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6579117774963379},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6560406684875488},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6121025085449219},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5757585167884827},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49021202325820923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48455777764320374},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4820469319820404},{"id":"https://openalex.org/C88548561","wikidata":"https://www.wikidata.org/wiki/Q347599","display_name":"sort","level":2,"score":0.47314465045928955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4618711769580841},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.4555285573005676},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.4411436915397644},{"id":"https://openalex.org/C56289965","wikidata":"https://www.wikidata.org/wiki/Q5249246","display_name":"Decision tree model","level":3,"score":0.4193595051765442},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41706928610801697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39625319838523865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3612857758998871},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35513997077941895},{"id":"https://openalex.org/C84525736","wikidata":"https://www.wikidata.org/wiki/Q831366","display_name":"Decision tree","level":2,"score":0.24254468083381653},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.14829620718955994},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09325554966926575},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.07709535956382751},{"id":"https://openalex.org/C51003876","wikidata":"https://www.wikidata.org/wiki/Q1536431","display_name":"Quantum error correction","level":4,"score":0.07446122169494629},{"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.1145/3519269","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3519269","pdf_url":null,"source":{"id":"https://openalex.org/S4210170170","display_name":"ACM Transactions on Quantum Computing","issn_l":"2643-6809","issn":["2643-6809","2643-6817"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Quantum Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.6399999856948853}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1751325145","https://openalex.org/W1964032471","https://openalex.org/W2008231303","https://openalex.org/W2071207394","https://openalex.org/W2120252658","https://openalex.org/W2135977679","https://openalex.org/W2157529519","https://openalex.org/W2158503306","https://openalex.org/W2529853932","https://openalex.org/W2584830529","https://openalex.org/W2585327097","https://openalex.org/W2947296406","https://openalex.org/W2962738101","https://openalex.org/W2968697199","https://openalex.org/W2970069141","https://openalex.org/W2990961515","https://openalex.org/W3022305591","https://openalex.org/W3092487408","https://openalex.org/W3099576038","https://openalex.org/W3100558667","https://openalex.org/W3101653183","https://openalex.org/W3106262597","https://openalex.org/W3198528674","https://openalex.org/W4229490222","https://openalex.org/W4301668019"],"related_works":["https://openalex.org/W2151412766","https://openalex.org/W1028212721","https://openalex.org/W2294970663","https://openalex.org/W2743915648","https://openalex.org/W2147115438","https://openalex.org/W2949880781","https://openalex.org/W1839257479","https://openalex.org/W1575165732","https://openalex.org/W4383473090","https://openalex.org/W2058497916"],"abstract_inverted_index":{"It":[0],"has":[1],"recently":[2],"been":[3],"shown":[4],"that":[5,18,109],"starting":[6],"with":[7,31,132,146],"a":[8,15,28,140],"classical":[9,45,81],"query":[10,23,32,41],"algorithm":[11,17,30,46,64,85,96],"(decision":[12],"tree)":[13,51],"and":[14,52,103,117,131,160],"guessing":[16,63],"tries":[19],"to":[20],"predict":[21],"the":[22,40,44,49,55,62,80],"answers,":[24],"we":[25,73],"can":[26,86,120,143,164],"design":[27],"quantum":[29,84,136,150],"complexity":[33,42],"O(":[34],"\u221a":[35],"GT":[36,93],"where":[37],"T":[38],"is":[39,54,97],"of":[43,48,58],"(depth":[47],"decision":[50],"G":[53],"maximum":[56,161],"number":[57],"wrong":[59],"answers":[60],"by":[61],"[":[65],"3":[66],",":[67],"14":[68],"].":[69],"In":[70],"this":[71,83],"article,":[72],"show":[74],"that,":[75],"given":[76],"some":[77],"constraints":[78],"on":[79,99],"algorithms,":[82],"be":[87,121,144,165],"implemented":[88],"in":[89,123,152,167],"time":[90,124,153,168],"O\u0303":[91],"(\u221a":[92],").":[94,174],"Our":[95],"based":[98],"non-binary":[100],"span":[101],"programs":[102],"their":[104],"efficient":[105],"implementation.":[106],"We":[107],"conclude":[108],"various":[110],"graph-theoretic":[111],"problems":[112],"including":[113],"bipartiteness,":[114],"cycle":[115],"detection,":[116],"topological":[118],"sort":[119],"solved":[122,145,166],"O(n":[125,133,147,154,169],"3/2":[126,134,148,155],"log":[127,156,171],"2":[128,157,170,172],"n":[129,158,173],")":[130,135,149],"queries.":[137],"Moreover,":[138],"finding":[139],"maximal":[141],"matching":[142,163],"queries":[151],"),":[159],"bipartite":[162]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1}],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-10-10T00:00:00"}