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

Communications in Theoretical Physics

Note on Implementation of Three-Qubit SWAP Gate

Hai‐Rui Wei, Yao-Min Di, Yan Wang, Jie Zhang

Published Jan 1, 2010• 3 citations
Publisher

Abstract

In this paper, the synthesis and implementation of three-quhit SWAP gate is discussed. The three-quhit SWAP gate can be decomposed into product of 2 two-qubit SWAP gates, and it can be realized by 6 CNOT gates. Research illustrated that although the result is very simple, the current methods of matrix decomposition for multi-qubit gate can not get that. Then the implementation of three-qubit SWAP gate in the three spin system with Ising interaction is investigated and the sequence of control pulse and drift process to implement the gate is given. It needs 23 control pulses and 12 drift processes. Since the interaction can not be switched on and off at will, the realization of three-qubit SWAP gate in specific quantum system also can not simply come down to 2 two-qubit SWAP gates.

DOI
10.1088/0253-6102/53/1/18

Related papers

Realization of Two-Qutrit Quantum Gates with Control Pulses

Jie Zhang, Yao-Min Di, Hai‐Rui Wei

We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.

Communications in Theoretical Physics•Apr 1, 2009•7 citations

CONSTRUCTION AND APPLICATION OF FOUR-QUBIT SWAP LOGIC GATE IN NMR QUANTUM COMPUTING

Ahmet Gün, İrfan Şaka, Azmi Gençten

In NMR quantum computing, spin states of spin-1/2 nuclei are called qubits. Quantum logic gates are represented by unitary matrices. As a universal gate, controlled-NOT (CNOT) is a two-qubit gate. For the IS (I = 1/2 and S = 1/2) spin system, two-qubit CNOT gate is represented by a 4 × 4 matrix. SWAP logic gate, which exchanges two quantum states, is constructed by CNOT gates. In this study, first, four-qubit CNOT gates are constructed for the IS (I = 3/2, S = 3/2) spin system. Then, by using these CNOT gates, a four-qubit SWAP logic gate is found. As an application and verification, an obtained SWAP logic gate is applied to the matrix representation of product operators for the IS (I = 3/2, S = 3/2) spin system. SWAP logic gate can also be presented by an NMR pulse sequence. By using the product operator theory, the pulse sequence of the SWAP logic gate is applied to product operators of the IS (I = 3/2, S = 3/2) spin system. The expected exchange results are obtained for both the matrix representation and the pulse sequence of SWAP logic gate.

International Journal of Quantum Information•Mar 1, 2011•3 citations

Realization of permutation groups by quantum circuit

Junchi Liu, Yangyang Ren, Yan Cao +2 more

In this paper, we exclusively utilize CNOT gates for implementing permutation groups generated by more than two elements. In Lemma 1, we recall that three CNOT gates are both necessary and sufficient to execute a two-qubit swap gate operation. Subsequently, in Lemma 2, we show that the maximum number of CNOT gates needed to carry out an n-qubit substitution operation is 3(n-1). Moving forward, our analysis in Section 3 reveals that utilizing five or fewer CNOT gates is insufficient for implementing a three-qubit swap gate corresponding to the permutation element (123). Hence six CNOT gates are both necessary and sufficient for implementing (123). This is done by employing a graph-theoretic approach to rigorously validate the results in terms of at most five CNOT gates. Using computational tools, we exhaustively explore all valid circuit diagrams containing exactly six CNOT gates to successfully execute the swap gate for (123), by explaining the equivalence classes in Remark 6 and Table 2. We conclude them in Theorem 7.To extend our analysis to the multiqubit scenario, we present the reducible and irreducible permutation elements in Definition 8. We clarify the equivalence between rows in the multi-qubit space and provide an approximate upper bound for multi-qubits to perform the aforementioned operations in Theorem 9. The comprehensive exploration of this paper aims to pave the way for further advancements in understanding quantum circuit optimization via multiple use of a specific two-qubit gate.

arXiv:2406.01350•Jun 3, 2024•3 citations

Two-qubit logical operations in three quantum dots system

Jakub Łuczak, Bogdan R. Bułka

