{"id":"https://openalex.org/W7109985276","doi":"https://doi.org/10.4230/lipics.icalp.2025.59","title":"Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time","display_name":"Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W7109985276","doi":"https://doi.org/10.4230/lipics.icalp.2025.59"},"language":"en","primary_location":{"id":"pmh:oai:HAL:hal-05435692v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-05435692","pdf_url":"http://arxiv.org/pdf/2502.06566","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. pp.59:1-59:20, ⟨10.4230/LIPIcs.ICALP.2025.59⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"volume":null,"type":"conference-paper","indexed_in":["arxiv","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://arxiv.org/pdf/2502.06566","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092905739","display_name":"Nathan Claudet","orcid":"https://orcid.org/0009-0000-0862-1264","observed_orcids":["https://orcid.org/0009-0000-0862-1264"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4405260520","display_name":"MOCQUA: Mod\u00e8les de calcul \u00e9mergents","ror":"https://ror.org/03w9t3v76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210127166","https://openalex.org/I4210159245","https://openalex.org/I4405260520","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Claudet, Nathan","raw_affiliation_strings":["Inria Mocqua, LORIA, CNRS, Universit\u00e9 de Lorraine, F-54000 Nancy, France"],"raw_orcid":"https://orcid.org/0009-0000-0862-1264","affiliations":[{"raw_affiliation_string":"Inria Mocqua, LORIA, CNRS, Universit\u00e9 de Lorraine, F-54000 Nancy, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210121838","https://openalex.org/I4405260520","https://openalex.org/I90183372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029014455","display_name":"Simon Perdrix","orcid":"https://orcid.org/0000-0002-1808-2409","observed_orcids":["https://orcid.org/0000-0002-1808-2409"]},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I4405260520","display_name":"MOCQUA: Mod\u00e8les de calcul \u00e9mergents","ror":"https://ror.org/03w9t3v76","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210127166","https://openalex.org/I4210159245","https://openalex.org/I4405260520","https://openalex.org/I90183372"]},{"id":"https://openalex.org/I90183372","display_name":"Universit\u00e9 de Lorraine","ror":"https://ror.org/04vfs2w97","country_code":"FR","type":"education","lineage":["https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Perdrix, Simon","raw_affiliation_strings":["Inria Mocqua, LORIA, CNRS, Universit\u00e9 de Lorraine, F-54000 Nancy, France"],"raw_orcid":"https://orcid.org/0000-0002-1808-2409","affiliations":[{"raw_affiliation_string":"Inria Mocqua, LORIA, CNRS, Universit\u00e9 de Lorraine, F-54000 Nancy, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I4210121838","https://openalex.org/I4405260520","https://openalex.org/I90183372"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.8448,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.92441486,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"334","issue":null,"first_page":"59:1","last_page":"59:20"},"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.9038000106811523,"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.9038000106811523,"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.08030000329017639,"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.0034000000450760126,"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/graph-states","display_name":"graph states","score":0.8619999885559082},{"id":"https://openalex.org/keywords/local-unitary-equivalence","display_name":"local unitary equivalence","score":0.9980000257492065},{"id":"https://openalex.org/keywords/quasi-polynomial-time","display_name":"quasi-polynomial time","score":0.7319999933242798},{"id":"https://openalex.org/keywords/quantum-entanglement","display_name":"quantum entanglement","score":0.6069999933242798}],"concepts":[{"id":"https://openalex.org/C67820243","wikidata":"https://www.wikidata.org/wiki/Q179164","display_name":"Unitary state","level":2,"score":0.6031000018119812},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.5203999876976013},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5113999843597412},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4936000108718872},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3926999866962433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38269999623298645},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3287999927997589},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.32600000500679016},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.26809999346733093},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.267300009727478},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.2599000036716461}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:HAL:hal-05435692v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-05435692","pdf_url":"http://arxiv.org/pdf/2502.06566","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. pp.59:1-59:20, ⟨10.4230/LIPIcs.ICALP.2025.59⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:arXiv.org:2502.06566","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2502.06566","pdf_url":"https://arxiv.org/pdf/2502.06566","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:drops-oai.dagstuhl.de:23436","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2025.59","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol334-icalp2025/LIPIcs.ICALP.2025.59/LIPIcs.ICALP.2025.59.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.48550/arxiv.2502.06566","doi":"https://doi.org/10.48550/arxiv.2502.06566","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2502.06566","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,"listed_in":[],"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"},{"id":"doi:10.4230/lipics.icalp.2025.59","doi":"https://doi.org/10.4230/lipics.icalp.2025.59","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.icalp.2025.59","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"listed_in":["doaj","jufo-1","norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-05435692v1","doi":null,"is_oa":true,"landing_page_url":"https://hal.science/hal-05435692","pdf_url":"http://arxiv.org/pdf/2502.06566","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025), Jul 2025, Aarhus (Danemark), Denmark. pp.59:1-59:20, ⟨10.4230/LIPIcs.ICALP.2025.59⟩","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1190173965","display_name":null,"funder_award_id":"France2030","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2191957979","display_name":"Etude de la pile quantique : Algorithmes, mod\u00e8les de calcul et simulation pour l\u2019informatique quantique","funder_award_id":"ANR-22-PETQ-0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G2970831653","display_name":"Initiative Nationale Hybride HPC Quantique \u2013 R&D et Support des communaut\u00e9s","funder_award_id":"ANR-22-PNCQ-0002","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7109985276.pdf","grobid_xml":"https://content.openalex.org/works/W7109985276.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7216273809","https://openalex.org/W7126350281","https://openalex.org/W4403929260","https://openalex.org/W7130677454","https://openalex.org/W7142557633","https://openalex.org/W6947603757","https://openalex.org/W1990406357","https://openalex.org/W2552865207","https://openalex.org/W2923604028","https://openalex.org/W4403815131"],"abstract_inverted_index":{"We":[0,63,106],"describe":[1],"an":[2,79],"algorithm":[3,18,88],"with":[4],"quasi-polynomial":[5],"runtime":[6],"$n^{\\log_2(n)+O(1)}$":[7],"for":[8,89,140,156],"deciding":[9,90],"local":[10,29,43,54,91],"unitary":[11],"(LU)":[12],"equivalence":[13,94],"of":[14,25,50,73,95,102,114],"graph":[15,59,96,115,157],"states.":[16],"The":[17],"builds":[19],"on":[20,111],"a":[21,38,51,71,83],"recent":[22],"graphical":[23],"characterisation":[24],"LU-equivalence":[26,45],"via":[27],"generalised":[28,53],"complementation.":[30],"By":[31],"first":[32],"transforming":[33],"the":[34,48,61,100,112,124],"corresponding":[35],"graphs":[36],"into":[37],"standard":[39],"form":[40],"using":[41],"usual":[42],"complementations,":[44],"reduces":[46,68],"to":[47,60,69,142,161],"existence":[49],"single":[52],"complementation":[55],"that":[56,66,117,135,151],"maps":[57],"one":[58],"other.":[62],"crucially":[64],"demonstrate":[65],"this":[67,147],"solving":[70],"system":[72],"quasi-polynomially":[74],"many":[75],"linear":[76,104],"equations,":[77],"avoiding":[78],"exponential":[80],"blow-up.":[81],"As":[82],"byproduct,":[84],"we":[85,145],"generalise":[86],"Bouchet's":[87],"Clifford":[92],"(LC)":[93],"states":[97,116,158],"by":[98,149],"allowing":[99],"addition":[101],"arbitrary":[103],"constraints.":[105],"also":[107],"improve":[108],"existing":[109],"bounds":[110],"size":[113],"are":[118],"LU-":[119,152],"but":[120],"not":[121],"LC-equivalent.":[122],"While":[123],"smallest":[125],"known":[126],"examples":[127,138],"involve":[128],"27":[129],"qubits,":[130,144],"and":[131,153],"it":[132],"is":[133],"established":[134],"no":[136],"such":[137],"exist":[139],"up":[141,160],"8":[143],"refine":[146],"bound":[148],"proving":[150],"LC-equivalence":[154],"coincide":[155],"involving":[159],"19":[162],"qubits.":[163]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":1}],"updated_date":"2026-10-25T09:29:13.331239","created_date":"2025-12-08T00:00:00"}