pith. sign in

arxiv: cond-mat/9409111 · v1 · submitted 1994-09-26 · ❄️ cond-mat · hep-lat· hep-th· quant-ph

Results on two-bit gate design for quantum computers

classification ❄️ cond-mat hep-lathep-thquant-ph
keywords quantumgatetwo-bitgatesarbitrarycomputationdesignexactly
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.