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

Physics

A Scalable Code for Reducing Quantum Errors

Sophia Chen

Published Sep 15, 2021• 0 citations
Publisher

Abstract

A new scheme could offer a technologically viable solution for remedying computational errors in near-term quantum devices.
DOI
10.1103/physics.14.s118

Related papers

Error range for encoding in imperfect quantum error correction

Ilan Cohn, Sebastian Fraga, Lucas Reyes +2 more

Abstract Quantum error correction (QEC) codes are vital for scalable and robust computations of quantum operations. The main challenge lies in introducing ancilla qubits with minimal side effect in the resultant computation, particularly considering state-of-the-art near-term devices. With the aim of identifying error value ranges that make encoding advantageous, the Shor code stands out as a viable first approach for a physical implementation of quantum error correction, due to its simpler structure. The noise models utilized, through their Operator Sum Representation (OSR), can be extrapolated, as these are typical of the majority of current technologies. In this article, error widths are analytically determined such that it becomes worthwhile to transmit information through encoding.

•Mar 7, 2024•0 citations

Streamlined Quantum Error Correction

Ryan Wilkinson

A new method for fixing errors in quantum computations can be just as accurate as previous approaches while needing fewer resources.

Physics•Jan 9, 2025•0 citations

Algorithmic Complexity Theory for Quantum Error Correction

Jincheng Zhang

Quantum error correction (QEC) is a critical component of future quantum computing, addressing the fragility of quantum information. Current error correction schemes, while effective, suffer from significant computational overhead, limiting the scalability of quantum devices. This paper explores the application of algorithmic complexity theory to design a novel complexity class and algorithm for QEC, specifically targeting near-term error correction. We introduce a new complexity measure that directly quantifies the 'complexity' of the error correction process, linking it to the underlying quantum system's dynamics. This approach aims to significantly reduce computational burden compared to existing methods, potentially unlocking practical quantum computing. The theoretical analysis reveals that this complexity measure offers a substantial improvement in error correction efficiency and robustness, offering a path towards more practical and scalable quantum technologies.

•Sep 2, 2026•0 citations

Technical perspective: Deciphering errors to reduce the cost of quantum computation

Daniel Gottesman

Communications of the ACM•Dec 17, 2020•2 citations

Improving readout in quantum simulations with repetition codes

Jakob Günther, Francesco Tacchino, James R. Wootton +2 more

Abstract Near term quantum computers suffer from the presence of different noise sources. In order to mitigate for this effect and acquire results with significantly better accuracy, there is the urge of designing efficient error correction or error mitigation schemes. The cost of such techniques is usually high in terms of resource requirements, either in hardware or at the algorithmic level. In this work, we follow a pragmatic approach and we use repetition codes as scalable schemes with the potential to provide more accurate solutions to problems of interest in quantum chemistry and physics. We investigate different repetition code layouts and we propose a circular repetition scheme with connectivity requirements that are native on IBM Quantum hardware. We showcase our approach in multiple IBM Quantum devices and validate our results using a simplified theoretical noise model. We highlight the effect of using the proposed scheme in an electronic structure variational quantum eigensolver calculation and in the simulation of time evolution for a quantum Ising model.

arXiv:2105.13377•Quantum Science and Technology•Oct 26, 2021•19 citations

Algorithmic aspects of quantum error-correcting codes

Markus Grassl

Computational matematics series/Computational mathematics series•Feb 14, 2002•7 citations
Abstract Quantum error correction (QEC) codes are vital for scalable and robust computations of quantum operations. The main challenge lies in introducing ancilla qubits with minimal side effect in the resultant computation, particularly considering state-of-the-art near-term devices. With the aim of identifying error value ranges that make encoding advantageous, the Shor code stands out as a viable first approach for a physical implementation of quantum error correction, due to its simpler structure. The noise models utilized, through their Operator Sum Representation (OSR), can be extrapolated, as these are typical of the majority of current technologies. In this article, error widths are analytically determined such that it becomes worthwhile to transmit information through encoding.
Quantum error correction (QEC) is a critical component of future quantum computing, addressing the fragility of quantum information. Current error correction schemes, while effective, suffer from significant computational overhead, limiting the scalability of quantum devices. This paper explores the application of algorithmic complexity theory to design a novel complexity class and algorithm for QEC, specifically targeting near-term error correction. We introduce a new complexity measure that directly quantifies the 'complexity' of the error correction process, linking it to the underlying quantum system's dynamics. This approach aims to significantly reduce computational burden compared to existing methods, potentially unlocking practical quantum computing. The theoretical analysis reveals that this complexity measure offers a substantial improvement in error correction efficiency and robustness, offering a path towards more practical and scalable quantum technologies.
Abstract Near term quantum computers suffer from the presence of different noise sources. In order to mitigate for this effect and acquire results with significantly better accuracy, there is the urge of designing efficient error correction or error mitigation schemes. The cost of such techniques is usually high in terms of resource requirements, either in hardware or at the algorithmic level. In this work, we follow a pragmatic approach and we use repetition codes as scalable schemes with the potential to provide more accurate solutions to problems of interest in quantum chemistry and physics. We investigate different repetition code layouts and we propose a circular repetition scheme with connectivity requirements that are native on IBM Quantum hardware. We showcase our approach in multiple IBM Quantum devices and validate our results using a simplified theoretical noise model. We highlight the effect of using the proposed scheme in an electronic structure variational quantum eigensolver calculation and in the simulation of time evolution for a quantum Ising model.