{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:44Z","timestamp":1773376964005,"version":"3.50.1"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195424","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing Hypergraph Product Codes with Random Walks, Simulated Annealing and Reinforcement Learning"],"prefix":"10.1109","author":[{"given":"Bruno Costa Alves","family":"Freire","sequence":"first","affiliation":[{"name":"Inria Paris, Pasqal"}]},{"given":"Nicolas","family":"Delfosse","sequence":"additional","affiliation":[]},{"given":"Anthony","family":"Leverrier","sequence":"additional","affiliation":[{"name":"Inria Paris,France"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.2.040101"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.26421\/QIC14.15-16-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/focs.2018.00076"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.129.050504"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.22331\/q-2020-09-21-327"},{"key":"ref6","author":"Xu","year":"2023","journal-title":"Constantoverhead fault-tolerant quantum computation with reconfigurable atom arrays"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.022317"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.13.041052"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-11-07-1516"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.133.180601"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-07107-7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2013.2292061"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520017"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00117"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585101"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.26421\/qic8.10-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.22331\/q-2021-11-22-585"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/physrevresearch.2.043423"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965567"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-32094-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06516-4"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1103\/prxquantum.4.020358"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1103\/physrevx.13.041022"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.22331\/q-2024-08-27-1450"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton63246.2024.10735275"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2025.3578597"},{"key":"ref27","author":"Su","year":"2023","journal-title":"Discovery of optimal quantum error correcting codes via reinforcement learning"},{"key":"ref28","author":"Mauron","year":"2023","journal-title":"Optimization of tensor network codes with reinforcement learning"},{"key":"ref29","author":"Briegel","year":"2013","journal-title":"Projective simulation for artificial intelligence"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-14740-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.86.032324"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.22331\/q-2019-12-16-215"},{"key":"ref33","author":"Delfosse","year":"2016","journal-title":"A linear-time benchmarking tool for generalized surface codes"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/tqe.2025.3538934"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-024-00920-y"},{"key":"ref36","author":"Freire","year":"2024","journal-title":"Ps hgp qec"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.54.1098"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1996.0136"},{"key":"ref39","article-title":"Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes","author":"Hillmann","year":"2024","journal-title":"arXiv preprint"},{"key":"ref40","article-title":"Ambiguity clustering: an accurate and efficient decoder for qldpc codes","author":"Wolanski","year":"2024","journal-title":"arXiv preprint"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.26421\/QIC13.9-10-4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"key":"ref43","volume-title":"The M4RI Library","author":"Albrecht"},{"key":"ref44","volume-title":"Projective Simulation","author":"Melnikov"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.25080\/TCWV9851"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-020-2649-2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"ref48","volume-title":"LDPC: Python tools for low density parity check codes","author":"Roffe","year":"2022"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2012.2218595"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abc609"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.133.150603"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-025-01033-w"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195424.pdf?arnumber=11195424","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:39Z","timestamp":1773347379000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195424\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195424","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}