2 citations · 2 across the 3 of their papers we have counts for
11 papers
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
Aydin Deger, Stergios Koutsioumpas, Mark Webster +3
We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…
An almost-linear time decoding algorithm for quantum LDPC codes under circuit-level noise
Antonio deMarti iOlius, Imanol Etxezarreta Martinez, Joschka Roffe +1
Fault-tolerant quantum computers must be designed in conjunction with classical co-processors that decode quantum error correction measurement information in real-time. In this wor…
Nearest-neighbour gates are all you need: High-rate quantum low-density parity-check codes on a planar grid
Boren Gu, Tamas Noszko, Vincent Steffan +4
High-performance quantum low-density parity-check codes promise substantial reductions in the overhead of fault-tolerant quantum computation, but most constructions require long-ra…
High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory
Thomas R. Scruby, Timo Hillmann, Joschka Roffe
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…
QGPU: Parallel logic in quantum LDPC codes
Boren Gu, Andy Zeyi Liu, Armanda O. Quintavalle +3
Quantum error correction is critical to the design and manufacture of scalable quantum computing systems. Recently, there has been growing interest in quantum low-density parity-ch…
Computing Efficiently in QLDPC Codes
Alexander J. Malcolm, Andrew N. Glaudell, Patricio Fuentes +10
It is the prevailing belief that quantum error correcting techniques will be required to build a utility-scale quantum computer able to perform computations that are out of reach o…