Micro Blossom: Accelerated Minimum-Weight Perfect Matching Decoding for Quantum Error Correction

• URL: http://arxiv.org/abs/2502.14787v1
• Date: Thu, 20 Feb 2025 18:08:55 GMT
• Title: Micro Blossom: Accelerated Minimum-Weight Perfect Matching Decoding for Quantum Error Correction
• Authors: Yue Wu, Namitha Liyanage, Lin Zhong,
• Abstract summary: This work presents the first publicly known MWPM decoder, called Micro Blossom, that achieves sub-microsecond decoding latency. Micro Blossom is the first publicly known hardware-accelerated exact MWPM decoder, and the decoding latency of $0.8 mu s$ is 8 times shorter than the best latency of MWPM decoder implementations reported in the literature.
• Score: 4.1300531003759575
• License:
• Abstract: Minimum-Weight Perfect Matching (MWPM) decoding is important to quantum error correction decoding because of its accuracy. However, many believe that it is difficult, if possible at all, to achieve the microsecond latency requirement posed by superconducting qubits. This work presents the first publicly known MWPM decoder, called Micro Blossom, that achieves sub-microsecond decoding latency. Micro Blossom employs a heterogeneous architecture that carefully partitions a state-of-the-art MWPM decoder between software and a programmable accelerator with parallel processing units, one of each vertex/edge of the decoding graph. On a surface code with code distance $d$ and a circuit-level noise model with physical error rate $p$, Micro Blossom's accelerator employs $O(d^3)$ parallel processing units to reduce the worst-case latency from $O(d^{12})$ to $O(d^9)$ and reduce the average latency from $O(p d^3+1)$ to $O(p^2 d^2+1)$ when $p \ll 1$. We report a prototype implementation of Micro Blossom using FPGA. Measured at $d=13$ and $p=0.1\%$, the prototype achieves an average decoding latency of $0.8 \mu s$ at a moderate clock frequency of $62 MHz$. Micro Blossom is the first publicly known hardware-accelerated exact MWPM decoder, and the decoding latency of $0.8 \mu s$ is 8 times shorter than the best latency of MWPM decoder implementations reported in the literature.

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)
• FPGA-based Distributed Union-Find Decoder for Surface Codes [3.780617572622938]
  A fault-tolerant quantum computer must decode and correct errors faster than they appear to prevent exponential slowdown due to error correction. We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup.
  arXiv  Detail & Related papers  (2024-03-20T13:36:59Z)
• Fusion Blossom: Fast MWPM Decoders for QEC [6.878819782873719]
  Existing implementations of the Minimum-Weight Perfect Matching decoder cannot catch up with quantum hardware. We design and implement a fast MWPM decoder, called Parity Blossom, which reaches a time complexity almost proportional to the number of defect measurements. Given a practical circuit-level noise of 0.1%, Fusion Blossom can decode a million measurement rounds per second up to a code distance of 33.
  arXiv  Detail & Related papers  (2023-05-15T02:31:06Z)
• Fast, high-fidelity addressed single-qubit gates using efficient composite pulse sequences [0.0]
  We use electronic microwave control methods to implement addressed single-qubit gates with high speed and fidelity. For a single qubit, we benchmark an error of $1.5$ $times$ $10-6$ per Clifford gate. For two qubits in the same trap zone, we use a spatial microwave field gradient, combined with an efficient 4-pulse scheme.
  arXiv  Detail & Related papers  (2023-05-11T11:01:45Z)
• Sparse Blossom: correcting a million errors per core second with minimum-weight matching [0.03320194947871346]
  We introduce a fast implementation of the minimum-weight perfect matching (MWPM) decoder. Our algorithm, which we call sparse blossom, is a variant of the blossom algorithm which directly solves the decoding problem relevant to quantum error correction.
  arXiv  Detail & Related papers  (2023-03-28T12:42:54Z)
• Scalable Quantum Error Correction for Surface Codes using FPGA [67.74017895815125]
  A fault-tolerant quantum computer must decode and correct errors faster than they appear. We report a distributed version of the Union-Find decoder that exploits parallel computing resources for further speedup. The implementation employs a scalable architecture called Helios that organizes parallel computing resources into a hybrid tree-grid structure.
  arXiv  Detail & Related papers  (2023-01-20T04:23:00Z)
• Denoising MCMC for Accelerating Diffusion-Based Generative Models [54.06799491319278]
  Diffusion models are powerful generative models that simulate the reverse of diffusion processes using score functions to synthesize data from noise. Here, we propose an approach to accelerating score-based sampling: Denoising MCMC. We show that Denoising Langevin Gibbs (DLG), an instance of DMCMC, successfully accelerates all six reverse-S/ODE computation tasks.
  arXiv  Detail & Related papers  (2022-09-29T07:16:10Z)
• Erasure qubits: Overcoming the $T_1$ limit in superconducting circuits [105.54048699217668]
  amplitude damping time, $T_phi$, has long stood as the major factor limiting quantum fidelity in superconducting circuits. We propose a scheme for overcoming the conventional $T_phi$ limit on fidelity by designing qubits in a way that amplitude damping errors can be detected and converted into erasure errors.
  arXiv  Detail & Related papers  (2022-08-10T17:39:21Z)
• FastFlowNet: A Lightweight Network for Fast Optical Flow Estimation [81.76975488010213]
  Dense optical flow estimation plays a key role in many robotic vision tasks. Current networks often occupy large number of parameters and require heavy computation costs. Our proposed FastFlowNet works in the well-known coarse-to-fine manner with following innovations.
  arXiv  Detail & Related papers  (2021-03-08T03:09:37Z)

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.