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:2410.20233

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

Published Oct 26, 2024• 0 citations
arXivHTMLPDF

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.

DOI
10.48550/arxiv.2410.20233

Related papers

New Quantum Burst-Error Correcting Codes from Interleaving Technique

Cibele Cristina Trinca, Clarice Dias de Albuquerque, Reginaldo Palazzo +3 more

Quantum memory is essential for the development of many devices in quantum information processing, including a synchronization tool that can match the various processes in a quantum computer, a quantum gate that maintains the identity of any state, and a mechanism for converting predetermined photons into on-demand photons. Quantum memory can be used in many aspects, such as quantum computing and quantum communication. Continuous research and experiments have enabled quantum memory to realize the storage of qubits. On the other hand, interleaving techniques are used to deal with burst of errors. Many works from literature provide effective interleaving techniques for combating burst of errors by using classical error-correcting codes. However, to the best of our knowledge, little is known regarding interleaving techniques for combating cluster of errors in topological quantum error-correcting codes. Thenceforward, it is proposed in this work a new interleaving technique by using good toric quantum codes, namely Bombin and Martin-Delgado toric codes and another class of toric codes from literature which is described in this work. As a consequence, by applying this new interleaving method to such toric quantum codes, new quantum burst-error correcting codes are obtained which improve the coding gain. In addition to the proposed quantum interleaving technique improves such parameter, it can be used for burst-error correction in errors which are located, quantum data stored and quantum channels with memory.

Globecom•Dec 4, 2022•4 citations

Analysis of Quantum Error-Correcting Codes: Symplectic Lattice Codes and Toric Codes

James William Harrington

Quantum information theory is concerned with identifying how quantum mechanical resources, such as entangled quantum states, can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g., factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system, such as a mode of light, can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under realistic error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in particular condensed matter models. I also present a local classical processing scheme for correcting errors on toric codes, which demonstrates that quantum information can be maintained in two dimensions by purely local quantum and classical resources.

•May 20, 2004•52 citations

How to Combat Quantum Bursts of Errors Efficiently

Ying Guo, Guihua Zeng

To construct a quantum code with much error-correcting ability, the philosophy of the quantum interleaving is illustrated by introducing the block interleaving techniques. Quantum interleaving is a process to rearrange the qubits of several states of the same code so as to spread the same quantum errors over multiple states. Utilizing the interleaving technique, the concatenated k n -qubit code is constructed in this paper with more error-correcting ability than utilizing only one n -qubit quantum error-correcting code (QECC) without introducing the redundant qubits. It hence suggests an important way to design an quantum convolution code as the classical convolutional code has been constructed. For the application, the proposed quantum interleaving technique becomes an effective means to combat quantum bursts of errors by converting quantum bursts of errors into quantum random errors.

Journal of the Physical Society of Japan•Mar 14, 2006•3 citations

Spatially correlated qubit errors and burst-correcting quantum codes

Farrokh Vatan, Vwani Roychowdhury, M. P. Anantram

We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, one can find one-dimensional quantum codes of length n=13 and 15 that correct burst errors of width b<3; as a comparison, a random-error correcting quantum code that corrects t=3 errors must have length n/spl ges/17. In general, we show that it is possible to build quantum burst-correcting codes that have near optimal dimension. For example, we show that for any constant b, there exist b-burst-correcting quantum codes with length n, and dimension k=n-log n-O(1); as a comparison, the Hamming bound for the case with t (constant) random errors yields k/spl les/n-tlog n+O(1).

arXiv:quant-ph/9704019•IEEE Transactions on Information Theory•Jul 1, 1999•28 citations

Quantum Error-Correcting Code for Burst Error

Shiro Kawabata

We propose a quantum error correcting code for burst error.% By using the quantum interleaver, any quantum burst-errors that have occurred are spread over the interleaved code word, so that we can construct good quantum burst-error correcting codes without increasing the redundancy of the code.

Kluwer Academic Publishers eBooks•Feb 24, 2006•0 citations

Quantum Interleaver: Quantum Error Correction for Burst Error

Shiro Kawabata

The concept of quantum interleaver and a simple method of quantum burst-error correction is proposed. By using the quantum interleaver, any quantum burst-errors that have occurred spread over the interleaved code word, so that we can construct good quantum burst-error correcting codes without increasing the redundancy of the code. We also discuss the general method of constructing the quantum circuit for the quantum interleaver and the quantum network.

