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

Journal of the Indian Institute of Science

Theory Behind Quantum Error Correcting Codes: An Overview

Shayan Srinivasa Garani, Priya J. Nadkarni, Ankur Raina

Published Apr 1, 2023• 9 citations
Publisher
DOI
10.1007/s41745-023-00392-7

Related papers

A survey on quantum error correcting codes

황규호

•Jan 1, 2018•0 citations

An Overview of Quantum Latin Squares in Quantum Information Theory

Abdul Fatah, Ian McLoughlin, Saim Ghafoor +1 more

Quantum Latin Squares have emerged as mathematical structures of interest in quantum information theory. This paper provides a comprehensive overview of quantum Latin squares. We aim to synthesize the current knowledge for the benefit of researchers in quantum information theory. We begin by establishing the theoretical foundation linking classical Latin squares with their quantum counterparts. This provides insight into their potential applications, particularly in the realm of quantum error correction. Through a detailed examination, we outline known constructions and elucidate the properties of quantum Latin squares, highlighting their role within quantum computing frameworks. We then explore the relationships of quantum Latin squares with mutually unbiased bases and unitary error bases. This underscores their importance in the construction of quantum error correcting codes using mutually orthogonal quantum Latin squares. We give significant focus to a comparative analysis between classical and quantum Latin squares, particularly in their applications to error correcting codes. The applications are analogous to the application of classical Latin squares to classical error correcting codes. This overview aims to not only compile existing research but also to inspire further exploration into Quantum Latin squares and their applications in quantum information theory.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Jul 1, 2024•0 citations

Introduction to Quantum Deletion Error-Correcting Codes

Manabu Hagiwara

This paper serves as an introductory overview of quantum deletion error-correction codes, a burgeoning field within quantum coding theory. Covering foundational concepts, existing research, and open questions, it aims to be the first accessible resource on the subject. This paper contains basic definitions of terms so that readers can read it regardless of their background. This paper invites readers to explore this primer and take their initial steps into the realm of quantum deletion error-correcting codes research.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 21, 2024•3 citations

Introduction to quantum error correction with stabilizer codes

Zachary P. Bradshaw, Jeffrey J. Dale, Ethan N. Evans

arXiv:2507.07121•Annals of Physics•Jan 27, 2026•3 citations

Developments in superconducting erasure qubits for hardware-efficient quantum error correction

Maria Violaris, Luciana Henaut, James Wills +3 more

Quantum computers are inherently noisy, and a crucial challenge for achieving large-scale, fault-tolerant quantum computing is to implement quantum error correction. A promising direction that has made rapid recent progress is to design hardware that has a specific noise profile, leading to a significantly higher threshold for noise with certain quantum error correcting codes. This Perspective focuses on erasure qubits, which enable hardware-efficient quantum error correction, by concatenating an inner code built-in to the hardware with an outer code. We focus on implementations of dual-rail encoded erasure qubits using superconducting qubits, giving an overview of recent developments in theory and simulation, and hardware demonstrators. We also discuss the differences between implementations; near-term applications using quantum error detection; and the open problems for developing this approach towards early fault-tolerant quantum computers.

quant-pharXiv:2601.02183•Jan 6, 2026•0 citations

Quantum error correction with the surface code

Alexander M. Dalzell, Sam McArdle, Mario Berta +10 more

This chapter provides an overview of how to perform quantum error correction using the surface code, which is the most well-studied quantum error correcting code for practical quantum computation. We provide formulas for the code distance—which determines the resource overhead when using the surface code—as a function of the desired logical error rate and underlying physical error rate. We discuss several decoders for the surface code and the possibility of experiencing the backlog problem if the decoder is too slow.

Cambridge University Press eBooks•Apr 24, 2025•0 citations
Quantum Latin Squares have emerged as mathematical structures of interest in quantum information theory. This paper provides a comprehensive overview of quantum Latin squares. We aim to synthesize the current knowledge for the benefit of researchers in quantum information theory. We begin by establishing the theoretical foundation linking classical Latin squares with their quantum counterparts. This provides insight into their potential applications, particularly in the realm of quantum error correction. Through a detailed examination, we outline known constructions and elucidate the properties of quantum Latin squares, highlighting their role within quantum computing frameworks. We then explore the relationships of quantum Latin squares with mutually unbiased bases and unitary error bases. This underscores their importance in the construction of quantum error correcting codes using mutually orthogonal quantum Latin squares. We give significant focus to a comparative analysis between classical and quantum Latin squares, particularly in their applications to error correcting codes. The applications are analogous to the application of classical Latin squares to classical error correcting codes. This overview aims to not only compile existing research but also to inspire further exploration into Quantum Latin squares and their applications in quantum information theory.
This paper serves as an introductory overview of quantum deletion error-correction codes, a burgeoning field within quantum coding theory. Covering foundational concepts, existing research, and open questions, it aims to be the first accessible resource on the subject. This paper contains basic definitions of terms so that readers can read it regardless of their background. This paper invites readers to explore this primer and take their initial steps into the realm of quantum deletion error-correcting codes research.
Quantum computers are inherently noisy, and a crucial challenge for achieving large-scale, fault-tolerant quantum computing is to implement quantum error correction. A promising direction that has made rapid recent progress is to design hardware that has a specific noise profile, leading to a significantly higher threshold for noise with certain quantum error correcting codes. This Perspective focuses on erasure qubits, which enable hardware-efficient quantum error correction, by concatenating an inner code built-in to the hardware with an outer code. We focus on implementations of dual-rail encoded erasure qubits using superconducting qubits, giving an overview of recent developments in theory and simulation, and hardware demonstrators. We also discuss the differences between implementations; near-term applications using quantum error detection; and the open problems for developing this approach towards early fault-tolerant quantum computers.
This chapter provides an overview of how to perform quantum error correction using the surface code, which is the most well-studied quantum error correcting code for practical quantum computation. We provide formulas for the code distance—which determines the resource overhead when using the surface code—as a function of the desired logical error rate and underlying physical error rate. We discuss several decoders for the surface code and the possibility of experiencing the backlog problem if the decoder is too slow.