eBooks E-Books Complexity and hardness – lecture introduction Fault-tolerant quantum computation – ingredients I Post-BPP is contained in Approximate Counting Complete problems and the generality of complexity class definitions – reductions Fault-tolerant quantum circuit construction example Models of quantum computation – perspective Cluster states and graph states – examples I Fault-tolerant non-clifford gates Models of computing – Turing machines II Cluster states and graph states – examples I Fault-tolerant measurements – scheme with error Models of computing – Turing machines I Cluster states and graph states – definition Fault-tolerant construction of a general element in C3 Models of computing – random and quantum Cluster quantum computation – single qubit gate example II « Previous 1 … 1,720 1,721 1,722 1,723 1,724 … 4,276 Next »
