Scaling and Better Approximating Quantum Fourier Transform by Higher Radices
From MaRDI portal
Publication:4564113
DOI10.1109/TC.2007.35zbMATH Open1390.81015arXivquant-ph/0702195OpenAlexW2119110040MaRDI QIDQ4564113FDOQ4564113
Authors: Zeljko Zilic, Katarzyna Radecka 
Publication date: 12 June 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Abstract: Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently built is limited, while many quantum technologies are inherently three- (or more) valued, we consider extending the reach of the realistic quantum systems by building a QFT over ternary quantum digits. Compared to traditional binary QFT, the q-valued transform improves approximation properties and increases the state space by a factor of (q/2)n. Further, we use non-binary QFT derivation to generalize and improve the approximation bounds for QFT.
Full work available at URL: https://arxiv.org/abs/quant-ph/0702195
Quantum computation (81P68) Computational methods for problems pertaining to quantum theory (81-08) Numerical methods for discrete and fast Fourier transforms (65T50)
Cited In (2)
This page was built for publication: Scaling and Better Approximating Quantum Fourier Transform by Higher Radices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564113)
