Artificial Neural Network Syndrome Decoding on IBM Quantum Processors
- URL: http://arxiv.org/abs/2311.15146v1
- Date: Sun, 26 Nov 2023 00:14:22 GMT
- Title: Artificial Neural Network Syndrome Decoding on IBM Quantum Processors
- Authors: Brhyeton Hall, Spiro Gicev, Muhammad Usman
- Abstract summary: Syndrome decoding is an integral but computationally demanding step in the implementation of quantum error correction for fault-tolerant quantum computing.
We show that Artificial Neural Network (ANN) decoding can efficiently decode syndrome measurement data from heavy-hexagonal code architecture.
Our work confirms the applicability of ANN decoding methods of syndrome data retrieved from experimental devices and establishes machine learning as a promising pathway for quantum error correction when quantum devices with below threshold error rates become available in the near future.
- Score: 0.7232471205719458
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Syndrome decoding is an integral but computationally demanding step in the
implementation of quantum error correction for fault-tolerant quantum
computing. Here, we report the development and benchmarking of Artificial
Neural Network (ANN) decoding on IBM Quantum Processors. We demonstrate that
ANNs can efficiently decode syndrome measurement data from heavy-hexagonal code
architecture and apply appropriate corrections to facilitate error protection.
The current physical error rates of IBM devices are above the code's threshold
and restrict the scope of our ANN decoder for logical error rate suppression.
However, our work confirms the applicability of ANN decoding methods of
syndrome data retrieved from experimental devices and establishes machine
learning as a promising pathway for quantum error correction when quantum
devices with below threshold error rates become available in the near future.
Related papers
- Advantage of Quantum Neural Networks as Quantum Information Decoders [1.1842028647407803]
We study the problem of decoding quantum information encoded in the groundspaces of topological stabilizer Hamiltonians.
We first prove that the standard stabilizer-based error correction and decoding schemes work adequately perturbed well in such quantum codes.
We then prove that Quantum Neural Network (QNN) decoders provide an almost quadratic improvement on the readout error.
arXiv Detail & Related papers (2024-01-11T23:56:29Z) - Testing the Accuracy of Surface Code Decoders [55.616364225463066]
Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC)
This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
arXiv Detail & Related papers (2023-11-21T10:22:08Z) - 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) - Real-Time Decoding for Fault-Tolerant Quantum Computing: Progress,
Challenges and Outlook [0.8066496490637088]
We highlight some of the key challenges facing the implementation of real-time decoders.
We lay out our perspective for the future development and provide a possible roadmap for the field of real-time decoding.
arXiv Detail & Related papers (2023-02-28T19:51:03Z) - 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) - Applying the Quantum Error-correcting Codes for Fault-tolerant Blind
Quantum Computation [33.51070104730591]
The Blind Quantum Computation (BQC) is a delegated protocol, which allows a client to rent a remote quantum server to implement desired quantum computations.
We propose a fault-tolerant blind quantum computation protocol with quantum error-correcting codes to avoid the accumulation and propagation of qubit errors during the computing.
arXiv Detail & Related papers (2023-01-05T08:52:55Z) - A scalable and fast artificial neural network syndrome decoder for
surface codes [0.8078491757252693]
We develop a scalable and fast syndrome decoder capable of decoding surface codes of arbitrary shape and size with data qubits suffering from the depolarizing error model.
Based on rigorous training over 50 million random quantum error instances, our ANN decoder is shown to work with code distances exceeding 1000.
arXiv Detail & Related papers (2021-10-12T09:41:09Z) - Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg
Atoms [55.41644538483948]
We provide the first complete characterization of sources of error in a neutral-atom quantum computer.
We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace.
Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
arXiv Detail & Related papers (2021-05-27T23:29:53Z) - Hardware-efficient error-correcting codes for large nuclear spins [62.997667081978825]
We present a hardware-efficient quantum protocol that corrects phase flips of a nuclear spin using explicit experimentally feasible operations.
Results provide a realizable blueprint for a corrected spin-based qubit.
arXiv Detail & Related papers (2021-03-15T17:14:48Z) - Deterministic correction of qubit loss [48.43720700248091]
Loss of qubits poses one of the fundamental obstacles towards large-scale and fault-tolerant quantum information processors.
We experimentally demonstrate the implementation of a full cycle of qubit loss detection and correction on a minimal instance of a topological surface code.
arXiv Detail & Related papers (2020-02-21T19:48:53Z)
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.