A Binary-Shadow Method for Wire Permutations and the Exact CNOT Cost of n-Qubit Cyclic SWAP Gates

Abstract

We develop the binary-shadow method for exact CNOT counting and apply it to arbitrary wire permutations. The Heisenberg evolution of rotated local Z observables converts every CNOT gate into an elementary transvection over ${\mathbb{F}}_2$, and for a wire permutation, the resulting binary shadow is rigid: it must equal the associated permutation matrix. This reduces the exact CNOT cost of a wire permutation in the CNOT+local model to the transvection length of its permutation matrix. The remaining problem is classical. The relevant mathematical input is the transvection-length theory of permutation matrices, or equivalently, the CNOT-only synthesis of permutation circuits. Combining the binary-shadow reduction with the graph-theoretic link-middle-cut theorem for cycle matrices yields an exact formula: if $\sigma \in S_n$ has $c\left(\sigma \right)$ disjoint cycles, then $\mathrm{CNOT-cost}\left(W_{\sigma }\right)={\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right).$ The novelty is therefore not the CNOT-only permutation formula by itself, but the transfer of that exact lower bound to the CNOT+local model: arbitrary one-qubit gates may rotate the local Pauli axes, but they cannot reduce the CNOT count of a wire permutation. In particular, the n-qubit cyclic SWAP gate $S_n|x_1{⟩}_1|x_2{⟩}_2\cdots |x_n{⟩}_n=|x_n{⟩}_1|x_1{⟩}_2\cdots {|x_{n-1}⟩}_n$ requires exactly $3(n-1)$ CNOT gates, even when arbitrary one-qubit gates are allowed at zero cost. Thus, the exact values for $n=2,3,4,5,6,\dots$ are $3,6,9,12,15,\dots$. We also give explicit optimal factorizations for $n=4$ and $n=5$, and show more generally that each additional wire in a cyclic shift costs exactly three more CNOT gates.

1. Introduction

Minimizing the number of CNOT gates is a central problem in exact quantum circuit synthesis and reversible-circuit optimization [1,2,3]. In most architectures, one-qubit gates are far cheaper and more reliable than two-qubit entangling gates, so the CNOT count is a natural and practically meaningful cost measure. The two-qubit SWAP gate is the standard benchmark: the standard optimal construction uses three CNOT gates, and three are necessary in the exact two-qubit synthesis theory [4,5]. For larger systems, upper bounds are easy to obtain from explicit constructions, but matching lower bounds are often subtle once arbitrary one-qubit gates are allowed.

Wire permutations are also a basic data-movement primitive. They appear when logical qubits must be routed to physical locations, when swap networks rearrange registers, and when permutation subroutines are used inside larger quantum algorithms. An exact lower bound for these gates therefore separates unavoidable two-qubit cost from artefacts of a particular compiler or circuit decomposition.

This paper develops a binary-shadow framework for exact CNOT counting in the CNOT+local model and uses it to treat the general n-qubit problem. The target gate is the cyclic wire permutation

$$S_n|x_1{⟩}_1|x_2{⟩}_2\cdots |x_n{⟩}_n= |x_n{⟩}_1|x_1{⟩}_2\cdots {|x_{n-1}⟩}_n.$$

(1)

For $n=2$, this is the ordinary SWAP and costs 3 CNOT gates. For $n=3$, the cost is 6. The natural question is whether there is a closed formula for general n, and more generally, for arbitrary wire permutations.

The binary-shadow method shows that the quantum problem is equivalent to a classical one. Working in the Heisenberg picture, we allow the local Pauli Z axis on each qubit to rotate under the surrounding one-qubit gates. After this change in viewpoint, each CNOT contributes one elementary transvection over ${\mathbb{F}}_2$, so every circuit with k CNOT gates has a binary shadow that is a product of k transvections. For a wire permutation, the shadow is rigid: it must coincide with the associated permutation matrix. Consequently, for every wire permutation $W_{\sigma }$, one has

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)={\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right),$$

(2)

where $P_{\sigma }$ is the permutation matrix of $\sigma$ and ${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)$ is its transvection length over ${\mathbb{F}}_2$.

Thus, the quantum question becomes the classical question of computing the transvection length of permutation matrices. This places the problem in the theory of linear reversible circuits, where CNOT-only synthesis is Gaussian elimination over ${\mathbb{F}}_2$, and optimization is governed by word length with respect to elementary transvections [3,6,7]. The decisive concept here is the graph-theoretic link-middle-cut decomposition introduced by Bu, Fan, and Joo in their study of exact CNOT synthesis for linear reversible circuits [8]. Their result shows that an m-cycle permutation matrix requires exactly $3(m-1)$ CNOT gates in the CNOT-only model. Related permutation-circuit realizations have also been studied recently from a group-theoretic quantum-circuit perspective [9]. Combined with the binary-shadow reduction, this immediately suggests a complete answer for cyclic SWAP gates. In fact, by adding a short induction on the number of cycles, one obtains a formula for every permutation matrix.

The main result of this paper is the following.

Theorem 1.

Let $\sigma \in S_n$, and let $c\left(\sigma \right)$ denote the number of disjoint cycles in its cycle decomposition, including fixed points. Then,

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)={\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right).$$

(3)

In particular, if $S_n$ is the cyclic SWAP gate from (1), then

$$\mathrm{CNOT-cost}\left(S_n\right)=3(n-1).$$

(4)

Comparison with Existing Work and Novelty

