SCCI Digital Library and Forum

Menu

Home
About Us
Video Library
eBooks
SCCI Forum

Home » Basic and Health Sciences » Physics » Quantum Information Science » Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity » Post-selection

Post-selection

Course:Quantum Information Science II, Part 2 - Efficient Quantum Computing - fault tolerance and complexity
Discipline:Basic and Health Sciences
Institute:MIT
Instructor(s): Prof. Isaac Chuang, Dr. Aram Harrow
Level:Undergraduate

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

Sialkot Chamber of Commerce & Industry P.O. Box 1870, Shahrah-e-Aiwan-e-Sanat-o-Tijarat, Sialkot City 51310 – Pakistan

Facebook Twitter Instagram

Need help?

+92-52-4261881-3

sialkot@scci.com.pk

Copyright © 2026 SCCI Digital Library and Forum | All Right Reserved. Developed By FARAZ SALEEM