Results 1  10
of
234,804
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
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
Monte Carlo simulation of quantum computation
 Mathematics and Computers in Simulation 47, 143
, 1998
"... The manybody dynamics of a quantum computer can be reduced to the time evolution of noninteracting quantum bits in auxiliary fields by use of the HubbardStratonovich representation of twobit quantum gates in terms of onebit gates. This makes it possible to perform the stochastic simulation of a ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
The manybody dynamics of a quantum computer can be reduced to the time evolution of noninteracting quantum bits in auxiliary fields by use of the HubbardStratonovich representation of twobit quantum gates in terms of onebit gates. This makes it possible to perform the stochastic simulation
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
unknown title
, 1997
"... The manybody dynamics of a quantum computer can be reduced to the time evolution of noninteracting quantum bits in auxiliary fields by use of the HubbardStratonovich representation of twobit quantum gates in terms of onebit gates. This makes it possible to perform the stochastic simulation of a ..."
Abstract
 Add to MetaCart
The manybody dynamics of a quantum computer can be reduced to the time evolution of noninteracting quantum bits in auxiliary fields by use of the HubbardStratonovich representation of twobit quantum gates in terms of onebit gates. This makes it possible to perform the stochastic simulation
nce at corners
"... ere ib,c, sics a Yor halid Recent years have seen remarkable developments, firstly in the ability to create material Furthermore, the physics of quantum systems in a restricted space has acquired a new significance tion for the realisation of twobit quantum gate— an important element in a quantum ..."
Abstract
 Add to MetaCart
ere ib,c, sics a Yor halid Recent years have seen remarkable developments, firstly in the ability to create material Furthermore, the physics of quantum systems in a restricted space has acquired a new significance tion for the realisation of twobit quantum gate— an important element in a quantum
Quantum Gravity
, 2004
"... We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string theor ..."
Abstract

Cited by 566 (11 self)
 Add to MetaCart
We describe the basic assumptions and key results of loop quantum gravity, which is a background independent approach to quantum gravity. The emphasis is on the basic physical principles and how one deduces predictions from them, at a level suitable for physicists in other areas such as string
Elementary Gates for Quantum Computation
, 1995
"... We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x,y) to (x,x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We in ..."
Abstract

Cited by 276 (11 self)
 Add to MetaCart
We show that a set of gates that consists of all onebit quantum gates (U(2)) and the twobit exclusiveor gate (that maps Boolean values (x,y) to (x,x⊕y)) is universal in the sense that all unitary operations on arbitrarily many bits n (U(2 n)) can be expressed as compositions of these gates. We
A Fast Quantum Mechanical Algorithm for Database Search
 ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING
, 1996
"... Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a supe ..."
Abstract

Cited by 1126 (10 self)
 Add to MetaCart
Imagine a phone directory containing N names arranged in completely random order. In order to find someone's phone number with a probability of , any classical algorithm (whether deterministic or probabilistic)
will need to look at a minimum of names. Quantum mechanical systems can be in a
Results 1  10
of
234,804