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

arXiv:1609.04673 · Physical Review X

Poking Holes and Cutting Corners to Achieve Clifford Gates with the Surface Code

Benjamin J. Brown, Katharina Laubscher, Markus S. Kesselring, James R. Wootton

Published May 24, 2017• 161 citations
arXivHTMLPDF

Abstract

Error correction is essential to the development of practical quantum computers, but a leading method that relies on ``surface codes'' requires distinct and seemingly incompatible approaches to different computational operations. A new framework unifies these schemes and shows how to combine and compare different codes, an important tool for universal quantum computation.

DOI
10.1103/physrevx.7.021029

Related papers

Decoding algorithms for surface codes

Antonio deMarti iOlius, Patricio Fuentes, Román Orús +2 more

Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.

arXiv:2307.14989•Quantum•Oct 10, 2024•92 citations

Quantum error correction: an introductory guide

Joschka Roffe

Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are described using the simplest examples of detection and correction codes, the working of which can be verified by hand. We outline the construction and operation of the surface code, the most widely pursued error correction protocol for experiment. Finally, we discuss issues that arise in the practical implementation of the surface code and other quantum error correction codes.

arXiv:1907.11157•Contemporary Physics•Jul 3, 2019•470 citations

The Hitchhiker’s Guide to the Surface Code

Fang Zhang, Jianxin Chen

Error correction is an essential part of the theory of quantum computation. However, new quantum computation students may find the theories of error correction and fault tolerance daunting, or they may be stuck with theoretical/outdated schemes (such as the one in the original proof of the threshold theorem by Aharonov and Ben-or) with unrealistically low thresholds and/or high overhead. In this article, we describe an adequately modern approach to fault-tolerant quantum computation based on the surface code and lattice surgery. The reader is assumed to have a basic understanding of quantum computation (state vectors, unitary gates, and measurements, etc.), but no prior knowledge about quantum codes or quantum error correction is needed.

Entropy•Feb 22, 2026•1 citation

Benchmarking and Analysis of Quantum Error Correction Codes

Rohan Timmaraju

Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.

Journal of Student Research•Aug 31, 2023•0 citations

Protecting Quantum Gates Using Quantum Topological Error Correction Codes

Zunaira Babar, Daryus Chandra, Soon Xin Ng +1 more

A general framework is proposed for improving the performance of transversal quantum Clifford gates by protecting them with quantum topological error correction codes (QTECCs). A general method is developed in which transversal Hadamard and CNOT gates are combined with stabilizer codes, including surface, rotated-surface, color, and toric codes, while only relying on a single stabilizer measurement per operator. The analysis demonstrates that the localized stabilizer structure of QTECCs preserves fault tolerance under transversal implementations and facilitates beneficial qubit error rate improvements. It is quantified under conditions where they are capable of offering beneficial reliability improvements. It is shown both in terms of analytical bounds and simulation-based evaluations that QTECC-protected Clifford gates are capable of outperforming unprotected implementations, thereby establishing practical conditions for realizing fault-tolerant large-scale quantum computation.

Wiley eBooks•Dec 18, 2025•0 citations

Quantum Computing with Rotation-Symmetric Bosonic Codes

Arne L. Grimsmo, Joshua Combes, Ben Q. Baragiola

A unifying framework for quantum error-correcting codes based on collections of bosons allows for the discovery of new codes that provide robust error correction in line with fundamental theoretical limits.

arXiv:1901.08071•Physical Review X•Mar 6, 2020•208 citations
Error correction is essential to the development of practical quantum computers, but a leading method that relies on ``surface codes'' requires distinct and seemingly incompatible approaches to different computational operations. A new framework unifies these schemes and shows how to combine and compare different codes, an important tool for universal quantum computation.
Quantum technologies have the potential to solve certain computationally hard problems with polynomial or super-polynomial speedups when compared to classical methods. Unfortunately, the unstable nature of quantum information makes it prone to errors. For this reason, quantum error correction is an invaluable tool to make quantum information reliable and enable the ultimate goal of fault-tolerant quantum computing. Surface codes currently stand as the most promising candidates to build near term error corrected qubits given their two-dimensional architecture, the requirement of only local operations, and high tolerance to quantum noise. Decoding algorithms are an integral component of any error correction scheme, as they are tasked with producing accurate estimates of the errors that affect quantum information, so that they can subsequently be corrected. A critical aspect of decoding algorithms is their speed, since the quantum state will suffer additional errors with the passage of time. This poses a connundrum, where decoding performance is improved at the expense of complexity and viceversa. In this review, a thorough discussion of state-of-the-art decoding algorithms for surface codes is provided. The target audience of this work are both readers with an introductory understanding of the field as well as those seeking to further their knowledge of the decoding paradigm of surface codes. We describe the core principles of these decoding methods as well as existing variants that show promise for improved results. In addition, both the decoding performance, in terms of error correction capability, and decoding complexity, are compared. A review of the existing software tools regarding surface codes decoding is also provided.
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are described using the simplest examples of detection and correction codes, the working of which can be verified by hand. We outline the construction and operation of the surface code, the most widely pursued error correction protocol for experiment. Finally, we discuss issues that arise in the practical implementation of the surface code and other quantum error correction codes.
Error correction is an essential part of the theory of quantum computation. However, new quantum computation students may find the theories of error correction and fault tolerance daunting, or they may be stuck with theoretical/outdated schemes (such as the one in the original proof of the threshold theorem by Aharonov and Ben-or) with unrealistically low thresholds and/or high overhead. In this article, we describe an adequately modern approach to fault-tolerant quantum computation based on the surface code and lattice surgery. The reader is assumed to have a basic understanding of quantum computation (state vectors, unitary gates, and measurements, etc.), but no prior knowledge about quantum codes or quantum error correction is needed.
Quantum Computing is a computing framework that takes advantage of unique quantum mechanical properties (such as superposition and entanglement) to perform calculations and implement algorithms that could offer exponential speed-ups over classical computing. However, in physical implementations of such quantum computers, qubits – the fundamental components of these systems – can accumulate errors that must be accounted for. In order to mitigate these errors, various quantum error correction (QEC) codes have been developed, including the repetition code and surface codes. In this experiment I implement and evaluate three types of QEC codes on the Qiskit simulator to compare their efficacy and applicability in correcting for different kinds of errors. I hypothesize that surface codes, with their more effective design and range of correction methods, should perform the best with much lower error thresholds and resultant logical error rates. The results support the hypothesis and suggest that surface codes are a viable method of implementing scalable error correction in quantum computers.
A general framework is proposed for improving the performance of transversal quantum Clifford gates by protecting them with quantum topological error correction codes (QTECCs). A general method is developed in which transversal Hadamard and CNOT gates are combined with stabilizer codes, including surface, rotated-surface, color, and toric codes, while only relying on a single stabilizer measurement per operator. The analysis demonstrates that the localized stabilizer structure of QTECCs preserves fault tolerance under transversal implementations and facilitates beneficial qubit error rate improvements. It is quantified under conditions where they are capable of offering beneficial reliability improvements. It is shown both in terms of analytical bounds and simulation-based evaluations that QTECC-protected Clifford gates are capable of outperforming unprotected implementations, thereby establishing practical conditions for realizing fault-tolerant large-scale quantum computation.