PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
October 20, 20250 citationsOpen Access

Quantum Error Correction Exploiting Degeneracy to Approach the Hashing Bound

View Full Paper
KKKenta Kasai

Key Points

  • The proposed method achieves a frame error rate of $10^{-4}$ at a physical error rate of 9.45%, demonstrating significant decoding performance improvements.
  • By utilizing degeneracy, the coding rate of 1/3 was achieved with a code encompassing 104,000 logical qubits and 312,000 physical qubits.
  • This work emphasizes the importance of degeneracy in closing the performance gap to the quantum hashing bound, a fundamental limit in quantum error correction.
  • Results from simulations over the depolarizing channel indicate the method's effectiveness, underscoring its potential for scalable quantum computation.

Abstract

Quantum error correction is essential for realizing scalable quantum computation. Among various approaches, low-density parity-check codes over higher-order Galois fields have shown promising performance due to their structured sparsity and compatibility with iterative decoding algorithms whose computational complexity scales linearly with the number of physical qubits. In this work, we demonstrate that explicitly exploiting the degeneracy of quantum errors can significantly enhance the decoding performance. Simulation results over the depolarizing channel indicate that the proposed method, at a coding rate of 1/3, achieves a frame error rate as low as 10^-4 at a physical error rate of 9. 45% for a code with 104, 000 logical qubits and 312, 000 physical qubits, approaching the quantum hashing bound. These findings highlight the critical role of degeneracy in closing the gap to the fundamental limits of quantum error correction.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Kenta Kasai (2025) studied this question.

synapsesocial.com/papers/68f6379bb481a140a36cf841https://doi.org/10.48550/arxiv.2506.15636
Ask AI
Helpful
Bookmark
Share
View Full Paper