Fault-tolerant quantum computation with constant error
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
SIAM Journal on Computing
Fault-tolerant quantum computation
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Self-testing of universal and fault-tolerant sets of quantum gates
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum Codes for Simplifying Design and Suppressing Decoherence in Superconducting Phase-Qubits
Quantum Information Processing
Algorithms on ensemble quantum computers
Natural Computing: an international journal
Characterization of universal two-qubit hamiltonian
Quantum Information & Computation
Quantum Information & Computation
High-fidelity single-qubit gates using non-adiabatic rapid passage
Quantum Information & Computation
High fidelity universal set of quantum gates using non-adiabatic rapid passage
Quantum Information & Computation
Encoded universality from a single physical interaction
Quantum Information & Computation
LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Classical simulations of Abelian-group normalizer circuits with intermediate measurements
Quantum Information & Computation
| Hi-index | 0.00 |
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 \math), 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 \math) 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 quantum basis.