Table of Contents
Fetching ...

Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes

Cibele Cristina Trinca, Reginaldo Palazzo, J. Carmelo Interlando, Ricardo Augusto Watanabe, Clarice Dias de Albuquerque, Edson Donizete de Carvalho, Antonio Aparecido de Andrade

TL;DR

A generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes is introduced and can be applied for burst error correction in cases involving localized errors, quantum data storage and quantum channels with memory.

Abstract

Quantum error correction is essential for the development of any scalable quantum computer. In this work we introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes. We present new $n$-dimensional toric quantum codes, where $n\geq 5$, which are featured by lattice codes and apply the proposed quantum interleaving method to such new $n$-dimensional toric quantum codes. Through the application of this method to these novel $n$-dimensional toric quantum codes we derive new $n$-dimensional quantum burst-error-correcting codes. Consequently, $n$-dimensional toric quantum codes and burst-error-correcting quantum codes are provided offering both a good code rate and a significant coding gain when it comes to toric quantum codes. Another important consequence from the presented $n$-dimensional toric quantum codes is that if the Golomb and Welch conjecture in \cite{perfcodes} regarding the Lee sphere in $n$ dimensions for the respective close packings holds true, then it follows that these $n$-dimensional toric quantum codes are the only possible ones to be obtained from lattice codes. Moreover, such a methodology can be applied for burst error correction in cases involving localized errors, quantum data storage and quantum channels with memory.

Characterization of $n$-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes

TL;DR

A generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes is introduced and can be applied for burst error correction in cases involving localized errors, quantum data storage and quantum channels with memory.

Abstract

Quantum error correction is essential for the development of any scalable quantum computer. In this work we introduce a generalization of a quantum interleaving method for combating clusters of errors in toric quantum error-correcting codes. We present new -dimensional toric quantum codes, where , which are featured by lattice codes and apply the proposed quantum interleaving method to such new -dimensional toric quantum codes. Through the application of this method to these novel -dimensional toric quantum codes we derive new -dimensional quantum burst-error-correcting codes. Consequently, -dimensional toric quantum codes and burst-error-correcting quantum codes are provided offering both a good code rate and a significant coding gain when it comes to toric quantum codes. Another important consequence from the presented -dimensional toric quantum codes is that if the Golomb and Welch conjecture in \cite{perfcodes} regarding the Lee sphere in dimensions for the respective close packings holds true, then it follows that these -dimensional toric quantum codes are the only possible ones to be obtained from lattice codes. Moreover, such a methodology can be applied for burst error correction in cases involving localized errors, quantum data storage and quantum channels with memory.

Paper Structure

This paper contains 8 sections, 3 theorems, 8 equations, 2 figures, 2 tables.

Key Result

Theorem 1

The classical single-error-correcting code from the $q^{n}$ hypercubic lattice, where $q=2n+1$ and $n\geq 5$, can be characterized as a lattice code.

Figures (2)

  • Figure 1: Square lattice of the torus, from ClariceArtigo.
  • Figure 2: Representation of an storage system 34D.

Theorems & Definitions (6)

  • Theorem 1
  • proof
  • Theorem 2
  • proof
  • Theorem 3
  • proof