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:quant-ph/9610042 · Physical Review A

Codes for the quantum erasure channel

Markus Grassl, T. Beth, Thomas Pellizzari

Published Jul 1, 1997• 403 citations
arXivHTMLPDF

Abstract

The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i.e., arbitrary errors at known positions. We show that four quantum bits are necessary and sufficient to encode one quantum bit and correct one erasure, in contrast to five quantum bits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum Bose-Chaudhuri-Hocquenghem codes, that can be efficiently decoded is introduced.

DOI
10.1103/physreva.56.33

Related papers

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

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

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

A Code for Correcting Quantum Erasures

G. Santos, Francisco de Assis, Adriana Silva Lima

Quantum states are very delicate, so quantum error-correction procedures are believed to be essential for the successful implementation of quantum communications or computations.To erroneous qubits where the position is known, Grassl et al. [Phys.Rev. A 56, 33 (1997)] proposed an error model which they called quantum erasure channel.In this paper we present a quantum code capable of protecting nqubit of information against the occurrence of t erasures.This code is based on GHZ states.

International Telecommunications Symposium (ITS)•Jan 1, 2010•0 citations

Simulating the Effects of Quantum Error-correction Schemes

J. Niwa, Keiji Matsumoto, Imai, Hiroshi

It is important to protect quantum information against decoherence and operational errors, and quantum error-correcting (QEC) codes are the keys to solving this problem. Of course, just the existence of codes is not efficient. It is necessary to perform operations fault-tolerantly on encoded states because error-correction process (i.e., encoding, decoding, syndrome measurement and recovery) itself induces an error. By using simulation, this paper investigates the effects of some important QEC codes (the five qubit code, the seven qubit code and the nine qubit code) and their fault-tolerant operations when the error-correction process itself induces an error. The corresponding results, statistics and analyses are presented in this paper.

arXiv:quant-ph/0211071•Nov 13, 2002•10 citations

Fault-tolerant quantum architectures based on erasure qubits

Shouzhen Gu, Alex Retzker, Aleksander Kubica

The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We start by introducing a formalism for QEC schemes with erasure qubits and express the corresponding decoding problem as a matching problem. Then, we propose and optimize QEC schemes based on erasure qubits and the recently introduced Floquet codes. Our schemes are well suited for superconducting circuits, being compatible with planar layouts. We numerically estimate the memory thresholds for the circuit noise model that includes spreading (via entangling operations) and imperfect detection of erasures. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.

arXiv:2312.14060•Physical Review Research•Mar 6, 2025•28 citations
The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i.e., arbitrary errors at known positions. We show that four quantum bits are necessary and sufficient to encode one quantum bit and correct one erasure, in contrast to five quantum bits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum Bose-Chaudhuri-Hocquenghem codes, that can be efficiently decoded is introduced.
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.
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.
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.
It is important to protect quantum information against decoherence and operational errors, and quantum error-correcting (QEC) codes are the keys to solving this problem. Of course, just the existence of codes is not efficient. It is necessary to perform operations fault-tolerantly on encoded states because error-correction process (i.e., encoding, decoding, syndrome measurement and recovery) itself induces an error. By using simulation, this paper investigates the effects of some important QEC codes (the five qubit code, the seven qubit code and the nine qubit code) and their fault-tolerant operations when the error-correction process itself induces an error. The corresponding results, statistics and analyses are presented in this paper.
The overhead of quantum error correction (QEC) poses a major bottleneck for realizing fault-tolerant computation. To reduce this overhead, we exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We start by introducing a formalism for QEC schemes with erasure qubits and express the corresponding decoding problem as a matching problem. Then, we propose and optimize QEC schemes based on erasure qubits and the recently introduced Floquet codes. Our schemes are well suited for superconducting circuits, being compatible with planar layouts. We numerically estimate the memory thresholds for the circuit noise model that includes spreading (via entangling operations) and imperfect detection of erasures. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.