A real-time, scalable, fast and highly resource efficient decoder for a
quantum computer
- URL: http://arxiv.org/abs/2309.05558v1
- Date: Mon, 11 Sep 2023 15:46:27 GMT
- Title: A real-time, scalable, fast and highly resource efficient decoder for a
quantum computer
- Authors: Ben Barber, Kenton M. Barnes, Tomasz Bialas, Okan Bu\u{g}dayc{\i},
Earl T. Campbell, Neil I. Gillespie, Kauser Johar, Ram Rajan, Adam W.
Richardson, Luka Skoric, Canberk Topal, Mark L. Turner, Abbas B. Ziad
- Abstract summary: 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.
- Score: 1.9479059801959495
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum computers promise to solve computing problems that are currently
intractable using traditional approaches. This can only be achieved if the
noise inevitably present in quantum computers can be efficiently managed at
scale. A key component in this process is a classical decoder, which diagnoses
the errors occurring in the system. If the decoder does not operate fast
enough, an exponential slowdown in the logical clock rate of the quantum
computer occurs. Additionally, the decoder must be resource efficient to enable
scaling to larger systems and potentially operate in cryogenic environments.
Here 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. We
simulate a logical memory experiment on large instances of the leading quantum
error correction scheme, the surface code, assuming a circuit-level noise
model. The FPGA decoding frequency is above a megahertz, a stringent
requirement on decoders needed for e.g. superconducting quantum computers. To
decode an 881 qubit surface code it uses only $4.5\%$ of the available logical
computation elements. The ASIC decoding frequency is also above a megahertz on
a 1057 qubit surface code, and occupies 0.06 mm$^2$ area and consumes 8 mW of
power. 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.
Related papers
- Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
We develop a reinforcement learning-based quantum compiler for a superconducting processor.
We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths.
Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
arXiv Detail & Related papers (2024-06-18T01:49:48Z) - A Scalable, Fast and Programmable Neural Decoder for Fault-Tolerant
Quantum Computation Using Surface Codes [12.687083899824314]
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)
arXiv Detail & Related papers (2023-05-25T06:23:32Z) - 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) - 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) - QECOOL: On-Line Quantum Error Correction with a Superconducting Decoder
for Surface Code [2.2749157557381245]
Surface code (SC) associated with its decoding algorithm is one of the most promising quantum error correction (QEC) methods.
In this paper, we propose an online-QEC algorithm and its hardware implementation with superconducting digital circuits.
Our decoder is simulated on a quantum error simulator for code 5 to 13 and achieves a 1.0% accuracy threshold.
arXiv Detail & Related papers (2021-03-26T01:51:15Z) - 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) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - 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) - 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.