Quick Navigation
Topics
Trapped Ion Quantum Computing
Charge-Informed Quantum Error Correction
arXiv
Authors: Vlad Temkin, Zack Weinstein, Ruihua Fan, Daniel Podolsky, Ehud Altman
Year
2025
Paper ID
36194
Status
Preprint
Abstract Read
~2 min
Abstract Words
178
Citations
N/A
Abstract
We investigate the statistical physics of quantum error correction in {rm U}(1) symmetry-enriched topological quantum memories. Starting from a phenomenological error model of charge-conserving noise, we study the optimal decoder assuming the local charges of each anyon can be measured. The error threshold of the optimal decoder corresponds to a continuous phase transition in a disordered two-dimensional integer loop model on the Nishimori line. Using an effective replica field theory analysis and Monte Carlo numerics, we show that the optimal decoding transition exhibits Berezinskii-Kosterlitz-Thouless universality with a modified universal jump in winding number variance. We further generalize the model beyond the Nishimori line, which defines a large class of suboptimal decoders. At low nonzero temperatures and strong disorder, we find numerical evidence of a disorder-dominated loop-glass phase which corresponds to a "confidently incorrect" decoder. The zero-temperature limit defines the minimum-cost flow decoder, which serves as the {rm U}(1) analog of minimum-weight perfect matching in mathbb{Z}2 topological codes. Both the optimal and minimum-cost flow decoders are shown to dramatically outperform the charge-agnostic optimal decoder in symmetry-enriched topological codes.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2025 reference point for readers tracking recent quantum research.
- We investigate the statistical physics of quantum error correction in rm U(1) symmetry-enriched topological quantum memories.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.