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/9702033 · Physical Review A

Five quantum register error correction code for higher spin systems

H. F. Chau

Published Jul 1, 1997• 47 citations
arXivHTMLPDF

Abstract

I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each $N$-state quantum particle is encoded as five $N$-state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is shown to be optimal for higher spin systems. I also report a simple algorithm for encoding. The importance of multiplicative group character in constructing QECCs will be addressed.

DOI
10.1103/physreva.56.r1

Related papers

Correcting quantum errors in higher spin systems

H. F. Chau

I consider the theory of the quantum error correcting code (QECC), where each quantum particle has more than two possible eigenstates. In this higher spin system, I report an explicit QECC that is related to the symmetry group ${\mathrm{Z}}_{2}^{\ensuremath{\bigotimes}(\mathrm{N}\mathrm{\ensuremath{-}}1)}$\ensuremath{\bigotimes}${\mathrm{S}}_{\mathrm{N}}$. This QECC, which generalizes Shor's simple majority vote code [Phys. Rev. A 52, 2493 (1995)], is able to correct errors arising from exactly one quantum particle. I also provide a simple encoding algorithm.

arXiv:quant-ph/9610023•Physical Review A•Feb 1, 1997•40 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.

arXiv:quant-ph/9602019•Physical Review Letters•Jul 1, 1996•1,028 citations

Versatility in quantum error correcting code of encodingone qubit in five qubits

Li-zhen Jiang

Based on the group theoretic framework of investigating quantum error correcting code, we found out at least 192 different forms of quantum error correcting codes for encoding one qubit in five qubits.

Journal of China Institute of Metrology•Jan 1, 2002•0 citations

Implementation of standard quantum error-correction codes for solid-state qubits

Tetsufumi Tanamoto

In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators ${G}_{i}\phantom{\rule{0.28em}{0ex}}(i=1,2,...)$ consist of multiples of Pauli matrices and perform encoding, decoding, and measurement. In order to maintain encoding states, the stabilizer Hamiltonian ${H}_{\mathrm{stab}}=\ensuremath{-}{\ensuremath{\sum}}_{i}{G}_{i}$ is suitable because its ground state corresponds to the code space. On the other hand, Hamiltonians of most solid-state qubits have two-body interactions and show their own dynamics. In addition solid-state qubits are fixed on substrate and qubit-qubit operation is restricted in their neighborhood. The main purpose of this paper is to show how to directly generate the stabilizer Hamiltonian ${H}_{\mathrm{stab}}$ from conventional two-body Hamiltonians with Ising interaction and $XY$ interaction by applying a pulse control method such as an NMR technique. We show that generation times of ${H}_{\mathrm{stab}}$ for nine-qubit code, five-qubit code, and Steane code are estimated to be less than 300 ns when typical experimental data of superconducting qubits are used, and sufficient pulse control is assumed. We also show how to prepare encoded states from an initial state $|0,...,0\ensuremath{\rangle}$. In addition, we discuss an appropriate arrangement of two- or three-dimensional arrayed qubits.

arXiv:1307.6970•Physical Review A•Dec 26, 2013•7 citations

Adaptive quantum codes: constructions, applications and fault tolerance

Akshaya Jayashankar

A major obstacle towards realizing a practical quantum computer is the noise that arises due to system-environment interactions. While it is very well known that quantum error correction (QEC) provides a way to protect against errors that arise due to the noise affecting the system, a perfect quantum code requires atleast five physical qubits to observe a noticeable improvement over the no-QEC scenario. However, in cases where the noise structure in the system is already known, it might be more useful to consider quantum codes that are adapted to specific noise models. It is already known in the literature that such codes are resource efficient and perform on par with the standard codes. In this spirit, we address the following questions concerning such adaptive quantum codes in this thesis. (a) Construction: Given a noise model, we propose a simple and fast numerical optimization algorithm to search for good quantum codes. (b) Application: As a simple application of noise-adapted codes, we propose an adaptive QEC protocol that allows transmission of quantum information from one site to the other over a 1-d spin chain with high fidelity. (c) Fault-tolerance: Finally, we address the question of whether such noise-adapted QEC protocols can be made fault-tolerant starting with a [[4,1]] code and obtain a rigorous lower bound on threshold.

