Results on two-bit gate design for quantum computers
Abstract
We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is a universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very non-classical feature of the operation, its exact quantum phase factor.
Cite
@article{arxiv.cond-mat/9409111,
title = {Results on two-bit gate design for quantum computers},
author = {David P. DiVincenzo and John Smolin},
journal= {arXiv preprint arXiv:cond-mat/9409111},
year = {2007}
}
Comments
plain LaTeX with two ps figures. Submitted to: Proceedings of the Workshop on Physics and Computation, PhysComp '94 (Los Alamitos: IEEE Comp. Soc. Press, 1994)