The CNOT-only part of (3) is not claimed as new. Bataille studied the algebraic structure and optimization of CNOT circuits and, in compatible notation, reports the cost $3(n-p)$ for a permutation/cycling with p components [10]. Bu, Fan, and Joo later proved, using the link-middle-cut method, that n-cycle matrices require $3(n-1)$ CNOT gates and also generalized the statement to permutation circuits [8]. Liu et al. studied related realizations of permutation groups by CNOT circuits, including exact results for the three-qubit cycle and upper-bound constructions for larger cases [9]. Recent work on sparse amplitude permutation gates further shows that permutation-type primitives remain relevant in state preparation and circuit decomposition [11].

The contribution of the present paper is different: it proves that these CNOT-only lower bounds remain valid even in the larger CNOT+local model, where arbitrary one-qubit gates may be inserted before, after, and between the CNOT gates for free. A priori, those local gates can rotate the Pauli axes and might conceivably create a shorter entangling-gate implementation. The binary-shadow rigidity theorem rules this out for wire permutations. Thus, this paper gives a model-lifting argument from CNOT-only transvection length to exact CNOT complexity with free local gates.

Equation (4) settles the exact values for the first unresolved cases:

$$\mathrm{CNOT-cost}\left(S_4\right)=9,\mathrm{CNOT-cost}\left(S_5\right)=12,\mathrm{CNOT-cost}\left(S_6\right)=15.$$

More generally, every time the cyclic shift gains one additional qubit, the optimal CNOT count increases by exactly three.

The proof is deliberately phrased in the Heisenberg picture, following a standard viewpoint in quantum computation and stabilizer-circuit analysis [12,13]. Unlike stabilizer simulation, however, the binary shadow used here tracks only the support pattern of rotated local Z axes; this coarse invariant is weak for general unitaries but becomes exact for wire permutations.

This paper is organized as follows. Section 2 fixes the notation and records the conventions used throughout. Section 3 develops binary shadows of CNOT+local circuits. Section 4 proves the rigidity theorem for wire permutations and the reduction (2). Section 5 computes the transvection length of permutation matrices using cycle structure and the classical exact m-cycle theorem. Section 6 specializes the formula to n-qubit cyclic SWAP gates, including explicit optimal factorizations for $n=4$ and $n=5$. Section 7 discusses applications and implications for circuit compilation and resource accounting. Section 8 closes with a more explicit conclusion and open directions.

2. Notation and Setup

We work on the Hilbert space ${\left({\mathbb{C}}^2\right)}^{\otimes n}$ of n qubits. The computational basis on qubit r is denoted by ${|0⟩}_r,{|1⟩}_r$. If

$$|x⟩= |x_1{⟩}_1\cdots {|x_n⟩}_n,x_r\in \{0,1\},$$

then $x=(x_1,\dots ,x_n)$ will also be regarded as a vector in ${\mathbb{F}}_2^n$. Throughout this paper, all addition in ${\mathbb{F}}_2$ is modulo 2, and products of gates are read from right to left.

If $i\ne j$, then ${\mathrm{CNOT}}_{i\to j}$ denotes the controlled-NOT gate with control qubit i and target qubit j. Explicitly,

$${\mathrm{CNOT}}_{i\to j}|x_1{⟩}_1\cdots |x_n{⟩}_n= |x_1{⟩}_1\cdots |x_i{⟩}_i\cdots |x_i+x_j{⟩}_j\cdots {|x_n⟩}_n,$$

(5)

with all other qubits unchanged. The arrow in ${\mathrm{CNOT}}_{i\to j}$ therefore points from the control qubit to the target qubit.

A local unitary is a tensor product

$$L=U_1\otimes \cdots \otimes U_n,$$

where each $U_r$ is a one-qubit unitary acting on qubit r only.

For permutation $\sigma \in S_n$, we write $W_{\sigma }$ for the corresponding wire permutation:

$$W_{\sigma }|{\psi }_1{⟩}_1\cdots |{\psi }_n{⟩}_n= |{\psi }_{\sigma \left(1\right)}{⟩}_1\cdots {|{\psi }_{\sigma \left(n\right)}⟩}_n.$$

(6)

Thus, output wire r receives the input state that originally sat on wire $\sigma \left(r\right)$. Equivalently,

$$W_{\sigma }^{†}{Z}_r{W}_{\sigma }=Z_{\sigma \left(r\right)}(r=1,\dots ,n),$$

(7)

where $Z_r$ denotes the Pauli Z operator acting on qubit r.

We now introduce the binary objects that will encode the CNOT pattern.

Definition 1.

A local axis on qubit r is an observable of the form

$$A_r=u_{r}Z{u}_r^{†}$$

for some one-qubit unitary $u_r$. Equivalently, $A_r$ is a traceless Hermitian unitary on qubit r; in particular, $A_r^2=I$ and the eigenvalues of $A_r$ are $\pm 1$.

In Bloch-sphere language, a local axis is simply a rotated Pauli Z direction. Allowing these axes to vary is what lets the one-qubit gates be absorbed into the formalism.

More explicitly, if $X,Y,Z$ are the Pauli matrices, then every local axis can be written as

$$A_r={\alpha }_{r}X+{\beta }_{r}Y+{\gamma }_{r}Z,{\alpha }_r^2+{\beta }_r^2+{\gamma }_r^2=1,$$

so it is a measurement direction on the Bloch sphere obtained from the standard Z axis by a one-qubit change in basis. The word “local” means that the operator acts on one tensor factor only; the word “axis” refers to the corresponding Bloch-sphere direction.

Definition 2.

