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

Journal of Physics A Mathematical and General

Decomposing the SWAP quantum gate

Yorick Hardy, W.‐H. Steeb

Published Jan 24, 2006• 10 citations
Publisher

Abstract

Quantum gates are represented by unitary operators on a Hilbert space. We consider the unitary operators on and describe the component operators on each Hilbert space in the product space. From these criteria we derive a decomposition for a specific class of unitary operators such that each operator in the product has Schmidt rank bounded by 2. This decomposition directly yields the XOR (controlled NOT) implementation of the SWAP operation.

DOI
10.1088/0305-4470/39/6/018

Related papers

Decomposition of bipartite and multipartite unitary gates into the product of controlled unitary gates

Lin Chen, Li Zhi Yu

We show that any unitary operator on the ${d}_{A}\ifmmode\times\else\texttimes\fi{}{d}_{B}$ system $({d}_{A}\ensuremath{\ge}2)$ can be decomposed into the product of at most $4{d}_{A}\ensuremath{-}5$ controlled unitary operators. The number can be reduced to $2{d}_{A}\ensuremath{-}1$ when ${d}_{A}$ is a power of two. We also prove that three controlled unitaries can implement a bipartite complex permutation operator, and discuss the connection to an analogous result on classical reversible circuits. We further show that any $n$-partite unitary on the space ${\mathbb{C}}^{{d}_{1}}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{\mathbb{C}}^{{d}_{n}}$ is the product of at most $[2{\ensuremath{\prod}}_{j=1}^{n\ensuremath{-}1}(2{d}_{j}\ensuremath{-}2)\ensuremath{-}1]$ controlled unitary gates, each of which is controlled from $n\ensuremath{-}1$ systems. We also decompose any bipartite unitary into the product of a simple type of bipartite gate and some local unitaries. We derive dimension-independent upper bounds for the controlled-not gate cost or entanglement cost of bipartite permutation unitaries (with the help of ancillas of fixed size) as functions of the Schmidt rank of the unitary. It is shown that such costs under a simple protocol are related to the log-rank conjecture in communication complexity theory via the link of nonnegative rank.

arXiv:1501.02708•Physical Review A•Mar 17, 2015•22 citations

DECOMPOSITION OF UNITARY MATRICES AND QUANTUM GATES

Chi-Kwong Li, Rebecca Roberts, Xiaoyan Yin

A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

arXiv:1210.7366•International Journal of Quantum Information•Feb 1, 2013•56 citations

Decomposition of quantum gates

Chi-Kwong Li, Diane Christine Pelejo

A recurrence scheme is presented to decompose an n-qubit unitary gate to the product of no more than N(N - 1)/2 single qubit gates with small number of controls, where N = 2n. Detailed description of the recurrence steps and formulas for the number of k-controlled single qubit gates in the decomposition are given. Comparison of the result to a previous scheme is presented, and future research directions are discussed.

arXiv:1311.3599•International Journal of Quantum Information•Feb 1, 2014•7 citations

Characterization of three-qubit controlled unitary gates of Schmidt rank three

Xiutao Zhang

We characterize three-qubit controlled unitary gates of Schmidt rank three, establishing necessary and sufficient conditions for such gates to have Schmidt rank three. We construct explicit examples and analyze their entanglement capabilities, showing that gates with Schmidt rank three can generate output states ranging from fully separable to maximal GHZ-class states. Within this classification, we present a parameterized gate family that produces an output W-class state whose bipartite tangles for subsystems AB and AC are modulated as simple trigonometric functions of a single phase parameter. The examples also include gates implementable with only three CNOT gates, showing that this lower bound is achievable. Decompositions that achieve the minimum possible CNOT count for several other cases are provided as well. Our results bridge Schmidt rank classification, entanglement structure, and resource-efficient circuit synthesis.

quant-pharXiv:2606.18612•Journal of Physics A Mathematical and Theoretical•Jun 18, 2026•0 citations

Quantum-state preparation with universal gate decompositions

Martin Plesch, Časlav Brukner

In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of $2$. It also reduces the total number of cnot gates from ${2}^{n}$ to $\frac{23}{24}{2}^{n}$ in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from $11$ cnot gates to $9$ and the depth from $11$ to $5$ steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.

arXiv:1003.5760•Physical Review A•Mar 3, 2011•387 citations

APPLICATION OF LINEAR OPERATORS AND TENSOR PRODUCTS IN QUANTUM ENTANGLEMENT AND QUANTUM COMPUTING

Sevinchova Charosxon Maxmudjonovna, Worldly Knowledge Publishing Centre

Quantum computing is fundamentally based on the mathematical structure of complex Hilbert spaces, linear operators, tensor products, and unitary transformations. Among these concepts, tensor products provide the formal mechanism for constructing the state space of composite quantum systems, whereas linear and unitary operators describe quantum transformations, measurements, and computational gates. This article examines the mathematical relationship between linear operators and tensor products and analyzes their role in the formation, manipulation, and characterization of quantum entanglement. Particular attention is given to two-qubit systems, separable and entangled states, Schmidt decomposition, controlled operations, and the role of non-factorizable operators in quantum circuits. The analysis demonstrates that tensor products perform a dual function: they provide the mathematical representation of composite systems and enable the construction of local operations acting on individual subsystems. At the same time, genuinely entangling transformations, such as the controlled-NOT operation, cannot in general be represented as a single tensor product of independent local operators. Recent research further demonstrates that tensor-product and operator-Schmidt decompositions can be used to characterize operator entanglement, reduce circuit complexity, and construct efficient representations of quantum processes. The results establish that linear algebra and tensor-product structures are not merely formal tools but constitute the mathematical foundation connecting quantum entanglement with quantum computation.

