Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity

A BQP-complete problem: quantum circuit evaluation

Amplifying approximate counting accuracy

Approximate Counting is contained in Post-BPP

Beyond Clifford gates – the Gottesman-Chuang hierarchy

Beyond NP: approximate and exact counting

Computational capacity – computation with noisy gates

Beyond NP: starting with counting solutions

Constructing the magic state for the T gate

Classical simulation algorithms for quantum computational supremacy experiments

Crude estimate of the threshold for reliable quantum computation

Cluster quantum computation – controlled-not gate example

Efficient quantum computing – codes and fault tolerance

Cluster quantum computation – process description

Exact Counting is contained in PostBQP

Cluster quantum computation – single qubit gate example I

Examples of fault-tolerant and non-fault-tolerant procedures

Cluster quantum computation – single qubit gate example II

Models of computing – random and quantum

Fault-tolerant construction of a general element in C3

Cluster states and graph states – definition

Models of computing – Turing machines I

Fault-tolerant measurements – scheme with error

Cluster states and graph states – examples I

Models of computing – Turing machines II

Fault-tolerant non-clifford gates