Let $\mathcal{A}=(A_1,\dots ,A_n)$ be a family of local axes, and let $x=(x_1,\dots ,x_n)\in {\mathbb{F}}_2^n$. We write

$${\mathcal{A}}^x:=A_1^{x_1}\otimes \cdots \otimes A_n^{x_n},A_r^0=I,A_r^1=A_r.$$

(8)

If, for example, $x=(1,0,1)$, then ${\mathcal{A}}^x=A_1\otimes I\otimes A_3$.

Because the factors in (8) act on different qubits, they commute, and one has

$${\mathcal{A}}^x{\mathcal{A}}^y={\mathcal{A}}^{x+y}(x,y\in {\mathbb{F}}_2^n).$$

For a bit vector $x\in {\mathbb{F}}_2^n$, we write

$$supp\left(x\right):=\{r\in \{1,\dots ,n\}:x_r=1\}$$

for its support.

Definition 3.

For $i\ne j$, let $T_{j\leftarrow i}\in GL(n,{\mathbb{F}}_2)$ be the elementary transvection defined by

$$T_{j\leftarrow i}{e}_j=e_i+e_j,T_{j\leftarrow i}{e}_r=e_r(r\ne j),$$

(9)

where $e_1,\dots ,e_n$ is the standard basis of ${\mathbb{F}}_2^n$.

The notation in (9) is chosen to mirror the circuit notation: the CNOT gate ${\mathrm{CNOT}}_{i\to j}$ contributes the transvection $T_{j\leftarrow i}$ on the Heisenberg-side labels.

For clarity, $T_{j\leftarrow i}$ is the only elementary transvection notation used below. When a two-wire swap is expanded, it will be written as the three directed transvections $T_{b\leftarrow a}{T}_{a\leftarrow b}{T}_{b\leftarrow a}$, not as an undefined bidirectional symbol.

Definition 4.

For $\sigma \in S_n$, the associated permutation matrix $P_{\sigma }\in GL(n,{\mathbb{F}}_2)$ is defined by

$$P_{\sigma }{e}_r=e_{\sigma \left(r\right)}(r=1,\dots ,n).$$

(10)

We write ${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)$ for the minimal number of elementary transvections needed to factor $P_{\sigma }$.

If $\sigma$ has disjoint cycle decomposition

$$\sigma ={\gamma }_1{\gamma }_2\cdots {\gamma }_c,$$

we write $c\left(\sigma \right)=c$ for the number of cycles, counting fixed points as 1-cycles. If $m_i$ is the length of ${\gamma }_i$, then

$$m_1+\cdots +m_c=n.$$

Finally, we fix the specific cyclic shift permutation used throughout this paper.

Definition 5.

Let ${\sigma }_n\in S_n$ be the cycle defined by

$${\sigma }_n\left(1\right)=n,{\sigma }_n\left(r\right)=r-1(2\le r\le n).$$

(11)

The corresponding wire permutation $W_{{\sigma }_n}$ will be denoted by $S_n$ and called the n-qubit cyclic SWAP gate. Thus,

$$S_n|x_1{⟩}_1|x_2{⟩}_2\cdots |x_n{⟩}_n= |x_n{⟩}_1|x_1{⟩}_2\cdots {|x_{n-1}⟩}_n.$$

(12)

The matrix $P_{{\sigma }_n}$ is the standard cyclic permutation matrix

$$P_{{\sigma }_n}=\left(\begin{array}{ccccc}0& 1& 0& \cdots & 0\\ 0& 0& 1& \cdots & 0\\ ⋮& ⋮& ⋮& \ddots & ⋮\\ 0& 0& 0& \cdots & 1\\ 1& 0& 0& \cdots & 0\end{array}\right).$$

(13)

3. Binary Shadows of CNOT+Local Circuits

The construction below is a support-level version of the Heisenberg evolution of Pauli observables [12,13]. The surrounding one-qubit gates are absorbed by allowing the local Z axes to rotate. We begin with the basic one-CNOT calculation.

Lemma 1.

Let

$$G=L^{\mathrm{out}}{\mathrm{CNOT}}_{i\to j}{L}^{\mathrm{in}}$$

be an n-qubit circuit consisting of one CNOT gate and arbitrary local unitaries before and after it. Then, there exist families of local axes $\mathcal{A}=(A_1,\dots ,A_n)$ on the input side and $\mathcal{B}=(B_1,\dots ,B_n)$ on the output side such that

$$G^{†}{\mathcal{B}}^{e_r}G={\mathcal{A}}^{T_{j\leftarrow i}{e}_r}\mathrm{for}\mathrm{all}r=1,\dots ,n.$$

(14)

Consequently,

$$G^{†}{\mathcal{B}}^{x}G={\mathcal{A}}^{T_{j\leftarrow i}x}\mathrm{for}\mathrm{all}x\in {\mathbb{F}}_2^n.$$

(15)

Proof. 

Write

$$L^{\mathrm{in}}=V_1\otimes \cdots \otimes V_n,L^{\mathrm{out}}=U_1\otimes \cdots \otimes U_n.$$

Define local axes on the input and output sides by

$$A_r:=V_r^{†}Z{V}_r,B_r:=U_{r}Z{U}_r^{†}(r=1,\dots ,n).$$

For qubits $r\notin \{i,j\}$, the CNOT acts trivially, so

$$G^{†}{B}_{r}G=V_r^{†}Z{V}_r=A_r.$$

For the two active qubits, we use the standard Heisenberg identities

