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

Journal of Experimental and Theoretical Physics Letters

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

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

Published Mar 1, 2004• 4 citations
Publisher

Abstract

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.

DOI
10.1134/1.1753423

Related papers

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

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

Three-qubit quantum error-correction scheme for collective decoherence

Chui‐Ping Yang, Julio R. Gea-Banacloche

We show a way to correct collective error through a three-qubit quantum code. The encoding and decoding (i.e., error recovery) operations for such a code, which protects one qubit of quantum information perfectly (with infinite ``distance'') against collective decoherence, are presented. The code is actually a manifestation of a noiseless subsystem first reported by Knill, Laflamme, and Viola [Phys. Rev. Lett. 84, 2525 (2000)], and provides a good illustration of the relationship between noiseless subsystems and error-correcting codes already noted by these authors. We also show in detail how this code can be used to preserve an arbitrary joint state (including entangled states) of two qubits, by pairing each of them with two other qubits, even in the case in which the two resulting clusters interact in nonequivalent ways with a common environment.

Physical Review A•Jan 18, 2001•32 citations

Perfect Quantum Error Correction Code

Raymond Laflamme, César Miquel, Juan Pablo Paz +1 more

We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We give a simple circuit which takes the initial state with four extra qubits in the state |0> to the encoded state. The circuit can be converted into a decoding one by simply running it backward. Reading the extra four qubits at the decoder's output we learn which one of the sixteen alternatives (no error plus all fifteen possible 1-bit errors) was realized. The original state of the encoded qubit can then be restored by a simple unitary transformation.

arXiv:quant-ph/9602019•Feb 27, 1996•34 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

Codes for the quantum erasure channel

Markus Grassl, T. Beth, Thomas Pellizzari

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.

arXiv:quant-ph/9610042•Physical Review A•Jul 1, 1997•374 citations
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.
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 show a way to correct collective error through a three-qubit quantum code. The encoding and decoding (i.e., error recovery) operations for such a code, which protects one qubit of quantum information perfectly (with infinite ``distance'') against collective decoherence, are presented. The code is actually a manifestation of a noiseless subsystem first reported by Knill, Laflamme, and Viola [Phys. Rev. Lett. 84, 2525 (2000)], and provides a good illustration of the relationship between noiseless subsystems and error-correcting codes already noted by these authors. We also show in detail how this code can be used to preserve an arbitrary joint state (including entangled states) of two qubits, by pairing each of them with two other qubits, even in the case in which the two resulting clusters interact in nonequivalent ways with a common environment.
We present a quantum error correction code which protects a qubit of information against general one qubit errors which maybe caused by the interaction with the environment. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We give a simple circuit which takes the initial state with four extra qubits in the state |0> to the encoded state. The circuit can be converted into a decoding one by simply running it backward. Reading the extra four qubits at the decoder's output we learn which one of the sixteen alternatives (no error plus all fifteen possible 1-bit errors) was realized. The original state of the encoded qubit can then be restored by a simple unitary transformation.