Managing Classical Processing Requirements for Quantum Error Correction

• URL: http://arxiv.org/abs/2406.17995v1
• Date: Wed, 26 Jun 2024 00:50:10 GMT
• Title: Managing Classical Processing Requirements for Quantum Error Correction
• Authors: Satvik Maurya, Swamit Tannu,
• Abstract summary: 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.
• Score: 0.36832029288386137
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum Error Correction requires decoders to process syndromes generated by the error-correction circuits. These decoders must process syndromes faster than they are being generated to prevent a backlog of undecoded syndromes that can exponentially increase the memory and time required to execute the program. This has resulted in the development of fast hardware decoders that accelerate decoding. Applications utilizing error-corrected quantum computers will require hundreds to thousands of logical qubits and provisioning a hardware decoder for every logical qubit can be very costly. In this work, we present a framework to reduce the number of hardware decoders and navigate the compute-memory trade-offs without sacrificing the performance or reliability of program execution. Through workload-centric characterizations, we propose efficient decoder scheduling policies which can reduce the number of hardware decoders required to run a program by up to 10x while consuming less than 100 MB of memory.

Related papers

• 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)
• Efficient Encoder-Decoder Transformer Decoding for Decomposable Tasks [53.550782959908524]
  We introduce a new configuration for encoder-decoder models that improves efficiency on structured output and decomposable tasks. Our method, prompt-in-decoder (PiD), encodes the input once and decodes the output in parallel, boosting both training and inference efficiency.
  arXiv  Detail & Related papers  (2024-03-19T19:27:23Z)
• A real-time, scalable, fast and highly resource efficient decoder for a quantum computer [1.9014261239550778]
  We introduce the Collision Clustering decoder and implement it on FPGA and ASIC hardware. We simulate logical memory experiments using the leading quantum error correction scheme, the surface code. We demonstrate MHz decoding speed - matching the requirements of fast-operating modalities such as superconducting qubits.
  arXiv  Detail & Related papers  (2023-09-11T15:46:27Z)
• 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)
• Better Than Worst-Case Decoding for Quantum Error Correction [6.943255454097062]
  We propose a lightweight decoder for decoding and correcting trivial common-case errors on superconducting quantum systems. The decoder is implemented for SFQ logic. It achieves 10-10000x bandwidth reduction over prior off-chip bandwidth reduction techniques. It achieves a 15-37x resource overhead reduction compared to prior on-chip-only decoding.
  arXiv  Detail & Related papers  (2022-08-17T21:26:48Z)
• 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)
• LILLIPUT: A Lightweight Low-Latency Lookup-Table Based Decoder for Near-term Quantum Error Correction [3.6532769050417997]
  Quantum Error Correction (QEC) encodes logical qubits and distributes information using several physical qubits. LILLIPUT translates syndromes into error detection events that index into a Look-Up Table (LUT) whose entry provides the error information in real-time. LILLIPUT tolerates an error on any operation in the quantum hardware, including gates and measurement, and the number of tolerated errors grows with the size of the code.
  arXiv  Detail & Related papers  (2021-08-14T15:50:09Z)
• 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)
• 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.