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:1101.4159 · International Journal of Quantum Information

ON SWAPPING THE STATES OF TWO QUDITS

Colin Wilmott

Published Aug 25, 2011• 19 citations
arXivHTMLPDF

Abstract

The SWAP gate has become an integral component of quantum circuit architecture where its primary role is given to permuting the states of two qubits. We consider the question of whether a two-qudit quantum circuit composed entirely from instances of the generalized controlled-NOT gate can be constructed to permute the states of two qudits. Arguing via the signature of a permutation, we demonstrate the impossibility of such circuits for dimensions d ≡ 3 (mod 4).

DOI
10.1142/s0219749911008143

Related papers

On interchanging the states of a pair of qudits

Colin Wilmott, Peter Wild

The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental element in the circuit implementation of Shor's algorithm. We consider the problem of generalising the SWAP gate beyond the qubit setting. We show that quantum circuit architectures completely described by instances of the CNOT gate can not implement a transposition of a pair of qudits for dimensions $d \equiv 3 (mod 4)$. The task of constructing generalised SWAP gates based on transpositions of qudit states is argued in terms of the signature of a permutation.

arXiv:0811.1545•Nov 10, 2008•3 citations

A generalized quantum SWAP gate

Colin Wilmott

The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of $d$ qudits for $d$ prime.

arXiv:0811.1684•Nov 11, 2008•2 citations

ON A GENERALIZED QUANTUM SWAP GATE

Colin Wilmott, Peter Wild

The SWAP gate plays a central role in network designs for qubit quantum computation. However, there has been a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of d qudits for d prime.

International Journal of Quantum Information•Apr 1, 2012•20 citations

Moving quantum states without swap via intermediate higher-dimensional qudits

Amit Saha, Debasri Saha, Amlan Chakrabarti

Quantum algorithms can be realized in the form of a quantum circuit. To map a quantum circuit for a specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighborhood constraint of qubit topology, the implementation of the quantum algorithm rightly, is essential for moving information around in a quantum computer. Swapping of qubits using a swap gate moves the quantum state between two qubits and solves the neighborhood constraint of qubit topology. Although, one needs to decompose the swap gate into three controlled-not gates to implement the swap gate efficiently, but unwillingly quantum cost with respect to the gate count and depth increases. In this paper, a formalism of moving quantum states without using swap operation is introduced. Moving quantum states through qubits have been attained with the adoption of temporary intermediate qudit states. This introduction of intermediate qudit states has exhibited a three times reduction in quantum cost with respect to the gate count and approximately two times reduction with respect to circuit depth compared to the state-of-the-art approach of the swap gate insertion. We also exhibit that the adoption of the intermediate qudit makes the approach sublimer than the existing works by obtaining a better fidelity. Furthermore, the proposed approach is generalized to any finite-dimensional quantum system.

arXiv:2106.09089•Physical Review A•Jul 21, 2022•3 citations

Various Constructions of Qudit SWAP Gate

S. Balakrishnan

It is known that SWAP operation for quantum systems of arbitrary dimension can be implemented using various qudit gates. In this paper, equivalence of some important qudit operations is demonstrated. Equivalence of the qudit operations is exploited to minimize the circuit complexity in the previously proposed qudit SWAP gate constructions. Further, constructions of qudit SWAP operation with minimum number of qudit gates are also proposed. Importantly, these circuit constructions of SWAP retain its properties like symmetry and simplicity.

Physics Research International•Aug 5, 2014•10 citations

A Note on Quantum Gates SWAP and iSWAP in Higher Dimensions

Arash Pourkia

We present explicit descriptions for the swap gate and the iswap gate in any arbitrary dimension $d \geq 2$, in terms of permutation matrices. Moreover, we unify these gates by introducing a more general gate xSWAP which includes SWAP and iSWAP for $x=1$ and $x=i$ (i.e. $\sqrt{-1}$), respectively. The higher dimensional xSWAP e.g., the swap and iswap gates for $d > 2$ serve as quantum logic gates that operate on two $d$-level qudits. For $d=2$, it is well known that iSWAP unlike SWAP is universal for quantum computing. We will prove this fact for xSWAP in any dimension $d$, when $x \neq \pm 1$. Our explicit representation of xSWAP by a permutation matrix facilitates the proof, greatly.

