Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cond-mat > arXiv:2510.05222

Help | Advanced Search

Condensed Matter > Statistical Mechanics

arXiv:2510.05222 (cond-mat)
[Submitted on 6 Oct 2025 (v1) , last revised 20 Oct 2025 (this version, v2)]

Title: Scalable accuracy gains from postselection in quantum error correcting codes

Title: 量子纠错码中后选择带来的可扩展精度提升

Authors:Hongkun Chen, Daohong Xu, Grace M. Sommers, David A. Huse, Jeff D. Thompson, Sarang Gopalakrishnan
Abstract: Decoding stabilizer codes such as the surface and toric codes involves evaluating free-energy differences in a disordered statistical mechanics model, in which the randomness comes from the observed pattern of error syndromes. We study the statistical distribution of logical failure rates across observed syndromes in the toric code, and show that, within the coding phase, logical failures are predominantly caused by exponentially unlikely syndromes. Therefore, postselecting on not seeing these exponentially unlikely syndrome patterns offers a scalable accuracy gain. In general, the logical error rate can be suppressed from $p_f$ to $p_f^b$, where $b \geq 2$ in general; in the specific case of the toric code with perfect syndrome measurements, we find numerically that $b = 3.1(1)$. Our arguments apply to general topological stabilizer codes, and can be extended to more general settings as long as the decoding failure probability obeys a large deviation principle.
Abstract: 解码如表面码和环面码这样的稳定子码涉及在无序统计力学模型中评估自由能差异,其中随机性来自于观测到的误差伴随式模式。 我们研究了环面码中观测到的伴随式逻辑故障率的统计分布,并表明在编码相内,逻辑故障主要由指数上不可能的伴随式引起。 因此,对未看到这些指数上不可能的伴随式模式进行后选择可以提供可扩展的精度提升。 一般来说,逻辑错误率可以从$p_f$降低到$p_f^b$,其中$b \geq 2$一般成立;在完美伴随式测量的环面码特定情况下,我们数值上发现$b = 3.1(1)$。 我们的论证适用于一般的拓扑稳定子码,并且只要解码失败概率满足大偏差原理,就可以扩展到更一般的设置。
Comments: 17 pages, 11 figures
Subjects: Statistical Mechanics (cond-mat.stat-mech) ; Quantum Physics (quant-ph)
Cite as: arXiv:2510.05222 [cond-mat.stat-mech]
  (or arXiv:2510.05222v2 [cond-mat.stat-mech] for this version)
  https://doi.org/10.48550/arXiv.2510.05222
arXiv-issued DOI via DataCite

Submission history

From: Hongkun Chen [view email]
[v1] Mon, 6 Oct 2025 18:00:47 UTC (1,571 KB)
[v2] Mon, 20 Oct 2025 17:09:20 UTC (1,571 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cond-mat.stat-mech
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cond-mat
quant-ph

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号