DocumentCode
3450599
Title
On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor´s basis
Author
Boykin, P. Oscar ; Mor, Tal ; Pulver, Matthew ; Roychowdhury, Vwani ; Vatan, Farrokh
Author_Institution
Dept. of Electr. Eng., California Univ., Los Angeles, CA, USA
fYear
1999
fDate
1999
Firstpage
486
Lastpage
494
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 σz¼) 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 π) 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 P.W. Shor (1996) and A.Y. Kitaev (1997)
Keywords
fault tolerant computing; quantum gates; set theory; theorem proving; Controlled-NOT; Hadamard; Shor basis; alternative proof; constructive proof; double-qubit gate; fault-tolerant basis; fault-tolerant quantum computing; irrational multiples; quantum computation gates; realistic noisy environment; simplest universal basis; single-qubit gates; universality; Circuit faults; Computational modeling; Contracts; Error correction; Error-free operation; Fault tolerance; Quantum computing; Quantum mechanics; Subcontracting; Working environment noise;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1999. 40th Annual Symposium on
Conference_Location
New York City, NY
ISSN
0272-5428
Print_ISBN
0-7695-0409-4
Type
conf
DOI
10.1109/SFFCS.1999.814621
Filename
814621
Link To Document