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

IEEE Spectrum

Amazingly accurate Quantum computing [News]

Published May 29, 2014• 0 citations
Publisher

Abstract

For Quantum computing to ever fulfill its promise, it will have to deal with errors. That‚s been a real problem until recently, because although scientists have come up with error-correction codes, the quantum machines available couldn‚t use them. Now researchers have finally created a small quantum-computing array that for the first time performs with enough accuracy to allow for error correction, paving the way toward practical machines that could outperform ordinary computers.

DOI
10.1109/mspec.2014.6821602

Related papers

Quantum Error Correction and Fault Tolerant Quantum Computing

Frank Gaitan

It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impossible. It provides in-depth coverage on the most important class of codes discovered to date—quantum stabilizer codes. It brings together the central themes of quantum error correction and fault-tolerant procedures to prove the accuracy threshold theorem for a particular noise error model. The author also includes a derivation of well-known bounds on the parameters of quantum error correcting code. Packed with over 40 real-world problems, 35 field exercises, and 17 worked-out examples, this book is the essential resource for any researcher interested in entering the quantum field as well as for those who want to understand how the unexpected realization of quantum computing is possible.

CRC Press eBooks•Dec 19, 2013•97 citations

The quest for a practical quantum advantage or the importance of applications for quantum computing

Jeanette Miriam Lorenz

Quantum computing as emerging technology raises high expectations to accelerate complicated calculations, superseding capabilities of presently available supercomputers and to provide a solution to the ever-increasing challenge of processing big amount of data. Besides theoretical promises, quantum computers have successfully been realized in experimental settings during the past few years, and can now also be accessed commercially. Given this availability of quantum computers, their application potential can be scrutinized. Promised to lead to disruptive changes in addressing and solving problems from the domains of simulation, optimization and machine learning, quantum computers have been researched in context of many application scenarios in industrial and academic setting in the recent years. However, it turns out that currently available quantum computers are still to small in size and limited in quality to fulfill the high hopes set in them at the moment. This review reflects on the current state of the technology coming from the perspective of the application, and indicates the developments required on hardware, software and algorithmic side to eventually make quantum computing beneficial for applications.

Modern Physics Letters A•Jul 20, 2024•2 citations

Optimal noise estimation from syndrome statistics of quantum codes

Thomas Wagner, Hermann Kampermann, Dagmar Bruß +1 more

Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough.To make this error correction competitive information about the specific noise is required.Traditionally, this information is obtained by benchmarking the device before operation.We address the question of what can be learned from only the measurements done during decoding.Such estimation of noise models was proposed for surface codes, exploiting their special structure, and in the limit of low error rates, also for other codes.However, so far it has been unclear under what general conditions noise models can be estimated from the syndrome measurements.In this work, we derive a general condition for identifiability of the error rates.For general stabilizer codes, we prove identifiability under the assumption that the rates are small enough.Without this assumption, we prove a result for perfect codes.Finally, we propose a practical estimation method with linear runtime for concatenated codes.We demonstrate that it outperforms other recently proposed methods and that the estimation is optimal in the sense that it reaches the Cramér-Rao bound.Our method paves the way for practical calibration of error corrected quantum devices during operation.

arXiv:2010.02243•Physical Review Research•Mar 31, 2021•18 citations

Reliable quantum computers

John P. Preskill

The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10–6, would be a formidable factoring engine. Even a smaller less–accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15 to 18 December 1996.

arXiv:quant-ph/9705031•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 8, 1998•1,034 citations

A scalable and real-time neural decoder for topological quantum codes

Andrew W. Senior, Thomas Edlich, Francisco J. H. Heras +21 more

Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits. Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable. This combination of requirements remains unmet by a machine-learning decoder, nor by any decoder for promising resource-efficient codes such as the color code. Here we introduce AlphaQubit 2, a neural-network decoder that achieves near-optimal logical error rates for both surface and color codes at scale under realistic noise. For the color code, it is orders of magnitude faster than other high-accuracy decoders. We demonstrate real-time decoding faster than 1μs per cycle on commercial accelerators: for the surface code to distance 11, with better accuracy than leading real-time decoders; and the first real-time decoding of the color code to distance 9. These results support the practical application of a wider class of promising QEC codes, and establish a credible path towards high-accuracy, real-time neural decoding at the scales required for fault-tolerant quantum computation.

quant-pharXiv:2512.07737•Dec 9, 2025•59 citations

Error-Correcting Code Keeps Quantum Computers on Track

Barry A. Cipra

Quantum computers, which could exploit systems such as the energy states of a row of atoms to perform vast numbers of computations at the same time, have remained in the realm of fantasy. A major barrier has been the fragility of quantum states, which makes quantum systems vulnerable to errors. Classical error-correction schemes won't work in a quantum computer, because they rely on duplicate bits, and in quantum systems information vanishes when you read and copy it. A new mathematical scheme, however, makes it possible—at least in theory—to nudge a quantum system back into line without directly looking at it. Computers/Math

