{"id":"https://openalex.org/W4378800896","doi":"https://doi.org/10.1145/3583781.3590234","title":"TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits","display_name":"TDAG: Tree-based Directed Acyclic Graph Partitioning for Quantum Circuits","publication_year":2023,"publication_date":"2023-05-31","ids":{"openalex":"https://openalex.org/W4378800896","doi":"https://doi.org/10.1145/3583781.3590234"},"language":"en","primary_location":{"id":"doi:10.1145/3583781.3590234","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583781.3590234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Great Lakes Symposium on VLSI 2023","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.osti.gov/servlets/purl/1985363","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5055042810","display_name":"Joseph F. Clark","orcid":"https://orcid.org/0009-0000-0295-0083"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph Clark","raw_affiliation_strings":["University of Tennessee, Knoxville, TN, USA"],"raw_orcid":"https://orcid.org/0009-0000-0295-0083","affiliations":[{"raw_affiliation_string":"University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001784263","display_name":"Travis S. Humble","orcid":"https://orcid.org/0000-0002-9449-0498"},"institutions":[{"id":"https://openalex.org/I1289243028","display_name":"Oak Ridge National Laboratory","ror":"https://ror.org/01qz5mb56","country_code":"US","type":"facility","lineage":["https://openalex.org/I1289243028","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I4210159294"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Travis Humble","raw_affiliation_strings":["Oak Ridge National Laboratory, Oak Ridge, TN, USA"],"raw_orcid":"https://orcid.org/0000-0002-9449-0498","affiliations":[{"raw_affiliation_string":"Oak Ridge National Laboratory, Oak Ridge, TN, USA","institution_ids":["https://openalex.org/I1289243028"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091267392","display_name":"Himanshu Thapliyal","orcid":"https://orcid.org/0000-0001-9157-4517"},"institutions":[{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Himanshu Thapliyal","raw_affiliation_strings":["University of Tennessee, Knoxville, TN, USA"],"raw_orcid":"https://orcid.org/0000-0001-9157-4517","affiliations":[{"raw_affiliation_string":"University of Tennessee, Knoxville, TN, USA","institution_ids":["https://openalex.org/I75027704"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6316,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8666027,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"587","last_page":"592"},"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.9998000264167786,"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.9998000264167786,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.8082841038703918},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6987919211387634},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5270659923553467},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.51463782787323},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.5007328987121582},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.4994382858276367},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.47620829939842224},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4734725058078766},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.4491724967956543},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.4346984624862671},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.42487287521362305},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3426559567451477},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.31794679164886475},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2591847777366638},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.07549649477005005}],"concepts":[{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.8082841038703918},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6987919211387634},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5270659923553467},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.51463782787323},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5007328987121582},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.4994382858276367},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.47620829939842224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4734725058078766},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.4491724967956543},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.4346984624862671},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.42487287521362305},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3426559567451477},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.31794679164886475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2591847777366638},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.07549649477005005},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3583781.3590234","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3583781.3590234","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Great Lakes Symposium on VLSI 2023","raw_type":"proceedings-article"},{"id":"pmh:oai:osti.gov:1985363","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1985363","pdf_url":"https://www.osti.gov/servlets/purl/1985363","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:osti.gov:1985363","is_oa":true,"landing_page_url":"https://www.osti.gov/biblio/1985363","pdf_url":"https://www.osti.gov/servlets/purl/1985363","source":{"id":"https://openalex.org/S4306402487","display_name":"OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I139351228","host_organization_name":"Office of Scientific and Technical Information","host_organization_lineage":["https://openalex.org/I139351228"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4378800896.pdf"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W2011926294","https://openalex.org/W2963864336","https://openalex.org/W3027115108","https://openalex.org/W3027825264","https://openalex.org/W3088557189","https://openalex.org/W3096120761","https://openalex.org/W3103142852","https://openalex.org/W3110697055","https://openalex.org/W3113899023","https://openalex.org/W3153758851","https://openalex.org/W3196675196","https://openalex.org/W4280604717","https://openalex.org/W4290043176","https://openalex.org/W4312243397","https://openalex.org/W4313141566"],"related_works":["https://openalex.org/W2146569528","https://openalex.org/W4214487273","https://openalex.org/W4287028074","https://openalex.org/W2106828717","https://openalex.org/W3191289342","https://openalex.org/W1998712144","https://openalex.org/W3164774158","https://openalex.org/W2372211403","https://openalex.org/W4297817344","https://openalex.org/W1498463151"],"abstract_inverted_index":{"We":[0],"propose":[1],"the":[2,32,35,83],"Tree-based":[3],"Directed":[4],"Acyclic":[5],"Graph":[6],"(TDAG)":[7],"partitioning":[8,16,72],"for":[9],"quantum":[10,14],"circuits,":[11],"a":[12,25,70],"novel":[13],"circuit":[15],"method":[17,50,73],"which":[18],"partitions":[19],"circuits":[20],"by":[21,76],"viewing":[22],"them":[23],"as":[24],"series":[26],"of":[27,41,45,80,82],"binary":[28],"trees":[29],"and":[30],"selecting":[31],"tree":[33],"containing":[34],"most":[36],"gates.":[37],"TDAG":[38,66],"produces":[39],"results":[40,84],"comparable":[42],"quality":[43,81],"(number":[44],"partitions)":[46],"to":[47,69],"an":[48,58],"existing":[49],"called":[51,74],"ScanPartitioner":[52],"(an":[53],"exhaustive":[54],"search":[55],"algorithm)":[56],"with":[57,85],"95%":[59],"average":[60],"reduction":[61],"in":[62,78,88],"execution":[63,89],"time.":[64,90],"Furthermore,":[65],"improves":[67],"compared":[68],"faster":[71],"QuickPartitioner":[75],"38%":[77],"terms":[79],"minimal":[86],"overhead":[87]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}