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

arXiv:2008.00713

Exploiting degeneracy to construct good ternary quantum error correcting code

Ritajit Majumdar, Susmita Sur‐Kolay

Published Aug 3, 2020• 0 citations
arXivHTMLPDF

Abstract

Quantum error-correcting code for higher dimensional systems can, in general, be directly constructed from the codes for qubit systems. What remains unknown is whether there exist efficient code design techniques for higher dimensional systems. In this paper, we propose a 7-qutrit error-correcting code for the ternary quantum system and show that this design formulation has no equivalence in qubit systems. This code is optimum in the number of qutrits required to correct a single error while maintaining the CSS structure. This degenerate CSS code can (i) correct up to seven simultaneous phase errors and a single bit error, (ii) correct two simultaneous bit errors on pre-defined pairs of qutrits on eighteen out of twenty-one possible pairs, and (iii) in terms of the cost of implementation, the depth of the circuit of this code is only two more than that of the ternary Steane code. Our proposed code shows that it is possible to design better codes explicitly for ternary quantum systems instead of simply carrying over codes from binary quantum systems.

DOI
10.48550/arxiv.2008.00713

Related papers

Quantum error-correcting code for ternary logic

Ritajit Majumdar, Saikat Basu, Shibashis Ghosh +1 more

Ternary quantum systems are being studied because they provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the coefficient of one of the basis states is zero. Hence both $(2\ifmmode\times\else\texttimes\fi{}2)$-dimensional and $(3\ifmmode\times\else\texttimes\fi{}3)$-dimensional Pauli errors can occur on qutrits. In this paper, we (i) explore the possible $(2\ifmmode\times\else\texttimes\fi{}2)$-dimensional as well as $(3\ifmmode\times\else\texttimes\fi{}3)$-dimensional Pauli errors in qutrits and show that any pairwise bit swap error can be expressed as a linear combination of shift errors and phase errors, (ii) propose a special type of error called a quantum superposition error and show its equivalence to arbitrary rotation, (iii) formulate a nine-qutrit code which can correct a single error in a qutrit, and (iv) provide its stabilizer and circuit realization.

arXiv:1807.01863•Physical Review A•May 2, 2018•26 citations

Optimal Error Correcting Code For Ternary Quantum Systems

Ritajit Majumdar, Susmita Sur‐Kolay

Multi-valued quantum systems can store more information than binary ones for a given number of quantum states. For reliable operation of multi-valued quantum systems, error correction is mandated. In this paper, we propose a 5-qutrit quantum error-correcting code and provide its stabilizer formulation. Since 5 qutrits are necessary to correct a single error, our proposed code is optimal in the number of qutrits. We prove that the error model considered in this paper spans the entire $(3 \times 3)$ operator space. Therefore, our proposed code can correct any single error on the codeword. This code outperforms the previous 9-qutrit code in (i) the number of qutrits required for encoding, (ii) our code can correct any arbitrary $(3 \times 3)$ error, (ii) our code can readily correct bit errors in a single step as opposed to the two-step correction used previously, and (iii) phase error correction does not require correcting individual subspaces.

arXiv:1906.11137•Jun 26, 2019•3 citations

Approximate Ternary Quantum Error Correcting Code with Low Circuit Cost

Ritajit Majumdar, Susmita Sur‐Kolay

Quantum error correcting code (QECC) with encoding and decoding circuits having low gate count, is an important criterion for realizing quantum computing systems. CSS QECCs are known to have simple circuits. Shaw et al. showed that it is not possible to have a 6-qubit CSS type QECC without sharing entanglement between the encoder and the decoder. In this paper, we propose a 6-qutrit approximate QECC (AQECC) of CSS structure which can simultaneously correct phase errors in upto six qutrits, and one bit error in only four of the six qutrits, without sharing prior entanglement. Our AQECC corrects a single error with probability 0.75 for symmetric error model, and probability 0.9988 for asymmetric error model. It also maintains CSS structure without sharing prior entanglement. Furthermore, the quantum cost of a circuit for this AQECC is 55.72% less than that for the 9-qutrit exact QECC. Overall, low qutrit count, low cost circuit realization with low depth and the ability to correct multiple phase errors make our proposed AQECC a suitable candidate for real life quantum channels.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•Nov 1, 2020•6 citations

Qutrit Error Correction Codes for Quantum Communications and Computations

Muhammad Imansyah Basudewa, Khoirul Anwar, Melinda Br Ginting