Science•Apr 12, 1996•4 citations
For Quantum computing to ever fulfill its promise, it will have to deal with errors. That‚s been a real problem until recently, because although scientists have come up with error-correction codes, the quantum machines available couldn‚t use them. Now researchers have finally created a small quantum-computing array that for the first time performs with enough accuracy to allow for error correction, paving the way toward practical machines that could outperform ordinary computers.
It was once widely believed that quantum computation would never become a reality. However, the discovery of quantum error correction and the proof of the accuracy threshold theorem nearly ten years ago gave rise to extensive development and research aimed at creating a working, scalable quantum computer. Over a decade has passed since this monumental accomplishment yet no book-length pedagogical presentation of this important theory exists. Quantum Error Correction and Fault Tolerant Quantum Computing offers the first full-length exposition on the realization of a theory once thought impossible. It provides in-depth coverage on the most important class of codes discovered to date—quantum stabilizer codes. It brings together the central themes of quantum error correction and fault-tolerant procedures to prove the accuracy threshold theorem for a particular noise error model. The author also includes a derivation of well-known bounds on the parameters of quantum error correcting code. Packed with over 40 real-world problems, 35 field exercises, and 17 worked-out examples, this book is the essential resource for any researcher interested in entering the quantum field as well as for those who want to understand how the unexpected realization of quantum computing is possible.
Quantum computing as emerging technology raises high expectations to accelerate complicated calculations, superseding capabilities of presently available supercomputers and to provide a solution to the ever-increasing challenge of processing big amount of data. Besides theoretical promises, quantum computers have successfully been realized in experimental settings during the past few years, and can now also be accessed commercially. Given this availability of quantum computers, their application potential can be scrutinized. Promised to lead to disruptive changes in addressing and solving problems from the domains of simulation, optimization and machine learning, quantum computers have been researched in context of many application scenarios in industrial and academic setting in the recent years. However, it turns out that currently available quantum computers are still to small in size and limited in quality to fulfill the high hopes set in them at the moment. This review reflects on the current state of the technology coming from the perspective of the application, and indicates the developments required on hardware, software and algorithmic side to eventually make quantum computing beneficial for applications.
Quantum error correction allows to actively correct errors occurring in a quantum computation when the noise is weak enough.To make this error correction competitive information about the specific noise is required.Traditionally, this information is obtained by benchmarking the device before operation.We address the question of what can be learned from only the measurements done during decoding.Such estimation of noise models was proposed for surface codes, exploiting their special structure, and in the limit of low error rates, also for other codes.However, so far it has been unclear under what general conditions noise models can be estimated from the syndrome measurements.In this work, we derive a general condition for identifiability of the error rates.For general stabilizer codes, we prove identifiability under the assumption that the rates are small enough.Without this assumption, we prove a result for perfect codes.Finally, we propose a practical estimation method with linear runtime for concatenated codes.We demonstrate that it outperforms other recently proposed methods and that the estimation is optimal in the sense that it reaches the Cramér-Rao bound.Our method paves the way for practical calibration of error corrected quantum devices during operation.
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10–6, would be a formidable factoring engine. Even a smaller less–accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15 to 18 December 1996.
Fault-tolerant quantum computing will require error rates far below those achievable with physical qubits. Quantum error correction (QEC) bridges this gap, but depends on decoders being simultaneously fast, accurate, and scalable. This combination of requirements remains unmet by a machine-learning decoder, nor by any decoder for promising resource-efficient codes such as the color code. Here we introduce AlphaQubit 2, a neural-network decoder that achieves near-optimal logical error rates for both surface and color codes at scale under realistic noise. For the color code, it is orders of magnitude faster than other high-accuracy decoders. We demonstrate real-time decoding faster than 1μs per cycle on commercial accelerators: for the surface code to distance 11, with better accuracy than leading real-time decoders; and the first real-time decoding of the color code to distance 9. These results support the practical application of a wider class of promising QEC codes, and establish a credible path towards high-accuracy, real-time neural decoding at the scales required for fault-tolerant quantum computation.
Quantum computers, which could exploit systems such as the energy states of a row of atoms to perform vast numbers of computations at the same time, have remained in the realm of fantasy. A major barrier has been the fragility of quantum states, which makes quantum systems vulnerable to errors. Classical error-correction schemes won't work in a quantum computer, because they rely on duplicate bits, and in quantum systems information vanishes when you read and copy it. A new mathematical scheme, however, makes it possible—at least in theory—to nudge a quantum system back into line without directly looking at it. Computers/Math