Topological hypermaps can be used to construct quantum stabilizer codes, although these codes are later shown to be just surface codes. In this article, we explore the quantum codes stem from the dual hypermaps and their relations with those from the original hypermaps. We find that the cell strucure of the surface codes from the dual hypermaps are just the dual cell structure of original hypermap itself with special darts erased. Then we propose a new kind of dual hypermaps called
△-duals, and also the concept of their contrary maps. We also propose an alternative route to construct quantum codes from hypermaps. With all these new constructions, we find that the homological code of the original hypermap and that of the dual hypermap can be transformed to the new quantum codes of the
△-dual and its contrary map, which makes the duality between these two codes more apparent both geometrically and algebraically.
We introduce a new type of sparse CSS quantum error correcting code based on the homology of hypermaps. Sparse quantum error correcting codes are of interest in the building of quantum computers due to their ease of implementation and the possibility of developing fast decoders for them. Codes based on the homology of embeddings of graphs, such as Kitaev's toric code, have been discussed widely in the literature and our class of codes generalize these. We use embedded hypergraphs, which are a generalization of graphs that can have edges connected to more than two vertices. We develop theorems and examples of our hypermap-homology codes, especially in the case that we choose a special type of basis in our homology chain complex. In particular the most straightforward generalization of the
m×m toric code to hypermap-homology codes gives us a
[(3/2)m2,2,m] code as compared to the toric code which is a
[2m2,2,m] code. Thus we can protect the same amount of quantum information, with the same error-correcting capability, using less physical qubits.