Get started
Work

Aggressive Guided Exploitation Optimized Sparse-Dual Attention Enabled Meta-Learning-Based Deep Learning Model for Quantum Error Correction

Year: 2026
Type: article
Abstract: Quantum error-correcting codes are essential for achieving fault-tolerant quantum computing. Heavy hexagonal code is a type of topological code that leverages the arrangement of qubits to find and correct errors. The heavy hexagonal code is suitable for superconducting architectures, specifically graph layouts with a limited number of connections. The topological error correction methods work well, but they need more qubits, cannot be used for different sizes of quantum systems, are less reliable, and do not work well with changing quantum distributions. Thus, the research proposes an Ardea-guided exploit optimized sparse-dual attention enabled meta-learning-based convolutional neural network with bi-directional long short-term memory model (AGuESD-MCBiTM). The method exhibits effective correction over dynamic environments with the utilization of meta-learning and the extraction of statistical information, which provides a detailed representation of the qubit patterns. The Ardea-guided exploit optimized (AGuEO) algorithm tunes the weights of MCBiTM and acquires optimal solutions with higher convergence. Moreover, the sparse-dual attention module and meta-learning-based MCBiTM model, which together provide scalable, real-time identification of non-linear qubit noise fluctuations with lower computational cost. Comparatively, the proposed AGuESD-MCBiTM exhibits superior error correction with a higher correlation of 0.97, accuracy of 98.93%, and R-squared value of 0.93, as well as a lower Root mean square error of 1.87, Mean absolute error of 1.20, Bit error rate of 1.85, Logical error rate of 3.82, and mean square error of 3.49 in circuit 2, respectively.
Source: Mathematics
DOI: 10.3390/math14091459
Language: English
Open Access status: gold
Estimated APC paid: $3,137
OpenAlex ID: W7157166003
FWCI:
Cites:
Cited by:
Related to: