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:1908.07229

Minimal degenerate CSS quantum code with low cost circuit

Ritajit Majumdar, Susmita Sur‐Kolay

Published Aug 20, 2019• 1 citation
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1908.07229

Related papers

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

Exploiting degeneracy to construct good ternary quantum error correcting code

Ritajit Majumdar, Susmita Sur‐Kolay

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.

arXiv:2008.00713•Aug 3, 2020•1 citation

A Comprehensive Overview of the Steane Code [[7,1,3]] CSS Quantum Error Correction Scheme

Neeraj Kumar, Arpit Anand, Aijaz Mehdi Zaidi +2 more

Since quantum states are limited in their ease of manipulation, quantum computing has great advantages when used for computation. These interactions, even if infinitesimal, are the very reason why errors arise, be it bit-flip, phase-flip, or composite, thus diminishing the accuracy in computation. Quantum error correction (QEC) intervenes systematically to guard against the loss of coherence from quantum information. Amongst the various QEC protocols developed so far, Steane code [ [7], [1], [3]] is a very famous CSS stabilizer code that was derived from a classical Hamming code. It will encode a single logical qubit into seven physical qubits, which corrects all single-qubit errors by separating X and Z syndrome measurements. The Steane code enables the implementation of transversal Clifford gates, making it an ideal playground to study fault-tolerant quantum computation. Although surface codes remain the codes of choice for scaling implementations, the Steane code will forever remain one of the cornerstone codes due to its clear structure of error correction and ease in teaching.

International Conference on Intelligent Processing, Hardware, Electronics, and Radio Systems (CIPHER)•Feb 13, 2026•0 citations

Implementation of Fault-Tolerant Encoding Circuit Based on Stabilizer Implementation and “Flag” Bits in Steane Code

Dongxiao Quan, Chensong Liu, Xiaojie Lv +1 more

Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.

Entropy•Aug 11, 2022•8 citations

Quantum error correction

E. Desurvire

This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

Modular fault-tolerant quantum computing on a non-CSS code

Robert Freund, Friederike Butt, César Benito +6 more

Modularization promises to break down the design and implementation complexity of large scale quantum processors into smaller manageable subtasks. In this approach, quantum channels, realized for instance through physical rerouting of qubits or quantum teleportation, connect multiple modules. Each of those modules hosts a subset of qubits, e.g. multiple logical qubits, and provides quantum operations on them. In this work, we implement for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect $[[5, 1, 3]]$ code, on a trapped-ion quantum computer. This code is the smallest quantum error-correcting (QEC) code capable of correcting any single-qubit error, making it a compact alternative to larger CSS codes. We demonstrate logical state teleportation and a full suite of fault-tolerant operations required for universal logical control, including logical state preparation, QEC with real-time feedback, logical measurements, magic-state preparation, logical entangling operations, and magic-state injection. Moreover, we characterize the logical spectator error picked up by idling logical qubits during quantum operations on distinct qubit registers and demonstrate a logical Pauli quantum process tomography that minimizes required sampling resources for logical tomography.

quant-pharXiv:2609.22572•Sep 22, 2026•0 citations
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.
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.
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.
Since quantum states are limited in their ease of manipulation, quantum computing has great advantages when used for computation. These interactions, even if infinitesimal, are the very reason why errors arise, be it bit-flip, phase-flip, or composite, thus diminishing the accuracy in computation. Quantum error correction (QEC) intervenes systematically to guard against the loss of coherence from quantum information. Amongst the various QEC protocols developed so far, Steane code [ [7], [1], [3]] is a very famous CSS stabilizer code that was derived from a classical Hamming code. It will encode a single logical qubit into seven physical qubits, which corrects all single-qubit errors by separating X and Z syndrome measurements. The Steane code enables the implementation of transversal Clifford gates, making it an ideal playground to study fault-tolerant quantum computation. Although surface codes remain the codes of choice for scaling implementations, the Steane code will forever remain one of the cornerstone codes due to its clear structure of error correction and ease in teaching.
Quantum error correction (QEC) is an effective way to overcome quantum noise and de-coherence, meanwhile the fault tolerance of the encoding circuit, syndrome measurement circuit, and logical gate realization circuit must be ensured so as to achieve reliable quantum computing. Steane code is one of the most famous codes, proposed in 1996, however, the classical encoding circuit based on stabilizer implementation is not fault-tolerant. In this paper, we propose a method to design a fault-tolerant encoding circuit for Calderbank-Shor-Steane (CSS) code based on stabilizer implementation and “flag” bits. We use the Steane code as an example to depict in detail the fault-tolerant encoding circuit design process including the logical operation implementation, the stabilizer implementation, and the “flag” qubits design. The simulation results show that assuming only one quantum gate will be wrong with a certain probability p, the classical encoding circuit will have logic errors proportional to p; our proposed circuit is fault-tolerant as with the help of the “flag” bits, all types of errors in the encoding process can be accurately and uniquely determined, the errors can be fixed. If all the gates will be wrong with a certain probability p, which is the actual situation, the proposed encoding circuit will also be wrong with a certain probability, but its error rate has been reduced greatly from p to p2 compared with the original circuit. This encoding circuit design process can be extended to other CSS codes to improve the correctness of the encoding circuit.
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
Modularization promises to break down the design and implementation complexity of large scale quantum processors into smaller manageable subtasks. In this approach, quantum channels, realized for instance through physical rerouting of qubits or quantum teleportation, connect multiple modules. Each of those modules hosts a subset of qubits, e.g. multiple logical qubits, and provides quantum operations on them. In this work, we implement for the first time all logical operations required for modular fault-tolerant universal quantum computing with a non-Calderbank-Shor-Steane (CSS) code, the perfect [[5,1,3]][[5, 1, 3]][[5,1,3]] code, on a trapped-ion quantum computer. This code is the smallest quantum error-correcting (QEC) code capable of correcting any single-qubit error, making it a compact alternative to larger CSS codes. We demonstrate logical state teleportation and a full suite of fault-tolerant operations required for universal logical control, including logical state preparation, QEC with real-time feedback, logical measurements, magic-state preparation, logical entangling operations, and magic-state injection. Moreover, we characterize the logical spectator error picked up by idling logical qubits during quantum operations on distinct qubit registers and demonstrate a logical Pauli quantum process tomography that minimizes required sampling resources for logical tomography.