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

Bulletin of the American Physical Society

Evaluation of the Performance of a 7-Qubit Surface Code

Ants Remm, Christian Kraglund Andersen, Stefania Lazar, Nathan Lacroix, Sebastian Krinner, Graham J. Norris, Mihai S. Gabureac, Christopher Eichler, Andreas J. Wallraff

Published Mar 6, 2020• 0 citations
OpenAlex

Related papers

Demonstrating a four-qubit network for the surface code with superconducting qubits

Srikanth J. Srinivasan, Easwar Magesan, Jerry M. Chow +7 more

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

CaliQEC: In-situ Qubit Calibration for Surface Code Quantum Error Correction

Xiang Fang, Keyi Yin, Yuchen Zhu +8 more

Quantum Error Correction (QEC) is essential for fault-tolerant, large-scale quantum computation.However, error drift in qubits undermines QEC performance during long computations, necessitating frequent calibration.Conventional calibration methods disrupt quantum states, requiring system downtime and rendering in situ calibration impractical.To address this challenge, we propose QECali, a novel framework that enables in situ calibration for surface codes.Our evaluation demonstrates that QECali introduces modest qubit overhead and negligible increases in execution time, offering the first practical solution for in situ calibration in surface code based quantum computation.

Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 20, 2025•2 citations

INTRODUCTION TO SURFACE CODE QUANTUM COMPUTATION

Yidun Wan

•Sep 27, 2012•0 citations

Surface-Code Thresholds and Qubit Footprints in Shuttling-Based Spin-Qubit Railways

Arun John Moncy, Reza Dastbasteh, Josu Etxezarreta Martinez +5 more

We present a fault-tolerant mapping of rotated surface codes onto a $2\times N$ silicon spin-qubit railway architecture, utilizing electron shuttling to resolve the wiring fan-out bottleneck. Employing circuit-level noise modeling, we evaluate threshold performances across various noise biases. We demonstrate that shuttling check qubits instead of data qubits fundamentally improves system thresholds. Crucially, under a noise model biased towards dephasing for spin-qubit shuttling, the non-CSS XZZX surface code outperforms standard CSS variants. By tailoring the topological code to this specific inherent bias, we show that the Megaquop footprint is achievable with a distance 7 code requiring a $p = 10^{-3}$ physical error rate, highlighting a pathway for substantial hardware reductions in early fault-tolerant quantum processors.

quant-pharXiv:2605.05881•May 8, 2026•0 citations

Performance Analysis of Quantum Error-Correcting Surface Codes over Asymmetric Channels

Lorenzo Valentini, Diego Forlivesi, Marco Chiani

One of the main challenge for an efficient implementation of quantum information technologies is how to counteract quantum noise. Quantum error correcting codes are therefore of primary interest for the evolution towards quantum computing and quantum Internet. We here analyze the performance of surface codes, one of the most important class for practical implementations, on both symmetric and asymmetric quantum channels. We derive approximate expressions, confirmed by simulations, to evaluate the performance of surface codes and of XZZX codes, and provide a metric to assess the advantage of codes with respect to uncoded systems. Our findings allow to characterize the performance by means of analytical formulas of surface codes, like, for example, the [[13, 1, 3]], the [[23, 1, 3/5]], the [[33, 1, 3/7]], and the [[41, 1, 5]] surface codes.

arXiv:2302.13015•International Conference on Communications•May 28, 2023•6 citations

Design and Analysis of Superconducting Qubits for Extensible Surface Coding

Nadia Haider, Stefano Poletto, Alessandro Bruno +9 more

Bulletin of the American Physical Society•Mar 8, 2018•0 citations
Quantum Error Correction (QEC) is essential for fault-tolerant, large-scale quantum computation.However, error drift in qubits undermines QEC performance during long computations, necessitating frequent calibration.Conventional calibration methods disrupt quantum states, requiring system downtime and rendering in situ calibration impractical.To address this challenge, we propose QECali, a novel framework that enables in situ calibration for surface codes.Our evaluation demonstrates that QECali introduces modest qubit overhead and negligible increases in execution time, offering the first practical solution for in situ calibration in surface code based quantum computation.
We present a fault-tolerant mapping of rotated surface codes onto a 2×N2\times N2×N silicon spin-qubit railway architecture, utilizing electron shuttling to resolve the wiring fan-out bottleneck. Employing circuit-level noise modeling, we evaluate threshold performances across various noise biases. We demonstrate that shuttling check qubits instead of data qubits fundamentally improves system thresholds. Crucially, under a noise model biased towards dephasing for spin-qubit shuttling, the non-CSS XZZX surface code outperforms standard CSS variants. By tailoring the topological code to this specific inherent bias, we show that the Megaquop footprint is achievable with a distance 7 code requiring a p=10−3p = 10^{-3}p=10−3 physical error rate, highlighting a pathway for substantial hardware reductions in early fault-tolerant quantum processors.
One of the main challenge for an efficient implementation of quantum information technologies is how to counteract quantum noise. Quantum error correcting codes are therefore of primary interest for the evolution towards quantum computing and quantum Internet. We here analyze the performance of surface codes, one of the most important class for practical implementations, on both symmetric and asymmetric quantum channels. We derive approximate expressions, confirmed by simulations, to evaluate the performance of surface codes and of XZZX codes, and provide a metric to assess the advantage of codes with respect to uncoded systems. Our findings allow to characterize the performance by means of analytical formulas of surface codes, like, for example, the [[13, 1, 3]], the [[23, 1, 3/5]], the [[33, 1, 3/7]], and the [[41, 1, 5]] surface codes.