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

理论物理通讯：英文版

Unitary Application of the Quantum Error Correction Codes

游波, 许可, 吴小华

Published Sep 15, 2012• 0 citations
OpenAlex

Abstract

For applying the perfect code to transmit quantum information over a noise channel,the standard protocol contains four steps:the encoding,the noise channel,the error-correction operation,and the decoding.In present work,we show that this protocol can be simplified.The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation.We also offer a quantum circuit,which can correct the arbitrary single-qubit errors.

Related papers

Unitary Application of the Quantum Error Correction Codes

Bo You, Ke Xu, Xiaohua Wu

For applying the perfect code to transmit quantum information over a noise channel, the standard protocol contains four steps: the encoding, the noise channel, the error-correction operation, and the decoding. In present work, we show that this protocol can be simplified. The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation. We also offer a quantum circuit, which can correct the arbitrary single-qubit errors.

Communications in Theoretical Physics•Sep 1, 2012•4 citations

Unitary application of the quantum error correction codes

Xoaohua Wu, Bo You

From the set of operators for errors and its correction code, we introduce the so-called complete unitary transformation. It can be used for encoding while the inverse of it can be applied for correcting the errors of the encoded qubit. We show that this unitary protocol can be applied for any code which satisfies the quantum error correction condition.

arXiv:1106.4878•Jun 24, 2011•0 citations

Perfect Quantum Error Correcting 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. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state $|0〉$ to the encoded state. It can also be converted into a decoder by running it backward. The original state of the encoded qubit can then be restored by a simple unitary transformation.

Physical Review Letters•Jul 1, 1996•963 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

Analytical technique for simplification of the encoder–decoder circuit for a perfect five-qubit error correction

Jin-Yuan Hsieh, Che-Ming Li, Der-San Chuu

Simpler encoding and decoding networks are necessary for more reliable quantum error-correcting codes (QECCs). The simplification of the encoder–decoder circuit for a perfect five-qubit QECC can be derived analytically if the QECC is converted from its equivalent one-way entanglement purification protocol. In this work, the analytical method to simplify the encoder–decoder circuit is introduced and a circuit that is as simple as the existing simplest circuits is presented as an example. The encoder–decoder circuit presented here involves nine single- and two-qubit unitary operations, only six of which are controlled-NOT gates.

arXiv:quant-ph/0410004•New Journal of Physics•May 30, 2006•2 citations

Fault-Tolerant Quantum Input/Output

Matthias Christandl, Omar Fawzi, Ashutosh Goswami

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor’s algorithm for factoring. In particular, this means that input and output to the quantum algorithm are classical. In contrast to stand-alone single-core quantum computers, in many distributed scenarios, quantum information might have to be passed on from one quantum information processing system to another one, possibly via noisy quantum communication channels with noise levels above fault-tolerant thresholds. In such situations, quantum information processing devices will have quantum inputs, quantum outputs or even both, which pass qubits among each other. Working in the fault-tolerant framework of [Kitaev, 1997], we show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit that produces the ideal circuit with some controlled noise applied at the input and output. The framework allows the direct composition of the statements, enabling versatile future applications. We illustrate this with a concrete application, namely, communication over a noisy channel with faulty encoding and decoding operations [Christandl and Müller-Hermes, 2024]. For communication codes with linear minimum distance, we construct fault-tolerant encoders and decoders for general noise (including coherent errors). For the weaker, but standard model of local stochastic noise, we obtain fault-tolerant encoders and decoders for any communication code that can correct a constant fraction of random errors.

IEEE Transactions on Information Theory•Mar 10, 2026•0 citations
For applying the perfect code to transmit quantum information over a noise channel,the standard protocol contains four steps:the encoding,the noise channel,the error-correction operation,and the decoding.In present work,we show that this protocol can be simplified.The error-correction operation is not necessary if the decoding is realized by the so-called complete unitary transformation.We also offer a quantum circuit,which can correct the arbitrary single-qubit errors.
We present a quantum error correction code which protects a qubit of information against general one qubit errors. To accomplish this, we encode the original state by distributing quantum information over five qubits, the minimal number required for this task. We describe a circuit which takes the initial state with four extra qubits in the state ∣0〉|0〉∣0〉 to the encoded state. It can also be converted into a decoder by running it backward. The original state of the encoded qubit can then be restored by a simple unitary transformation.
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.
Simpler encoding and decoding networks are necessary for more reliable quantum error-correcting codes (QECCs). The simplification of the encoder–decoder circuit for a perfect five-qubit QECC can be derived analytically if the QECC is converted from its equivalent one-way entanglement purification protocol. In this work, the analytical method to simplify the encoder–decoder circuit is introduced and a circuit that is as simple as the existing simplest circuits is presented as an example. The encoder–decoder circuit presented here involves nine single- and two-qubit unitary operations, only six of which are controlled-NOT gates.
Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor’s algorithm for factoring. In particular, this means that input and output to the quantum algorithm are classical. In contrast to stand-alone single-core quantum computers, in many distributed scenarios, quantum information might have to be passed on from one quantum information processing system to another one, possibly via noisy quantum communication channels with noise levels above fault-tolerant thresholds. In such situations, quantum information processing devices will have quantum inputs, quantum outputs or even both, which pass qubits among each other. Working in the fault-tolerant framework of [Kitaev, 1997], we show that any quantum circuit with quantum input and output can be transformed into a fault-tolerant circuit that produces the ideal circuit with some controlled noise applied at the input and output. The framework allows the direct composition of the statements, enabling versatile future applications. We illustrate this with a concrete application, namely, communication over a noisy channel with faulty encoding and decoding operations [Christandl and Müller-Hermes, 2024]. For communication codes with linear minimum distance, we construct fault-tolerant encoders and decoders for general noise (including coherent errors). For the weaker, but standard model of local stochastic noise, we obtain fault-tolerant encoders and decoders for any communication code that can correct a constant fraction of random errors.