AI 中文总结
该研究为量子纠错构建场论框架，围绕酉融合范畴中的融合空间码，区分诊断与综合征代数，给出精确可纠条件及测量恢复分解，通过伊辛理论举例，还证明条件阈值定理，最后指出相关表示理论和代数几何方向。
AI 中文摘要
我们为量子纠错开发了一个场论框架，该框架以酉融合范畴中的融合空间码为中心。可允许簇确定总电荷扇区，正交足迹投影仪记录错误历史留下的局部可见数据。核心区别在于诊断足迹代数和综合征可允许对易代数：后者可以在不揭示逻辑信息的情况下进行测量，并将选定的错误代表分解为测量扇区。对于此类代数，精确可纠性等同于纤维状的Knill-Laflamme条件，产生一种先测量后恢复的分解。在可收缩真空局部性假设下，封闭中性复合体为代码上的标量作用提供了一个范畴充分标准。在伊辛理论中，四个σ穿孔表明对电荷足迹可以是互补的逻辑诊断，并实现精确的单比特克利福德阴影。一个合适的六σ码允许进行综合征可允许的对电荷测量，并从显式的马约拉纳双线性错误中精确恢复。第二个双线性具有相同的测量足迹，但相差一个逻辑比特翻转，产生一个具体的非平凡足迹纤维和真正的解码模糊性。我们还制定了共形块似然数据，并计算了依赖几何的伊辛四点权重。对于不断增长的码族，我们证明了一个条件皮尔斯型阈值定理：有界连通区域增长、局部随机噪声、小残留分量的局部可中和性以及分量解码器平衡意味着在非零常数错误率以下，\(\Pr_L(\mathrm{fail})\le C|\Omega_L|e^{-cL}\)。我们以涉及管代数和霍普夫代数、杨式结构、希格斯丛、谱曲线、雅可比和阿贝尔簇的表示理论和代数几何方向作为结论。
英文摘要
We develop a field-theoretic framework for quantum error correction centred on fusion-space codes in unitary fusion categories. Admissible clusters determine total-charge sectors and orthogonal footprint projectors recording locally visible data left by error histories. The central distinction is between diagnostic footprint algebras and syndrome-admissible commuting algebras: the latter can be measured without revealing logical information and resolve chosen error representatives into measured sectors. For such algebras, exact correctability is equivalent to fibrewise Knill--Laflamme conditions, yielding a measure-then-recover factorization. Under a contractible-vacuum locality hypothesis, closed neutral composites give a categorical sufficient criterion for scalar action on the code. In the Ising theory, four $σ$ punctures show that pair-charge footprints can be complementary logical diagnostics and realize an exact one-qubit Clifford shadow. A proper six-$σ$ code instead admits a syndrome-admissible pair-charge measurement and exact recovery from an explicit Majorana bilinear error. A second bilinear has the same measured footprint but differs by a logical bit flip, producing a concrete nontrivial footprint fibre and genuine decoding ambiguity. We also formulate conformal-block likelihood data and compute geometry-dependent Ising four-point weights. For growing code families, we prove a conditional Peierls-type threshold theorem: bounded connected-region growth, local stochastic noise, local neutralizability of small residual components, and componentwise decoder balance imply $\Pr_L(\mathrm{fail})\le C|Ω_L|e^{-cL}$ below a nonzero constant error rate. We conclude with representation-theoretic and algebro-geometric directions involving tube and Hopf algebras, Yangian-type structures, Higgs bundles, spectral curves, Jacobians, and abelian varieties.
Comments69 pages, 6 figures, 4 tables
