Classical error correction
Now that you have learned how spin-qubits in Germanium are created, tuned, and operated, you will learn another critical aspect of quantum computers: quantum error correction. Quantum error correction is crucial for performing error-free quantum algorithms and scaling quantum computers beyond the few tens of qubits achievable today.
This video introduces a few basic concepts of error correction in classical information theory as a preparation for quantum error correction, which is presented in Parts 2 and 3. These include the repetition code, the concepts of the decoder, the majority vote decoder and the maximum likelihood decoder, performance measures of error correcting codes, code distance, break-even point, and error threshold.
Prerequisite knowledge
- Elementary probability theory
Main takeaways
-
Information encoded in physical bits is corrupted due to noise imposed on the bits by their environment.
-
Noise effects can be mitigated if the information is stored redundantly.
-
Increasing the redundancy can lead to increased protection.
-
For the classical repetition code, the simplest decoder is the majority vote decoder.
-
Often-used concepts to characterize error correction schemes are the logical error probability, the break-even point, and the error threshold.
Further thinking
True or False: For a typical error correction scheme, if the physical error is below the break-even point, then the logical error is below the physical error.
Further reading
This classic textbook has a chapter on quantum error correction, which starts with a with a description of the classical repetition code.
Michael Nielsen and Isaac Chuang, Quantum Information and Quantum Computation, Cambridge University Press. Chapter 10.1
https://www.cambridge.org/highereducation/books/quantum-computation-and-quantum-information/01E10196D0A682A6AEFFEA52D53BE9AE#overview