{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:03Z","timestamp":1773378123610,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834749","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2225-2230","source":"Crossref","is-referenced-by-count":1,"title":["Quantum message-passing algorithm for optimal and efficient decoding"],"prefix":"10.1109","author":[{"given":"Christophe","family":"Piveteau","sequence":"first","affiliation":[{"name":"ETH Zürich,Institute for Theoretical Physics,Zürich,Switzerland,8093"}]},{"given":"Joseph M.","family":"Renes","sequence":"additional","affiliation":[{"name":"ETH Zürich,Institute for Theoretical Physics,Zürich,Switzerland,8093"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1080\/17442507508833114","article-title":"Optimal multiple quantum statistical hypothesis testing","volume":"1","author":"belavkin","year":"1975","journal-title":"Stochastics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/09500349414552221"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF02435921"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.58.146"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.915636"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1038\/s41534-021-00422-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2280915"},{"key":"ref6","article-title":"Quantum message-passing algorithm for optimal and efficient decoding","author":"piveteau","year":"2021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.910573"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2017.8277985"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2716422"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006824"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2004.1267047"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834749.pdf?arnumber=9834749","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:25Z","timestamp":1773347785000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834749\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834749","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}