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

Quantum Codes on Hurwitz Surfaces

Isaac H. Kim

Published Jan 1, 2007• 16 citations
OpenAlex

Abstract

Ever since the birth of the first quantum error correcting code, many error correcting techniques and formalism has been constructed so far. Among those, generating a quantum code on a locally planar geometry have lead to some interesting classes of codes. Main idea of this thesis stems from Kitaev's Toric code, which was the first surface code, yet it suffered from having a asymptotically vanishing encoding rate. In this paper, we propose a quantum surface code on a more complicated closed surface which has large genus, namely the Hurwitz surface. This code admits a constant encoding rate in the asymptotic limit that the number of genus goes to infinity. However, we give evidence that t/n, where n is the number of qubits and t is the number of correctible errors, converges to 0 asymptotically. This is based on numerically generating many Hurwitz surfaces and observing the corresponding quantum code in the limit that genus number goes to infinity.

Related papers

Topological quantum error correction with optimal encoding rate

Héctor Bombín, Miguel Angel Martin-Delgado

We prove the existence of topological quantum error correcting codes with encoding rates $k∕n$ asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbitrary genus. We find a class of regular toric codes that are optimal. For physical implementations, we present planar topological codes.

arXiv:quant-ph/0602063•Physical Review A•Jun 6, 2006•44 citations

Homological error correction: Classical and quantum codes

Héctor Bombín, M. A. Martin-Delgado

We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for nonorientable surfaces it is impossible to construct homological codes based on qudits of dimension D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor’s 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.

arXiv:quant-ph/0605094•Journal of Mathematical Physics•May 1, 2007•146 citations

PhD thesis: Homological Quantum Codes Beyond the Toric Code

Nikolas P. Breuckmann

PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.

arXiv:1802.01520•Feb 5, 2018•21 citations

Topological quantum codes on compact surfaces with genus g≥2

Clarice Dias de Albuquerque, Reginaldo Palazzo, E.B. Da Silva

In this paper we propose a construction procedure of a class of topological quantum error-correcting codes on surfaces with genus g≥2. This generalizes the toric codes construction. We also tabulate all possible surface codes with genus 2–5. In particular, this construction reproduces the class of codes obtained when considering the embedding of complete graphs Ks, for s≡1 mod 4, on surfaces with appropriate genus. We also show a table comparing the rate of different codes when fixing the distance to 3–5.

Journal of Mathematical Physics•Feb 1, 2009•45 citations

Construction of topological quantum codes on compact surfaces

Clarice Dias de Albuquerque, Reginaldo Palazzo, Eduardo Brandani da Silva

In this paper we construct a class of topological quantum error-correcting codes on compact surfaces with genus g ≥ 2. This generalizes the construction process of toric codes. As examples, we tabulate some good topological quantum codes on surfaces with genus 2 and 3.

IEEE Information Theory Workshop (ITW)•May 1, 2008•2 citations

Homological quantum codes beyond the toric code

Nikolas P. Breuckmann

Computer architectures which exploit quantum mechanical effects can solve computing tasks that are otherwise impossible to perform. A quantum computer operates on a number of small quantum mechanical systems, known as quantum bits, or qubits. Since these systems are realized on the scale of atoms, they are very prone to errors. Errors occur when the environment interacts with the qubits, a process called decoherence. It is widely accepted that it will not be possible to shield qubits completely from the outside world. If one were to perform a quantum computation on the qubits directly, then after a short period of time the information present in the qubits would be lost. To counter decoherence the state of a qubit can be encoded into multiple physical ones. This is called a quantum error correcting code. Performing quantum error correction allows one to extend the life time of the encoded qubit arbitrarily, assuming that the rate of errors remains below a certain threshold value. The use of quantum codes creates an overhead in resources, as for every logical qubit many more physical qubits are needed. The resource overhead for fault-tolerance is problematic, since realizing qubits will be costly, and in the early stages of building quantum computers the number of physical qubits will be limited. The currently favored coding architecture is the toric code and its variant the surface code in which the physical qubits are put on a square grid in which interactions are only between nearest neighbors. In this thesis we will explore quantum codes in which qubits interact as if they were nearest neighbors in more exotic spaces. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.