$${\mathrm{CNOT}}_{i\to j}^{†}{Z}_i{\mathrm{CNOT}}_{i\to j}=Z_i,{\mathrm{CNOT}}_{i\to j}^{†}{Z}_j{\mathrm{CNOT}}_{i\to j}=Z_i{Z}_j.$$

(16)

Hence,

$$G^{†}{B}_{i}G=A_i,G^{†}{B}_{j}G=A_i{A}_j.$$

This is precisely the elementary transvection $T_{j\leftarrow i}$ on exponent vectors. The basis vector $e_i$ labels the output axis $B_i$, and the identity $G^{†}{B}_{i}G=A_i$ says that its input-side exponent vector is still $e_i=T_{j\leftarrow i}{e}_i$. The basis vector $e_j$ labels $B_j$, and the identity $G^{†}{B}_{j}G=A_i{A}_j$ says that its input-side exponent vector is $e_i+e_j=T_{j\leftarrow i}{e}_j$. All other basis vectors are fixed. Equation (15) then follows from multiplicativity: conjugation preserves products, and the observables ${\mathcal{A}}^x$ multiply by bitwise addition of exponents. □

The previous lemma motivates the central definition.

Definition 6.

Let U be an n-qubit unitary. A matrix $M\in GL(n,{\mathbb{F}}_2)$ is called a binary shadow of U if there exist families of local axes $\mathcal{A}$ on the input side and $\mathcal{B}$ on the output side such that

$$U^{†}{\mathcal{B}}^{x}U={\mathcal{A}}^{Mx}\mathrm{for}\mathrm{all}x\in {\mathbb{F}}_2^n.$$

(17)

A binary shadow need not be unique for a general unitary, because the families of local axes in (17) may not be unique. The notation “a binary shadow of U” should therefore be read as “a binary shadow of U with respect to some chosen input and output local axes.” The axis families $\mathcal{A}$ and $\mathcal{B}$ may depend on U and on the particular CNOT+local decomposition used to construct the shadow. The next theorem shows, however, that the existence of a short shadow is automatic for every circuit with few CNOT gates.

Remark 1

(Terminology). The term “binary shadow” is not meant to invoke classical shadow tomography. Classical shadows are randomized measurement data used to estimate properties of quantum states. Here, the object is instead a deterministic matrix over ${\mathbb{F}}_2$ extracted from the Heisenberg evolution of rotated local Z axes. The word “shadow” is used only in the elementary sense that this matrix is a coarse binary projection of the full operator evolution.

Theorem 2.

Let U be an n-qubit circuit containing exactly k CNOT gates and any number of one-qubit gates. If the CNOT gates, in temporal order, are

$${\mathrm{CNOT}}_{i_1\to j_1},{\mathrm{CNOT}}_{i_2\to j_2},\dots ,{\mathrm{CNOT}}_{i_k\to j_k},$$

then U has a binary shadow

$$M=T_{j_1\leftarrow i_1}{T}_{j_2\leftarrow i_2}\cdots T_{j_k\leftarrow i_k}.$$

(18)

In particular, every k-CNOT circuit has a binary shadow that is a product of exactly k elementary transvections.

Proof. 

We argue by induction on k. If $k=0$, then U is local, say $U=U_1\otimes \cdots \otimes U_n$. Choose any family of output axes $\mathcal{B}=(B_1,\dots ,B_n)$ and define

$$A_r:=U_r^{†}{B}_r{U}_r.$$

Then, $U^{†}{\mathcal{B}}^{x}U={\mathcal{A}}^x$ for every $x\in {\mathbb{F}}_2^n$, so the identity matrix is a binary shadow of U.

Now, suppose the statement is true for circuits with $k-1$ CNOT gates, and write

$$U=G_{k}V,$$

where $G_k$ is the last CNOT block together with the local gates immediately adjacent to it, and V contains the first $k-1$ CNOT gates. By Lemma 1, there exist an intermediate family of local axes $\mathcal{C}$ and an output family $\mathcal{B}$ such that

$$G_k^{†}{\mathcal{B}}^x{G}_k={\mathcal{C}}^{T_{j_k\leftarrow i_k}x}\mathrm{for}\mathrm{all}x\in {\mathbb{F}}_2^n.$$

By the induction hypothesis applied to V, there exist an input family $\mathcal{A}$ and a binary shadow

$$N=T_{j_1\leftarrow i_1}\cdots T_{j_{k-1}\leftarrow i_{k-1}}$$

for which

$$V^{†}{\mathcal{C}}^{y}V={\mathcal{A}}^{Ny}\mathrm{for}\mathrm{all}y\in {\mathbb{F}}_2^n.$$

Combining the two identities gives

$$U^{†}{\mathcal{B}}^{x}U=V^{†}{G}_k^{†}{\mathcal{B}}^x{G}_{k}V=V^{†}{\mathcal{C}}^{T_{j_k\leftarrow i_k}x}V={\mathcal{A}}^{N{T}_{j_k\leftarrow i_k}x}.$$

Therefore,

$$M=N{T}_{j_k\leftarrow i_k}=T_{j_1\leftarrow i_1}\cdots T_{j_k\leftarrow i_k}$$

is a binary shadow of U. □

4. Wire Permutations and Transvection Length

For a wire permutation $W_{\sigma }$, the binary shadow is in fact unique.

Theorem 3.

Let U be an n-qubit circuit built from CNOT gates and one-qubit gates, and suppose that $U=W_{\sigma }$ is a wire permutation. Then, every binary shadow of U is equal to $P_{\sigma }$. Consequently,

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)\ge {\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right).$$

(19)