This paper proposes simple quantum [[9],[1],[3]] error correction codes for quantum systems beyond qubits, focusing on quantum ternary digits (qutrits) that represent the simplest higher-dimensional systems for future quantum technologies. Although qutrit-based systems offer larger capacity information over 2-dimensional systems, the challenge of identifying commuting stabilizers for constructing error correction codes becomes more difficult as the dimensionality increases or when working with a large number of qutrits. We design qutrit codes based on the generalized Pauli group and investigate the underlying structure, including shift, phase, and rotation operators. We successfully create suitable stabilizer codes that detect and correct qutrit errors. Furthermore, we (i) identify operators in qutrit, which are selected from various matrix interpretations for higher-dimensional systems, (ii) propose stabilizers for 9-qutrit error correction codes, and (iii) design a new 9-qutrit quantum circuit for communications. Our study is expected to contribute a foundational basis for possible future theoretical and experimental advancements in quantum computing, communications, and code-based cryptography in higher dimensional systems.

IEEE Asia-Pacific Conference on Applied Electromagnetics (APACE)•Dec 21, 2024•2 citations

Minimal degenerate CSS quantum code with low cost circuit

Ritajit Majumdar, Susmita Sur‐Kolay

Error correction is of utmost necessity for large-scale quantum computing. Quantum error correcting codes can be degenerate, if more than one type of error can map the input state to the same error state. In this paper, we propose a 6-qubit degenerate CSS code. We show that our proposed code can correct a single bit flip error, but arbitrarily many phase flip errors occurring on the codeword. Furthermore, it follows from a bound on CSS codes that the proposed code is the minimal binary CSS code which can encode a single qubit of information. We also perform a comparative study of the gate count required for a fault tolerant decomposition of the error correction circuit for the proposed code, with that for the existing 9-qubit, 7-qubit and 5-qubit binary QEC codes. Our results show, on an average over the different technologies a savings of 98.14% in the gate count for the proposed code over that for the 5-qubit code. Significant improvement of around 50% in gate count is also obtained when compared to those for the 9-qubit and 7-qubit codes.

arXiv:1908.07229•Aug 20, 2019•0 citations

A Qutrit $[\![ 6,2,2 ]\!]_{3}$ Quantum Error-Correcting Code with a Transversal Binary AND Gate

Christine Li, Lia Yeh

