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

Transforming qubits via quasi-geometric approaches

Valentine Nyirahafashimana, Nurisya Mohd Shah, Umair Abdul Halim, Sharifah Kartini Said Husain, Ahmed Jellal

Published Jul 10, 2024• 0 citations
arXivHTMLPDF

Abstract

We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal complete complementary codes (2D-QOCCCSs) and quasi-cyclic asymmetric quantum error-correcting codes (AQECCs) via quasigroup and group theory properties. We integrate the Pauli $X$-gate to detect and correct errors, as well as the Hadamard $H$-gate to superpose the initial and final qubits in the quantum circuit diagram. We compare the numerical results to analyze the success, consistency, and performance of the corrected errors through bar graphs for 2D-QOCCCs and AQECCs according to their characteristics. The difficulty in generating additional sets of results and counts for AQECCs arises because mapping a smaller initial number of qubits to a larger final number is necessary to correct more errors. For AQECCs, the number of errors that can be corrected must be equal to or less than the initial number of qubits. High error correction performance is observed when mapping 1-qubit state to 29-qubits to correct 5 errors using 2D-QOCCCs. Similarly, transforming 1-qubit to 13-qubits using AQECCs also shows high performance, successfully correcting 2 errors. The results show that our theory has the advantage of providing a basis for refining and optimizing these codes in future quantum computing applications due to its high performance in error correction.

DOI
10.48550/arxiv.2407.07562

Related papers

Optimizing Qubit Mapping with Quasi-Orthogonal Space-Time Block Codes and Quaternion Orthogonal Designs

Valentine Nyirahafashimana, Nurisya Mohd Shah, Umair Abdul Halim +2 more

This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction (QEC) frameworks. QOSTBCs have gained prominence for enhancing performance and reliability in quantum computing and communication systems. These codes draw on stabilizer group formalism and QODs to boost error correction, with QOSTBCs mapping logical qubits to physical ones, refines error handling in complex channels environments. Simulations results demonstrate the effectiveness of this approach by comparing the percentage improvement under various detected and corrected error conditions for four different cases, \textbf{$Z_1$} up to \textbf{$Z_4$}. The obtained simulations and implemental results show that QOSTBCs consistently achieve a higher correction improvement percentage than stabilizer Group for \textbf{$Z_1$}, \textbf{$Z_2$}, and \textbf{$Z_4$}; QOSTBCs can correct more errors than those detected, achieving over 100\% correction rates for first two cases, which indicates their enhanced resilience and redundancy in high-error environments. While for \textbf{$Z_3$}, stabilizer consistently remains above that of QOSTBCs, reflecting its slightly better performance. These outcomes indicate that QOSTBCs are reliable in making better logarithmic efficiency and error resilience, making them a valuable asset for quantum information processing and advanced wireless communication.

arXiv:2412.06145•Dec 9, 2024•0 citations

Exploring quasi-geometric frameworks for quantum error-correcting codes: a systematic review

Valentine Nyirahafashimana, Nurisya Mohd Shah, Umair Abdul Halim +1 more

This study investigates quasi-geometric strategies for improving quantum error correction in quantum computing, utilizing geometric principles to improve error detection and correction while maintaining computational efficiency. A comprehensive review of 20 studies, selected from 2988 publications spanning 2019 to 2024, reveals significant progress in quasi-cyclic codes, quasi-orthogonal codes, and quasi-structured geometric codes, highlighting their growing importance in quantum error correction and information theory. The findings indicate that quasi-orthogonal codes that employ coefficient vector differential quasi-orthogonal space-time frequency coding demonstrated a $$1.20$$ dB gain at a bit error rate of $$10^{-4}$$ , while reducing computational complexity. Quasi-structured geometric codes offered energy-efficient solutions, facilitating multi-state orthogonal signaling and reliable linear code construction. Furthermore, quasi-cyclic low-density parity-check codes with optimized information selection surpassed traditional forward error correction codes, achieving superior quantum error rates of $$10^{-5}$$ at $$10.00$$ dB and $$10^{-6}$$ at $$15.00$$ dB. Performance analysis showed that the effectiveness of error correction depends more on the frequency of six-length cycles than on girth, suggesting a new direction for optimization. The study emphasizes the transformative potential of quasi-geometric strategies in improving quantum communication by focusing on bit and quantum bit error rates within both stabilizer and classical frameworks. Future work focuses on integrating hybrid quantum-classical codes to raise error resilience and efficiency, addressing challenges like decoding instability, and limited orthogonality to enable reliable and computational quantum communication systems.

Quantum Information Processing•Aug 28, 2025•0 citations

Entanglement-assisted quantum error-correcting codes via quasi-cyclic codes with complementary duals

Hajime Matsui, Kakeru Kaneko

Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of $$-1+x^m$$ - 1 + x m , which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD–QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD–QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.

Designs Codes and Cryptography•May 31, 2025•0 citations

Asymmetric quantum error-correcting codes

L. B. Ioffe, Marc Mézard

