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

Some Results on Qudit Quantum Error-Correction

Lane G. Gunderman

Published Jan 30, 2020• 0 citations
OpenAlex

Abstract

Quantum computing’s seemingly perpetual promise of nearness still has a few hurdles \nto surmount before it can become a reality. Among these hurdles is that of protection of \ninformation from random errors. A potential solution for this challenge is stabilizer codes, \nwhich are the analog of classical linear error-correcting codes, however, with an additional \naxis of error possibility. By and large, quantum computing is discussed in the standard \nqubit, or two-level, language, however, it is worth considering the case of qudits, or more \nthan two-level systems. Often times results follow simply from some form of algebraic \nextension: typically group theory or linear algebra. In this work we consider some features \nthat are not immediately apparent from that approach, more often appealing to physical \nintuition to guide our mathematical ideas, then proving these ideas using the language of \nqudit operators. \n \nHere we consider two particular previously unexplored ideas. The first idea is that of \nembedding and inscribing of codes into spaces of different sizes than the stabilizer code \nwas originally designed for. Here, we show that all codes can be embedded, and that for \ninfinitely many primes we can in fact guarantee that the distance is at least preserved–a \nsomewhat surprising result. The second idea is, in a way an application of those presented \nin the first idea, that of turning many stabilizer codes into hybrid codes by taking advantage \nof relabelling of syndromes and the rapid increase in syndrome space upon using codes in \nlarge spaces. Both of these are somewhat useful in their current forms, however, with some \nadditional mathematical work could be turned into potentially very powerful tools for the \nprotection of quantum information. We finish off by, and along the way, mentioning various \nfuture directions to carry work on this.

Related papers

Quantum error correction and fault tolerance: A comprehensive tutorial

Daniel J. Spencer, Shubham P. Jain, Andrew Tanggara +4 more

Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.

quant-pharXiv:2605.29137•May 29, 2026•7 citations

Degenerate local-dimension-invariant stabilizer codes and an alternative bound for the distance preservation condition

Lane G. Gunderman

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.

arXiv:2110.15274•Physical Review A•Apr 14, 2022•5 citations

Local-dimension-invariant qudit stabilizer codes

Lane G. Gunderman

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.

arXiv:1910.08122•Physical Review A•May 28, 2020•14 citations

Error Correcting Quantum Codes and Algebraic Curves

Artur Elezi

The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2015•0 citations

Quantum Error Correcting Codes

Mikio Nakahara

Quantum computing is a new and exciting field of research that, using the properties of quantum mechanics, has the potential to be a disruptive technology, being able to per form certain computations faster than any classical computer, such as Shor’s factorization algorithm and Grover’s algorithm. Although there are several quantum computer with different underlying technologies, one of the main challenges of quantum computation is the occurence of errors, destroying the information and making computation impossible. Errors may have several different sources namely, thermal noise, faulty gates or incorrect measurements. The present dissertation aims to study and employ methods for reducing the effects of errors during quantum computation and correct them using Stabilizer Codes, which are a very powerful tool to produce circuit encoding networks that can, in theory, protect quantum systems from errors during transmission. A proof of concept algorithm was implemented using Qiskit, a Python based program development language for the IBM Q machines, and tested on both simulators and real systems. The algorithm is capable of, given any stabilizer in standard form, generate the circuit encoding network. Due to technological limitations associated with current quantum computers the results obtained in ibmq_guadalupe fail to show the efficacy of Stabilizer Codes.

CRC Press eBooks•Mar 11, 2008•0 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

arXiv:quant-ph/9705052•May 28, 1997•2,856 citations
Quantum computing’s seemingly perpetual promise of nearness still has a few hurdles \nto surmount before it can become a reality. Among these hurdles is that of protection of \ninformation from random errors. A potential solution for this challenge is stabilizer codes, \nwhich are the analog of classical linear error-correcting codes, however, with an additional \naxis of error possibility. By and large, quantum computing is discussed in the standard \nqubit, or two-level, language, however, it is worth considering the case of qudits, or more \nthan two-level systems. Often times results follow simply from some form of algebraic \nextension: typically group theory or linear algebra. In this work we consider some features \nthat are not immediately apparent from that approach, more often appealing to physical \nintuition to guide our mathematical ideas, then proving these ideas using the language of \nqudit operators. \n \nHere we consider two particular previously unexplored ideas. The first idea is that of \nembedding and inscribing of codes into spaces of different sizes than the stabilizer code \nwas originally designed for. Here, we show that all codes can be embedded, and that for \ninfinitely many primes we can in fact guarantee that the distance is at least preserved–a \nsomewhat surprising result. The second idea is, in a way an application of those presented \nin the first idea, that of turning many stabilizer codes into hybrid codes by taking advantage \nof relabelling of syndromes and the rapid increase in syndrome space upon using codes in \nlarge spaces. Both of these are somewhat useful in their current forms, however, with some \nadditional mathematical work could be turned into potentially very powerful tools for the \nprotection of quantum information. We finish off by, and along the way, mentioning various \nfuture directions to carry work on this.
Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.
The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.
Quantum computing is a new and exciting field of research that, using the properties of quantum mechanics, has the potential to be a disruptive technology, being able to per form certain computations faster than any classical computer, such as Shor’s factorization algorithm and Grover’s algorithm. Although there are several quantum computer with different underlying technologies, one of the main challenges of quantum computation is the occurence of errors, destroying the information and making computation impossible. Errors may have several different sources namely, thermal noise, faulty gates or incorrect measurements. The present dissertation aims to study and employ methods for reducing the effects of errors during quantum computation and correct them using Stabilizer Codes, which are a very powerful tool to produce circuit encoding networks that can, in theory, protect quantum systems from errors during transmission. A proof of concept algorithm was implemented using Qiskit, a Python based program development language for the IBM Q machines, and tested on both simulators and real systems. The algorithm is capable of, given any stabilizer in standard form, generate the circuit encoding network. Due to technological limitations associated with current quantum computers the results obtained in ibmq_guadalupe fail to show the efficacy of Stabilizer Codes.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.