The checkerboard fracton code achieves a code-capacity threshold of p_th ≈ 0.107(3) under stochastic Pauli noise, the highest among known 3D codes and near the theoretical limit.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
fields
quant-ph 2years
2025 2verdicts
UNVERDICTED 2roles
background 1polarities
support 1representative citing papers
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.
citing papers explorer
-
Error Resilience of Fracton Codes and Near Saturation of Code-Capacity Threshold in Three Dimensions
The checkerboard fracton code achieves a code-capacity threshold of p_th ≈ 0.107(3) under stochastic Pauli noise, the highest among known 3D codes and near the theoretical limit.
-
Mind the gaps: The fraught road to quantum advantage
The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.