Euclidean and hyperbolic asymmetric topological quantum codes

• Main Authors: de Albuquerque, C.D (Author), de Oliveira Quilles Queiroz, C.R (Author), La Guardia, G.G (Author), Palazzo, R., Jr (Author), Vieira, V.L (Author)
• Format: Article
• Language: English
• Published: Springer 2022
• Subjects: Asymmetric code; Asymmetric quantum codes; Asymptotic behaviour; Codes (symbols); Euclidean; Hyperbolic code; Hyperbolic codes; Hyperbolic surface; Quantum codes; Quantum computers; Quantum error correcting codes; Quantum noise; Surface code; Surface codes; Topological quantum code; Topological quantum codes; Topology
• Online Access: View Fulltext in Publisher

 In the last three decades, several constructions of quantum error-correcting codes were presented in the literature. Among these codes, there are the asymmetric ones, i.e., quantum codes whose Z-distance dz is different from its X-distance dx. The topological quantum codes form an important class of quantum codes, where the toric code, introduced by Kitaev, was the first family of this type. After Kitaev’s toric code, several authors focused attention on investigating its structure and the constructions of new families of topological quantum codes over Euclidean and hyperbolic surfaces. As a consequence of establishing the existence and the construction of asymmetric topological quantum codes in Theorem 5.1, the main result of this paper, we introduce the class of hyperbolic asymmetric codes. Hence, families of Euclidean and hyperbolic asymmetric topological quantum codes are presented. An analysis regarding the asymptotic behavior of their distances dx and dz and encoding rates k/n versus the compact orientable surface’s genus is provided due to the significant difference between the asymmetric distances dx and dz when compared with the corresponding parameters of topological codes generated by other tessellations. This inherent unequal error protection is associated with the nontrivial homological cycle of the { r, s} tessellation and its dual, which may be appropriately explored depending on the application, where r≠ s and (r- 2) (s- 2) ≥ 4. Three families of codes derived from the { 7 , 3 } , { 5 , 4 } , and { 10 , 5 } tessellations are highlighted. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.