Level Reduction and the Quantum Threshold Theorem

TL;DR

This paper presents a simplified proof of the quantum threshold theorem using level reduction, extending it to various noise models and enabling improved bounds on the quantum accuracy threshold.

Contribution

It introduces a non-inductive proof technique based on level reduction, applicable to multiple noise types, and improves lower bounds on the quantum accuracy threshold.

Findings

Simplified proof of the quantum threshold theorem

Extension to coherent and leakage noise models

Improved lower bounds on the quantum accuracy threshold

Abstract

The quantum threshold theorem shows that a noisy quantum computer can accurately and efficiently simulate any ideal quantum computation provided that noise is weakly correlated and its strength is below a critical value known as the quantum accuracy threshold. This thesis provides a simpler and more transparent non-inductive proof of this theorem based on the concept of level reduction. This concept is also used in proving the quantum threshold theorem for coherent and leakage noise and for quantum computation by measurements. In addition, the proof provides a methodology which allows us to establish improved rigorous lower bounds on the value of the quantum accuracy threshold.