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.
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 y- and z-axes and 40 CNOT gates, beating an earlier bound of 64 CNOT gates.