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/0209035 · Physical Review A

Natural two-qubit gate for quantum computation using the XY interaction

Norbert Schuch, Jens Siewert

Published Mar 10, 2003• 237 citations
arXivHTMLPDF

Abstract

The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the controlled-NOT (CNOT) gate can be realized easily. It can be shown that, e.g., with the $\mathrm{XY}$ interaction more than one two-qubit operation is required in order to realize the CNOT operation. Here we propose a two-qubit gate for the $\mathrm{XY}$ interaction which combines the CNOT and SWAP operations. By using this gate quantum circuits can be implemented efficiently, even if only nearest-neighbor coupling between the qubits is available.

DOI
10.1103/physreva.67.032301

Related papers

Efficient quantum circuit for implementing discrete quantum Fourier transform in solid-state qubits

Hong‐Fu Wang, Xinxin Jiang, Shou Zhang +1 more

Based on the iSWAP gate generated from the XY interaction between solid-state qubits, we present an efficient quantum circuit for the implementation of discrete quantum Fourier transform. The relatively cumbersome and expensive controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit are replaced only by iSWAP gate operation. The scheme can be realized using any physical system with XY interaction and it would be a useful step towards the implementation of more complex quantum computation in solid-state qubits.

Journal of Physics B Atomic Molecular and Optical Physics•May 17, 2011•11 citations

Universal quantum computing in linear nearest neighbor architectures

Preethika Kumar, Steven R. Skinner

We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.

Quantum Information and Computation•Mar 1, 2011•6 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•2 citations

Minimal and robust composite two-qubit gates with Ising-type interaction

Tsubasa Ichikawa, Utkan Güngördü, Masamitsu Bando +2 more

We construct a minimal robust controlled-not gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number ($N=3$) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust swap gate cannot be constructed with $N=3$ but requires $N=6$ elementary two-qubit gates.

arXiv:1204.2750•Physical Review A•Feb 19, 2013•16 citations

Optimizing the number of CNOT gates in one-dimensional nearest-neighbor quantum Fourier transform circuit

Byeongyong Park, Doyeol Ahn

The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of quantum circuits because of their high error rate as compared with single-qubit gates. The controlled-not (CNOT) gate is the typical choice of a two-qubit gate for universal quantum circuit implementation together with the set of single-qubit gates. In this study, we construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT), which is one of the most frequently used quantum algorithms. Compared with previous studies on n-qubit one-dimensional nearest-neighbor QFT circuits, it is found that our method reduces the number of CNOT gates by ~60%. Additionally, we showed that our results for the one-dimensional nearest-neighbor circuit can be applied to quantum amplitude estimation.

arXiv:2208.14249•Aug 30, 2022•0 citations

Simplified approach to implementing controlled-unitary operations in a two-qubit system

Preethika Kumar, S.R. Skinner

We introduce a scheme for realizing arbitrary controlled-unitary operations in a two-qubit system. If the $2\ifmmode\times\else\texttimes\fi{}2$ unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse in our scheme will constitute varying one of the parameters of the system between an arbitrarily maximum and a ``calculated'' minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The values of the parameters are what we solve for using our approach in order to realize an arbitrary controlled-unitary operation. We further show that the computational complexity of the operation is no greater than that required for a controlled-NOT (CNOT) gate. Since conventional schemes realize a controlled-unitary operation by breaking it into a sequence of single-qubit and CNOT gate operations, our method is an improvement because we not only require less time duration, but also fewer control lines to implement the same operation. To demonstrate improvement over other schemes, we show, as examples, how two controlled-unitary operations, one being the controlled-Hadamard gate, can be realized in a single pulse operation using our scheme. Furthermore, our method can be applied to a wide range of coupling schemes and can be used to realize gate operations between two qubits coupled via Ising, Heisenberg, and anisotropic interactions.

