High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory

We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers \((r,s)\) and have parameters \([\![2r^2s,2(r-1)^2,\leq2s]\!]\), with n...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2024-06
Main Authors: Scruby, Thomas R, Hillmann, Timo, Roffe, Joschka
Format: Article
Language:English
Subjects:
Decoding
Error correcting codes
Error correction
Fault tolerance
Parameters
Quantum phenomena
Qubits (quantum computing)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a new family of quantum low-density parity-check codes, which we call radial codes, obtained from the lifted product of a specific subset of classical quasi-cyclic codes. The codes are defined using a pair of integers \((r,s)\) and have parameters \([\![2r^2s,2(r-1)^2,\leq2s]\!]\), with numerical studies suggesting average-case distance linear in \(s\). In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance while using approximately five times fewer physical qubits. This is true even when radial codes are decoded using a single-shot approach, which can allow for faster logical clock speeds and reduced decoding complexity. We describe an intuitive visual representation, canonical basis of logical operators and optimal-length stabiliser measurement circuits for these codes, and argue that their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
ISSN:2331-8422