We consider a model of two interacting always-on, exchange-only qubits for which controlled phase (CPHASE), controlled NOT (CNOT), quantum Fourier transform (QFT) and SWAP operations can be implemented only in a few electrical pulses in a nanosecond time scale. Each qubit is built of three quantum dots (TQD) in a triangular geometry with three electron spins which are always kept coupled by exchange interactions only. The qubit states are encoded in a doublet subspace and are fully electrically controlled by a voltage applied to gate electrodes. The two qubit quantum gates are realized by short electrical pulses which change the triangular symmetry of TQD and switch on exchange interaction between the qubits. We found an optimal configuration to implement the CPHASE gate by a single pulse of the order 2.3 ns. Using this gate, in combination with single qubit operations, we searched for optimal conditions to perform the other gates: CNOT, QFT and SWAP. Our studies take into account environment effects and leakage processes as well. The results suggest that the system can be implemented for fault tolerant quantum computations.

arXiv:1711.03761•Journal of Physics Condensed Matter•Apr 16, 2018•5 citations

LOGICAL OPERATIONS REALIZED ON THE ISING CHAIN OF N QUBITS

Masanari Asano, Norihiro Tateda, Chikara Ishii

We propose multi-qubit logical gates , which implement logical operations on N qubits realized physically with the use of local manipulations of qubits before and after the one-time evolution of Ising chain (an array of N qubits connected with the Ising interactions), avoiding complicated tuning of the interactions between qubits. General rules of the action of our multi-qubit logical gate are derived by decomposing the whole process into a product of two-qubit logical operations. We construct the multi-qubit logical gate, which expressed as a group of controlled-NOT gates.

•Mar 1, 2006•0 citations

Optimal simulation of three-qubit gates

Nengkun Yu, Mingsheng Ying

In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary $u$ on the target qubit only if both the states of the control are $\ket{1}$. Previously, it is only known that five two-qubit gates is sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. Our result shows that if the determinant of $u$ is 1, four two-qubit gates is achievable optimal. Otherwise, five is optimal. Thirdly, we show that five two-qubit gates are necessary and sufficient for implementing the Fredkin gate(the controlled swap gate), which settles the open problem introduced in [Smolin and DiVincenzo, Phys. Rev. A, 53, 2855 (1996)]. The Fredkin gate is one of the most important quantum logic gates because it is universal alone for classical reversible computation, and thus with little help, universal for quantum computation. Before our work, a five two-qubit gates decomposition of the Fredkin gate was already known, and numerical evidence of showing five is optimal is found.