Quantum computation and error correction in higher dimensional systems offer a promising route to more efficient and robust codes and circuits, compared to qubits. In this work, we present a novel qutrit$[\![ 6,2,2 ]\!]_{3}$quantum error correcting code with a transversal implementation of the binary AND gate. The key insight in our approach is that we can interpret a symmetric T-depth one circuit decomposition — composed of a CX circuit,$\mathrm{T}$and$\mathrm{T}^{\dagger}$gates, followed by the CX circuit in reverse — as a distance 1 CSS code. We thereafter increase the code distance by augmenting the code circuit with additional stabilizers while preserving the “built-in” transversal logical binary AND. As a result, we can leverage qutrit Clifford+T circuit synthesis to combine the advantages of quantum error correction and qudits, and moreover protect against leakage errors to higher levels.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations
Quantum error-correcting code for higher dimensional systems can, in general, be directly constructed from the codes for qubit systems. What remains unknown is whether there exist efficient code design techniques for higher dimensional systems. In this paper, we propose a 7-qutrit error-correcting code for the ternary quantum system and show that this design formulation has no equivalence in qubit systems. This code is optimum in the number of qutrits required to correct a single error while maintaining the CSS structure. This degenerate CSS code can (i) correct up to seven simultaneous phase errors and a single bit error, (ii) correct two simultaneous bit errors on pre-defined pairs of qutrits on eighteen out of twenty-one possible pairs, and (iii) in terms of the cost of implementation, the depth of the circuit of this code is only two more than that of the ternary Steane code. Our proposed code shows that it is possible to design better codes explicitly for ternary quantum systems instead of simply carrying over codes from binary quantum systems.
Ternary quantum systems are being studied because they provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the coefficient of one of the basis states is zero. Hence both $(2\ifmmode\times\else\texttimes\fi{}2)$-dimensional and $(3\ifmmode\times\else\texttimes\fi{}3)$-dimensional Pauli errors can occur on qutrits. In this paper, we (i) explore the possible $(2\ifmmode\times\else\texttimes\fi{}2)$-dimensional as well as $(3\ifmmode\times\else\texttimes\fi{}3)$-dimensional Pauli errors in qutrits and show that any pairwise bit swap error can be expressed as a linear combination of shift errors and phase errors, (ii) propose a special type of error called a quantum superposition error and show its equivalence to arbitrary rotation, (iii) formulate a nine-qutrit code which can correct a single error in a qutrit, and (iv) provide its stabilizer and circuit realization.
Multi-valued quantum systems can store more information than binary ones for a given number of quantum states. For reliable operation of multi-valued quantum systems, error correction is mandated. In this paper, we propose a 5-qutrit quantum error-correcting code and provide its stabilizer formulation. Since 5 qutrits are necessary to correct a single error, our proposed code is optimal in the number of qutrits. We prove that the error model considered in this paper spans the entire (3×3)(3 \times 3)(3×3) operator space. Therefore, our proposed code can correct any single error on the codeword. This code outperforms the previous 9-qutrit code in (i) the number of qutrits required for encoding, (ii) our code can correct any arbitrary (3×3)(3 \times 3)(3×3) error, (ii) our code can readily correct bit errors in a single step as opposed to the two-step correction used previously, and (iii) phase error correction does not require correcting individual subspaces.
Quantum error correcting code (QECC) with encoding and decoding circuits having low gate count, is an important criterion for realizing quantum computing systems. CSS QECCs are known to have simple circuits. Shaw et al. showed that it is not possible to have a 6-qubit CSS type QECC without sharing entanglement between the encoder and the decoder. In this paper, we propose a 6-qutrit approximate QECC (AQECC) of CSS structure which can simultaneously correct phase errors in upto six qutrits, and one bit error in only four of the six qutrits, without sharing prior entanglement. Our AQECC corrects a single error with probability 0.75 for symmetric error model, and probability 0.9988 for asymmetric error model. It also maintains CSS structure without sharing prior entanglement. Furthermore, the quantum cost of a circuit for this AQECC is 55.72% less than that for the 9-qutrit exact QECC. Overall, low qutrit count, low cost circuit realization with low depth and the ability to correct multiple phase errors make our proposed AQECC a suitable candidate for real life quantum channels.
This paper proposes simple quantum [[9],[1],[3]] error correction codes for quantum systems beyond qubits, focusing on quantum ternary digits (qutrits) that represent the simplest higher-dimensional systems for future quantum technologies. Although qutrit-based systems offer larger capacity information over 2-dimensional systems, the challenge of identifying commuting stabilizers for constructing error correction codes becomes more difficult as the dimensionality increases or when working with a large number of qutrits. We design qutrit codes based on the generalized Pauli group and investigate the underlying structure, including shift, phase, and rotation operators. We successfully create suitable stabilizer codes that detect and correct qutrit errors. Furthermore, we (i) identify operators in qutrit, which are selected from various matrix interpretations for higher-dimensional systems, (ii) propose stabilizers for 9-qutrit error correction codes, and (iii) design a new 9-qutrit quantum circuit for communications. Our study is expected to contribute a foundational basis for possible future theoretical and experimental advancements in quantum computing, communications, and code-based cryptography in higher dimensional systems.
Error correction is of utmost necessity for large-scale quantum computing. Quantum error correcting codes can be degenerate, if more than one type of error can map the input state to the same error state. In this paper, we propose a 6-qubit degenerate CSS code. We show that our proposed code can correct a single bit flip error, but arbitrarily many phase flip errors occurring on the codeword. Furthermore, it follows from a bound on CSS codes that the proposed code is the minimal binary CSS code which can encode a single qubit of information. We also perform a comparative study of the gate count required for a fault tolerant decomposition of the error correction circuit for the proposed code, with that for the existing 9-qubit, 7-qubit and 5-qubit binary QEC codes. Our results show, on an average over the different technologies a savings of 98.14% in the gate count for the proposed code over that for the 5-qubit code. Significant improvement of around 50% in gate count is also obtained when compared to those for the 9-qubit and 7-qubit codes.
A Qutrit [ ⁣[6,2,2] ⁣]3[\![ 6,2,2 ]\!]_{3}[[6,2,2]]3​ Quantum Error-Correcting Code with a Transversal Binary AND Gate
Quantum computation and error correction in higher dimensional systems offer a promising route to more efficient and robust codes and circuits, compared to qubits. In this work, we present a novel qutrit[ ⁣[6,2,2] ⁣]3[\![ 6,2,2 ]\!]_{3}[[6,2,2]]3​quantum error correcting code with a transversal implementation of the binary AND gate. The key insight in our approach is that we can interpret a symmetric T-depth one circuit decomposition — composed of a CX circuit,T\mathrm{T}TandT†\mathrm{T}^{\dagger}T†gates, followed by the CX circuit in reverse — as a distance 1 CSS code. We thereafter increase the code distance by augmenting the code circuit with additional stabilizers while preserving the “built-in” transversal logical binary AND. As a result, we can leverage qutrit Clifford+T circuit synthesis to combine the advantages of quantum error correction and qudits, and moreover protect against leakage errors to higher levels.