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

Theory and design of AI-optimized quantum error correction codes: fundamental limits and new constructions

Στεφανία Δ. Μιχαλάρη

Published Jan 1, 2026• 0 citations
OpenAlex

Related papers

Design and analysis of error correcting codes for quantum computation

Pavel Bažant

•Jan 1, 2008•0 citations

Nested Quantum Error Correction Codes

Zhuo Wang, Kai Sun, Hen Fan +1 more

The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.

arXiv:0909.5103•Sep 28, 2009•2 citations

A new family of quantum synchronizable codes from negacyclic codes

Tao Wang, Tongjiang Yan, Sun, Shiwen

Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum synchronizable codes from negacyclic codes are proposed, where the length of these negacyclic codes are $p$ and $pq$. Through this method, the quantum synchronizable code possesses optimal or almost optimal error-correcting capability towards bits errors and phase errors, since the negacyclic codes we used are optimal or almost optimal. Moreover, this paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.

arXiv:2107.02648•Jul 6, 2021•0 citations

A new description of quantum error-correcting codes

Wen-Ching Li

AMS/IP studies in advanced mathematics•Jul 20, 2007•0 citations

Energy-adaptive codes

Haewon Jeong, Pulkit Grover

We provide the first constructions of a new family of error-correcting codes called “energy-adaptive codes.” These codes are designed to enable adaptive circuit implementations that minimize the total system-level energy based on varying distances and target error probabilities. Recent work has explored fundamental limits and practical strategies for minimizing total (transmit + circuit) power, considering both power consumed in computational nodes as well as wires in the circuit. It is now established that to minimize total power, code choice and circuit-design should change with communication distances and/or target error probability. Motivated by circuit area constraints, the energy-adaptive codes adapt energy consumption as distances and/or target error probability change. These codes shrink and expand the wiring area they occupy as demands on the system change, adjusting the hardware by turning on and off non-local wires in the circuit. The code constructions are hierarchical, and use QC-LDPC codes as the basis. We estimate the decoding power savings attained by use of these codes through simulation results. Such codes can be of increasing utility as we enter the era of 1000 devices per person where designing the skilled labor for obtaining optimized designs for each system will simply be unavailable. While our first constructions are admittedly simplistic, the goal of the paper is to bring this new problem to the attention of the coding-theory community.

Allerton Conference on Communication, Control, and Computing•Sep 1, 2015•7 citations

Experimental Realization of Continuous-Variable Quantum Error Correction Codes

Mikael Lassen, Lars S. Madsen, Ulrik L. Andersen

•Jan 1, 2011•0 citations
The theory of quantum error correction was established more than a decade ago as the primary tool for fighting decoherence in quantum information processing. Although great progress has already been made in this field, limited methods are available in constructing new quantum error correction codes from old codes. Here we exhibit a simple and general method to construct new quantum error correction codes by nesting certain quantum codes together. The problem of finding long quantum error correction codes is reduced to that of searching several short length quantum codes with certain properties. Our method works for all length and all distance codes, and is quite efficient to construct optimal or near optimal codes. Two main known methods in constructing new codes from old codes in quantum error-correction theory, the concatenating and pasting, can be understood in the framework of nested quantum error correction codes.
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, a new method for construct quantum synchronizable codes from negacyclic codes are proposed, where the length of these negacyclic codes are ppp and pqpqpq. Through this method, the quantum synchronizable code possesses optimal or almost optimal error-correcting capability towards bits errors and phase errors, since the negacyclic codes we used are optimal or almost optimal. Moreover, this paper contributes to construct two classes quantum synchronizable codes, whose synchronization capabilities can reach the upper limit under certain conditions.
We provide the first constructions of a new family of error-correcting codes called “energy-adaptive codes.” These codes are designed to enable adaptive circuit implementations that minimize the total system-level energy based on varying distances and target error probabilities. Recent work has explored fundamental limits and practical strategies for minimizing total (transmit + circuit) power, considering both power consumed in computational nodes as well as wires in the circuit. It is now established that to minimize total power, code choice and circuit-design should change with communication distances and/or target error probability. Motivated by circuit area constraints, the energy-adaptive codes adapt energy consumption as distances and/or target error probability change. These codes shrink and expand the wiring area they occupy as demands on the system change, adjusting the hardware by turning on and off non-local wires in the circuit. The code constructions are hierarchical, and use QC-LDPC codes as the basis. We estimate the decoding power savings attained by use of these codes through simulation results. Such codes can be of increasing utility as we enter the era of 1000 devices per person where designing the skilled labor for obtaining optimized designs for each system will simply be unavailable. While our first constructions are admittedly simplistic, the goal of the paper is to bring this new problem to the attention of the coding-theory community.