Title:
Trellis Decoding And Applications For Quantum Error Correction
Trellis Decoding And Applications For Quantum Error Correction
| dc.contributor.advisor | Harrell, Evans M. | |
| dc.contributor.advisor | Brown, Kenneth R. | |
| dc.contributor.author | Sabo, Eric | |
| dc.contributor.committeeMember | Baker, Matthew | |
| dc.contributor.committeeMember | Short, Martin | |
| dc.contributor.committeeMember | Qureshi, Moinuddin | |
| dc.contributor.department | Mathematics | |
| dc.date.accessioned | 2022-08-25T13:36:34Z | |
| dc.date.available | 2022-08-25T13:36:34Z | |
| dc.date.created | 2022-08 | |
| dc.date.issued | 2022-08-08 | |
| dc.date.submitted | August 2022 | |
| dc.date.updated | 2022-08-25T13:36:34Z | |
| dc.description.abstract | Compact, graphical representations of error-correcting codes called trellises are a crucial tool in classical coding theory, establishing both theoretical properties and performance metrics for practical use. The idea was extended to quantum error-correcting codes by Ollivier and Tillich in 2005. Here, we use their foundation to establish a practical decoder able to compute the maximum-likely error for any stabilizer code over a finite field of prime dimension. We define a canonical form for the stabilizer group and use it to classify the internal structure of the graph. Similarities and differences between the classical and quantum theories are discussed throughout. Numerical results are presented which match or outperform current state-of-the-art decoding techniques. New construction techniques for large trellises are developed and practical implementations discussed. We then define a dual trellis and use algebraic graph theory to solve the maximum-likely coset problem for any stabilizer code over a finite field of prime dimension at minimum added cost. Classical trellis theory makes occasional theoretical use of a graph product called the trellis product. We establish the relationship between the trellis product and the standard graph products and use it to provide a closed form expression for the resulting graph, allowing it to be used in practice. We explore its properties and classify all idempotents. The special structure of the trellis allows us to present a factorization procedure for the product, which is much simpler than that of the standard products. Finally, we turn to an algorithmic study of the trellis and explore what coding-theoretic information can be extracted assuming no other information about the code is available. In the process, we present a state-of-the-art algorithm for computing the minimum distance for any stabilizer code over a finite field of prime dimension. We also define a new weight enumerator for stabilizer codes over F_2 incorporating the phases of each stabilizer and provide a trellis-based algorithm to compute it. | |
| dc.description.degree | Ph.D. | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/1853/67269 | |
| dc.language.iso | en_US | |
| dc.publisher | Georgia Institute of Technology | |
| dc.subject | Quantum | |
| dc.subject | trellis | |
| dc.subject | error correction | |
| dc.subject | quantum error correction | |
| dc.title | Trellis Decoding And Applications For Quantum Error Correction | |
| dc.type | Text | |
| dc.type.genre | Dissertation | |
| dspace.entity.type | Publication | |
| local.contributor.advisor | Brown, Kenneth R. | |
| local.contributor.advisor | Harrell, Evans M. | |
| local.contributor.corporatename | College of Sciences | |
| local.contributor.corporatename | School of Mathematics | |
| relation.isAdvisorOfPublication | f47855b9-eee7-44e0-8a7b-fd2c17563fc1 | |
| relation.isAdvisorOfPublication | f4970e81-552d-4cbb-afa2-d680962b0a59 | |
| relation.isOrgUnitOfPublication | 85042be6-2d68-4e07-b384-e1f908fae48a | |
| relation.isOrgUnitOfPublication | 84e5d930-8c17-4e24-96cc-63f5ab63da69 | |
| thesis.degree.level | Doctoral |