Quantum logic gate is indispensable to quantum computation. One of the important qubit operations is the quantum controlled-not (CNOT) gate that performs a NOT operation on a target qubit depending on the state of the control qubit. In this paper we present a scheme to realize the quantum CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage. The influence of various decoherence processes on the fidelity is discussed. The strict numerical simulation results show that the fidelity for the CNOT gate is relatively high.
Based on the shortcuts to adiabatic passage, we propose a scheme for directly implementing a controlled-not (CNOT) gate in a cavity quantum electrodynamics system. Moreover, we generalize the scheme to realize a CNOT gate in two separate cavities connected by an optical fiber. The strictly numerical simulation shows that the schemes are fast and insensitive to the decoherence caused by atomic spontaneous emission and photon leakage. In addition, the schemes can provide a theoretical basis for the manipulation of the multiqubit quantum gates in distant nodes of a quantum network.
Quantum Approximate Optimization Algorithm (QAOA) is studied primarily to find approximate solutions to combinatorial optimization problems. For a graph with
n vertices and
m edges, a depth
p QAOA for the Max-cut problem requires
2⋅m⋅p CNOT gates. CNOT is one of the primary sources of error in modern quantum computers. In this paper, we propose two hardware independent methods to reduce the number of CNOT gates in the circuit. First, we present a method based on Edge Coloring of the input graph that minimizes the the number of cycles (termed as depth of the circuit), and reduces upto
⌊2n⌋ CNOT gates. Next, we depict another method based on Depth First Search (DFS) on the input graph that reduces
n−1 CNOT gates, but increases depth of the circuit moderately. We analytically derive the condition for which the reduction in CNOT gates overshadows this increase in depth, and the error probability of the circuit is still lowered. We show that all IBM Quantum Hardware satisfy this condition. We simulate these two methods for graphs of various sparsity with the \textit{ibmq\_manhattan} noise model, and show that the DFS based method outperforms the edge coloring based method, which in turn, outperforms the traditional QAOA circuit in terms of reduction in the number of CNOT gates, and hence the probability of error of the circuit.