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.
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.
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.
The smallest quantum code that can correct all one-qubit errors is based on five qubits. We experimentally implemented the encoding, decoding, and error-correction quantum networks using nuclear magnetic resonance on a five spin subsystem of labeled crotonic acid. The ability to correct each error was verified by tomography of the process. The use of error correction for benchmarking quantum networks is discussed, and we infer that the fidelity achieved in our experiment is sufficient for preserving entanglement.