dc.contributor.author | Lloyd, Seth | |
dc.contributor.author | Shor, Peter Williston | |
dc.contributor.author | Thompson, Kevin | |
dc.date.accessioned | 2020-08-19T16:52:24Z | |
dc.date.available | 2020-08-19T16:52:24Z | |
dc.date.issued | 2019-11 | |
dc.date.submitted | 2018-07 | |
dc.identifier.issn | 1557-9654 | |
dc.identifier.issn | 0018-9448 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/126678 | |
dc.description.abstract | We provide polylog sparse quantum codes for correcting the erasure channel arbitrarily close to the capacity. Specifically, we provide [[n, k, d]] quantum stabilizer codes that correct for the erasure channel arbitrarily close to the capacity if the erasure probability is at least 0.33, and with a generating set hS1, S2, . . . Sn−ki such that |Si | ≤ log2+ζ (n) for all i and for any ζ > 0 with high probability. In this work we show that the result of Delfosse et al. [5] is tight: one can construct capacity approaching codes with weight almost O(1). | en_US |
dc.language.iso | en | |
dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
dc.relation.isversionof | 10.1109/TIT.2019.2925100 | en_US |
dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
dc.source | arXiv | en_US |
dc.title | Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel | en_US |
dc.type | Article | en_US |
dc.identifier.citation | S. Lloyd, P. Shor and K. Thompson, "Polylog-LDPC Capacity Achieving Codes for the Noisy Quantum Erasure Channel," in IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 7584-7595, Nov. 2019, doi: 10.1109/TIT.2019.2925100. | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mechanical Engineering | en_US |
dc.contributor.department | Massachusetts Institute of Technology. Department of Mathematics | en_US |
dc.relation.journal | IEEE Transactions on Information Theory | en_US |
dc.eprint.version | Original manuscript | en_US |
dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
dc.date.updated | 2019-11-20T13:53:29Z | |
dspace.date.submission | 2019-11-20T13:53:33Z | |
mit.journal.volume | 65 | en_US |
mit.journal.issue | 11 | en_US |
mit.metadata.status | Complete | |