Hierarchical decoding to reduce hardware requirements for quantum computing

• URL: http://arxiv.org/abs/2001.11427v1
• Date: Thu, 30 Jan 2020 16:09:51 GMT
• Title: Hierarchical decoding to reduce hardware requirements for quantum computing
• Authors: Nicolas Delfosse
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Extensive quantum error correction is necessary in order to scale quantum hardware to the regime of practical applications. As a result, a significant amount of decoding hardware is necessary to process the colossal amount of data required to constantly detect and correct errors occurring over the millions of physical qubits driving the computation. The implementation of a recent highly optimized version of Shor's algorithm to factor a 2,048-bits integer would require more 7 TBit/s of bandwidth for the sole purpose of quantum error correction and up to 20,000 decoding units. To reduce the decoding hardware requirements, we propose a fault-tolerant quantum computing architecture based on surface codes with a cheap hard-decision decoder, the lazy decoder, combined with a sophisticated decoding unit that takes care of complex error configurations. Our design drops the decoding hardware requirements by several orders of magnitude assuming that good enough qubits are provided. Given qubits and quantum gates with a physical error rate $p=10^{-4}$, the lazy decoder drops both the bandwidth requirements and the number of decoding units by a factor 50x. Provided very good qubits with error rate $p=10^{-5}$, we obtain a 1,500x reduction in bandwidth and decoding hardware thanks to the lazy decoder. Finally, the lazy decoder can be used as a decoder accelerator. Our simulations show a 10x speed-up of the Union-Find decoder and a 50x speed-up of the Minimum Weight Perfect Matching decoder.

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)
• 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)
• 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)
• How to choose a decoder for a fault-tolerant quantum computer? The speed vs accuracy trade-off [48.73569522869751]
  We show how to choose the best decoder for a given quantum architecture. By analyzing the speed vs. accuracy tradeoff, we propose strategies to select the optimal stopping time. We illustrate our protocol for the surface code equipped with a desktop implementation of the PyMatching decoder.
  arXiv  Detail & Related papers  (2023-10-23T19:30:08Z)
• 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)
• 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)
• 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.