most citedElementary gates for quantum computation

4.3k citations · 7k across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

9 papers · 1 filter

quant-ph1996★ 34 cited

Effects of noise on quantum error correction algorithms

Adriano Barenco, Todd A. Brun, Ruediger Schack +1

It has recently been shown that there are efficient algorithms for quantum computers to solve certain problems, such as prime factorization, which are intractable to date on classi…

quant-ph1996★ 116 cited

Quantum Physics and Computers

Adriano Barenco

Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem…

quant-ph1996★ 19 cited

Stabilisation of Quantum Computations by Symmetrisation

Adriano Barenco, Andre` Berthiaume, David Deutsch +3

We propose a method for the stabilisation of quantum computations (including quantum state storage). The method is based on the operation of projection into , the symmetr…

quant-ph1996★ 185 cited

Approximate Quantum Fourier Transform and Decoherence

Adriano Barenco, Artur Ekert, Kalle-Antti Suominen +1

We discuss the advantages of using the approximate quantum Fourier transform (AQFT) in algorithms which involve periodicity estimations. We analyse quantum networks performing AQFT…

quant-ph1995★ 819 cited

Quantum Networks for Elementary Arithmetic Operations

V. Vedral, A. Barenco, A. Ekert

Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation…

quant-ph1995★ 328 cited

Universality in Quantum Computation

D. Deutsch, A. Barenco, A. Ekert

We show that in quantum computation almost every gate that operates on two or more bits is a universal gate. We discuss various physical considerations bearing on the proper defini…