Five-qubit perfect code

Five-qubit perfect code[1]

Description

Five-qubit stabilizer code with generators that are symmetric under cyclic permutation of qubits, \begin{align} \begin{split} S_1 &= IXZZX \\ S_2 &= XZZXI \\ S_3 &= ZZXIX \\ S_4 &= ZXIXZ~. \end{split} \tag*{(1)}\end{align}

Protection

Smallest stabilizer code that protects against a single error on any one qubit. Detects two-qubit errors.

Encoding

Four CCZ, four Hadamard, and one \(Z\) gate ([2], Fig. 10.16).Four CNOT and five CPHASE gates [3].

Transversal Gates

Pauli gates are transversal, along with a non-Pauli Hadamard-phase gate \(SH\) and three-qubit Clifford operation \(M_3\) [4].

Gates

Pieceable fault-tolerant CZ, CNOT, and CCZ gates [5].

Decoding

Combined dynamical decoupling and error correction protocol on individually-controlled qubits with always-on Ising couplings [3].Symmetric decoder correcting all weight-one Pauli errors. The resulting logical error channel after coherent noise has been explicitly derived [6].

Fault Tolerance

Pieceable fault-tolerant CZ, CNOT, and CCZ gates [5].Syndrome measurement can be done with two ancillary flag qubits [7].

Realizations

NMR: Implementation of perfect error correcting code on 5 spin subsystem of labeled crotonic acid for quantum network benchmarking [8]. Single-qubit logical gates [9].Superconducting qubits [10].Trapped-ion qubits: non-transversal CNOT gate between two logical qubits, including rounds of correction and fault-tolerant primitives such as flag qubits and pieceable fault tolerance, on a 12-qubit device by Quantinuum [11].Nitrogen-vacancy centers in diamond: fault-tolerant single-qubit Clifford operations [12].

Parents

Stabilizer code over \(GF(4)\) — The five-qubit code is derived from the \([5,3,3]_4\) Hamming code.
Quantum maximum-distance-separable (MDS) code — The five-qubit code is one of the two qubit quantum MDS codes.
XZZX surface code — The five-qubit code is the smallest XZZX surface code [13; Ex. 11][14; Ex. 3].
Cyclic quantum code — The five-qubit code is the smallest known example of quantum cyclic code. The full automorphism group of the code is the dihedral group of order 10 [15].
Perfect quantum code — The five-qubit codes is the smallest perfect code.
Small-distance block quantum code

Cousins

Hamiltonian-based code — The five-qubit code Hamiltonian is local when expressed in terms of mutually commuting Majorana operators [16].
Majorana stabilizer code — The five-qubit code Hamiltonian is local when expressed in terms of mutually commuting Majorana operators [16].
Hexacode — Applying the stabilizer-over-\(GF(4)\) construction to the hexacode yields a \([[6,0,4]]\) quantum code [17] corresponding to the six-qubit perfect state. The five-qubit code can be obtained from this code by tracing out a qubit [18].
\(U(d)\)-covariant approximate erasure code — The five-qubit code can be used to construct an approximate code that is also covariant with respect to the unitary group.
Pastawski-Yoshida-Harlow-Preskill (HaPPY) code — The five-qubit encoding isometry tiles various holographic codes because its corresponding tensor is perfect [18].
\((5,1,2)\)-convolutional code — The \((5,1,2)\)-convolutional code is an infinite-qubit version of the five-qubit perfect code, with the former's lattice-translation symmetry being the extension of the latter's cyclic permutation symmetry.
Quantum divisible code — A fault-tolerant \(T\) gate on the five-qubit code can be obtained by concatenating with particular quantum divisible codes.
\([[4,2,2]]\) CSS code — \([[4,2,2]]\) can be derived from the five-qubit code using a protocol that converts an \([[n,k,d]]\) code into an \([[n-1, k+1, d-1]]\) code; see Sec. 3.5 in Gottesman [4].
\([[5,1,3]]_{\mathbb{Z}_q}\) modular-qudit code — The \([[5,1,3]]_{\mathbb{Z}_q}\) modular-qudit code reduces to the five-qubit perfect code for \(q=2\).
\([[5,1,3]]_q\) Galois-qudit code — The \([[5,1,3]]_q\) Galois-qudit code reduces to the five-qubit perfect code for \(q=2\).

