Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Quantum computation and quantum information
Quantum computation and quantum information
Spectral Techniques in Digital Logic
Spectral Techniques in Digital Logic
Fast parallel circuits for the quantum Fourier transform
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Development of Quantum Functional Devices for Multiple-Valued Logic Circuits
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
ISMVL '02 Proceedings of the 32nd International Symposium on Multiple-Valued Logic
Quantum Device Model-Based Super Pass Gate for Multiple-Valued Digital Systems
ISMVL '95 Proceedings of the 25th International Symposium on Multiple-Valued Logic
The quantum fourier transform and extensions of the abelian hidden subgroup problem
The quantum fourier transform and extensions of the abelian hidden subgroup problem
Synthesis of quantum circuits for d-level systems by using cosine-sine decomposition
Quantum Information & Computation
| Hi-index | 14.98 |
Quantum Fourier Transform (QFT) plays a principal role in the development of efficient quantum algorithms. Since the number of quantum bits that can currently be 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{\hbox{-}}\rm valued transform improves approximation properties and increases the state space by a factor of (q/2)^{n}. Further, we use nonbinary QFT derivation to generalize and improve the approximation bounds for QFT.