Publication:4502622
From MaRDI portal
zbMath1050.81519arXivquant-ph/9807064MaRDI QIDQ4502622
Martin Roetteler, Markus Püschel, Thomas Beth
Publication date: 3 April 2001
Full work available at URL: https://arxiv.org/abs/quant-ph/9807064
algorithm; solvable group; quantum computer; construction of fast Fourier transforms; fast quantum Fourier transforms
68W30: Symbolic computation and algebraic computation
20C15: Ordinary representations and characters
81P68: Quantum computation
65T50: Numerical methods for discrete and fast Fourier transforms
Related Items
Uses Software