{"id":"https://openalex.org/W7140476829","doi":"https://doi.org/10.48550/arxiv.2603.23892","title":"Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree","display_name":"Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree","publication_year":2026,"publication_date":"2026-03-25","ids":{"openalex":"https://openalex.org/W7140476829","doi":"https://doi.org/10.48550/arxiv.2603.23892"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.23892","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23892","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.23892","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036029949","display_name":"Nicholas Connolly","orcid":"https://orcid.org/0000-0003-4477-0552"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Connolly, Nicholas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101660591","display_name":"S. Nishio","orcid":"https://orcid.org/0000-0003-2659-5930"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nishio, Shin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128233037","display_name":"Dan E. Browne","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Browne, Dan E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Munro, William John","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Munro, William John","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081979382","display_name":"Kae Nemoto","orcid":"https://orcid.org/0000-0003-3938-0808"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nemoto, Kae","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5036029949"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9096999764442444,"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.9096999764442444,"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.056299999356269836,"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/T11804","display_name":"Quantum many-body systems","score":0.009399999864399433,"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/scalability","display_name":"Scalability","score":0.5565000176429749},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5059999823570251},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4555000066757202},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4553000032901764},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.43869999051094055},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4275999963283539},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.42579999566078186},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.3357999920845032}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5565000176429749},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5059999823570251},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4555000066757202},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4553000032901764},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.43869999051094055},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4300999939441681},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4275999963283539},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4251999855041504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.41830000281333923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3797000050544739},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.3357999920845032},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.31850001215934753},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.31049999594688416},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.29249998927116394},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2863999903202057},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2840999960899353},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26080000400543213},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.2538999915122986},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.25380000472068787},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.23892","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23892","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.23892","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.23892","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Graph":[0,20],"states":[1,21],"are":[2,28],"a":[3,42,100,127,133,155],"key":[4],"resource":[5],"for":[6,103,137],"measurement-based":[7],"quantum":[8,11],"computation":[9],"and":[10,64,86,118,132],"networking,":[12],"but":[13],"state-preparation":[14],"costs":[15],"limit":[16],"their":[17],"practical":[18],"use.":[19],"related":[22],"by":[23,40],"local":[24],"complement":[25],"(LC)":[26],"operations":[27],"equivalent":[29],"up":[30],"to":[31,82,113,158],"single-qubit":[32],"Clifford":[33],"gates;":[34],"one":[35],"may":[36],"reduce":[37],"entangling":[38,114],"resources":[39],"preparing":[41],"favorable":[43],"LC-equivalent":[44],"representative.":[45],"However,":[46],"exhaustive":[47],"optimization":[48],"over":[49],"the":[50,61,80,122],"LC":[51,84],"orbit":[52],"is":[53],"not":[54],"scalable.":[55],"We":[56,97],"address":[57],"this":[58],"problem":[59],"using":[60],"split":[62,68],"decomposition":[63],"its":[65],"quotient-augmented":[66],"strong":[67],"tree":[69],"(QASST).":[70],"For":[71],"several":[72],"families":[73],"of":[74],"distance-hereditary":[75],"(DH)":[76],"graphs,":[77,153],"we":[78,125],"use":[79],"QASST":[81],"characterize":[83],"orbits":[85],"identify":[87],"representatives":[88],"with":[89,111],"reduced":[90],"controlled-Z":[91],"count":[92],"or":[93],"preparation":[94],"circuit":[95],"depth.":[96],"also":[98],"introduce":[99],"split-fuse":[101,130],"construction":[102],"arbitrary":[104],"DH":[105,123],"graph":[106],"states,":[107],"achieving":[108],"linear":[109],"scaling":[110],"respect":[112],"gates,":[115],"time":[116],"steps,":[117],"auxiliary":[119],"qubits.":[120],"Beyond":[121],"setting,":[124],"discuss":[126],"generalized":[128],"divide-and-conquer":[129],"strategy":[131],"simple":[134],"greedy":[135],"heuristic":[136],"generic":[138],"graphs":[139],"based":[140],"on":[141,150],"triangle":[142],"enumeration.":[143],"Together,":[144],"these":[145],"methods":[146],"outperform":[147],"direct":[148],"implementations":[149],"sufficiently":[151],"large":[152],"providing":[154],"scalable":[156],"alternative":[157],"brute-force":[159],"optimization.":[160]},"counts_by_year":[],"updated_date":"2026-05-03T08:25:01.440150","created_date":"2026-03-27T00:00:00"}