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

Journal of Optoelectronics·laser

Two-bit Quantum Gates to Implement N-bit Quantum Gates

Zhang Deng

Published Jan 1, 2001• 0 citations
OpenAlex

Abstract

We propose a method for constructing n bit quantum gate (Λ n-1 (W) gate) by using basic 2 bit quantum gates,which is based on Barencos work.This scheme is easier to construct and to implement.

Related papers

AN EASY WAY FOR CONSTRUCTING FREDKIN QUANTUM GATE

Deng-Yu Zhang, Mingsheng Zhan, (1)中国科学院安徽光学精密机械研究所激光光谱学开放实验室; (2)中国科学院武汉物理研究所波谱与原子分子物理国家重点实验室

We propose a method for constructing Fredkin gate by using basic 2 bit quantum gates,which is based on A.Darenco's work.Compared with H.F.Chau's scheme,this scheme is easier to construct and to understand,as well as to put into practice.

Acta Physica Sinica•Jan 1, 1997•1 citation

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

ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES

Yang Liu, GUI LU LONG, Yang Sun

General n-qubit controlled unitary gates are frequently used in quantum information processing tasks. Barenco, Bennett, Cleve, Di Vincenzo, Margolus and Shor [Phys. Rev. A52 (1995) 3457] have given the general construction methods, and explicit results for up-to-four-qubits controlled unitary gates. We extended their calculation and gave two analytic expressions for the construction of general n-qubit controlled unitary gates in terms of one-qubit and two-qubit CNOT gates. There are two expressions – one is exponential in the qubit number which is efficient for up to ten qubits, and the other is polynomial in the qubit number, which is efficient for more than ten qubits.

International Journal of Quantum Information•Jun 1, 2008•70 citations

Improved quantum cost for n -bit Toffoli gates

Dmitri A Maslov, Gerhard W. Dueck

An n-bit Toffoli gate quantum circuit based on the realisation proposed by Barenco et al., where some of the Toffoli gates in their construction are replaced with Peres gates, is presented. This results in a significant cost reduction. The main contribution of this presentation is a quantum circuit which simulates the (m+1)-bit Toffoli gate with 32m−120 elementary quantum gates and one garbage bit which is passed unchanged.

arXiv:quant-ph/0403053•Electronics Letters•Dec 11, 2003•137 citations

Results on two-bit gate design for quantum computers

David Peter Divincenzo, John A. Smolin

We present numerical results which show how two-bit 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 two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very non-classical feature of the operation, its exact quantum phase factor.

arXiv:cond-mat/9409111•Sep 26, 1994•14 citations

Results on two-bit gate design for quantum computers

David Peter Divincenzo, John A. Smolin

We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very nonclassical feature of the operation, its exact quantum phase factor.>

Workshop on Physics and Computation (PhysComp)•Dec 17, 2002•15 citations
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.
General n-qubit controlled unitary gates are frequently used in quantum information processing tasks. Barenco, Bennett, Cleve, Di Vincenzo, Margolus and Shor [Phys. Rev. A52 (1995) 3457] have given the general construction methods, and explicit results for up-to-four-qubits controlled unitary gates. We extended their calculation and gave two analytic expressions for the construction of general n-qubit controlled unitary gates in terms of one-qubit and two-qubit CNOT gates. There are two expressions – one is exponential in the qubit number which is efficient for up to ten qubits, and the other is polynomial in the qubit number, which is efficient for more than ten qubits.
We present numerical results which show how two-bit 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 two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very non-classical feature of the operation, its exact quantum phase factor.
We present numerical results which show how two-bit logic gates can be used in the design of a quantum computer. We show that the Toffoli gate, which is the universal gate for all classical reversible computation, can be implemented using a particular sequence of exactly five two-bit gates. An arbitrary three-bit unitary gate, which can be used to build up any arbitrary quantum computation, can be implemented exactly with six two-bit gates. The ease of implementation of any particular quantum operation is dependent upon a very nonclassical feature of the operation, its exact quantum phase factor.>