Zijian Liang (梁子健), Yijia Xu (许逸葭), Joseph T. Iosue, Yu-An Chen (陳昱安)
{"title":"Extracting Topological Orders of Generalized Pauli Stabilizer Codes in Two Dimensions","authors":"Zijian Liang (梁子健), Yijia Xu (许逸葭), Joseph T. Iosue, Yu-An Chen (陳昱安)","doi":"10.1103/prxquantum.5.030328","DOIUrl":null,"url":null,"abstract":"In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><msub><mrow><mi mathvariant=\"double-struck\">Z</mi></mrow><mi>d</mi></msub></math> qudits, including instances where <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mi>d</mi></math> is a nonprime number. This capability allows the identification of topological orders that differ from the <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><msub><mrow><mi mathvariant=\"double-struck\">Z</mi></mrow><mi>d</mi></msub></math> toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><msub><mrow><mi mathvariant=\"double-struck\">Z</mi></mrow><mi>p</mi></msub></math> qudits (with <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><mi>p</mi></math> being a prime) are equivalent to finite copies of <math display=\"inline\" overflow=\"scroll\" xmlns=\"http://www.w3.org/1998/Math/MathML\"><msub><mrow><mi mathvariant=\"double-struck\">Z</mi></mrow><mi>p</mi></msub></math> toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order.","PeriodicalId":501296,"journal":{"name":"PRX Quantum","volume":"8 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PRX Quantum","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1103/prxquantum.5.030328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we introduce an algorithm for extracting topological data from translation invariant generalized Pauli stabilizer codes in two-dimensional systems, focusing on the analysis of anyon excitations and string operators. The algorithm applies to qudits, including instances where is a nonprime number. This capability allows the identification of topological orders that differ from the toric codes. It extends our understanding beyond the established theorem that Pauli stabilizer codes for qudits (with being a prime) are equivalent to finite copies of toric codes and trivial stabilizers. The algorithm is designed to determine all anyons and their string operators, enabling the computation of their fusion rules, topological spins, and braiding statistics. The method converts the identification of topological orders into computational tasks, including Gaussian elimination, the Hermite normal form, and the Smith normal form of truncated Laurent polynomials. Furthermore, the algorithm provides a systematic approach for studying quantum error-correcting codes. We apply it to various codes, such as self-dual CSS quantum codes modified from the two-dimensional honeycomb color code and non-CSS quantum codes that contain the double semion topological order or the six-semion topological order.