{"id":"https://openalex.org/W7092716531","doi":"https://doi.org/10.1109/isit63088.2025.11195424","title":"Optimizing Hypergraph Product Codes with Random Walks, Simulated Annealing and Reinforcement Learning","display_name":"Optimizing Hypergraph Product Codes with Random Walks, Simulated Annealing and Reinforcement Learning","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W7092716531","doi":"https://doi.org/10.1109/isit63088.2025.11195424"},"language":"en","primary_location":{"id":"doi:10.1109/isit63088.2025.11195424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"Bruno Costa Alves Freire","orcid":null},"institutions":[{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Bruno Costa Alves Freire","raw_affiliation_strings":["Inria Paris, Pasqal"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria Paris, Pasqal","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Nicolas Delfosse","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Delfosse","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Anthony Leverrier","orcid":null},"institutions":[{"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"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Anthony Leverrier","raw_affiliation_strings":["Inria Paris,France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria Paris,France","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.346,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.93934533,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9704999923706055,"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.9704999923706055,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.01080000028014183,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.006300000008195639,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.6743999719619751},{"id":"https://openalex.org/keywords/reinforcement-learning","display_name":"Reinforcement learning","score":0.6062999963760376},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4997999966144562},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4666999876499176},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.4260999858379364},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.41850000619888306},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4115999937057495},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.36489999294281006}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.6743999719619751},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.6062999963760376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5260999798774719},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4997999966144562},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4666999876499176},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45399999618530273},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.41850000619888306},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4115999937057495},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38199999928474426},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.36489999294281006},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3481000065803528},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.33709999918937683},{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.3280999958515167},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.3278000056743622},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31790000200271606},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3075000047683716},{"id":"https://openalex.org/C95466800","wikidata":"https://www.wikidata.org/wiki/Q1027298","display_name":"Quantum key distribution","level":3,"score":0.30649998784065247},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2944999933242798},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2712000012397766},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2660999894142151}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit63088.2025.11195424","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195424","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05462468v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-05462468","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISIT 2025 - IEEE International Symposium on Information Theory, Jun 2025, Ann Arbor, United States. pp.1-6, ⟨10.1109/ISIT63088.2025.11195424⟩","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5521806082","display_name":"From NISQ to LSQ: Bosonic and LDPC codes","funder_award_id":"ANR-22-PETQ-0006","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":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":41,"referenced_works":["https://openalex.org/W1706310151","https://openalex.org/W1850344377","https://openalex.org/W1959392488","https://openalex.org/W2030867075","https://openalex.org/W2043500043","https://openalex.org/W2046376809","https://openalex.org/W2103353540","https://openalex.org/W2114207424","https://openalex.org/W2131690084","https://openalex.org/W2132022337","https://openalex.org/W2616493737","https://openalex.org/W2896854735","https://openalex.org/W2963273092","https://openalex.org/W2963331884","https://openalex.org/W2995202285","https://openalex.org/W3003257820","https://openalex.org/W3025282692","https://openalex.org/W3035899097","https://openalex.org/W3035965352","https://openalex.org/W3204653979","https://openalex.org/W3207755657","https://openalex.org/W3213933684","https://openalex.org/W3216521614","https://openalex.org/W4225985538","https://openalex.org/W4230167402","https://openalex.org/W4313227180","https://openalex.org/W4376639540","https://openalex.org/W4382776701","https://openalex.org/W4387527421","https://openalex.org/W4388142063","https://openalex.org/W4389892080","https://openalex.org/W4393234688","https://openalex.org/W4401906506","https://openalex.org/W4403335320","https://openalex.org/W4403868944","https://openalex.org/W4404037736","https://openalex.org/W4404140215","https://openalex.org/W4404978924","https://openalex.org/W4407168504","https://openalex.org/W4410463880","https://openalex.org/W4411203166"],"related_works":[],"abstract_inverted_index":{"Hypergraph":[0],"products":[1],"are":[2],"quantum":[3,49,75],"low-density":[4],"parity-check":[5],"(LDPC)":[6],"codes":[7,61],"constructed":[8],"from":[9,42],"two":[10],"classical":[11,27,59],"LDPC":[12,60],"codes.":[13],"Although":[14],"their":[15,30],"dimension":[16],"and":[17,109],"distance":[18],"depend":[19],"only":[20],"on":[21,70,100],"the":[22,25,43,48,74,85,123],"parameters":[23],"of":[24,45,81,87],"underlying":[26],"codes,":[28,103],"optimizing":[29,71],"performance":[31,72,120],"against":[32,73],"various":[33],"noise":[34],"channels":[35],"remains":[36],"challenging.":[37],"This":[38],"difficulty":[39],"partly":[40],"stems":[41],"complexity":[44],"decoding":[46],"in":[47],"setting.":[50],"The":[51],"standard,":[52],"ad":[53],"hoc":[54],"approach":[55],"typically":[56],"involves":[57],"selecting":[58],"with":[62],"large":[63],"girth.":[64],"In":[65],"this":[66,82],"work,":[67],"we":[68],"focus":[69],"erasure":[76],"channel.":[77],"A":[78],"key":[79],"advantage":[80],"channel":[83],"is":[84],"existence":[86],"an":[88],"efficient":[89],"maximum-likelihood":[90],"decoder,":[91],"which":[92],"enables":[93],"us":[94],"to":[95,122],"employ":[96],"optimization":[97],"techniques":[98,118],"based":[99],"sampling":[101],"random":[102],"such":[104],"as":[105],"Reinforcement":[106],"Learning":[107],"(RL)":[108],"Simulated":[110],"Annealing":[111],"(SA).":[112],"Our":[113],"results":[114],"indicate":[115],"that":[116],"these":[117],"improve":[119],"relative":[121],"state-of-the-art.":[124]},"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-21T00:00:00"}