Proof. 

Let M be any binary shadow of U. By definition, there exist families of local axes $\mathcal{A}$ and $\mathcal{B}$ such that

$$U^{†}{\mathcal{B}}^{x}U={\mathcal{A}}^{Mx}\mathrm{for}\mathrm{all}x\in {\mathbb{F}}_2^n.$$

In particular,

$$U^{†}{B}_{r}U={\mathcal{A}}^{M{e}_r}(r=1,\dots ,n),$$

(20)

where $B_r={\mathcal{B}}^{e_r}$ is a local observable on output qubit r.

Because $U=W_{\sigma }$ only permutes tensor factors, the operator $U^{†}{B}_{r}U$ is local on input qubit $\sigma \left(r\right)$. On the other hand, the operator ${\mathcal{A}}^{M{e}_r}$ acts nontrivially, exactly on the qubits in $supp\left(M{e}_r\right)$, because every local axis $A_s$ is non-identity. Therefore, $supp\left(M{e}_r\right)$ must contain exactly one index, namely $\sigma \left(r\right)$. Equivalently,

$$M{e}_r=e_{\sigma \left(r\right)}(r=1,\dots ,n).$$

Thus, $M=P_{\sigma }$.

If U is realized with k CNOT gates, then by Theorem 2, it has a binary shadow that is a product of k transvections. Since every binary shadow is $P_{\sigma }$, the matrix $P_{\sigma }$ admits a factorization of length k. Hence, $k\ge {\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)$, which proves (19). □

Corollary 1.

For every wire permutation $W_{\sigma }$,

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)={\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right).$$

(21)

Equivalently, allowing arbitrary one-qubit gates does not lower the optimal CNOT count of a wire permutation below its optimal CNOT-only count.

Proof. 

The lower bound is exactly Theorem 3. For the reverse inequality, choose a shortest transvection factorization

$$P_{\sigma }=T_{j_1\leftarrow i_1}\cdots T_{j_k\leftarrow i_k}.$$

Consider the CNOT-only circuit

$$V={\mathrm{CNOT}}_{i_k\to j_k}\cdots {\mathrm{CNOT}}_{i_1\to j_1},$$

so that the CNOT gates appear in temporal order as

$${\mathrm{CNOT}}_{i_1\to j_1},\dots ,{\mathrm{CNOT}}_{i_k\to j_k}.$$

Applying Theorem 2 with no surrounding one-qubit gates shows that V has binary shadow $P_{\sigma }$ relative to the standard Z axes. Hence,

$$V^{†}{Z}_{r}V=Z_{\sigma \left(r\right)}(r=1,\dots ,n).$$

For computational-basis states, this means that the rth output bit is exactly the $\sigma \left(r\right)$th input bit, so V implements the wire permutation $W_{\sigma }$. Therefore, $\mathrm{CNOT-cost}\left(W_{\sigma }\right)\le k={\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)$. □

Remark 2.

Readers who prefer the usual Schrödinger-side bit-update convention may transpose all matrices. Since

$$T_{j\leftarrow i}^{\mathsf{T}}=T_{i\leftarrow j},$$

transvection length is unchanged by transposition, and the results above are independent of this convention.

Remark 3.

For any transposition $\left(ab\right)$, one has

$$P_{\left(ab\right)}=T_{b\leftarrow a}{T}_{a\leftarrow b}{T}_{b\leftarrow a},$$

so ${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\left(ab\right)}\right)\le 3$. By Corollary 1, this is exactly the CNOT cost of the corresponding two-wire swap. The exact three-CNOT lower bound for two-qubit SWAP follows from the standard optimal two-qubit synthesis results [4,5]. Hence,

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\left(ab\right)}\right)=3.$$

(22)

Section 4 is the quantum reduction step: every exact CNOT-counting problem for a wire permutation in the CNOT+local model becomes a transvection-length problem for a permutation matrix over ${\mathbb{F}}_2$. We now solve that classical problem for arbitrary permutations.

5. Transvection Length of Permutation Matrices

CNOT-only circuits on computational basis states implement invertible linear maps over ${\mathbb{F}}_2$, and elementary CNOT gates correspond exactly to elementary transvections. This viewpoint is standard in linear reversible circuit synthesis and optimization [3,6,7]. In this section, we derive the exact formula

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right)$$

for every permutation $\sigma \in S_n$. The key external input is the exact length of a single cycle matrix.

5.1. The Cycle Case and the Link-Middle-Cut Method

The relevant classical lower-bound technique is the link-middle-cut (LMC) decomposition of a CNOT synthesis, introduced by Bu, Fan, and Joo [8]. Their method associates several graphs with a CNOT circuit and classifies each gate as a link, middle, or cut gate. For a cycle matrix, they prove that each of these three classes must contain at least $m-1$ gates, yielding an exact lower bound of $3(m-1)$. The same paper also shows that optimal factorizations of a cycle matrix split into three spanning trees of size $m-1$.

This single-cycle theorem is closely aligned with earlier CNOT-only work of Bataille, who analyzed CNOT circuits through their underlying algebraic structure and stated the corresponding $3(n-p)$ cost for permutation/cycling structures with p components [10]. The LMC theorem is used here as the quoted exact transvection-length input, while the binary-shadow argument supplies the additional quantum reduction needed when arbitrary local gates are free.

For the purposes of the present paper, we need only the following theorem.

Theorem 4

(Bu–Fan–Joo). Let $\tau \in S_m$ be an m-cycle, and let $P_{\tau }$ be its permutation matrix over ${\mathbb{F}}_2$. Then,

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\tau }\right)=3(m-1).$$

