{"id":"https://openalex.org/W7168158770","doi":"https://doi.org/10.48550/arxiv.2607.09469","title":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity","display_name":"A combinatorial framework for clustering graph states: Algorithms and hardness for rank-integrity","publication_year":2026,"publication_date":"2026-07-10","ids":{"openalex":"https://openalex.org/W7168158770","doi":"https://doi.org/10.48550/arxiv.2607.09469"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.09469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.09469","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5090509291","display_name":"Romain Bourneuf","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bourneuf, Romain","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140541503","display_name":"Nathan Claudet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Claudet, Nathan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140528870","display_name":"Sang Yoon Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Sang Yoon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140534119","display_name":"Rose McCarty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"McCarty, Rose","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5128178423","display_name":"Blair D. Sullivan (5933777)","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sullivan, Blair D.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5033238040","display_name":"St\u00e9phan Thomass\u00e9","orcid":"https://orcid.org/0000-0002-7090-1790"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Thomass\u00e9, St\u00e9phan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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.9031999707221985,"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.9031999707221985,"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.014399999752640724,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.008500000461935997,"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/strength-of-a-graph","display_name":"Strength of a graph","score":0.51419997215271},{"id":"https://openalex.org/keywords/complement-graph","display_name":"Complement graph","score":0.4902999997138977},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4781000018119812},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.44999998807907104},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.40400001406669617},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.3896999955177307},{"id":"https://openalex.org/keywords/butterfly-graph","display_name":"Butterfly graph","score":0.38179999589920044},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.37869998812675476},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.3702999949455261},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.36579999327659607}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6141999959945679},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5879999995231628},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.51419997215271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5080999732017517},{"id":"https://openalex.org/C168291704","wikidata":"https://www.wikidata.org/wiki/Q902252","display_name":"Complement graph","level":5,"score":0.4902999997138977},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4781000018119812},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.44999998807907104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42750000953674316},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.40400001406669617},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.3896999955177307},{"id":"https://openalex.org/C18819970","wikidata":"https://www.wikidata.org/wiki/Q3035340","display_name":"Butterfly graph","level":5,"score":0.38179999589920044},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.37869998812675476},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.36579999327659607},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.36399999260902405},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.35589998960494995},{"id":"https://openalex.org/C148364342","wikidata":"https://www.wikidata.org/wiki/Q948887","display_name":"Wheel graph","level":5,"score":0.34790000319480896},{"id":"https://openalex.org/C76444178","wikidata":"https://www.wikidata.org/wiki/Q72897900","display_name":"Connectivity","level":3,"score":0.34200000762939453},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.33329999446868896},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.32839998602867126},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C53052385","wikidata":"https://www.wikidata.org/wiki/Q17104046","display_name":"Mixed graph","level":5,"score":0.31540000438690186},{"id":"https://openalex.org/C56783289","wikidata":"https://www.wikidata.org/wiki/Q3115556","display_name":"Distance-regular graph","level":5,"score":0.3102000057697296},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.29899999499320984},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28859999775886536},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C180347388","wikidata":"https://www.wikidata.org/wiki/Q336233","display_name":"Pauli matrices","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C146661039","wikidata":"https://www.wikidata.org/wiki/Q2915204","display_name":"Dominating set","level":4,"score":0.2709999978542328},{"id":"https://openalex.org/C38754835","wikidata":"https://www.wikidata.org/wiki/Q2003238","display_name":"Strongly connected component","level":2,"score":0.2653000056743622},{"id":"https://openalex.org/C140752511","wikidata":"https://www.wikidata.org/wiki/Q905837","display_name":"Graph minor","level":5,"score":0.25690001249313354},{"id":"https://openalex.org/C198414033","wikidata":"https://www.wikidata.org/wiki/Q5155607","display_name":"Comparability graph","level":5,"score":0.2558000087738037},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.25450000166893005},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.251800000667572},{"id":"https://openalex.org/C161677786","wikidata":"https://www.wikidata.org/wiki/Q2478475","display_name":"Neighbourhood (mathematics)","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.09469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.09469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.09469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,63,76,185,195],"introduce":[1],"a":[2,30,65,105,115,147],"new":[3],"notion":[4],"of":[5,18,26,68,74,86,104,138,143,149,154,176,179],"distance":[6,21,70,81,131,166],"between":[7,167],"two":[8],"graph":[9,31,46,88,106,116,127],"states":[10,128],"$|G\\rangle$":[11,37,136],"and":[12,38,60,118,169,224],"$|G'\\rangle$":[13,39,129],"on":[14],"the":[15,23,72,100,122,139,152,165,173,177,198],"same":[16],"set":[17],"qubits.":[19],"This":[20],"is":[22,159,171,190,205],"minimum":[24,123,174],"number":[25,153],"ancilla":[27,110,155,217],"qubits":[28],"in":[29,151,207],"state":[32,107],"$|\\widehat{G}\\rangle$":[33],"from":[34,135],"which":[35],"both":[36],"can":[40],"be":[41],"``easily":[42],"prepared''.":[43],"(When":[44],"preparing":[45],"states,":[47],"we":[48,94,210],"are":[49],"only":[50],"allowed":[51],"to":[52,146,161],"use":[53],"one-qubit":[54,57],"Clifford":[55],"gates,":[56],"Pauli":[58],"measurements,":[59],"classical":[61,96],"communication.)":[62],"give":[64,211],"graphical":[66],"description":[67],"this":[69,80,92,157],"through":[71],"lens":[73],"vertex-minors.":[75],"then":[77],"show":[78],"how":[79],"yields":[82],"quantum":[83],"network":[84],"analogs":[85],"many":[87],"edit-distance":[89],"problems.":[90],"Using":[91],"framework,":[93],"develop":[95],"algorithms":[97],"for":[98,121,216],"identifying":[99],"``highly":[101],"entangled":[102],"clusters''":[103],"$|G\\rangle$.":[108],"The":[109],"integrity":[111,189,204,218],"problem":[112,158],"asks,":[113],"given":[114],"$G$":[117,168,220],"integer":[119],"$k$,":[120],"--":[124,137],"over":[125,183],"all":[126],"with":[130],"at":[132],"most":[133],"$k$":[134],"maximum":[140],"component":[141],"size":[142],"$G'$.":[144],"Up":[145],"factor":[148],"$2$":[150],"qubits,":[156],"equivalent":[160],"rank":[162,175,188,203],"integrity,":[163],"where":[164],"$G'$":[170],"instead":[172],"sum":[178],"their":[180],"adjacency":[181],"matrices":[182],"$\\text{GF}(2)$.":[184],"prove":[186,197],"that":[187,202],"XP":[191],"parameterized":[192],"by":[193],"$k$.":[194,208],"also":[196],"complementary":[199],"hardness":[200],"result":[201],"W[1]-hard":[206],"Finally,":[209],"an":[212],"explicit":[213],"$\\mathcal{O}(n^6)$-time":[214],"algorithm":[215],"when":[219],"has":[221],"$n$":[222],"vertices":[223],"$k=1$.":[225]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-14T00:00:00"}