Fault Tolerant Quantum Computation Understanding Quantum Information Computation Lesson 16

This is part of the Understanding Quantum Information u0026 Computation series. Watch the full playlist here: https://www.youtube.com/playlist?list=PLOFEBzvs-VvqKKMXX4vbi4EB1uaErFMSO. . This lesson starts with a basic framework for fault-tolerant quantum computing, including a short discussion of noise models and a methodology for fault tolerant implementations of quantum circuits. It then moves on to the important issue of error propagation in fault-tolerant quantum circuits and how to control it. The lesson concludes with a high-level discussion of the threshold theorem, which states that arbitrarily large quantum circuits can be implemented reliably, so long as the error rate for all of the components involved falls below a certain finite threshold value. This threshold value depends on the error correcting code that is used, as well as the specific choices that are made for fault-tolerant implementations of gates and measurements, but critically it does not depend on the size of the quantum circuit being implemented.. . 0:00 – Introduction. 1:48 – Overview. 3:14 – Model for fault tolerance. 6:42 – Fault-tolerant implementations. 9:22 – Error propagation. 12:03 – Transversal gates. 18:20 – Magic states. 25:43 – Fault-tolerant error correction. 28:43 – Threshold theorem. 36:17 – Conclusion. . Find the written content for this lesson on IBM Quantum Learning: https://learning.quantum.ibm.com/course/foundations-of-quantum-error-correction/fault-tolerant-quantum-computation