(23)

Remark 4.

Theorem 4 is the exact classical statement needed to extend the binary-shadow method from the three-qubit cyclic SWAP to all n. In the notation of the introduction, it says precisely that the permutation matrix of the m-qubit cyclic shift has CNOT-only cost $3(m-1)$.

5.2. Cycle Decomposition and the General Permutation Formula

We now record two elementary lemmas that convert the single-cycle theorem into a formula for arbitrary permutations.

Lemma 2.

Let $\sigma \in S_n$, and let a and b lie in distinct cycles of σ. Then, the permutation $\sigma \circ \left(ab\right)$ has exactly one fewer cycle than σ:

$$c\left(\sigma \circ \left(ab\right)\right)=c\left(\sigma \right)-1.$$

Proof. 

Write the two cycles containing a and b as

$$(a{a}_2\dots a_r)\mathrm{and}(b{b}_2\dots b_s),$$

and let the remaining cycles of $\sigma$ be unchanged. Since the transposition $\left(ab\right)$ acts first in the composition $\sigma \circ \left(ab\right)$, we compute

$$a\mapsto b\mapsto b_2,b_2\mapsto b_2\mapsto b_3,\dots ,b_s\mapsto b_s\mapsto b,$$

and then,

$$b\mapsto a\mapsto a_2,a_2\mapsto a_2\mapsto a_3,\dots ,a_r\mapsto a_r\mapsto a.$$

Therefore, the two cycles merge into the single cycle

$$(a{b}_2\dots b_{s}b{a}_2\dots a_r),$$

while all other cycles are unchanged. Hence, the total number of cycles drops by exactly one. □

Proposition 1.

For every permutation $\sigma \in S_n$,

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)\le 3\left(n-c\left(\sigma \right)\right).$$

(24)

Proof. 

Let

$$\sigma ={\gamma }_1{\gamma }_2\cdots {\gamma }_c$$

be the disjoint cycle decomposition of $\sigma$, with $|{\gamma }_i|=m_i$. Each cycle ${\gamma }_i$ can be written as a product of $m_i-1$ transpositions:

$${\gamma }_i=\left(a_{i,1}{a}_{i,2}\right)\left(a_{i,2}{a}_{i,3}\right)\cdots \left(a_{i,m_i-1}{a}_{i,m_i}\right),$$

where ${\gamma }_i=(a_{i,1}{a}_{i,2}\dots a_{i,m_i})$. Since each transposition matrix has transvection length 3 by (22), we obtain

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{{\gamma }_i}\right)\le 3(m_i-1).$$

Because the cycles are disjoint, their permutation matrices commute and multiply to $P_{\sigma }$. By subadditivity of transvection length,

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)\le {\displaystyle \sum _{i=1}^c}{\mathsf{\ell }}_{\mathrm{tr}}\left(P_{{\gamma }_i}\right)\le {\displaystyle \sum _{i=1}^c}3(m_i-1)=3\left({\displaystyle \sum _{i=1}^c}{m}_i-c\right)=3(n-c).$$

This proves (24). □

We can now prove the exact formula.

Theorem 5.

For every permutation $\sigma \in S_n$,

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right).$$

(25)

Proof. 

The upper bound is Proposition 1. For the lower bound, we induct on $c\left(\sigma \right)$.

If $c\left(\sigma \right)=1$, then $\sigma$ is an n-cycle, and the claim is exactly Theorem 4.

Now, assume the formula is known for all permutations on n letters with fewer than $c\ge 2$ cycles, and let $\sigma$ have c cycles. Suppose for contradiction that

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)<3(n-c).$$

Choose a and b from two distinct cycles of $\sigma$, and set

$$\tau :=\sigma \circ \left(ab\right).$$

By Lemma 2, $\tau$ has $c-1$ cycles. Moreover, our convention $P_{\rho }{e}_r=e_{\rho \left(r\right)}$ gives $P_{\alpha \circ \beta }=P_{\alpha }{P}_{\beta }$ for all permutations $\alpha ,\beta$. Hence, for $\tau =\sigma \circ \left(ab\right)$,

$$P_{\tau }=P_{\sigma }{P}_{\left(ab\right)}.$$

There is no extra sign or phase issue: these are ordinary 0–1 permutation matrices, now regarded over ${\mathbb{F}}_2$. So, by subadditivity of transvection length and (22), we have

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\tau }\right)\le {\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)+{\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\left(ab\right)}\right)<3(n-c)+3=3\left(n-(c-1)\right).$$

This contradicts the induction hypothesis applied to $\tau$, since $c\left(\tau \right)=c-1$. Therefore, no such $\sigma$ can exist, and the lower bound

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{\sigma }\right)\ge 3\left(n-c\left(\sigma \right)\right)$$

holds for every $\sigma$. Together with Proposition 1, this proves (25). □

Remark 5.

Theorem 5 is consistent with the general permutation result proved by Bu, Fan, and Joo [8]. The point of the argument above is that, once the exact single-cycle length is known, the full cycle-structure formula follows by a short induction that fits naturally with the binary-shadow reduction.

The quantum consequence is now immediate.

Corollary 2.

For every wire permutation $W_{\sigma }$,

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right).$$

(26)

Proof. 

Combine Corollary 1 with Theorem 5. □

6. Exact CNOT Cost of the $\mathit{n}$-Qubit Cyclic SWAP

