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

Adiabatic methods for a quantum CNOT gate

Valentina Corato, P. Silvestrini, Leo Stodolsky, J. Wosiek

Published May 24, 2002• 0 citations
OpenAlex

Related papers

Design of adiabatic logic for a quantum CNOT gate

V Corato, P. Silvestrini, Leo Stodolsky +1 more

arXiv:cond-mat/0205514•Physics Letters A•Mar 1, 2003•10 citations

CNOT gate by adiabatic passage with an optical cavity

Nicolas Sangouard, X. Lacour, S. Guérin +1 more

arXiv:quant-ph/0509187•The European Physical Journal D•Nov 21, 2005•18 citations

Fast CNOT gate between two spatially separated atoms via shortcuts to adiabatic passage

Yan Liang, Chong Song, Xin Ji +1 more

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.

Optics Express•Sep 2, 2015•22 citations

Fast CNOT gate via shortcuts to adiabatic passage

Zhe Wang, Yan Xia, Ye‐Hong Chen +1 more

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.

Journal of Modern Optics•May 10, 2016•5 citations

Adiabatic Quantum Gates

M. Andrecut, Mazhar Ali

International Journal of Theoretical Physics•Apr 1, 2004•1 citation

Optimizing Ansatz Design in QAOA for Max-cut

Ritajit Majumdar, Dhiraj Madan, Debasmita Bhoumik +3 more

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\cdot m \cdot 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 $\lfloor \frac{n}{2} \rfloor$ 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.

arXiv:2106.02812•Jun 5, 2021•39 citations
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 nnn vertices and mmm edges, a depth ppp QAOA for the Max-cut problem requires 2⋅m⋅p2\cdot m \cdot p2⋅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 ⌊n2⌋\lfloor \frac{n}{2} \rfloor⌊2n​⌋ CNOT gates. Next, we depict another method based on Depth First Search (DFS) on the input graph that reduces n−1n-1n−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.