Almost-Optimal Computational Basis State Transpositions

Steven Herbert, Julien Sorci, Yao Tang

We give an explicit construction to perform any $n$-qubit computational basis state transposition using $\Theta (n)$ gates. This nearly coincides with the lower bound $\Omega (n/\log (nd))$ on…