arXiv:1202.2053•Physical Review A•Aug 30, 2007•11 citations
The two-qubit interaction Hamiltonian of a given physical implementation determines whether or not a two-qubit gate such as the controlled-NOT (CNOT) gate can be realized easily. It can be shown that, e.g., with the XY\mathrm{XY}XY interaction more than one two-qubit operation is required in order to realize the CNOT operation. Here we propose a two-qubit gate for the XY\mathrm{XY}XY interaction which combines the CNOT and SWAP operations. By using this gate quantum circuits can be implemented efficiently, even if only nearest-neighbor coupling between the qubits is available.
Based on the iSWAP gate generated from the XY interaction between solid-state qubits, we present an efficient quantum circuit for the implementation of discrete quantum Fourier transform. The relatively cumbersome and expensive controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit are replaced only by iSWAP gate operation. The scheme can be realized using any physical system with XY interaction and it would be a useful step towards the implementation of more complex quantum computation in solid-state qubits.
We introduce a scheme for realizing universal quantum computing in a linear nearest neighbor architecture with fixed couplings. We first show how to realize a controlled-NOT gate operation between two adjacent qubits without having to isolate the two qubits from qubits adjacent to them. The gate operation is implemented by applying two consecutive pulses of equal duration, but varying amplitudes, on the target qubit. Since only a single control parameter is required in implementing our scheme, it is very efficient. We next show how our scheme can be used to realize single qubit rotations and two-qubit controlled-unitary operations. As most proposals for solid state implementations of a quantum computer use a one-dimensional line of qubits, the schemes presented here will be extremely useful.
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.
We construct a minimal robust controlled-not gate with an Ising-type interaction by which elementary two-qubit gates are implemented. It is robust against inaccuracy of the coupling strength and the obtained quantum circuits are constructed with the minimal number (N=3N=3N=3) of elementary two-qubit gates and several one-qubit gates. It is noteworthy that all the robust circuits can be mapped to one-qubit circuits robust against a pulse length error. We also prove that a minimal robust swap gate cannot be constructed with N=3N=3N=3 but requires N=6N=6N=6 elementary two-qubit gates.
The physical limitations of quantum hardware often require nearest-neighbor qubit structures, in which two-qubit gates are required to construct nearest-neighbor quantum circuits. However, two-qubit gates are considered a major cost of quantum circuits because of their high error rate as compared with single-qubit gates. The controlled-not (CNOT) gate is the typical choice of a two-qubit gate for universal quantum circuit implementation together with the set of single-qubit gates. In this study, we construct a one-dimensional nearest-neighbor circuit of quantum Fourier transform (QFT), which is one of the most frequently used quantum algorithms. Compared with previous studies on n-qubit one-dimensional nearest-neighbor QFT circuits, it is found that our method reduces the number of CNOT gates by ~60%. Additionally, we showed that our results for the one-dimensional nearest-neighbor circuit can be applied to quantum amplitude estimation.
We introduce a scheme for realizing arbitrary controlled-unitary operations in a two-qubit system. If the $2\ifmmode\times\else\texttimes\fi{}2$ unitary matrix is special unitary (has unit determinant), the controlled-unitary gate operation can be realized in a single pulse operation. The pulse in our scheme will constitute varying one of the parameters of the system between an arbitrarily maximum and a ``calculated'' minimum value. This parameter will constitute the variable parameter of the system while the other parameters, which include the coupling between the two qubits, will be treated as fixed parameters. The values of the parameters are what we solve for using our approach in order to realize an arbitrary controlled-unitary operation. We further show that the computational complexity of the operation is no greater than that required for a controlled-NOT (CNOT) gate. Since conventional schemes realize a controlled-unitary operation by breaking it into a sequence of single-qubit and CNOT gate operations, our method is an improvement because we not only require less time duration, but also fewer control lines to implement the same operation. To demonstrate improvement over other schemes, we show, as examples, how two controlled-unitary operations, one being the controlled-Hadamard gate, can be realized in a single pulse operation using our scheme. Furthermore, our method can be applied to a wide range of coupling schemes and can be used to realize gate operations between two qubits coupled via Ising, Heisenberg, and anisotropic interactions.