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

arXiv:quant-ph/0609014 · International Journal of Quantum Information

THE CNOT QUANTUM LOGIC GATE USING q-DEFORMED OSCILLATORS

Debashis Gangopadhyay

Published Jun 1, 2008• 7 citations
arXivHTMLPDF

Abstract

It is shown that the two qubit CNOT (controlled NOT) gate can also be realized using q-deformed angular momentum states constructed via the Jordan–Schwinger mechanism. Thus, all the three gates necessary for universality i.e. Hadamard, Phase Shift and the two qubit CNOT gate are realizable with q-deformed oscillators.
DOI
10.1142/s0219749908003645

Related papers

QUANTUM LOGIC GATES USING q-DEFORMED OSCILLATORS

Debashis Gangopadhyay, MAHENDRA NATH SINHA ROY

We show that quantum logic gates, viz. the single qubit Hadamard and Phase Shift gates, can also be realized using q-deformed angular momentum states constructed via the Jordan–Schwinger mechanism with two q-deformed oscillators.

arXiv:quant-ph/0409045•International Journal of Quantum Information•Apr 1, 2006•1 citation

Quantum CNOT gates with orbital angular momentum and polarization of single-photon quantum logic

Li-Ping Deng, Haibo Wang, Kaige Wang

We propose a polarization-controlled-NOT (P-CNOT) gate and an orbital-angular-momentum-controlled-NOT (OAM-CNOT) gate for single-photon two-qubit quantum logic. Both of the controlled-NOT (CNOT) gates are simple and deterministic. Moreover the entanglement swap between polarization and orbital angular momentum (OAM) can be realized using the P-CNOT gate and the OAM-CNOT gate.

Journal of the Optical Society of America B•Aug 31, 2007•57 citations

Universal quantum circuit for two-qubit transformations with three controlled-NOT gates

Guifré Vidal, Christopher M. Dawson

We consider quantum circuits made of controlled-NOT (CNOT) gates and single-qubit unitary gates and look for constructions that minimize the use of CNOT gates. We show, by means of an explicit quantum circuit, that three CNOT gates are necessary and sufficient in order to implement an arbitrary unitary transformation of two qubits. We also identify the subset of two-qubit gates that can be performed with only two CNOT gates and provide a simple characterization for them.

arXiv:quant-ph/0307177•Physical Review A•Jan 8, 2004•296 citations

Remote controlled-NOT gate of d-dimension

Gui-Fang Dang, Heng Fan

Single qubit rotation gate and the controlled-NOT (CNOT) gate constitute a complete set of gates for universal quantum computation. In general the CNOT gate are only for two nearby qubits. For two qubits which are remote from each other, we need a series of swap gates to transfer these two qubits to the nearest neighboring sites, and then after the CNOT gate we should transfer them to their original sites again. However, a series of swap gates are resource for quantum information processing. One economy way which does not consume so much resource is to implement CNOT gate remotely. The remote CNOT gate is to implement the CNOT gate for two remotely separated qubits with the help of one additional maximally entangled state. The original remote CNOT gate is for two qubits, here we will present the d-dimensional remote CNOT gate. The role of quantum teleportation is identified in the process of the remote CNOT gate.

arXiv:0711.3714•Nov 23, 2007•6 citations

Finding small two-qubit circuits

Vivek Shende, Igor L. Markov, Stephen S. Bullock

An important result from the mid nineties shows that any unitary evolution may be realized as a sequence of controlled-not and one-qubit gates. This work surveys especially efficient circuits in this library, in the special case of evolutions on two-quantum bits. In particular, we show that to construct an arbitrary two-qubit state from |00>, one CNOT gate suffices. To simulate an arbitrary two-qubit operator up to relative phases, two CNOTs suffice. To simulate an arbitrary two-qubit operator up to global phase, three CNOTs suffice. In each case, we construct an explicit circuit and prove optimality in the generic case. We also contribute a procedure to determine the minimal number of CNOT gates necessary to simulate a given two-qubit operator up to global phase. We use this procedure to discuss timing a given Hamiltonian to simulate the CNOT and to determine an optimal circuit for the two-qubit Quantum Fourier Transform. Our constructive proofs amount to circuit synthesis algorithms and have been coded in C++.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 24, 2004•12 citations

Realization of a General Three-Qubit Quantum Gate

Farrokh Vatan, Colin P. Williams

We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the $y$- and $z$-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.

arXiv:quant-ph/0401178•Jan 29, 2004•49 citations
Single qubit rotation gate and the controlled-NOT (CNOT) gate constitute a complete set of gates for universal quantum computation. In general the CNOT gate are only for two nearby qubits. For two qubits which are remote from each other, we need a series of swap gates to transfer these two qubits to the nearest neighboring sites, and then after the CNOT gate we should transfer them to their original sites again. However, a series of swap gates are resource for quantum information processing. One economy way which does not consume so much resource is to implement CNOT gate remotely. The remote CNOT gate is to implement the CNOT gate for two remotely separated qubits with the help of one additional maximally entangled state. The original remote CNOT gate is for two qubits, here we will present the d-dimensional remote CNOT gate. The role of quantum teleportation is identified in the process of the remote CNOT gate.
An important result from the mid nineties shows that any unitary evolution may be realized as a sequence of controlled-not and one-qubit gates. This work surveys especially efficient circuits in this library, in the special case of evolutions on two-quantum bits. In particular, we show that to construct an arbitrary two-qubit state from |00>, one CNOT gate suffices. To simulate an arbitrary two-qubit operator up to relative phases, two CNOTs suffice. To simulate an arbitrary two-qubit operator up to global phase, three CNOTs suffice. In each case, we construct an explicit circuit and prove optimality in the generic case. We also contribute a procedure to determine the minimal number of CNOT gates necessary to simulate a given two-qubit operator up to global phase. We use this procedure to discuss timing a given Hamiltonian to simulate the CNOT and to determine an optimal circuit for the two-qubit Quantum Fourier Transform. Our constructive proofs amount to circuit synthesis algorithms and have been coded in C++.
We prove that a generic three-qubit quantum logic gate can be implemented using at most 98 one-qubit rotations about the yyy- and zzz-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.