Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation
- URL: http://arxiv.org/abs/2504.01164v1
- Date: Tue, 01 Apr 2025 20:04:27 GMT
- Title: Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation
- Authors: Francisco Garcia-Herrero, Javier Valls, Llanos Vergara-Picazo, Vicente Torres,
- Abstract summary: This paper introduces a hardware emulator to evaluate quantum error correction decoders using real hardware instead of software models.<n>The emulator can explore $1013$ different error patterns in 20 days with a single FPGA device running at 150 MHz.<n>An optimized C++ software on an Intel Core i9 with 128 GB RAM would take over a year to achieve similar results.
- Score: 0.46873264197900916
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Understanding the impact of accuracy and speed when quantum error correction (QEC) decoders transition from floating-point software implementations to finite-precision hardware architectures is crucial for resource estimation on both classical and quantum sides. The final performance of the hardware implementation influences the code distance, affecting the number of physical qubits needed, and defines connectivity between quantum and classical control units, among other factors like refrigeration systems. This paper introduces a hardware emulator to evaluate QEC decoders using real hardware instead of software models. The emulator can explore $10^{13}$ different error patterns in 20 days with a single FPGA device running at 150 MHz, guaranteeing the decoder's performance at logical rates of $10^{-12}$, the requirement for most quantum algorithms. In contrast, an optimized C++ software on an Intel Core i9 with 128 GB RAM would take over a year to achieve similar results. The emulator also enables storing patterns that generate logical errors for offline analysis and to design new decoders. Using results from the emulator, we propose a diversity-based method combining several belief propagation (BP) decoders with different quantization levels. Individually, these decoders may show subpar error correction, but together they outperform the floating-point version of BP for quantum low-density parity-check (QLDPC) codes like hypergraph or lifted product. Preliminary results with circuit-level noise and bivariate bicycle codes suggest hardware insights can also improve software. Our diversity-based proposal achieves a similar logical error rate as BP with ordered statistics decoding, with average speed improvements ranging from 30% to 80%, and 10% to 120% in worst-case scenarios, while reducing post-processing algorithm activation by 47% to 96.93%, maintaining the same accuracy.
Related papers
- Demonstrating real-time and low-latency quantum error correction with superconducting qubits [52.08698178354922]
We demonstrate low-latency feedback with a scalable FPGA decoder integrated into a superconducting quantum processor.
We observe logical error suppression as the number of decoding rounds is increased.
The decoder throughput and latency developed in this work, combined with continued device improvements, unlock the next generation of experiments.
arXiv Detail & Related papers (2024-10-07T17:07:18Z) - Quantum error correction below the surface code threshold [107.92016014248976]
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit.
We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder.
Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
arXiv Detail & Related papers (2024-08-24T23:08:50Z) - Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes [0.0]
We introduce the Ambiguity Clustering decoder (AC) which divides measurement data into clusters that can be decoded independently.<n>With 0.3% circuit-level depolarising noise, AC is up to 27x faster than BP-OSD with matched accuracy.<n>Our implementation decodes the 144-qubit Gross code in 135us per round of syndrome extraction on an M2 CPU.
arXiv Detail & Related papers (2024-06-20T17:39:31Z) - MITS: A Quantum Sorcerer Stone For Designing Surface Codes [2.348041867134616]
We present MITS, a tool designed to reverse-engineer the well-known simulator STIM for designing QEC codes.
MITS accepts the specific noise model of a quantum computer and a target logical error rate as input and outputs the optimal surface code rounds and code distances.
arXiv Detail & Related papers (2024-02-16T19:17:53Z) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes [12.687083899824314]
Quantum error-correcting codes (QECCs) can eliminate the negative effects of quantum noise, the major obstacle to the execution of quantum algorithms.
We propose a scalable, fast, and programmable neural decoding system to meet the requirements of FTQEC for rotated surface codes (RSC)
Our system achieves an extremely low decoding latency of 197 ns, and the accuracy results of our system are close to minimum weight perfect matching (MWPM)
arXiv Detail & Related papers (2023-05-25T06:23:32Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - Hardware optimized parity check gates for superconducting surface codes [0.0]
Error correcting codes use multi-qubit measurements to realize fault-tolerant quantum logic steps.
We analyze an unconventional surface code based on multi-body interactions between superconducting transmon qubits.
Despite the multi-body effects that underpin this approach, our estimates of logical faults suggest that this design can be at least as robust to realistic noise as conventional designs.
arXiv Detail & Related papers (2022-11-11T18:00:30Z) - Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes.
Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number.
Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - A Scalable Decoder Micro-architecture for Fault-Tolerant Quantum
Computing [2.617437465051793]
We design a decoder micro-architecture for the Union-Find decoding algorithm.
We optimize the amount of decoding hardware required to perform error correction simultaneously over all the logical qubits of the quantum computer.
arXiv Detail & Related papers (2020-01-18T04:44:52Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.