2025/05/08 by Konstantin Tiurev, Tiurev, Konstantin, Christophe Goeller +11
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2505.05210
We present a two-step decoder for the parity code and evaluate its performance in code-capacity and faulty-measurement settings. For noiseless measurements, we find that the decoding problem can be reduced to a series of repetition codes while yielding near-optimal decoding for intermediate code sizes and achieving optimality in the limit of large codes. In the regime of unreliable measurements, the decoder demonstrates fault-tolerant thresholds above 5% at the cost of decoding a series of independent repetition codes in (1 + 1) dimensions. Such high thresholds, in conjunction with a practical decoder, efficient long-range logical gates, and suitability for planar implementation, position the parity architecture as a promising candidate for demonstrating quantum advantage on qubit platforms with strong noise bias.