We now specialize Corollary 2 to the cyclic SWAP gate $S_n$ from Definition 5. Since ${\sigma }_n$ is a single n-cycle, we have $c\left({\sigma }_n\right)=1$, and therefore,

$$\mathrm{CNOT-cost}\left(S_n\right)=3(n-1).$$

(27)

We first record an explicit optimal family of circuits.

Proposition 2.

For every $n\ge 2$,

$$S_n={\mathrm{SWAP}}_{12}{\mathrm{SWAP}}_{23}\cdots {\mathrm{SWAP}}_{n-1,n}.$$

(28)

Consequently,

$$\mathrm{CNOT-cost}\left(S_n\right)\le 3(n-1).$$

(29)

At the level of transvections,

$$P_{{\sigma }_n}=\left(T_{n\leftarrow n-1}{T}_{n-1\leftarrow n}{T}_{n\leftarrow n-1}\right)\cdots \left(T_{2\leftarrow 1}{T}_{1\leftarrow 2}{T}_{2\leftarrow 1}\right).$$

(30)

Proof. 

Starting from the right-hand side of (28), the rightmost swap ${\mathrm{SWAP}}_{n-1,n}$ moves the state on wire n one position to the left, the next swap ${\mathrm{SWAP}}_{n-2,n-1}$ moves it one step further, and so on. After the full product is applied, the state originally on wire n has moved to wire 1, while each of the states originally on wires $1,2,\dots ,n-1$ has shifted one place to the right. This is exactly the action of $S_n$.

Each two-wire swap uses three CNOT gates, so (29) follows immediately. Replacing each swap by its standard three-transvection factorization gives (30). □

We can now state the exact theorem.

Theorem 6.

For every $n\ge 2$, the n-qubit cyclic SWAP gate satisfies

$$\mathrm{CNOT-cost}\left(S_n\right)=3(n-1).$$

(31)

Equivalently, the cyclic permutation matrix (13) has transvection length

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{{\sigma }_n}\right)=3(n-1).$$

(32)

Proof. 

The upper bound is Proposition 2. The lower bound follows from Corollary 2, because $c\left({\sigma }_n\right)=1$. □

The first unresolved cases asked for in the problem statement now follow immediately.

Corollary 3.

The exact CNOT costs of the four- and five-qubit cyclic SWAP gates are

$$\mathrm{CNOT-cost}\left(S_4\right)=9,\mathrm{CNOT-cost}\left(S_5\right)=12.$$

More generally,

$$\mathrm{CNOT-cost}\left(S_6\right)=15,\mathrm{CNOT-cost}\left(S_7\right)=18,\mathit{and}\mathit{in}\mathit{general}\mathrm{CNOT-cost}\left(S_n\right)=3n-3.$$

6.1. Explicit Optimal Factorizations for $n=4$ and $n=5$

For completeness, we write out the first two new cases explicitly.

Example 1

(The four-qubit cyclic SWAP). The four-qubit cyclic SWAP is

$$S_4{|a⟩}_1{|b⟩}_2{|c⟩}_3{|d⟩}_4={|d⟩}_1{|a⟩}_2{|b⟩}_3{|c⟩}_4.$$

Its permutation matrix is

$$P_{{\sigma }_4}=\left(\begin{array}{cccc}0& 1& 0& 0\\ 0& 0& 1& 0\\ 0& 0& 0& 1\\ 1& 0& 0& 0\end{array}\right),$$

(33)

and by Theorem 6, one has

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{{\sigma }_4}\right)=\mathrm{CNOT-cost}\left(S_4\right)=9.$$

One optimal factorization is

$$\begin{array}{cc}\hfill P_{{\sigma }_4}& =\left(T_{4\leftarrow 3}{T}_{3\leftarrow 4}{T}_{4\leftarrow 3}\right)\left(T_{3\leftarrow 2}{T}_{2\leftarrow 3}{T}_{3\leftarrow 2}\right)\left(T_{2\leftarrow 1}{T}_{1\leftarrow 2}{T}_{2\leftarrow 1}\right)\hfill \\ \hfill & =P_{\left(34\right)}{P}_{\left(23\right)}{P}_{\left(12\right)}.\hfill \end{array}$$

(34)

Thus, no exact implementation of $S_4$ can use fewer than nine CNOT gates, even with arbitrary one-qubit gates inserted anywhere in the circuit.

Example 2

(The five-qubit cyclic SWAP). The five-qubit cyclic SWAP is

$$S_5{|a⟩}_1{|b⟩}_2{|c⟩}_3{|d⟩}_4{|e⟩}_5={|e⟩}_1{|a⟩}_2{|b⟩}_3{|c⟩}_4{|d⟩}_5.$$

Its permutation matrix is

$$P_{{\sigma }_5}=\left(\begin{array}{ccccc}0& 1& 0& 0& 0\\ 0& 0& 1& 0& 0\\ 0& 0& 0& 1& 0\\ 0& 0& 0& 0& 1\\ 1& 0& 0& 0& 0\end{array}\right),$$

(35)

and Theorem 6 gives

$${\mathsf{\ell }}_{\mathrm{tr}}\left(P_{{\sigma }_5}\right)=\mathrm{CNOT-cost}\left(S_5\right)=12.$$

An optimal factorization is

