Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

National Academy Science Letters

Some New Classes of Homological Quantum Codes Associated with Surface Maps

Debashis Bhowmik, Dipendu Maity, Bhanu Pratap Yadav, Sachin Pathak, Ashish Kumar Upadhyay

Published Jul 25, 2021• 0 citations
Publisher
DOI
10.1007/s40009-021-01069-4

Related papers

A New Class of Quantum Codes Associate with a Class of Maps

Debashis Bhowmik, Dipendu Maity, Ashish Kumar Upadhyay

Advances in intelligent systems and computing•Jan 1, 2022•1 citation

On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction

Gilles Zémor

Lecture notes in computer science•Jan 1, 2009•54 citations

New classes of quantum codes on closed orientable surfaces

Avaz Naghipour

Cryptography and Communications•Dec 17, 2018•2 citations

New Classes of Quantum Codes Associated with Surface Maps

Debashis Bhowmik, Dipendu Maity, Bhanu Pratap Yadav +1 more

If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following: (i) equivelar maps of type $ [k^k]$, (ii) equivelar maps on the double torus along with the covering of the maps, and (iii) semi-equivelar maps on the surface of \Echar{-1}, along with {their} covering maps. The encoding rate of the class of codes associated with the maps in (i) is such that $ \frac{k}{n}\rightarrow 1 $ as $ n\rightarrow\infty $, and for the remaining classes of codes, the encoding rate is $ \frac{k}{n}\rightarrow α$ as $ n\rightarrow \infty $ with $ α< 1 $.

arXiv:2007.01684•Jul 3, 2020•0 citations

Relation between surface codes and hypermap-homology quantum codes

Pradeep Kiran Sarvepalli

Recently, a new class of quantum codes based on hypermaps has been proposed. These codes are obtained from embeddings of hypergraphs as opposed to surface codes which are obtained from the embeddings of graphs. It is natural to compare these two classes of codes and their relation to each other. In this context two related questions are addressed in this paper: Can the parameters of hypermap-homology codes be superior to those of surface codes, and what is precisely the relation between these two classes of quantum codes? We show that a canonical hypermap code is identical to a surface code, whereas a noncanonical hypermap code can be transformed to a surface code by cnot gates alone. Our approach is constructive; we construct the related surface code and the transformation involving cnot gates.

arXiv:1312.6344•Physical Review A•May 13, 2014•4 citations

On the duality between homological quantum codes of a hypermap and its dual hypermap

Zihan Lei

arXiv:2105.01608•Quantum Information Processing•Feb 11, 2023•1 citation
If the cyclic sequences of {face types} {at} all vertices in a map are the same, then the map is said to be a semi-equivelar map. In particular, a semi-equivelar map is equivelar if the faces are the same type. Homological quantum codes represent a subclass of topological quantum codes. In this article, we introduce {thirteen} new classes of quantum codes. These codes are associated with the following: (i) equivelar maps of type $ [k^k]$, (ii) equivelar maps on the double torus along with the covering of the maps, and (iii) semi-equivelar maps on the surface of \Echar{-1}, along with {their} covering maps. The encoding rate of the class of codes associated with the maps in (i) is such that $ \frac{k}{n}\rightarrow 1 $ as $ n\rightarrow\infty $, and for the remaining classes of codes, the encoding rate is $ \frac{k}{n}\rightarrow α$ as $ n\rightarrow \infty $ with $ α< 1 $.
Recently, a new class of quantum codes based on hypermaps has been proposed. These codes are obtained from embeddings of hypergraphs as opposed to surface codes which are obtained from the embeddings of graphs. It is natural to compare these two classes of codes and their relation to each other. In this context two related questions are addressed in this paper: Can the parameters of hypermap-homology codes be superior to those of surface codes, and what is precisely the relation between these two classes of quantum codes? We show that a canonical hypermap code is identical to a surface code, whereas a noncanonical hypermap code can be transformed to a surface code by cnot gates alone. Our approach is constructive; we construct the related surface code and the transformation involving cnot gates.