A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes
- URL: http://arxiv.org/abs/2305.15767v1
- Date: Thu, 25 May 2023 06:23:32 GMT
- Title: A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes
- Authors: Mengyu Zhang, Xiangyu Ren, Guanglei Xi, Zhenxing Zhang, Qiaonian Yu,
Fuming Liu, Hualiang Zhang, Shengyu Zhang and Yi-Cong Zheng
- Abstract summary: 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)
- Score: 12.687083899824314
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum error-correcting codes (QECCs) can eliminate the negative effects of
quantum noise, the major obstacle to the execution of quantum algorithms.
However, realizing practical quantum error correction (QEC) requires resolving
many challenges to implement a high-performance real-time decoding system. Many
decoding algorithms have been proposed and optimized in the past few decades,
of which neural network (NNs) based solutions have drawn an increasing amount
of attention due to their high efficiency. Unfortunately, previous works on
neural decoders are still at an early stage and have only relatively simple
architectures, which makes them unsuitable for practical QEC. In this work, we
propose a scalable, fast, and programmable neural decoding system to meet the
requirements of FTQEC for rotated surface codes (RSC). Firstly, we propose a
hardware-efficient NN decoding algorithm with relatively low complexity and
high accuracy. Secondly, we develop a customized hardware decoder with
architectural optimizations to reduce latency. Thirdly, our proposed
programmable architecture boosts the scalability and flexibility of the decoder
by maximizing parallelism. Fourthly, we build an FPGA-based decoding system
with integrated control hardware for evaluation. Our $L=5$ ($L$ is the code
distance) decoder achieves an extremely low decoding latency of 197 ns, and the
$L=7$ configuration also requires only 1.136 $\mu$s, both taking $2L$ rounds of
syndrome measurements. The accuracy results of our system are close to minimum
weight perfect matching (MWPM). Furthermore, our programmable architecture
reduces hardware resource consumption by up to $3.0\times$ with only a small
latency loss. We validated our approach in real-world scenarios by conducting a
proof-of-concept benchmark with practical noise models, including one derived
from experimental data gathered from physical hardware.
Related papers
- A real-time, scalable, fast and highly resource efficient decoder for a
quantum computer [1.9479059801959495]
We introduce the Collision Clustering decoder, which overcomes both challenges.
We implement our decoder on both an FPGA and ASIC, the latter ultimately being necessary for any cost-effective scalable solution.
Our decoder is optimised to be both highly performant and resource efficient, while its implementation on hardware constitutes a viable path to practically realising fault-tolerant quantum computers.
arXiv Detail & Related papers (2023-09-11T15:46:27Z) - A Cryogenic Memristive Neural Decoder for Fault-tolerant Quantum Error
Correction [0.0]
We report the design and performance analysis of a neural decoder inference accelerator based on an in-memory computing architecture.
Hardware-aware training methods are developed to mitigate the loss in accuracy.
This work provides a pathway to scalable, fast, and low-power cryogenic IMC hardware for integrated QEC.
arXiv Detail & Related papers (2023-07-18T17:46:33Z) - 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) - 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) - NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for
Surface Codes [2.2749157557381245]
We propose an NN-based accurate, fast, and low-power decoder capable of decoding SCs and lattice surgery (LS) operations with measurement errors on ancillary qubits.
We evaluate the decoder performance by a quantum error simulator for the single logical qubit protection and the minimum operation of LS with code up to 13.
arXiv Detail & Related papers (2022-08-11T11:37:09Z) - 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) - Neural-Network Decoders for Quantum Error Correction using Surface
Codes:A Space Exploration of the Hardware Cost-Performance Trade-Offs [0.07734726150561086]
This work presents a space exploration of fully-connected feed-forward NN decoders for small distance surface codes.
The goal is to optimize the neural network for high decoding performance, while keeping a minimalistic hardware implementation.
We demonstrate that hardware based NN-decoders can achieve high decoding performance comparable to other state-of-the-art decoding algorithms.
arXiv Detail & Related papers (2022-02-11T16:27:14Z) - OMPQ: Orthogonal Mixed Precision Quantization [64.59700856607017]
Mixed precision quantization takes advantage of hardware's multiple bit-width arithmetic operations to unleash the full potential of network quantization.
We propose to optimize a proxy metric, the concept of networkity, which is highly correlated with the loss of the integer programming.
This approach reduces the search time and required data amount by orders of magnitude, with little compromise on quantization accuracy.
arXiv Detail & Related papers (2021-09-16T10:59:33Z) - Space-efficient binary optimization for variational computing [68.8204255655161]
We show that it is possible to greatly reduce the number of qubits needed for the Traveling Salesman Problem.
We also propose encoding schemes which smoothly interpolate between the qubit-efficient and the circuit depth-efficient models.
arXiv Detail & Related papers (2020-09-15T18:17:27Z) - AQD: Towards Accurate Fully-Quantized Object Detection [94.06347866374927]
We propose an Accurate Quantized object Detection solution, termed AQD, to get rid of floating-point computation.
Our AQD achieves comparable or even better performance compared with the full-precision counterpart under extremely low-bit schemes.
arXiv Detail & Related papers (2020-07-14T09:07:29Z) - NISQ+: Boosting quantum computing power by approximating quantum error
correction [6.638758213186185]
We design a method to boost the computational power of near-term quantum computers.
By approximating fully-fledged error correction mechanisms, we can increase the compute volume.
We demonstrate a proof-of-concept that approximate error decoding can be accomplished online in near-term quantum systems.
arXiv Detail & Related papers (2020-04-09T20:17:28Z)
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.