References

[1]: R. Laflamme et al., “Perfect Quantum Error Correction Code”, (1996) arXiv:quant-ph/9602019
[2]: M. Nakahara, “Quantum Computing”, (2008) DOI
[3]: A. De and L. P. Pryadko, “Universal set of dynamically protected gates for bipartite qubit networks: Soft pulse implementation of the [[5,1,3]] quantum error-correcting code”, Physical Review A 93, (2016) arXiv:1509.01239 DOI
[4]: D. Gottesman, “Stabilizer Codes and Quantum Error Correction”, (1997) arXiv:quant-ph/9705052
[5]: T. J. Yoder, R. Takagi, and I. L. Chuang, “Universal Fault-Tolerant Gates on Concatenated Stabilizer Codes”, Physical Review X 6, (2016) arXiv:1603.03948 DOI
[6]: C. Liu, “Exact performance of the five-qubit code with coherent errors”, (2022) arXiv:2203.01706
[7]: R. Chao and B. W. Reichardt, “Quantum Error Correction with Only Two Extra Qubits”, Physical Review Letters 121, (2018) arXiv:1705.02329 DOI
[8]: E. Knill et al., “Benchmarking Quantum Computers: The Five-Qubit Error Correcting Code”, Physical Review Letters 86, 5811 (2001) arXiv:quant-ph/0101034 DOI
[9]: J. Zhang, R. Laflamme, and D. Suter, “Experimental Implementation of Encoded Logical Qubit Operations in a Perfect Quantum Error Correcting Code”, Physical Review Letters 109, (2012) arXiv:1208.4797 DOI
[10]: M. Gong et al., “Experimental exploration of five-qubit quantum error-correcting code with superconducting qubits”, National Science Review 9, (2021) arXiv:1907.04507 DOI
[11]: C. Ryan-Anderson et al., “Implementing Fault-tolerant Entangling Gates on the Five-qubit Code and the Color Code”, (2022) arXiv:2208.01863
[12]: M. H. Abobeih et al., “Fault-tolerant operation of a logical qubit in a diamond quantum processor”, Nature 606, 884 (2022) arXiv:2108.01646 DOI
[13]: A. A. Kovalev, I. Dumer, and L. P. Pryadko, “Design of additive quantum codes via the code-word-stabilized framework”, Physical Review A 84, (2011) arXiv:1108.5490 DOI
[14]: A. A. Kovalev and L. P. Pryadko, “Quantum Kronecker sum-product low-density parity-check codes with finite rate”, Physical Review A 88, (2013) arXiv:1212.6703 DOI
[15]: H. Hao, “Investigations on Automorphism Groups of Quantum Stabilizer Codes”, (2021) arXiv:2109.12735
[16]: Aleksander Kubica, private communication, 2019
[17]: A. J. Scott, “Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions”, Physical Review A 69, (2004) arXiv:quant-ph/0310137 DOI
[18]: F. Pastawski et al., “Holographic quantum error-correcting codes: toy models for the bulk/boundary correspondence”, Journal of High Energy Physics 2015, (2015) arXiv:1503.06237 DOI

Page edit log

Victor V. Albert (2022-08-10) — most recent
Aleksander Kubica (2022-03-14)
Victor V. Albert (2022-03-14)
Marianna Podzorova (2021-12-13)
Qingfeng (Kee) Wang (2021-12-07)

Cite as:

“Five-qubit perfect code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/stab_5_1_3

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/quantum/qubits/small_distance/small/stab_5_1_3.yml.