arXiv:2203.03247•Mar 7, 2022•2 citations

A Nonadditive Quantum Code

Eric M. Rains, Ronald H. Hardin, Peter W. Shor +1 more

Every good quantum error-correcting code discovered thus far, such as those known as ``stabilizer'' or ``additive'' codes, has had the structure of an eigenspace of an Abelian group generated by tensor products of Pauli matrices. In this Letter we present the first example of a code that is better than any code of this type. It encodes six states in five qubits and can correct the erasure of any single qubit.

arXiv:quant-ph/9703002•Physical Review Letters•Aug 4, 1997•113 citations
I construct a quantum error correction code (QECC) in higher spin systems using the idea of multiplicative group character. Each NNN-state quantum particle is encoded as five NNN-state quantum registers. By doing so, this code can correct any quantum error arising from any one of the five quantum registers. This code generalizes the well-known five qubit perfect code in spin-1/2 systems and is shown to be optimal for higher spin systems. I also report a simple algorithm for encoding. The importance of multiplicative group character in constructing QECCs will be addressed.
I consider the theory of the quantum error correcting code (QECC), where each quantum particle has more than two possible eigenstates. In this higher spin system, I report an explicit QECC that is related to the symmetry group ${\mathrm{Z}}_{2}^{\ensuremath{\bigotimes}(\mathrm{N}\mathrm{\ensuremath{-}}1)}$\ensuremath{\bigotimes}SN{\mathrm{S}}_{\mathrm{N}}SN​. This QECC, which generalizes Shor's simple majority vote code [Phys. Rev. A 52, 2493 (1995)], is able to correct errors arising from exactly one quantum particle. I also provide a simple encoding algorithm.
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.
In quantum error-correcting code (QECC), many quantum operations and measurements are necessary to correct errors in logical qubits. In the stabilizer formalism, which is widely used in QECC, generators Gi(i=1,2,...){G}_{i}\phantom{\rule{0.28em}{0ex}}(i=1,2,...)Gi​(i=1,2,...) consist of multiples of Pauli matrices and perform encoding, decoding, and measurement. In order to maintain encoding states, the stabilizer Hamiltonian ${H}_{\mathrm{stab}}=\ensuremath{-}{\ensuremath{\sum}}_{i}{G}_{i}$ is suitable because its ground state corresponds to the code space. On the other hand, Hamiltonians of most solid-state qubits have two-body interactions and show their own dynamics. In addition solid-state qubits are fixed on substrate and qubit-qubit operation is restricted in their neighborhood. The main purpose of this paper is to show how to directly generate the stabilizer Hamiltonian Hstab{H}_{\mathrm{stab}}Hstab​ from conventional two-body Hamiltonians with Ising interaction and XYXYXY interaction by applying a pulse control method such as an NMR technique. We show that generation times of Hstab{H}_{\mathrm{stab}}Hstab​ for nine-qubit code, five-qubit code, and Steane code are estimated to be less than 300 ns when typical experimental data of superconducting qubits are used, and sufficient pulse control is assumed. We also show how to prepare encoded states from an initial state $|0,...,0\ensuremath{\rangle}$. In addition, we discuss an appropriate arrangement of two- or three-dimensional arrayed qubits.
A major obstacle towards realizing a practical quantum computer is the noise that arises due to system-environment interactions. While it is very well known that quantum error correction (QEC) provides a way to protect against errors that arise due to the noise affecting the system, a perfect quantum code requires atleast five physical qubits to observe a noticeable improvement over the no-QEC scenario. However, in cases where the noise structure in the system is already known, it might be more useful to consider quantum codes that are adapted to specific noise models. It is already known in the literature that such codes are resource efficient and perform on par with the standard codes. In this spirit, we address the following questions concerning such adaptive quantum codes in this thesis. (a) Construction: Given a noise model, we propose a simple and fast numerical optimization algorithm to search for good quantum codes. (b) Application: As a simple application of noise-adapted codes, we propose an adaptive QEC protocol that allows transmission of quantum information from one site to the other over a 1-d spin chain with high fidelity. (c) Fault-tolerance: Finally, we address the question of whether such noise-adapted QEC protocols can be made fault-tolerant starting with a [[4,1]] code and obtain a rigorous lower bound on threshold.