Modular decoding: parallelizable real-time decoding for quantum
computers
- URL: http://arxiv.org/abs/2303.04846v1
- Date: Wed, 8 Mar 2023 19:26:10 GMT
- Title: Modular decoding: parallelizable real-time decoding for quantum
computers
- Authors: H\'ector Bomb\'in, Chris Dawson, Ye-Hua Liu, Naomi Nickerson, Fernando
Pastawski, Sam Roberts
- Abstract summary: Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
- Score: 55.41644538483948
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Universal fault-tolerant quantum computation will require real-time decoding
algorithms capable of quickly extracting logical outcomes from the stream of
data generated by noisy quantum hardware. We propose modular decoding, an
approach capable of addressing this challenge with minimal additional
communication and without sacrificing decoding accuracy. We introduce the
edge-vertex decomposition, a concrete instance of modular decoding for
lattice-surgery style fault-tolerant blocks which is remarkably effective. This
decomposition of the global decoding problem into sub-tasks mirrors the
logical-block-network structure of a fault-tolerant quantum circuit. We
identify the buffering condition as a key requirement controlling decoder
quality; it demands a sufficiently large separation (buffer) between a
correction committed by a decoding sub-task and the data unavailable to it. We
prove that the fault distance of the protocol is preserved if the buffering
condition is satisfied. Finally, we implement edge-vertex modular decoding and
apply it on a variety of quantum circuits, including the Clifford component of
the 15-to-1 magic-state distillation protocol. Monte Carlo simulations on a
range of buffer sizes provide quantitative evidence that buffers are both
necessary and sufficient to guarantee decoder accuracy. Our results show that
modular decoding meets all the practical requirements necessary to support
real-world fault-tolerant quantum computers.
Related papers
- Localized statistics decoding: A parallel decoding algorithm for quantum low-density parity-check codes [3.001631679133604]
We introduce localized statistics decoding for arbitrary quantum low-density parity-check codes.
Our decoder is more amenable to implementation on specialized hardware, positioning it as a promising candidate for decoding real-time syndromes from experiments.
arXiv Detail & Related papers (2024-06-26T18:00:09Z) - Algorithmic Fault Tolerance for Fast Quantum Computing [37.448838730002905]
We show that fault-tolerant logical operations can be performed with constant time overhead for a broad class of quantum codes.
We prove that the deviation from the ideal measurement result distribution can be made exponentially small in the code distance.
Our work sheds new light on the theory of fault tolerance, potentially reducing the space-time cost of practical fault-tolerant quantum computation by orders of magnitude.
arXiv Detail & Related papers (2024-06-25T15:43:25Z) - Spatially parallel decoding for multi-qubit lattice surgery [0.10713888959520208]
Running quantum algorithms protected by quantum error correction requires a real time, classical decoder.
Most prior work on real time decoding has focused on an isolated logical qubit encoded in the surface code.
For surface code, quantum programs of utility will require multi-qubit interactions performed via lattice surgery.
A large merged patch can arise during lattice surgery -- possibly as large as the entire device.
arXiv Detail & Related papers (2024-03-03T00:17:13Z) - Fault-Tolerant Quantum Memory using Low-Depth Random Circuit Codes [0.24578723416255752]
Low-depth random circuit codes possess many desirable properties for quantum error correction.
We design a fault-tolerant distillation protocol for preparing encoded states of one-dimensional random circuit codes.
We show through numerical simulations that our protocol can correct erasure errors up to an error rate of $2%$.
arXiv Detail & Related papers (2023-11-29T19:00:00Z) - 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) - 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) - Error Correction Code Transformer [92.10654749898927]
We propose to extend for the first time the Transformer architecture to the soft decoding of linear codes at arbitrary block lengths.
We encode each channel's output dimension to high dimension for better representation of the bits information to be processed separately.
The proposed approach demonstrates the extreme power and flexibility of Transformers and outperforms existing state-of-the-art neural decoders by large margins at a fraction of their time complexity.
arXiv Detail & Related papers (2022-03-27T15:25:58Z) - Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs.
Super-Quantum Encoders [67.12391801199688]
We investigate dense coding by imposing various locality restrictions to our decoder.
In this task, the sender Alice and the receiver Bob share an entangled state.
arXiv Detail & Related papers (2021-09-26T07:29:54Z)
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.