Scaling and Better Approximating Quantum Fourier Transform by Higher Radices

DOI10.1109/TC.2007.35zbMath1390.81015arXivquant-ph/0702195OpenAlexW2119110040MaRDI QIDQ4564113

Zeljko Zilic, Katarzyna Radecka

Publication date: 12 June 2018

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0702195

Mathematics Subject Classification ID

Quantum computation (81P68) Numerical methods for discrete and fast Fourier transforms (65T50) Computational methods for problems pertaining to quantum theory (81-08)

Related Items (2)

Outcome determinism in measurement-based quantum computation with qudits ⋮ Paired quantum Fourier transform with \(\log_2N\) Hadamard gates

This page was built for publication: Scaling and Better Approximating Quantum Fourier Transform by Higher Radices