• Corpus ID: 252368194

Parallel window decoding enables scalable fault tolerant quantum computation

  title={Parallel window decoding enables scalable fault tolerant quantum computation},
  author={Luka Skoric and Dan E. Browne and Kenton M. Barnes and Neil I. Gillespie and Earl T. Campbell},
Large-scale quantum computers have the potential to hold computational capabilities beyond conventional computers for certain problems. However, the physical qubits within a quantum computer are prone to noise and decoherence, which must be corrected in order to perform reliable, fault-tolerant quantum computations. Quantum Error Correction (QEC) provides the path for realizing such computations. QEC continuously generates a continuous stream of data that decoders must process at the rate it is… 

Figures from this paper

Experimental demonstration of the advantage of adaptive quantum circuits

It is experimentally demonstrated that even a noisy adaptive quantum circuit of constant depth can achieve a task that is impossible for any purely unitary quantum Circuit of identical depth: the preparation of long-range entangled topological states with high fidelity.



Topological quantum memory

We analyze surface codes, the topological quantum error-correcting codes introduced by Kitaev. In these codes, qubits are arranged in a two-dimensional array on a surface of nontrivial topology, and

Quantum error correction for quantum memories

It may seem inevitable that highly entangled quantum states are susceptible to disturbance through interaction with a decohering environment. However, certain multiqubit entangled states are well

Scalable surface code decoders with parallelization in time

This work introduces a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism, which can solve the decoding throughput problem as the code scales up, even if the inner decoder is slow.

NEO-QEC: Neural Network Enhanced Online Superconducting Decoder for Surface Codes

An NN-based accurate, fast, and low-power decoder capable of decoding SCs and lattice surgery operations with measurement errors on ancillary qubits is proposed and a binarized NN is applied to achieve both accuracy and hardware efficiency of the SC decoder.

Techniques for combining fast local decoders with global decoders under circuit-level noise

This work introduces the construction of local neural network (NN) decoders using three-dimensional convolutions, and considers a strategy of performing a syndrome collapse which removes many vertical pairs and reduces the size of the decoding graph used by the global decoder.

Perspective on the Current State-of-the-Art of Quantum Computing for Drug Discovery Applications

Computational chemistry is an essential tool in the pharmaceutical industry. Quantum computing is a fast evolving technology that promises to completely shift the computational capabilities in many

Pipelined correlated minimum weight perfect matching of the surface code

A pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events, and validate the new algorithm on the fully fault-tolerant toric, unrotated, and rotated surface codes, all with standard depolarizing noise.

Matching and maximum likelihood decoding of a multi-round subsystem quantum error correction experiment

It is shown that the logical error varies depending on the use of a perfect matching decoder compared to a maximum likelihood decoder, and more significant improvements to decoders are likely on the horizon as quantum hardware has reached a new stage of development towards fully fault-tolerant operations.

Fragile boundaries of tailored surface codes

Biased noise is common in physical qubits, and tailoring a quantum code to the bias by locally modifying stabilizers or changing boundary conditions has been shown to greatly increase error

Circuit-level protocol and analysis for twist-based lattice surgery

The first circuit-level error correction simulations during twist-based lattice surgery using a biased depolarizing noise model are undertaken and a slight decrease in the threshold for timelike logical failures is indicated.