2 papers
quant-ph2026
Quantum Fourier transform toolbox
Carli Bruinsma, Pietro M. Posta, Joppe Stokvis +2
Quantum Fourier transforms (QFTs) are essential primitives in quantum algorithms. While abelian groups admit efficient QFT circuits, with circuit size polynomial in the logarithm o…
quant-ph2026
Quantum Fourier transform for the symmetric group
Carli Bruinsma, Dmitry Grinko, Maris Ozols
Quantum Fourier transforms (QFT) for general groups were recognized to be fundamental already early in the field. A canonical example of non-abelian QFT for the symmetric group was…