arXiv:1301.3727•Jan 16, 2013•7 citations
In this paper, the synthesis and implementation of three-quhit SWAP gate is discussed. The three-quhit SWAP gate can be decomposed into product of 2 two-qubit SWAP gates, and it can be realized by 6 CNOT gates. Research illustrated that although the result is very simple, the current methods of matrix decomposition for multi-qubit gate can not get that. Then the implementation of three-qubit SWAP gate in the three spin system with Ising interaction is investigated and the sequence of control pulse and drift process to implement the gate is given. It needs 23 control pulses and 12 drift processes. Since the interaction can not be switched on and off at will, the realization of three-qubit SWAP gate in specific quantum system also can not simply come down to 2 two-qubit SWAP gates.
We investigate the realization of 2-qutrit logic gate in a bipartite 3-level system with qusi-Ising interaction. On the basis of Cartan decomposition of matrices, the unitary matrices of 2-qutrit are factorized into products of a series of realizable matrices. It is equivalent to exerting a certain control field on the system, and the control goal is usually gained by a sequence of control pulses. The general discussion on the realization of 2-qutrit logic gate is made first, and then the realization of the ternary SWAP gate and the ternary gate are discussed specifically, and the sequences of control pulses and drift processes implementing these gates are given.
In NMR quantum computing, spin states of spin-1/2 nuclei are called qubits. Quantum logic gates are represented by unitary matrices. As a universal gate, controlled-NOT (CNOT) is a two-qubit gate. For the IS (I = 1/2 and S = 1/2) spin system, two-qubit CNOT gate is represented by a 4 × 4 matrix. SWAP logic gate, which exchanges two quantum states, is constructed by CNOT gates. In this study, first, four-qubit CNOT gates are constructed for the IS (I = 3/2, S = 3/2) spin system. Then, by using these CNOT gates, a four-qubit SWAP logic gate is found. As an application and verification, an obtained SWAP logic gate is applied to the matrix representation of product operators for the IS (I = 3/2, S = 3/2) spin system. SWAP logic gate can also be presented by an NMR pulse sequence. By using the product operator theory, the pulse sequence of the SWAP logic gate is applied to product operators of the IS (I = 3/2, S = 3/2) spin system. The expected exchange results are obtained for both the matrix representation and the pulse sequence of SWAP logic gate.
In this paper, we exclusively utilize CNOT gates for implementing permutation groups generated by more than two elements. In Lemma 1, we recall that three CNOT gates are both necessary and sufficient to execute a two-qubit swap gate operation. Subsequently, in Lemma 2, we show that the maximum number of CNOT gates needed to carry out an n-qubit substitution operation is 3(n-1). Moving forward, our analysis in Section 3 reveals that utilizing five or fewer CNOT gates is insufficient for implementing a three-qubit swap gate corresponding to the permutation element (123). Hence six CNOT gates are both necessary and sufficient for implementing (123). This is done by employing a graph-theoretic approach to rigorously validate the results in terms of at most five CNOT gates. Using computational tools, we exhaustively explore all valid circuit diagrams containing exactly six CNOT gates to successfully execute the swap gate for (123), by explaining the equivalence classes in Remark 6 and Table 2. We conclude them in Theorem 7.To extend our analysis to the multiqubit scenario, we present the reducible and irreducible permutation elements in Definition 8. We clarify the equivalence between rows in the multi-qubit space and provide an approximate upper bound for multi-qubits to perform the aforementioned operations in Theorem 9. The comprehensive exploration of this paper aims to pave the way for further advancements in understanding quantum circuit optimization via multiple use of a specific two-qubit gate.
We consider a model of two interacting always-on, exchange-only qubits for which controlled phase (CPHASE), controlled NOT (CNOT), quantum Fourier transform (QFT) and SWAP operations can be implemented only in a few electrical pulses in a nanosecond time scale. Each qubit is built of three quantum dots (TQD) in a triangular geometry with three electron spins which are always kept coupled by exchange interactions only. The qubit states are encoded in a doublet subspace and are fully electrically controlled by a voltage applied to gate electrodes. The two qubit quantum gates are realized by short electrical pulses which change the triangular symmetry of TQD and switch on exchange interaction between the qubits. We found an optimal configuration to implement the CPHASE gate by a single pulse of the order 2.3 ns. Using this gate, in combination with single qubit operations, we searched for optimal conditions to perform the other gates: CNOT, QFT and SWAP. Our studies take into account environment effects and leakage processes as well. The results suggest that the system can be implemented for fault tolerant quantum computations.
We propose multi-qubit logical gates , which implement logical operations on N qubits realized physically with the use of local manipulations of qubits before and after the one-time evolution of Ising chain (an array of N qubits connected with the Ising interactions), avoiding complicated tuning of the interactions between qubits. General rules of the action of our multi-qubit logical gate are derived by decomposing the whole process into a product of two-qubit logical operations. We construct the multi-qubit logical gate, which expressed as a group of controlled-NOT gates.
In this paper, we study the optimal simulation of three-qubit unitary by using two-qubit gates. First, we give a lower bound on the two-qubit gates cost of simulating a multi-qubit gate. Secondly, we completely characterize the two-qubit gate cost of simulating a three-qubit controlled controlled gate by generalizing our result on the cost of Toffoli gate. The function of controlled controlled gate is simply a three-qubit controlled unitary gate and can be intuitively explained as follows: the gate will output the states of the two control qubit directly, and apply the given one-qubit unitary uuu on the target qubit only if both the states of the control are ∣1⟩\ket{1}∣1⟩. Previously, it is only known that five two-qubit gates is sufficient for implementing such a gate [Sleator and Weinfurter, Phys. Rev. Lett. 74, 4087 (1995)]. Our result shows that if the determinant of uuu is 1, four two-qubit gates is achievable optimal. Otherwise, five is optimal. Thirdly, we show that five two-qubit gates are necessary and sufficient for implementing the Fredkin gate(the controlled swap gate), which settles the open problem introduced in [Smolin and DiVincenzo, Phys. Rev. A, 53, 2855 (1996)]. The Fredkin gate is one of the most important quantum logic gates because it is universal alone for classical reversible computation, and thus with little help, universal for quantum computation. Before our work, a five two-qubit gates decomposition of the Fredkin gate was already known, and numerical evidence of showing five is optimal is found.