Almost-Optimal Computational Basis State Transpositions
Abstract
We give an explicit construction to perform any n-qubit computational basis state transposition using (n) gates. This nearly coincides with the lower bound (n/(nd)) on worst-case and average-case gate complexity to perform transpositions using a d-element gate-set, which we also prove.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.