Simplified circuit-level decoding using Knill error correction
Ewan Murphy, Subhayan Sahu, Michael Vasmer

TL;DR
This paper investigates Knill error correction, demonstrating it can simplify decoding at the circuit level and reduce classical control requirements for scalable quantum computing.
Contribution
It provides a theoretical and numerical analysis of Knill error correction, proving fault tolerance and benchmarking its performance with quantum low-density parity-check codes.
Findings
Knill error correction is fault-tolerant under circuit-level noise.
Decoding for Knill correction can use the same decoder as simpler models.
Knill correction may reduce classical control demands for large-scale quantum computers.
Abstract
Quantum error correction will likely be essential for building a large-scale quantum computer, but it comes with significant requirements at the level of classical control software. In particular, a quantum error-correcting code must be supplemented with a fast and accurate classical decoding algorithm. Standard techniques for measuring the parity-check operators of a quantum error-correcting code involve repeated measurements, which both increases the amount of data that needs to be processed by the decoder, and changes the nature of the decoding problem. Knill error correction is a technique that replaces repeated syndrome measurements with a single round of measurements, but requires an auxiliary logical Bell state. Here, we provide a theoretical and numerical investigation into Knill error correction from the perspective of decoding. We give a self-contained description of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
