Preprint
Aug 2026
Quantum Fourier transform toolbox
Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm of the group order, efficient constructions are known for relatively few non-abelian families. We develop two new approaches to QFT circuit c...
Carli Bruinsma, P. M. Posta, Joppe Stokvis et al.
· 0 citations