•Jan 1, 2017•13 citations
Ever since the birth of the first quantum error correcting code, many error correcting techniques and formalism has been constructed so far. Among those, generating a quantum code on a locally planar geometry have lead to some interesting classes of codes. Main idea of this thesis stems from Kitaev's Toric code, which was the first surface code, yet it suffered from having a asymptotically vanishing encoding rate. In this paper, we propose a quantum surface code on a more complicated closed surface which has large genus, namely the Hurwitz surface. This code admits a constant encoding rate in the asymptotic limit that the number of genus goes to infinity. However, we give evidence that t/n, where n is the number of qubits and t is the number of correctible errors, converges to 0 asymptotically. This is based on numerically generating many Hurwitz surfaces and observing the corresponding quantum code in the limit that genus number goes to infinity.
We prove the existence of topological quantum error correcting codes with encoding rates k∕nk∕nk∕n asymptotically approaching the maximum possible value. Explicit constructions of these topological codes are presented using surfaces of arbitrary genus. We find a class of regular toric codes that are optimal. For physical implementations, we present planar topological codes.
We prove several theorems characterizing the existence of homological error correction codes both classically and quantumly. Not every classical code is homological, but we find a family of classical homological codes saturating the Hamming bound. In the quantum case, we show that for nonorientable surfaces it is impossible to construct homological codes based on qudits of dimension D>2, while for orientable surfaces with boundaries it is possible to construct them for arbitrary dimension D. We give a method to obtain planar homological codes based on the construction of quantum codes on compact surfaces without boundaries. We show how the original Shor’s 9-qubit code can be visualized as a homological quantum code. We study the problem of constructing quantum codes with optimal encoding rate. In the particular case of toric codes we construct an optimal family and give an explicit proof of its optimality. For homological quantum codes on surfaces of arbitrary genus we also construct a family of codes asymptotically attaining the maximum possible encoding rate. We provide the tools of homology group theory for graphs embedded on surfaces in a self-contained manner.
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.
In this paper we propose a construction procedure of a class of topological quantum error-correcting codes on surfaces with genus g≥2. This generalizes the toric codes construction. We also tabulate all possible surface codes with genus 2–5. In particular, this construction reproduces the class of codes obtained when considering the embedding of complete graphs Ks, for s≡1 mod 4, on surfaces with appropriate genus. We also show a table comparing the rate of different codes when fixing the distance to 3–5.
Computer architectures which exploit quantum mechanical effects can solve computing tasks that are otherwise impossible to perform. A quantum computer operates on a number of small quantum mechanical systems, known as quantum bits, or qubits. Since these systems are realized on the scale of atoms, they are very prone to errors. Errors occur when the environment interacts with the qubits, a process called decoherence. It is widely accepted that it will not be possible to shield qubits completely from the outside world. If one were to perform a quantum computation on the qubits directly, then after a short period of time the information present in the qubits would be lost. To counter decoherence the state of a qubit can be encoded into multiple physical ones. This is called a quantum error correcting code. Performing quantum error correction allows one to extend the life time of the encoded qubit arbitrarily, assuming that the rate of errors remains below a certain threshold value. The use of quantum codes creates an overhead in resources, as for every logical qubit many more physical qubits are needed. The resource overhead for fault-tolerance is problematic, since realizing qubits will be costly, and in the early stages of building quantum computers the number of physical qubits will be limited. The currently favored coding architecture is the toric code and its variant the surface code in which the physical qubits are put on a square grid in which interactions are only between nearest neighbors. In this thesis we will explore quantum codes in which qubits interact as if they were nearest neighbors in more exotic spaces. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and enumerate all quantum codes derived from them which have less than 10.000 physical qubits. For codes that are extremal in a certain sense we perform numerical simulations to determine the value of their threshold. Furthermore, we give evidence that these codes can be used for more overhead efficient storage as compared to the surface code by orders of magnitude. We also show how to read and write the encoded qubits while keeping their connectivity low. In the second part we consider codes in which qubits are layed-out according to a four- dimensional geometry. Such codes allow for much simpler decoding schemes compared to codes which are two-dimensional. In particular, measurements do not necessarily have to be repeated to obtain reliable information about the error and the classical hardware performing the error correction is greatly simplified. We perform numerical simulations to analyze the performance of these codes using decoders based on local updates. We also introduce a novel decoder based on techniques from machine learning and image recognition to decode four-dimensional codes.