Recognition: unknown
On Universal and Fault-Tolerant Quantum Computing
read the original abstract
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${\sigma_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $\pi$) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by Shor and by Kitaev.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code
A code-switching protocol in the [[8,3,2]] code yields a universal scheme for postselected fault-tolerant quantum computation with quadratic logical error suppression.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.