Abstract

Quantum error correction is an essential technique for constructing a scalable quantum computer. In order to implement quantum error correction with near-term quantum devices, a fast and near-optimal decoding method is demanded. A decoder based on machine learning is considered as one of the most viable solutions for this purpose, since its prediction is fast once training has been done, and it is applicable to any quantum error correcting code and any noise model. So far, various formulations of the decoding problem as the task of machine learning have been proposed. Here, we discuss general constructions of machine-learning-based decoders. We found several conditions to achieve near-optimal performance, and proposed a criterion which should be optimized when a size of training data set is limited. We also discuss preferable constructions of neural networks, and proposed a decoder using spatial structures of topological codes using a convolutional neural network. We numerically show that our method can improve the performance of machine-learning-based decoders in various topological codes and noise models.

Highlights

  • In order to build a scalable quantum computer, quantum error correction (QEC) [1,2,3] is a vital technique for achieving reliable computation

  • We propose the use of construction of neural networks which explicitly utilize the spatial structure of the topological codes

  • We review the basics of the supervised machine learning with neural networks

Read more

Summary

INTRODUCTION

In order to build a scalable quantum computer, quantum error correction (QEC) [1,2,3] is a vital technique for achieving reliable computation. One approach is to use the most likely physical errors that are consistent with the observed syndrome value as a recovery operation This scheme is called the minimum-distance (MD) decoder. The machine-learning-based decoder using a neural network is called a neural decoder [24] All these existing methods numerically showed that the performance of the neural decoder is superior to the known efficient decoders when a sufficiently large amount of the training data set is supplied. We show that the performance of the neural decoder is improved with these techniques, and it shows better performance than that of a decoder using minimum-weight perfect matching with a 106 data set at a distance d = 11 in the surface code under a depolarizing noise. The neural decoder can be used as a fast, versatile, and high-performance decoder for decoding topological stabilizer codes

Organization of the article
PRELIMINARY INFORMATION
Quantum error correction
Binary representation of stabilizer code
Optimal and near-optimal decoders
Topological code
Supervised machine learning
CONSTRUCTION OF TASKS OF MACHINE-LEARNING-BASED DECODERS
Linear prediction framework
Criterion for diagnosis matrix
Uniform data construction
Construction of data set and example
Relation to existing methods
Numerical result
UTILIZING SPATIAL INFORMATION
Importance of the spatial information
Construction of the network
CONCLUSION
Proof of the existence of faithful and decomposable diagnosis matrices
Details about the multilayer perceptron
Details about the Convolutional Neural Network
Findings
Implementation of the minimum-distance decoder

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.