$$\begin{array}{cc}\hfill P_{{\sigma }_5}& =\left(T_{5\leftarrow 4}{T}_{4\leftarrow 5}{T}_{5\leftarrow 4}\right)\left(T_{4\leftarrow 3}{T}_{3\leftarrow 4}{T}_{4\leftarrow 3}\right)\left(T_{3\leftarrow 2}{T}_{2\leftarrow 3}{T}_{3\leftarrow 2}\right)\left(T_{2\leftarrow 1}{T}_{1\leftarrow 2}{T}_{2\leftarrow 1}\right)\hfill \\ \hfill & =P_{\left(45\right)}{P}_{\left(34\right)}{P}_{\left(23\right)}{P}_{\left(12\right)}.\hfill \end{array}$$

(36)

Hence, twelve CNOT gates are necessary and sufficient.

6.2. First Exact Values

Table 1 lists the first exact values for cyclic SWAP gates.

Table 1. Exact CNOT cost of the n-qubit cyclic SWAP gate.

n	$\mathit{c}\left({\mathit{\sigma }}_{\mathit{n}}\right)$	$\mathrm{CNOT-cost}\left({\mathit{S}}_{\mathit{n}}\right)$
2	1	3
3	1	6
4	1	9
5	1	12
6	1	15
⋮	⋮	$3(n-1)$

The table exhibits the simplest qualitative consequence of the theorem: the exact cost grows linearly with slope 3. In particular, extending a cyclic shift from n to $n+1$ wires increases the optimal CNOT count by exactly three.

7. Applications and Implications

The theorem has three immediate implications.

First, it gives a certified benchmark for qubit-routing and register-rearrangement subroutines. If an algorithm or compiler must implement a pure wire permutation $W_{\sigma }$ in an unconstrained architecture, then $3(n-c(\sigma \left)\right)$ CNOT gates are unavoidable. In particular, the adjacent-swap construction for an n-cycle is not merely natural; it is globally optimal even after arbitrary one-qubit gates are allowed at zero cost.

Second, the result clarifies the role of local gates in exact synthesis. In many Clifford, Clifford$+T$, and reversible-linear compilation tasks, local gates are treated as comparatively cheap. The binary-shadow rigidity theorem shows that, for wire permutations, those local degrees of freedom cannot be exploited to reduce the two-qubit cost. This provides a reusable proof strategy: if a target family has a rigid support-level Heisenberg shadow, then CNOT-only lower bounds may transfer to the CNOT+local setting.

Third, the result is relevant as a low-level resource-accounting primitive for larger permutation-based constructions. Recent work on sparse amplitude permutation gates uses permutation subroutines in state-preparation problems [11]. Recent quantum-information and quantum-secure communication protocols also emphasize the need to account carefully for quantum resources, including semi-quantum private comparison protocols [14,15,16] and quantum-based authentication schemes for smart-grid settings [17]. The present theorem does not optimize those complete protocols; rather, it supplies an exact lower bound for the pure wire-permutation/data-movement component whenever such a component occurs inside a larger construction.

8. Conclusions and Future Work

The binary-shadow method reduces an exact CNOT-counting problem for quantum circuits to a transvection-length problem over ${\mathbb{F}}_2$. For wire permutations, this reduction is complete: the binary shadow is rigid, and the CNOT complexity in the CNOT+local model is exactly the same as in the CNOT-only model. In this sense, arbitrary one-qubit gates do not create any hidden shortcut for permuting qubit wires.

The present paper extends the three-qubit cyclic SWAP analysis to arbitrary n. The exact formula

$$\mathrm{CNOT-cost}\left(S_n\right)=3(n-1)$$

shows that the linear upper bound coming from adjacent swaps is already optimal. More generally, the formula

$$\mathrm{CNOT-cost}\left(W_{\sigma }\right)=3\left(n-c\left(\sigma \right)\right)$$

expresses the exact CNOT cost of a wire permutation entirely in terms of its cycle structure.

Conceptually, three mathematical ideas are doing the work:

• The Heisenberg-picture binary shadow, which extracts a matrix over ${\mathbb{F}}_2$ from a CNOT+local circuit;
• Rigidity for wire permutations, which forces that shadow to be the permutation matrix itself;
• The graph-theoretic link-middle-cut theory of CNOT syntheses, which computes the transvection length of cycle matrices and hence, of arbitrary permutation matrices.

Together, these ideas turn a quantum lower-bound problem into a concrete question about word length in $GL(n,{\mathbb{F}}_2)$ with respect to elementary transvections.

There are several natural directions for further work. First, it would be interesting to identify other classes of target unitaries for which the binary shadow is similarly rigid. Second, one can ask for analogous exact formulas under architectural constraints; for example, when only nearest-neighbour CNOT gates are allowed. Third, the permutation case suggests investigating whether the binary-shadow method can be fused with other classical lower-bound techniques beyond the LMC framework, potentially yielding new exact CNOT counts for larger families of unitaries.

The comparison with the existing CNOT-only literature is now transparent. The formula $3(n-c(\sigma \left)\right)$ is already present at the level of CNOT-only permutation circuits; what is proved here is that the same value is the exact CNOT cost in the larger CNOT+local model. Thus, this paper’s main role is not to replace the LMC theory or earlier CNOT-only analyses, but to explain why their permutation lower bounds survive the addition of arbitrary one-qubit gates.

The limitations are also clear. The binary shadow records only the support pattern of rotated local Z axes, so it is generally too coarse to classify arbitrary unitaries. It becomes decisive here because a wire permutation maps each local output observable to a single local input observable, forcing the shadow matrix to be a permutation matrix. Extending the method therefore requires finding other target families with comparable rigidity.

Finally, it would be useful to turn the binary-shadow obstruction into an automated compiler certificate: given a proposed short circuit for a wire permutation, the certificate would show directly that its CNOT count is below the transvection length and hence, impossible.