Quick Navigation
Topics
Trapped Ion Quantum Computing
An exact Error Threshold of Surface Code under Correlated Nearest-Neighbor Errors: A Statistical Mechanical Analysis
arXiv
Authors: SiYing Wang, ZhiXin Xia, Yue Yan, Xiang-Bin Wang
Year
2025
Paper ID
17986
Status
Preprint
Abstract Read
~2 min
Abstract Words
196
Citations
N/A
Abstract
The surface code represents a promising candidate for fault-tolerant quantum computation due to its high error threshold and experimental accessibility with nearest-neighbor interactions. However, current exact surface code threshold analyses are based on the assumption of independent and identically distributed (i.i.d.) errors. Though there are numerical studieds for threshold with correlated error, they are only the lower bond ranther than exact value, this offers potential for higher error thresholds.Here, we establish an error-edge map, which allows for the mapping of quantum error correction to a square-octagonal random bond Ising model. We then present the exact threshold under a realistic noise model that combines independent single-qubit errors with correlated errors between nearest-neighbor data qubits. Our method is applicable for any ratio of nearest-neighbor correlated errors to i.i.d. errors. We investigate the error correction threshold of surface codes and we present analytical constraints giving exact value of error threshold. This means that our error threshold is both upper bound and achievable and hence on the one hand the existing numerical threshold values can all be improved to our threshold value, on the other hand, our threshold value is highest achievable value in principle.
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.
- The surface code represents a promising candidate for fault-tolerant quantum computation due to its high error threshold and experimental accessibility with nearest-neighbor...
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.