Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Analysis on optimal error threshold in surface code with loss of qubits

Masayuki Ohzeki

Published Feb 13, 2012• 0 citations
OpenAlex

Related papers

Quantum error correction below the surface code threshold

Google Quantum AI, Lee, Joonho

Proof

•Feb 12, 2025•0 citations

Error threshold estimates for surface code with loss of qubits

Masayuki Ohzeki

We estimate optimal thresholds for surface codes in the presence of loss via an analytical method developed in statistical physics. The optimal threshold for the surface code is closely related to a special critical point in a finite-dimensional spin glass, which is disordered magnetic material. We compare our estimations to the heuristic numerical results reported in earlier studies. Further application of our method to the depolarizing channel, a natural generalization of the noise model, unveils its wider robustness even with loss of qubits.

arXiv:1202.2593•Physical Review A•Jun 11, 2012•20 citations

Evaluation of the Performance of a 7-Qubit Surface Code

Ants Remm, Christian Kraglund Andersen, Stefania Lazar +6 more

Bulletin of the American Physical Society•Mar 6, 2020•0 citations

Thresholds of surface codes on the general lattice structures suffering biased error and loss

Yuuki Tokunaga, Keisuke Fujii

A family of surface codes with general lattice structures is proposed. We can control the error tolerances against bit and phase errors asymmetrically by changing the underlying lattice geometries. The surface codes on various lattices are found to be efficient in the sense that their threshold values universally approach the quantum Gilbert-Varshamov bound. We find that the error tolerance of the surface codes depends on the connectivity of the underlying lattices; the error chains on a lattice of lower connectivity are easier to correct. On the other hand, the loss tolerance of the surface codes exhibits an opposite behavior; the logical information on a lattice of higher connectivity has more robustness against qubit loss. As a result, we come upon a fundamental trade-off between error and loss tolerances in the family of surface codes with different lattice geometries.

AIP conference proceedings•Jan 1, 2014•1 citation

The intrinsic error thresholds of the surface code with correlated errors

Pejman Jouzdani, Eduardo R. Mucciolo, E. Novais

Bulletin of the American Physical Society•Mar 5, 2014•0 citations

Comparison of fault-tolerant thresholds for planar qudit geometries

Jacob A. Marks, Tomas Jochym-O’Connor, Vlad Gheorghiu

We introduce and analyze a new type of decoding algorithm called General Color Clustering (GCC), based on renormalization group methods, to be used in qudit color codes. The performance of this decoder is analyzed under code capacity depolarizing noise, and is used to obtain the first fault-tolerant threshold estimates for qudit 6-6-6 color codes. The proposed decoder is compared with similar decoding schemes for qudit surface codes as well as the current leading qubit decoders for both sets of codes. We find that, as with surface codes, clustering performs sub-optimally for qubit color codes, giving a threshold of $9.75\%$ compared to the $11.4\%$ obtained through surface projection decoding methods. However, the threshold rate increases by up to $75\%$ for large qudit dimensions, plateauing around $17.1\%$. All the analysis is performed using QTop, a new open-source software for simulating and visualizing topological quantum error correcting codes.

•Jan 9, 2017•1 citation
We estimate optimal thresholds for surface codes in the presence of loss via an analytical method developed in statistical physics. The optimal threshold for the surface code is closely related to a special critical point in a finite-dimensional spin glass, which is disordered magnetic material. We compare our estimations to the heuristic numerical results reported in earlier studies. Further application of our method to the depolarizing channel, a natural generalization of the noise model, unveils its wider robustness even with loss of qubits.
A family of surface codes with general lattice structures is proposed. We can control the error tolerances against bit and phase errors asymmetrically by changing the underlying lattice geometries. The surface codes on various lattices are found to be efficient in the sense that their threshold values universally approach the quantum Gilbert-Varshamov bound. We find that the error tolerance of the surface codes depends on the connectivity of the underlying lattices; the error chains on a lattice of lower connectivity are easier to correct. On the other hand, the loss tolerance of the surface codes exhibits an opposite behavior; the logical information on a lattice of higher connectivity has more robustness against qubit loss. As a result, we come upon a fundamental trade-off between error and loss tolerances in the family of surface codes with different lattice geometries.
We introduce and analyze a new type of decoding algorithm called General Color Clustering (GCC), based on renormalization group methods, to be used in qudit color codes. The performance of this decoder is analyzed under code capacity depolarizing noise, and is used to obtain the first fault-tolerant threshold estimates for qudit 6-6-6 color codes. The proposed decoder is compared with similar decoding schemes for qudit surface codes as well as the current leading qubit decoders for both sets of codes. We find that, as with surface codes, clustering performs sub-optimally for qubit color codes, giving a threshold of 9.75%9.75\%9.75% compared to the 11.4%11.4\%11.4% obtained through surface projection decoding methods. However, the threshold rate increases by up to 75%75\%75% for large qudit dimensions, plateauing around 17.1%17.1\%17.1%. All the analysis is performed using QTop, a new open-source software for simulating and visualizing topological quantum error correcting codes.