Generic Quantum Fourier Transforms

TL;DR

This paper introduces a versatile framework for constructing efficient quantum Fourier transform circuits applicable to various finite groups, including new families and linear groups, advancing quantum algorithm capabilities.

Contribution

It presents a generic method to build efficient QFT circuits for a broad class of groups using classical Fourier techniques and algebraic structures, including new circuits for linear groups.

Findings

Efficient quantum circuits for QFT over many finite groups.

First subexponential-size circuits for linear groups GL_k(q) and SL_k(q).

Applicable to both Abelian and non-Abelian groups.

Abstract

The quantum Fourier transform (QFT) is the principal algorithmic tool underlying most efficient quantum algorithms. We present a generic framework for the construction of efficient quantum circuits for the QFT by ``quantizing'' the separation of variables technique that has been so successful in the study of classical Fourier transform computations. Specifically, this framework applies the existence of computable Bratteli diagrams, adapted factorizations, and Gel'fand-Tsetlin bases to offer efficient quantum circuits for the QFT over a wide variety a finite Abelian and non-Abelian groups, including all group families for which efficient QFTs are currently known and many new group families. Moreover, the method gives rise to the first subexponential-size quantum circuits for the QFT over the linear groups GL_k(q), SL_k(q), and the finite groups of Lie type, for any fixed prime power q.