Adriano Barenco
University of Oxford
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Adriano Barenco.
Physical Review Letters | 1995
Adriano Barenco; David Deutsch; Artur Ekert; Richard Jozsa
Quantum logic gates provide fundamental examples of conditional quantum dynamics. They could form the building blocks of general quantum information processing systems which have recently been shown to have many interesting nonclassical properties. We describe a simple quantum logic gate, the quantum controlled-NOT, and analyze some of its applications. We discuss two possible physical realizations of the gate, one based on Ramsey atomic interferometry and the other on the selective driving of optical resonances of two subsystems undergoing a dipole-dipole interaction.
Physical Review A | 1996
Vlatko Vedral; Adriano Barenco; Artur Ekert
Quantum computers require quantum arithmetic. We provide an explicit construction of quantum networks effecting basic arithmetic operations: from addition to modular exponentiation. Quantum modular exponentiation seems to be the most difficult (time and space consuming) part of Shors quantum factorizing algorithm. We show that the auxiliary memory required to perform this operation in a reversible way grows linearly with the size of the number to be factorized. \textcopyright{} 1996 The American Physical Society.
arXiv: Quantum Physics | 1995
David Deutsch; Adriano Barenco; Artur 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 definition of universality for computational components such as logic gates.
arXiv: Quantum Physics | 1995
Adriano Barenco
We prove the existence of a class of two-input, two-output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three-bit gate introduced by Deutsch ( Proc. R. Soc. Lond. A 425, 73 (1989)) as a network consisting of replicas of a single two-bit gate.
SIAM Journal on Computing | 1997
Adriano Barenco; André Berthiaume; David Deutsch; Artur Ekert; Richard Jozsa; Chiara Macchiavello
We propose a method for the stabilization of quantum computations (including quantum state storage). The method is based on the operation of projection into
Physical Review A | 1996
Adriano Barenco; Artur Ekert; Kalle Antti Suominen; Päivi Törmä
\cal SYM
Journal of Modern Optics | 1995
Adriano Barenco; Artur Ekert
, the symmetric subspace of the full state space of
Physical Review A | 1997
Adriano Barenco; Todd A. Brun; Rüdiger Schack; Timothy P. Spiller
R
S.I.A.M. Journal on Computing | 1997
Adriano Barenco; André Berthiaume; David Deutsch; Artur Ekert; Richard Jozsa; Chiara Macchiavello
redundant copies of the computer. We describe an efficient algorithm and quantum network effecting
Mundo científico | 1997
Anna Sanpera Trigueros; Chiara Macchiavello; Adriano Barenco; Arthur K. Ekert
\cal SYM