© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Physical Review A

Three-qubit quantum error-correction scheme for collective decoherence

Chui‐Ping Yang, Julio R. Gea-Banacloche

Published Jan 18, 2001• 32 citations

Abstract

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.

DOI: 10.1103/physreva.63.022311

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 quantum information encoded in decoherence-free states against exchange errors

Daniel A. Lidar, David F. Bacon, Julia Kempe +1 more

The exchange interaction between identical qubits in a quantum-information processor gives rise to unitary two-qubit errors. It is shown here that decoherence-free subspaces (DFSs) for collective decoherence undergo Pauli errors under exchange, which, however, do not take the decoherence-free states outside of the DFS. In order to protect DFSs against these errors it is sufficient to employ a recently proposed concatenated DFS quantum-error-correcting code scheme [D. A. Lidar, D. Bacon, and K.B. Whaley, Phys. Rev. Lett. 82, 4556 (1999)].

arXiv:quant-ph/9907096•Physical Review A•Apr 10, 2000•55 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

Recursive encoding and decoding of the noiseless subsystem and decoherence-free subspace

Chi-Kwong Li, Mikio Nakahara, Yiu‐Tung Poon +2 more

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number $n$ of physical qubits. A single logical qubit is encoded with $n=3$ and 4, while two and three logical qubits are encoded with $n=5$ and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

arXiv:1106.5210•Physical Review A•Oct 5, 2011•13 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

Efficient schemes for reducing imperfect collective decoherences

Won-Young Hwang, Hyukjae Lee, Doyeol Ahn +1 more

We propose schemes that are efficient when each pair of qubits undergoes some imperfect collective decoherence with different baths. In the proposed scheme, each pair of qubits is first encoded in a decoherence-free subspace composed of two qubits. Leakage out of the encoding space generated by the imperfection is reduced by the quantum Zeno effect. Phase errors in the encoded bits generated by the imperfection are reduced by concatenation of the decoherence-free subspace with either a three-qubit quantum error correcting code that corrects only phase errors or a two-qubit quantum error detecting code that detects only phase errors connected with the quantum Zeno effect again.

arXiv:quant-ph/0008050•Physical Review A•Nov 1, 2000•20 citations

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 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.

The exchange interaction between identical qubits in a quantum-information processor gives rise to unitary two-qubit errors. It is shown here that decoherence-free subspaces (DFSs) for collective decoherence undergo Pauli errors under exchange, which, however, do not take the decoherence-free states outside of the DFS. In order to protect DFSs against these errors it is sufficient to employ a recently proposed concatenated DFS quantum-error-correcting code scheme [D. A. Lidar, D. Bacon, and K.B. Whaley, Phys. Rev. Lett. 82, 4556 (1999)].

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.

When an environmental disturbance to a quantum system has a wavelength much larger than the system size, all qubits in the system are under the action of the same error operator. The noiseless subsystem and decoherence-free subspace are immune to such collective noise. We construct simple quantum circuits that implement these error-avoiding codes for a small number

n

of physical qubits. A single logical qubit is encoded with

n=3

and 4, while two and three logical qubits are encoded with

n=5

and 7, respectively. Recursive relations among subspaces employed in these codes play essential roles in our implementation.

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.

We propose schemes that are efficient when each pair of qubits undergoes some imperfect collective decoherence with different baths. In the proposed scheme, each pair of qubits is first encoded in a decoherence-free subspace composed of two qubits. Leakage out of the encoding space generated by the imperfection is reduced by the quantum Zeno effect. Phase errors in the encoded bits generated by the imperfection are reduced by concatenation of the decoherence-free subspace with either a three-qubit quantum error correcting code that corrects only phase errors or a two-qubit quantum error detecting code that detects only phase errors connected with the quantum Zeno effect again.