Results 1  10
of
149,791
Results on twobit gate design for quantum computers
 Proceedings of the Workshop on Physics and Computation, PhysComp ’94 (Los Alamitos: IEEE Comp. Soc
, 1994
"... We present numerical results which show how twobit 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 twobit gates. An arbitrar ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
We present numerical results which show how twobit 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 twobit gates
TwoBit Gates Are Universal for Quantum Computation
, 1995
"... A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of threebit gates, by analogy to the universality of ..."
Abstract

Cited by 182 (10 self)
 Add to MetaCart
of the Toffoli threebit gate of classical reversible computing. Twobit quantum gates may be implemented by magnetic resonance operations applied to a pair of electronic or nuclear spins. A "gearbox quantum computer" proposed here, based on the principles of atomic force microscopy, would permit
twogat05.latex–submitted to Phys. Rev. A (AT5101); condmat/9407022 Twobit gates are universal for quantum computation
, 1994
"... A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of threebit gates, by analogy to the universality of ..."
Abstract
 Add to MetaCart
of the Toffoli threebit gate of classical reversible computing. Twobit quantum gates may be implemented by magnetic resonance operations applied to a pair of electronic or nuclear spins. A “gearbox quantum computer ” proposed here, based on the principles of atomic force microscopy, would permit the operation
Quantum Gates and Circuits
 in Proceedings of the ITP Conference on Quantum Coherence and Decoherence
, 1996
"... A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental twobit gate for quantum computation. This gate plays a central role in networks for quantum error correct ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
A historical review is given of the emergence of the idea of the quantum logic gate from the theory of reversible Boolean gates. I highlight the quantum XOR or controlled NOT as the fundamental twobit gate for quantum computation. This gate plays a central role in networks for quantum error
IASSNSHEP95/15; quantph:9503005 Simple Realization Of The Fredkin Gate Using A Series Of Twobody Operators ∗
, 2008
"... The Fredkin threebit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible twobit gates only. Here we construct the Fredkin gate using a combination of six twobody reversible (quantum) operators. ..."
Abstract
 Add to MetaCart
The Fredkin threebit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible twobit gates only. Here we construct the Fredkin gate using a combination of six twobody reversible (quantum) operators.
Five TwoBit Quantum Gates are Sufficient to Implement the Quantum Fredkin Gate
 Physical Review A
, 1995
"... We present an analytic construction of the threebit quantum conditional swap (Fredkin) gate which uses only five quantum gates each acting on only two qubits. Our implementation is based on previous work on the threebit quantum conditional NOT (Toffoli) gate. Numerical evidence suggests this is a ..."
Abstract

Cited by 37 (0 self)
 Add to MetaCart
minimal implementation. PACS number: 03.65.Bz, 89.80.+h There has been a great deal of interest lately in quantum computation, especially after Shor's discovery of a polynomialtime quantum factoring algorithm. [1] It is now well known that twobit quantum gates are sufficient to synthesize any
On the Nature of TwoBit Multiplier Landscapes
 In Proceedings 1st NASA/DoD Workshop on Evolvable Hardware
, 1999
"... The twobit multiplier is a simple electronic circuit, small enough to be evolvable, and practically useful for the implementation of many digital systems. In this paper, we study the structure of the twobit multiplier fitness landscapes generated by circuit evolution on an idealised model of a fi ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
fieldprogrammable gate array. The twobit multiplier landscapes are challenging. The difficulty in studying these landscapes stems from the genotype representation which allows us to evolve the functionality and connectivity of an array of logic cells. Here, the genotypes are simply strings defined
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum
High confidence visual recognition of persons by a test of statistical independence
 IEEE Trans. on Pattern Analysis and Machine Intelligence
, 1993
"... Abstruct A method for rapid visual recognition of personal identity is described, based on the failure of a statistical test of independence. The most unique phenotypic feature visible in a person’s face is the detailed texture of each eye’s iris: An estimate of its statistical complexity in a samp ..."
Abstract

Cited by 596 (8 self)
 Add to MetaCart
sample of the human population reveals variation corresponding to several hundred independent degreesoffreedom. Morphogenetic randomness in the texture expressed phenotypically in the iris trabecular meshwork ensures that a test of statistical independence on two coded patterns originating from
SIS: A System for Sequential Circuit Synthesis
, 1992
"... SIS is an interactive tool for synthesis and optimization of sequential circuits. Given a state transition table, a signal transition graph, or a logiclevel description of a sequential circuit, it produces an optimized netlist in the target technology while preserving the sequential inputoutput b ..."
Abstract

Cited by 514 (41 self)
 Add to MetaCart
, new logic optimization and verification algorithms, ASTG (asynchronous signal transition graph) manipulation, and synthesis for PGA’s (programmable gate arrays). The second part contains a tutorial example illustrating the design process using SIS.
Results 1  10
of
149,791