Nearby in the stack

Results on two-bit gate design for quantum computers · arXivDesk

cond-mat/9409111Sep 26, 1994plain LaTeX with two ps figures. Submitted to: Proceedings of the Workshop on Physics and Computation, PhysComp '94 (Los Alamitos: IEEE Comp. Soc. Press, 1994)

Results on two-bit gate design for quantum computers

David P. DiVincenzo, John Smolin

cond-mat Lattice Theory Quantum Physics

arXiv PDF

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.

Briefing

What this paper is actually doing

Socratic margin

Ask the abstract

Questions are grounded in the title and abstract. If the PDF is required, arXivDesk will say so.