Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physical Review Letters

Realizable Universal Quantum Logic Gates

Tycho Sleator, Harald Weinfurter

Published May 15, 1995• 513 citations
Publisher

Abstract

We identify a 2-bit quantum gate that is sufficient to build any quantum logic network. The existence of such a 2-bit universal gate considerably simplifies the search for physical realizations of quantum computational networks. We propose an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.

DOI
10.1103/physrevlett.74.4087

Related papers

Simple cavity-QED two-bit universal quantum logic gate: The principle and expected performances

P. Domokos, J. M. Raimond, M. Brune +1 more

We present a simple scheme for a universal two-bit quantum logic gate using circular Rydberg atoms and a superconducting millimeter-wave cavity. We analyze in detail the performances of this gate, using the parameters of an experiment currently under way in our laboratory.

Physical Review A•Nov 1, 1995•176 citations

A universal two-bit gate for quantum computation

Adriano Barenco

Abstract 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.

arXiv:quant-ph/9505016•Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences•Jun 8, 1995•217 citations

Universality in quantum computation

David Elieser Deutsch, Adriano Barenco, Artur Ekert

Abstract 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:quant-ph/9505018•Proceedings of the Royal Society of London Series A Mathematical and Physical Sciences•Jun 8, 1995•346 citations

Universality in Quantum Computation

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. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...

•Jan 1, 1995•309 citations

Simple Realization of the Fredkin Gate using a Series Of Two-Body Operators

H. F. Chau, Frank A. Wilczek

The Fredkin three-bit gate is universal for computational logic, and is reversible. Classically, it is impossible to do universal computation using reversible two-bit gates only. Here we construct the Fredkin gate using a combination of six two-body reversible (quantum) operators.

arXiv:quant-ph/9503005•Physical Review Letters•Jul 24, 1995•59 citations

Quantum logic gate constructions with one-bit "teleportation"

Xinlan Zhou, Debbie Leung, Isaac L. Chuang

We present a general method to construct quantum logic gates using one-bit``teleportation'' as a basic primitive, extending previous results based ontraditional two-bit teleportation (D. Gottesman and I. L. Chuang, Nature {\\bf402}, 390, 1999). This allows the realization of a variety of useful quantumoperations that cannot be directly performed due to some physical constraints.In particular, this technique leads to straightforward and systematicconstruction of many fault-tolerant encoded operations, including the $\\pi/8$and Toffoli gates, and remote quantum operations.

•Feb 14, 2000•2 citations
We identify a 2-bit quantum gate that is sufficient to build any quantum logic network. The existence of such a 2-bit universal gate considerably simplifies the search for physical realizations of quantum computational networks. We propose an explicit construction of this gate, which is based on cavity QED techniques and may be realizable with current technology.
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. Introduction It has been known for several years that the theory of quantum computers --- i.e. machines that rely on characteristically quantum phenomena to perform computations [1] --- is substantially different from the classical theory of computation, which is essentially the theory of the universal Turing machine. We may identify three important differences. Firstly, the properties of quantum computers are not postulated in abstracto but are deduced entirely from the laws of physics. Logically, this was already true of the classical theory, as Landauer [2] has pointed out, but the intuitive nature of the classically-available computational operations, and the millennia-long history of their study, allowed pioneers such as Turing, Chu...
We present a general method to construct quantum logic gates using one-bit``teleportation'' as a basic primitive, extending previous results based ontraditional two-bit teleportation (D. Gottesman and I. L. Chuang, Nature {\\bf402}, 390, 1999). This allows the realization of a variety of useful quantumoperations that cannot be directly performed due to some physical constraints.In particular, this technique leads to straightforward and systematicconstruction of many fault-tolerant encoded operations, including the pi/8\\pi/8pi/8and Toffoli gates, and remote quantum operations.