Local Clustering Decoder: a fast and adaptive hardware decoder for the surface code

• URL: http://arxiv.org/abs/2411.10343v1
• Date: Fri, 15 Nov 2024 16:43:59 GMT
• Title: Local Clustering Decoder: a fast and adaptive hardware decoder for the surface code
• Authors: Abbas B. Ziad, Ankit Zalawadiya, Canberk Topal, Joan Camps, György P. Gehér, Matthew P. Stafford, Mark L. Turner,
• Abstract summary: We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. It enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding.
• Score: 0.0
• License:
• Abstract: To avoid prohibitive overheads in performing fault-tolerant quantum computation, the decoding problem needs to be solved accurately and at speeds sufficient for fast feedback. Existing decoding systems fail to satisfy both of these requirements, meaning they either slow down the quantum computer or reduce the number of operations that can be performed before the quantum information is corrupted. We introduce the Local Clustering Decoder as a solution that simultaneously achieves the accuracy and speed requirements of a real-time decoding system. Our decoder is implemented on FPGAs and exploits hardware parallelism to keep pace with the fastest qubit types. Further, it comprises an adaptivity engine that allows the decoder to update itself in real-time in response to control signals, such as heralded leakage events. Under a realistic circuit-level noise model where leakage is a dominant error source, our decoder enables one million error-free quantum operations with 4x fewer physical qubits when compared to standard non-adaptive decoding. This is achieved whilst decoding in under 1 us per round with modest FPGA resources, demonstrating that high-accuracy real-time decoding is possible, and reducing the qubit counts required for large-scale fault-tolerant quantum computation.

Related papers

• Generalizing the matching decoder for the Chamon code [1.8416014644193066]
  We implement a matching decoder for a three-dimensional, non-CSS, low-density parity check code known as the Chamon code. We find that a generalized matching decoder that is augmented by a belief-propagation step prior to matching gives a threshold of 10.5% for depolarising noise.
  arXiv  Detail & Related papers  (2024-11-05T19:00:12Z)
• Accelerating Error Correction Code Transformers [56.75773430667148]
  We introduce a novel acceleration method for transformer-based decoders. We achieve a 90% compression ratio and reduce arithmetic operation energy consumption by at least 224 times on modern hardware.
  arXiv  Detail & Related papers  (2024-10-08T11:07:55Z)
• 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)
• Managing Classical Processing Requirements for Quantum Error Correction [0.36832029288386137]
  We present a framework to reduce the number of hardware decoders and navigate the compute-memory trade-offs. We propose efficient decoder scheduling policies which can reduce the number of hardware decoders required to run a program by up to 10x.
  arXiv  Detail & Related papers  (2024-06-26T00:50:10Z)
• Belief propagation as a partial decoder [0.0]
  We present a new two-stage decoder that accelerates the decoding cycle and boosts accuracy. In the first stage, a partial decoder based on belief propagation is used to correct errors that occurred with high probability. In the second stage, a conventional decoder corrects any remaining errors.
  arXiv  Detail & Related papers  (2023-06-29T17:44:20Z)
• The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
  We introduce a data efficient neural decoder that exploits the symmetries of the problem. We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
  arXiv  Detail & Related papers  (2023-04-14T19:46:39Z)
• Modular decoding: parallelizable real-time decoding for quantum computers [55.41644538483948]
  Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware. We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy. We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
  arXiv  Detail & Related papers  (2023-03-08T19:26:10Z)
• 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)
• A local pre-decoder to reduce the bandwidth and latency of quantum error correction [3.222802562733787]
  A fault-tolerant quantum computer will be supported by a classical decoding system interfacing with quantum hardware. We propose a local pre-decoder', which makes greedy corrections to reduce the amount of syndrome data sent to a standard matching decoder. We find substantial improvements in the runtime of the global decoder and the communication bandwidth by using the pre-decoder.
  arXiv  Detail & Related papers  (2022-08-09T11:01:56Z)
• 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)
• Hierarchical decoding to reduce hardware requirements for quantum computing [0.0]
  We propose a fault-tolerant quantum computing architecture based on surface codes with a cheap hard-decision decoder. We obtain a 1,500x reduction in bandwidth and decoding hardware thanks to the lazy decoder. Our simulations show a 10x speed-up of the Union-Find decoder and a 50x speed-up of the Minimum Weight Perfect Matching decoder.
  arXiv  Detail & Related papers  (2020-01-30T16:09:51Z)

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.