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

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)

A short and efficient quantum-erasure code for polarization-coded photonic qubits

Jonas Almlöf, Gunnar G. Bjork

Published Jun 1, 2009• 1 citation
Publisher

Abstract

Quantum- error-correcting code can be used to combat qubit errors originating from unwanted but unavoidable interaction with the quantum channel. A code that will protect a logical qubit from any single bit flip, phase flip, or combination of both is called a Pauli code. It has been shown that the shortest such code codes a logical qubit onto five physical qubits.

DOI
10.1109/cleoe-eqec.2009.5191786

Related papers

A small error-correction code for protecting three-qubit quantum information

Chui‐Ping Yang, Shih‐I Chu, Siyuan Han

We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. The present code has a high encoding efficiency, since only one auxiliary qubit is needed for one message qubit on average. In addition, we note that the code can also work even in a worse case that the interaction with the environment causes a leakage out of the qubit space. The code may have some applications in the storage of quantum information for small-scale quantum computing, quantum information processing, and quantum communication.

Journal of Experimental and Theoretical Physics Letters•Mar 1, 2004•4 citations

Error correction code for protecting three-qubit quantum information against erasures

Chui‐Ping Yang, Shih‐I Chu, Siyuan Han

We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by distributing quantum information over six qubits which is the minimal number for the present task (see reference [1]). The encoding and error recovery operations for such a code are presented. It is noted that the present code is also a three-qubit quantum hidded information code over each qubit. In addition, an encoding scheme for hiding $n$-qubit quantum information over each qubit is proposed.

arXiv:quant-ph/0112141•Dec 21, 2001•0 citations

Detecting bit-flip errors in a logical qubit using stabilizer measurements

Diego Ristè, Stefano Poletto, Meng-Zi Huang +4 more

Quantum data are susceptible to decoherence induced by the environment and to errors in the hardware processing it. A future fault-tolerant quantum computer will use quantum error correction to actively protect against both. In the smallest error correction codes, the information in one logical qubit is encoded in a two-dimensional subspace of a larger Hilbert space of multiple physical qubits. For each code, a set of non-demolition multi-qubit measurements, termed stabilizers, can discretize and signal physical qubit errors without collapsing the encoded information. Here using a five-qubit superconducting processor, we realize the two parity measurements comprising the stabilizers of the three-qubit repetition code protecting one logical qubit from physical bit-flip errors. While increased physical qubit coherence times and shorter quantum error correction blocks are required to actively safeguard the quantum information, this demonstration is a critical step towards larger codes based on multiple parity measurements.

arXiv:1411.5542•Nature Communications•Apr 29, 2015•265 citations

Protecting three-qubit quantum information against erasures through an efficient quantum error correction code

Chui‐Ping Yang, Shih‐I Chu, Siyuan Han

We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by distributing quantum information over six qubits. The encoding and error recovery operations for such a code are presented. We also show that the present code is a three-qubit quantum hidded information code over each qubit. In addition, hiding $n$-qubit quantum information over each qubit is considered.

•Dec 21, 2001•0 citations

Scaling Up Bit-Flip Quantum Error Correction

Farhan Feroz, A. B. M. Alim Al Islam

Quantum error correction comes from the marriage of quantum mechanics with the theory of error-correcting codes, which is still at the rudimentary stage tackling only 1 qubit to date. As, unlike the classical world, the extent of error in the quantum world is substantially high and unavoidable, scaling up the quantum error correction from 1 qubit to higher is of utmost significane. Therefore, to achive the scaling up, we present a general quantum error correction code that can be adapted for any number of quantum errors (bit-flip error to be specific in our case). This generalized code for bit-flip error correction realizes a delicate blending of using controlled-NOT gates with the notion of quantum entanglement. We augment the blending with majority voting in the final stage of the error correction. We demonstrate efficacy of our proposed error correction code through real experimentation in IBM Qiskit. Our experimental results up to 3-qubit bit-flip errors in the available Qiskit infrastructure confirm a total escape from errors using our proposed error correction code.

International Conference on Networking, Systems and Security (NSysS)•Dec 22, 2020•12 citations

Qubit Error Correction in Quantum Computing Simulations: Do Larger Repetition Codes Reduce Logical Errors?

Sanjeev Tamilselvan, Tanuj Ranjith

Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.

