Reproduce “Exponential T-Count Hardness and Stabilizer Rank from Syndrome Decoding” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yan Ru Pei
The authors reduce syndrome decoding to strong simulation of Clifford+T circuit amplitudes, encoding the code’s linear structure in Clifford gates and testing error weight with T gates. Each of at most N+1 adaptive queries uses 8A(N) T gates. The reduction is unconditional; under exponential decoding hardness, it rules out simulators with runtime 2^(αt) poly(g) when α<δ/8.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.