European Journal of Pure and Applied Mathematics•Jul 30, 2023•0 citations
The SWAP gate has become an integral component of quantum circuit architecture where its primary role is given to permuting the states of two qubits. We consider the question of whether a two-qudit quantum circuit composed entirely from instances of the generalized controlled-NOT gate can be constructed to permute the states of two qudits. Arguing via the signature of a permutation, we demonstrate the impossibility of such circuits for dimensions d ≡ 3 (mod 4).
The qubit SWAP gate has been shown to be an integral component of quantum circuitry design. It permutes the states of two qubits and allows for the storage quantum information, teleportation of atomic or ionic states, and is a fundamental element in the circuit implementation of Shor's algorithm. We consider the problem of generalising the SWAP gate beyond the qubit setting. We show that quantum circuit architectures completely described by instances of the CNOT gate can not implement a transposition of a pair of qudits for dimensions d≡3(mod4)d \equiv 3 (mod 4)d≡3(mod4). The task of constructing generalised SWAP gates based on transpositions of qudit states is argued in terms of the signature of a permutation.
The SWAP gate plays a central role in network designs for qubit quantum computation. However, there is a view to generalize qubit quantum computing to higher dimensional quantum systems. In this paper we construct a generalized SWAP gate using only instances of the generalized controlled-NOT gate to cyclically permute the states of ddd qudits for ddd prime.
Quantum algorithms can be realized in the form of a quantum circuit. To map a quantum circuit for a specific quantum algorithm to quantum hardware, qubit mapping is an imperative technique based on the qubit topology. Due to the neighborhood constraint of qubit topology, the implementation of the quantum algorithm rightly, is essential for moving information around in a quantum computer. Swapping of qubits using a swap gate moves the quantum state between two qubits and solves the neighborhood constraint of qubit topology. Although, one needs to decompose the swap gate into three controlled-not gates to implement the swap gate efficiently, but unwillingly quantum cost with respect to the gate count and depth increases. In this paper, a formalism of moving quantum states without using swap operation is introduced. Moving quantum states through qubits have been attained with the adoption of temporary intermediate qudit states. This introduction of intermediate qudit states has exhibited a three times reduction in quantum cost with respect to the gate count and approximately two times reduction with respect to circuit depth compared to the state-of-the-art approach of the swap gate insertion. We also exhibit that the adoption of the intermediate qudit makes the approach sublimer than the existing works by obtaining a better fidelity. Furthermore, the proposed approach is generalized to any finite-dimensional quantum system.
It is known that SWAP operation for quantum systems of arbitrary dimension can be implemented using various qudit gates. In this paper, equivalence of some important qudit operations is demonstrated. Equivalence of the qudit operations is exploited to minimize the circuit complexity in the previously proposed qudit SWAP gate constructions. Further, constructions of qudit SWAP operation with minimum number of qudit gates are also proposed. Importantly, these circuit constructions of SWAP retain its properties like symmetry and simplicity.
We present explicit descriptions for the swap gate and the iswap gate in any arbitrary dimension d≥2d \geq 2d≥2, in terms of permutation matrices. Moreover, we unify these gates by introducing a more general gate xSWAP which includes SWAP and iSWAP for x=1x=1x=1 and x=ix=ix=i (i.e. −1\sqrt{-1}−1​), respectively. The higher dimensional xSWAP e.g., the swap and iswap gates for d>2d > 2d>2 serve as quantum logic gates that operate on two ddd-level qudits. For d=2d=2d=2, it is well known that iSWAP unlike SWAP is universal for quantum computing. We will prove this fact for xSWAP in any dimension ddd, when x≠±1x \neq \pm 1x=±1. Our explicit representation of xSWAP by a permutation matrix facilitates the proof, greatly.