HSR (London)•Oct 8, 2026•0 citations
Quantum gates are represented by unitary operators on a Hilbert space. We consider the unitary operators on and describe the component operators on each Hilbert space in the product space. From these criteria we derive a decomposition for a specific class of unitary operators such that each operator in the product has Schmidt rank bounded by 2. This decomposition directly yields the XOR (controlled NOT) implementation of the SWAP operation.
We show that any unitary operator on the ${d}_{A}\ifmmode\times\else\texttimes\fi{}{d}_{B}$ system $({d}_{A}\ensuremath{\ge}2)$ can be decomposed into the product of at most $4{d}_{A}\ensuremath{-}5$ controlled unitary operators. The number can be reduced to $2{d}_{A}\ensuremath{-}1$ when dA{d}_{A}dA​ is a power of two. We also prove that three controlled unitaries can implement a bipartite complex permutation operator, and discuss the connection to an analogous result on classical reversible circuits. We further show that any nnn-partite unitary on the space ${\mathbb{C}}^{{d}_{1}}\ensuremath{\bigotimes}\ensuremath{\cdots}\ensuremath{\bigotimes}{\mathbb{C}}^{{d}_{n}}$ is the product of at most $[2{\ensuremath{\prod}}_{j=1}^{n\ensuremath{-}1}(2{d}_{j}\ensuremath{-}2)\ensuremath{-}1]$ controlled unitary gates, each of which is controlled from $n\ensuremath{-}1$ systems. We also decompose any bipartite unitary into the product of a simple type of bipartite gate and some local unitaries. We derive dimension-independent upper bounds for the controlled-not gate cost or entanglement cost of bipartite permutation unitaries (with the help of ancillas of fixed size) as functions of the Schmidt rank of the unitary. It is shown that such costs under a simple protocol are related to the log-rank conjecture in communication complexity theory via the link of nonnegative rank.
A general scheme is presented to decompose a d-by-d unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in d - 1 classes, where each class is isomorphic to the group of 2 × 2 unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on n-qubit registers can be expressed as no more than 2n-1(2n-1) fully controlled single-qubit gates chosen from 2n-1 classes, where the quantum gates in each class share the same n - 1 control qubits. Moreover, it is shown that one can easily adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.
We characterize three-qubit controlled unitary gates of Schmidt rank three, establishing necessary and sufficient conditions for such gates to have Schmidt rank three. We construct explicit examples and analyze their entanglement capabilities, showing that gates with Schmidt rank three can generate output states ranging from fully separable to maximal GHZ-class states. Within this classification, we present a parameterized gate family that produces an output W-class state whose bipartite tangles for subsystems AB and AC are modulated as simple trigonometric functions of a single phase parameter. The examples also include gates implementable with only three CNOT gates, showing that this lower bound is achievable. Decompositions that achieve the minimum possible CNOT count for several other cases are provided as well. Our results bridge Schmidt rank classification, entanglement structure, and resource-efficient circuit synthesis.
In quantum computation every unitary operation can be decomposed into quantum circuits---a series of single-qubit rotations and a single type entangling two-qubit gates, such as controlled-not(cnot) gates. Two measures are important when judging the complexity of the circuit: the total number of cnot gates needed to implement it and the depth of the circuit, measured by the minimal number of computation steps needed to perform it. Here we give an explicit and simple quantum circuit scheme for preparation of arbitrary quantum states, which can directly utilize any decomposition scheme for arbitrary full quantum gates, thus connecting the two problems. Our circuit reduces the depth of the best currently known circuit by a factor of 222. It also reduces the total number of cnot gates from 2n{2}^{n}2n to 23242n\frac{23}{24}{2}^{n}2423​2n in the leading order for even number of qubits. Specifically, the scheme allows us to decrease the upper bound from 111111 cnot gates to 999 and the depth from 111111 to 555 steps for four qubits. Our results are expected to help in designing and building small-scale quantum circuits using present technologies.
Quantum computing is fundamentally based on the mathematical structure of complex Hilbert spaces, linear operators, tensor products, and unitary transformations. Among these concepts, tensor products provide the formal mechanism for constructing the state space of composite quantum systems, whereas linear and unitary operators describe quantum transformations, measurements, and computational gates. This article examines the mathematical relationship between linear operators and tensor products and analyzes their role in the formation, manipulation, and characterization of quantum entanglement. Particular attention is given to two-qubit systems, separable and entangled states, Schmidt decomposition, controlled operations, and the role of non-factorizable operators in quantum circuits. The analysis demonstrates that tensor products perform a dual function: they provide the mathematical representation of composite systems and enable the construction of local operations acting on individual subsystems. At the same time, genuinely entangling transformations, such as the controlled-NOT operation, cannot in general be represented as a single tensor product of independent local operators. Recent research further demonstrates that tensor-product and operator-Schmidt decompositions can be used to characterize operator entanglement, reduce circuit complexity, and construct efficient representations of quantum processes. The results establish that linear algebra and tensor-product structures are not merely formal tools but constitute the mathematical foundation connecting quantum entanglement with quantum computation.