The noise in physical qubits is fundamentally asymmetric: in most devices, phase errors are much more probable than bit flips. We propose a quantum error-correcting code that takes advantage of this asymmetry and shows good performance at a relatively small cost in redundancy, requiring less than a doubling of the number of physical qubits for error correction. This code is particularly adapted for building an efficient quantum memory.

arXiv:quant-ph/0606107•Physical Review A•Mar 29, 2007•170 citations

Exponential suppression of bit or phase flip errors with repetitive quantum error correction

Zijun Chen, Kevin J. Satzinger, Juan Atalaya +88 more

Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the $10^{-15}$ regime, but state-of-the-art quantum platforms typically have physical error rates near $10^{-3}$. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits so that errors can be detected and corrected. Logical errors are then exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold. QEC also requires that the errors are local and that performance is maintained over many rounds of error correction, two major outstanding experimental challenges. Here, we implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors, reducing logical error per round by more than $100\times$ when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analyzing error correlations with high precision, and characterize the locality of errors in a device performing QEC for the first time. Finally, we perform error detection using a small 2D surface code logical qubit on the same device, and show that the results from both 1D and 2D codes agree with numerical simulations using a simple depolarizing error model. These findings demonstrate that superconducting qubits are on a viable path towards fault tolerant quantum computing.

•Feb 11, 2021•8 citations

Asymmetric quantum error correction efficiently tackles application-specific noise effects

Abhishek Yadav, Peter K. Schuhmacher, Michael Epping

Noise is a major challenge for current quantum computers. It can be broadly categorized into bit-flip and phase-flip errors. These two types do not necessarily affect the executed algorithm, thus also the application, in the same way. We illustrate this general effect for the example of the quantum approximate optimization algorithm (QAOA) applied to a small instance of the flight-gate assignment (FGA) problem. We compare bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, using two circuit decompositions of the same ideal QAOA unitary: a CNOT-based decomposition and a native-$R_{ZZ}$ decomposition. In the simulations, bit-flip noise produces the larger degradation in the performance of the quantum optimization. The asymmetry is most visible in the layer-level and native-$R_{ZZ}$ simulations. We explain this by how the errors affect mixing, final measurements, and how they propagate inside the circuit. We then exploit these insights to tackle noise particularly efficiently using asymmetric error-correcting codes. As an illustration, we use the quantum parity code (QPC), a generalization of the 9-qubit Shor code, and show that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice. This demonstrates that error-correction resources should be assigned not only according to physical error rates, but also according to how strongly each error channel affects the application. As a result, asymmetric quantum error correction proves useful even in cases where the noise model is symmetric. Finally, we discuss how information about the noise obtained through calibration can be exploited in our approach.

