Papers
Topics
Authors
Recent
Search
2000 character limit reached

An exact Error Threshold of Surface Code under Correlated Nearest-Neighbor Errors: A Statistical Mechanical Analysis

Published 28 Oct 2025 in quant-ph | (2510.24181v1)

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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.