Deep neural decoders for near term fault-tolerant experiments

by   Christopher Chamberland, et al.

Finding efficient decoders for quantum error correcting codes adapted to realistic experimental noise in fault-tolerant devices represents a significant challenge. In this paper we introduce several decoding algorithms complemented by deep neural decoders and apply them to analyze several fault-tolerant error correction protocols such as the surface code as well as Steane and Knill error correction. Our methods require no knowledge of the underlying noise model afflicting the quantum device making them appealing for real-world experiments. Our analysis is based on a full circuit-level noise model. It considers both distance-three and five codes, and is performed near the codes pseudo-threshold regime. Training deep neural decoders in low noise rate regimes appears to be a challenging machine learning endeavour. We provide a detailed description of our neural network architectures and training methodology. We then discuss both the advantages and limitations of deep neural decoders. Lastly, we provide a rigorous analysis of the decoding runtime of trained deep neural decoders and compare our methods with anticipated gate times in future quantum devices. Given the broad applications of our decoding schemes, we believe that the methods presented in this paper could have practical applications for near term fault-tolerant experiments.


page 13

page 15


Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit

This paper explores a new approach to fault-tolerant quantum computing, ...

Reinforcement Learning Decoders for Fault-Tolerant Quantum Computation

Topological error correcting codes, and particularly the surface code, c...

A Cryogenic Memristive Neural Decoder for Fault-tolerant Quantum Error Correction

Neural decoders for quantum error correction (QEC) rely on neural networ...

Biological error correction codes generate fault-tolerant neural networks

It has been an open question in deep learning if fault-tolerant computat...

Finding fault-tolerant Clifford circuits using satisfiability modulo theories solvers and decoding merged color-surface codes

Universal fault-tolerant quantum computers will require the use of effic...

Advantages of versatile neural-network decoding for topological codes

Finding optimal correction of errors in generic stabilizer codes is a co...

Quantitative Robustness Analysis of Quantum Programs (Extended Version)

Quantum computation is a topic of significant recent interest, with prac...

Please sign up or login with your details

Forgot password? Click here to reset