{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:41Z","timestamp":1773376601891,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100004191","name":"Novo Nordisk","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004191","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004787","name":"The Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004787","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206950","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"84-89","source":"Crossref","is-referenced-by-count":1,"title":["Fault-Tolerant Coding for Entanglement-Assisted Communication"],"prefix":"10.1109","author":[{"given":"Paula","family":"Belzig","sequence":"first","affiliation":[{"name":"University of Copenhagen,Department of Mathematics,Copenhagen,Denmark,2100"}]},{"given":"Matthias","family":"Christandl","sequence":"additional","affiliation":[{"name":"University of Copenhagen,Department of Mathematics,Copenhagen,Denmark,2100"}]},{"given":"Alexander","family":"M\u00fcller-Hermes","sequence":"additional","affiliation":[{"name":"University of Oslo,Department of Mathematics,Oslo,Norway,0851"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0003-4916(02)00018-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928980"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1998.0166"},{"key":"ref23","article-title":"Distillation of secret key and entanglement from quantum states","volume":"461","author":"devetak","year":"2003","journal-title":"Proceedings of The Royal Society A Mathematical Physical and Engineering Sciences"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139525343"},{"key":"ref14","article-title":"Quantum accuracy threshold for concatenated distance-3 codes","volume":"6","author":"aliferis","year":"2005","journal-title":"Quantum Information and Computation"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.90.062311"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799359385"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-012-1613-x"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3169438"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437610"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.651037"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref17","author":"nielsen","year":"2010","journal-title":"Quantum Computation and Quantum Information 10th Anniversary Edition"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.54.3824"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1996.0136"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1038\/s41586-021-03588-y","article-title":"Exponential suppression of bit or phase flip errors with repetitive error correction","volume":"595","author":"chen","year":"2021","journal-title":"Nature"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6993-4"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"2637","DOI":"10.1109\/TIT.2002.802612","article-title":"Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem","volume":"48","author":"bennett","year":"2002","journal-title":"Information Theory IEEE Transactions on"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","article-title":"Quantum computing in the NISQ era and beyond","volume":"2","author":"preskill","year":"2018","journal-title":"Quantum"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.55.1613"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.56.131"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839515"},{"key":"ref5","article-title":"The quantum channel capacity and coherent information","author":"shor","year":"2002"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206950.pdf?arnumber=10206950","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:50Z","timestamp":1773347210000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206950\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206950","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}