eBooks E-Books Examples of fault-tolerant and non-fault-tolerant procedures Cluster quantum computation – single qubit gate example I Exact Counting is contained in PostBQP Cluster quantum computation – process description Efficient quantum computing – codes and fault tolerance Cluster quantum computation – controlled-not gate example Crude estimate of the threshold for reliable quantum computation Classical simulation algorithms for quantum computational supremacy experiments Constructing the magic state for the T gate Beyond NP: starting with counting solutions Computational capacity – computation with noisy gates Beyond NP: approximate and exact counting Beyond Clifford gates – the Gottesman-Chuang hierarchy Approximate Counting is contained in Post-BPP Amplifying approximate counting accuracy A BQP-complete problem: quantum circuit evaluation « Previous 1 … 1,721 1,722 1,723 1,724 1,725 … 4,276 Next »