arXiv:quant-ph/0002020•Journal of the Physical Society of Japan•Nov 15, 2000•17 citations
Characterization of nnn-Dimensional Toric and Burst-Error-Correcting Quantum Codes from Lattice Codes
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 nnn-dimensional toric quantum codes, where n≥5n\geq 5n≥5, which are featured by lattice codes and apply the proposed quantum interleaving method to such new nnn-dimensional toric quantum codes. Through the application of this method to these novel nnn-dimensional toric quantum codes we derive new nnn-dimensional quantum burst-error-correcting codes. Consequently, nnn-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 nnn-dimensional toric quantum codes is that if the Golomb and Welch conjecture in \cite{perfcodes} regarding the Lee sphere in nnn dimensions for the respective close packings holds true, then it follows that these nnn-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.
Quantum memory is essential for the development of many devices in quantum information processing, including a synchronization tool that can match the various processes in a quantum computer, a quantum gate that maintains the identity of any state, and a mechanism for converting predetermined photons into on-demand photons. Quantum memory can be used in many aspects, such as quantum computing and quantum communication. Continuous research and experiments have enabled quantum memory to realize the storage of qubits. On the other hand, interleaving techniques are used to deal with burst of errors. Many works from literature provide effective interleaving techniques for combating burst of errors by using classical error-correcting codes. However, to the best of our knowledge, little is known regarding interleaving techniques for combating cluster of errors in topological quantum error-correcting codes. Thenceforward, it is proposed in this work a new interleaving technique by using good toric quantum codes, namely Bombin and Martin-Delgado toric codes and another class of toric codes from literature which is described in this work. As a consequence, by applying this new interleaving method to such toric quantum codes, new quantum burst-error correcting codes are obtained which improve the coding gain. In addition to the proposed quantum interleaving technique improves such parameter, it can be used for burst-error correction in errors which are located, quantum data stored and quantum channels with memory.
Quantum information theory is concerned with identifying how quantum mechanical resources, such as entangled quantum states, can be utilized for a number of information processing tasks, including data storage, computation, communication, and cryptography. Efficient quantum algorithms and protocols have been developed for performing some tasks (e.g., factoring large numbers, securely communicating over a public channel, and simulating quantum mechanical systems) that appear to be very difficult with just classical resources. In addition to identifying the separation between classical and quantum computational power, much of the theoretical focus in this field over the last decade has been concerned with finding novel ways of encoding quantum information that are robust against errors, which is an important step toward building practical quantum information processing devices. In this thesis I present some results on the quantum error-correcting properties of oscillator codes (also described as symplectic lattice codes) and toric codes. Any harmonic oscillator system, such as a mode of light, can be encoded with quantum information via symplectic lattice codes that are robust against shifts in the system's continuous quantum variables. I show the existence of lattice codes whose achievable rates match the one-shot coherent information over the Gaussian quantum channel. Also, I construct a family of symplectic self-dual lattices and search for optimal encodings of quantum information distributed between several oscillators. Toric codes provide encodings of quantum information into two-dimensional spin lattices that are robust against local clusters of errors and which require only local quantum operations for error correction. Numerical simulations of this system under realistic error models provide a calculation of the accuracy threshold for quantum memory using toric codes, which can be related to phase transitions in particular condensed matter models. I also present a local classical processing scheme for correcting errors on toric codes, which demonstrates that quantum information can be maintained in two dimensions by purely local quantum and classical resources.
To construct a quantum code with much error-correcting ability, the philosophy of the quantum interleaving is illustrated by introducing the block interleaving techniques. Quantum interleaving is a process to rearrange the qubits of several states of the same code so as to spread the same quantum errors over multiple states. Utilizing the interleaving technique, the concatenated k n -qubit code is constructed in this paper with more error-correcting ability than utilizing only one n -qubit quantum error-correcting code (QECC) without introducing the redundant qubits. It hence suggests an important way to design an quantum convolution code as the classical convolutional code has been constructed. For the application, the proposed quantum interleaving technique becomes an effective means to combat quantum bursts of errors by converting quantum bursts of errors into quantum random errors.
We explore the design of quantum error-correcting codes for cases where the decoherence events of qubits are correlated. In particular, we consider the case where only spatially contiguous qubits decohere, which is analogous to the case of burst errors in classical coding theory. We present several different efficient schemes for constructing families of such codes. For example, one can find one-dimensional quantum codes of length n=13 and 15 that correct burst errors of width b<3; as a comparison, a random-error correcting quantum code that corrects t=3 errors must have length n/spl ges/17. In general, we show that it is possible to build quantum burst-correcting codes that have near optimal dimension. For example, we show that for any constant b, there exist b-burst-correcting quantum codes with length n, and dimension k=n-log n-O(1); as a comparison, the Hamming bound for the case with t (constant) random errors yields k/spl les/n-tlog n+O(1).