quant-pharXiv:2609.07235•Sep 8, 2026•0 citations
We develop a theory based on quasi-geometric (QG) approach to transform a small number of qubits into a larger number of error-correcting qubits by considering four different cases. More precisely, we use the 2-dimensional quasi-orthogonal complete complementary codes (2D-QOCCCSs) and quasi-cyclic asymmetric quantum error-correcting codes (AQECCs) via quasigroup and group theory properties. We integrate the Pauli XXX-gate to detect and correct errors, as well as the Hadamard HHH-gate to superpose the initial and final qubits in the quantum circuit diagram. We compare the numerical results to analyze the success, consistency, and performance of the corrected errors through bar graphs for 2D-QOCCCs and AQECCs according to their characteristics. The difficulty in generating additional sets of results and counts for AQECCs arises because mapping a smaller initial number of qubits to a larger final number is necessary to correct more errors. For AQECCs, the number of errors that can be corrected must be equal to or less than the initial number of qubits. High error correction performance is observed when mapping 1-qubit state to 29-qubits to correct 5 errors using 2D-QOCCCs. Similarly, transforming 1-qubit to 13-qubits using AQECCs also shows high performance, successfully correcting 2 errors. The results show that our theory has the advantage of providing a basis for refining and optimizing these codes in future quantum computing applications due to its high performance in error correction.
This study explores the qubit mapping through the integration of Quasi-Orthogonal Space-Time Block Codes (QOSTBCs) with Quaternion Orthogonal Designs (QODs) in quantum error correction (QEC) frameworks. QOSTBCs have gained prominence for enhancing performance and reliability in quantum computing and communication systems. These codes draw on stabilizer group formalism and QODs to boost error correction, with QOSTBCs mapping logical qubits to physical ones, refines error handling in complex channels environments. Simulations results demonstrate the effectiveness of this approach by comparing the percentage improvement under various detected and corrected error conditions for four different cases, \textbf{Z1Z_1Z1​} up to \textbf{Z4Z_4Z4​}. The obtained simulations and implemental results show that QOSTBCs consistently achieve a higher correction improvement percentage than stabilizer Group for \textbf{Z1Z_1Z1​}, \textbf{Z2Z_2Z2​}, and \textbf{Z4Z_4Z4​}; QOSTBCs can correct more errors than those detected, achieving over 100\% correction rates for first two cases, which indicates their enhanced resilience and redundancy in high-error environments. While for \textbf{Z3Z_3Z3​}, stabilizer consistently remains above that of QOSTBCs, reflecting its slightly better performance. These outcomes indicate that QOSTBCs are reliable in making better logarithmic efficiency and error resilience, making them a valuable asset for quantum information processing and advanced wireless communication.
This study investigates quasi-geometric strategies for improving quantum error correction in quantum computing, utilizing geometric principles to improve error detection and correction while maintaining computational efficiency. A comprehensive review of 20 studies, selected from 2988 publications spanning 2019 to 2024, reveals significant progress in quasi-cyclic codes, quasi-orthogonal codes, and quasi-structured geometric codes, highlighting their growing importance in quantum error correction and information theory. The findings indicate that quasi-orthogonal codes that employ coefficient vector differential quasi-orthogonal space-time frequency coding demonstrated a 1.201.201.20 dB gain at a bit error rate of 10−410^{-4}10−4 , while reducing computational complexity. Quasi-structured geometric codes offered energy-efficient solutions, facilitating multi-state orthogonal signaling and reliable linear code construction. Furthermore, quasi-cyclic low-density parity-check codes with optimized information selection surpassed traditional forward error correction codes, achieving superior quantum error rates of 10−510^{-5}10−5 at 10.0010.0010.00 dB and 10−610^{-6}10−6 at 15.0015.0015.00 dB. Performance analysis showed that the effectiveness of error correction depends more on the frequency of six-length cycles than on girth, suggesting a new direction for optimization. The study emphasizes the transformative potential of quasi-geometric strategies in improving quantum communication by focusing on bit and quantum bit error rates within both stabilizer and classical frameworks. Future work focuses on integrating hybrid quantum-classical codes to raise error resilience and efficiency, addressing challenges like decoding instability, and limited orthogonality to enable reliable and computational quantum communication systems.
Abstract It is known that entanglement-assisted quantum error-correcting codes (EAQECCs), a type of quantum error correction codes, can be easily constructed using linear codes that satisfy the property called linear complementary duals (LCD). For quasi-cyclic (QC) codes, which are a class of linear codes, we have already published the methods for constructing the codes with properties such as self-orthogonality, self-duality and reversibility according to the prime-factor decomposition of −1+xm-1+x^m−1+xm - 1 + x m , which reduce the amount of calculation by assembling several small generator polynomial matrices into a large generator polynomial matrix. In this paper, we propose a method to construct LCD–QC codes according to the prime-factor decomposition. The main idea of this method is to decompose the generator polynomial matrix of the QC code into several small generator polynomial matrices corresponding to the prime factors and perform LCD determination, which leads to a reduction in the amount of calculation. As an application of our construction method, we create EAQECCs from the constructed LCD–QC codes, compare those minimum weights with the maximum values of the minimum weights of existing EAQECCs and find 15 EAQECCs with larger minimum weights than the existing ones.
Realizing the potential of quantum computing will require achieving sufficiently low logical error rates. Many applications call for error rates in the 10−1510^{-15}10−15 regime, but state-of-the-art quantum platforms typically have physical error rates near 10−310^{-3}10−3. Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits so that errors can be detected and corrected. Logical errors are then exponentially suppressed as the number of physical qubits grows, provided that the physical error rates are below a certain threshold. QEC also requires that the errors are local and that performance is maintained over many rounds of error correction, two major outstanding experimental challenges. Here, we implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors, reducing logical error per round by more than 100×100\times100× when increasing the number of qubits from 5 to 21. Crucially, this error suppression is stable over 50 rounds of error correction. We also introduce a method for analyzing error correlations with high precision, and characterize the locality of errors in a device performing QEC for the first time. Finally, we perform error detection using a small 2D surface code logical qubit on the same device, and show that the results from both 1D and 2D codes agree with numerical simulations using a simple depolarizing error model. These findings demonstrate that superconducting qubits are on a viable path towards fault tolerant quantum computing.
Noise is a major challenge for current quantum computers. It can be broadly categorized into bit-flip and phase-flip errors. These two types do not necessarily affect the executed algorithm, thus also the application, in the same way. We illustrate this general effect for the example of the quantum approximate optimization algorithm (QAOA) applied to a small instance of the flight-gate assignment (FGA) problem. We compare bit-flip and phase-flip Pauli noise under both layer-level and gate-level noise models, using two circuit decompositions of the same ideal QAOA unitary: a CNOT-based decomposition and a native-RZZR_{ZZ}RZZ​ decomposition. In the simulations, bit-flip noise produces the larger degradation in the performance of the quantum optimization. The asymmetry is most visible in the layer-level and native-RZZR_{ZZ}RZZ​ simulations. We explain this by how the errors affect mixing, final measurements, and how they propagate inside the circuit. We then exploit these insights to tackle noise particularly efficiently using asymmetric error-correcting codes. As an illustration, we use the quantum parity code (QPC), a generalization of the 9-qubit Shor code, and show that a smaller asymmetric code can achieve nearly the same improvement as a larger symmetric choice. This demonstrates that error-correction resources should be assigned not only according to physical error rates, but also according to how strongly each error channel affects the application. As a result, asymmetric quantum error correction proves useful even in cases where the noise model is symmetric. Finally, we discuss how information about the noise obtained through calibration can be exploited in our approach.