•Jun 12, 2026•0 citations
Quantum- error-correcting code can be used to combat qubit errors originating from unwanted but unavoidable interaction with the quantum channel. A code that will protect a logical qubit from any single bit flip, phase flip, or combination of both is called a Pauli code. It has been shown that the shortest such code codes a logical qubit onto five physical qubits.
We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. The present code has a high encoding efficiency, since only one auxiliary qubit is needed for one message qubit on average. In addition, we note that the code can also work even in a worse case that the interaction with the environment causes a leakage out of the qubit space. The code may have some applications in the storage of quantum information for small-scale quantum computing, quantum information processing, and quantum communication.
We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by distributing quantum information over six qubits which is the minimal number for the present task (see reference [1]). The encoding and error recovery operations for such a code are presented. It is noted that the present code is also a three-qubit quantum hidded information code over each qubit. In addition, an encoding scheme for hiding nnn-qubit quantum information over each qubit is proposed.
Quantum data are susceptible to decoherence induced by the environment and to errors in the hardware processing it. A future fault-tolerant quantum computer will use quantum error correction to actively protect against both. In the smallest error correction codes, the information in one logical qubit is encoded in a two-dimensional subspace of a larger Hilbert space of multiple physical qubits. For each code, a set of non-demolition multi-qubit measurements, termed stabilizers, can discretize and signal physical qubit errors without collapsing the encoded information. Here using a five-qubit superconducting processor, we realize the two parity measurements comprising the stabilizers of the three-qubit repetition code protecting one logical qubit from physical bit-flip errors. While increased physical qubit coherence times and shorter quantum error correction blocks are required to actively safeguard the quantum information, this demonstration is a critical step towards larger codes based on multiple parity measurements.
We present a quantum error correction code which protects three quantum bits (qubits) of quantum information against one erasure, i.e., a single-qubit arbitrary error at a known position. To accomplish this, we encode the original state by distributing quantum information over six qubits. The encoding and error recovery operations for such a code are presented. We also show that the present code is a three-qubit quantum hidded information code over each qubit. In addition, hiding nnn-qubit quantum information over each qubit is considered.
Quantum error correction comes from the marriage of quantum mechanics with the theory of error-correcting codes, which is still at the rudimentary stage tackling only 1 qubit to date. As, unlike the classical world, the extent of error in the quantum world is substantially high and unavoidable, scaling up the quantum error correction from 1 qubit to higher is of utmost significane. Therefore, to achive the scaling up, we present a general quantum error correction code that can be adapted for any number of quantum errors (bit-flip error to be specific in our case). This generalized code for bit-flip error correction realizes a delicate blending of using controlled-NOT gates with the notion of quantum entanglement. We augment the blending with majority voting in the final stage of the error correction. We demonstrate efficacy of our proposed error correction code through real experimentation in IBM Qiskit. Our experimental results up to 3-qubit bit-flip errors in the available Qiskit infrastructure confirm a total escape from errors using our proposed error correction code.
Abstract Quantum computers are powerful tools for certain computational problems, but their fragile quantum states are easily disrupted by environmental noise, causing errors that degrade computational accuracy. Quantum error correction (QEC) addresses this challenge by encoding one logical qubit across multiple physical qubits, so that individual errors can be identified and reversed through redundancy. We used Qiskit Aer, a free open-source quantum circuit simulator, to test the repetition code, one of the simplest QEC methods, under three types of noise: bit-flip, phase-flip, and depolarizing. We compared an unprotected single-qubit baseline (n = 1) to 3-qubit (n = 3) and 5-qubit (n = 5) repetition codes, sweeping the physical error rate p from 0 to 0.15 with 4,000 simulation shots per data point. We hypothesized that larger codes would achieve higher logical success probabilities at all tested noise levels, with n = 5 outperforming n = 3, which would outperform the unprotected baseline. Our results confirmed this scaling trend across all three noise types. At p = 0.10 under bit-flip noise, the baseline achieved 0.713 logical success, while n = 3 reached 0.791 and n = 5 reached 0.843. At low noise (p = 0.02), the n = 5 code approached 0.994 logical success. Simulation results closely matched exact theoretical predictions derived from the binomial failure probability formula, validating our experimental implementation. These findings confirm that even the simplest QEC methods provide meaningful error reduction and that larger codes offer greater protection, demonstrating a foundational principle of quantum error correction using only free simulation tools.