IEEE International Symposium on Multiple-Valued Logic (ISMVL)

The role of super-fast transforms in speeding up quantum computations

Z. Zilic, Katarzyna Radecka

Published Jun 25, 2003• 7 citations

Abstract

We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While the fast transform algorithms reduce the number of operations needed in obtaining the transforms from O(2/sup 2n/) to O(n/sup 2n/), quantum transforms are in comparison super-fast. The quantum Fourier transform can be performed in O(n/sup 2/) time, while the specific cases of Walsh-Hadamard and Chrestenson transforms require only O(n) operations. We derive quantum Fourier transform over non-binary quantum digits using the Chrestenson gate, which can serve as a basic block for quantum transforms.

DOI: 10.1109/ismvl.2002.1011080

Related papers

Efficient Quantum Transforms

Peter Høyer

Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a generalized Kronecker product is given. Applications include re-development of the networks for computing the Walsh-Hadamard and the quantum Fourier transform. New networks for two wavelet transforms are given. Quantum computation of Fourier transforms for non-Abelian groups is defined. A slightly relaxed definition is shown to simplify the analysis and the networks that computes the transforms. Efficient networks for computing such transforms for a class of metacyclic groups are introduced. A novel network for computing a Fourier transform for a group used in quantum error-correction is also given.

arXiv:quant-ph/9702028Feb 12, 199777 citations

A review on quantum Fourier transform

Tomás Barros, Pablo Álvarez, Bárbara Vidal +1 more

This survey presents a comprehensive analysis of the quantum Fourier transform (QFT), a fundamental tool in quantum computing, in comparison to its classical counterpart, the fast Fourier transform (FFT). The study begins with an introduction to the classical Fourier transform, which is widely used in different disciplines such as signal and image processing. The article introduces the QFT as a quantum version of the Fourier transform, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the operation, and highlighting its crucial role in quantum algorithms like Shor’s algorithm for integer factorization. The analysis also addresses the mathematical foundations of the QFT, its implementation in quantum circuits, and the key advantages and challenges associated with its use, such as measurement precision and quantum decoherence. Finally, it concludes with an exploration of the current and potential applications of QFT in quantum computing.

Quantum Information ProcessingJan 27, 20262 citations

Quantum Fourier Transform and Its Application in Shor’s Algorithm

Zhongwei Wang, Xirui Gou, Ruiqing Fu +1 more

Quantum Fourier transform (QFT) plays an eminent role in quantum computation.It creates a superposition of different quantum states, allowing simultaneous calculation, which would take many steps were the same program implemented on a classical computer.The computational speed of a quantum computer is thus boosted dramatically.In this article, we explain the application of QFT in Shor's algorithm, which was proposed by Peter Shor to factor large integers on quantum computers.Specifically, the principle and design of quantum Fourier transform are explained.We stress the subtle distinction between QFT and its inverse.Since former articles did not emphasize it, we hope it could be a supplement to former articles.Our next work is to verify the existing articles on executing Shor's algorithm by conducting two experiments on IBMQ of factoring N = 15 in two ways (a = 7 and a = 11).We find that the effect of quantum entanglement might be crucial to the speed boost of factoring large integers in Shor's algorithm.

International Conference on Computer Engineering, Information Science & Application Technology (ICCIA)Jan 1, 20200 citations

A simplification of the Shor quantum factorization algorithm employing a quantum Hadamard transform

Rupert C. D. Young, Philip M. Birch, Chris R. Chatwin

The Shor quantum factorization algorithm allows the factorization or large integers in logarithmic squared time whereas classical algorithms require an exponential time increase with the bit length of the number to be factored. The hardware implementation of the Shor algorithm would thus allow the factorization of the very large integers employed by commercial encryption methods. We propose some modifications of the algorithm by employing some simplification to the stage employing the quantum Fourier transform. The quantum Hadamard transform may be used to replace the quantum Fourier transform in certain cases. This would reduce the hardware complexity of implementation since phase rotation gates with only two states of 0 and π would be required.

Pattern Recognition and TrackingApr 27, 20184 citations

Quantum computing and a unified approach to fast unitary transforms

Sos С. Agaian, Andreas Klappenecker

A quantum computer directly manipulates information stored in the state of quantum mechanical systems. The available operations have many attractive features but also underly severe restrictions, which complicate the design of quantum algorithms. We present a divide-and-conquer approach to the design of various quantum algorithms. The class of algorithm includes many transforms which are well-known in classical signal processing applications. We show how fast quantum algorithms can be derived for the discrete Fourier transform, the Walsh-Hadamard transform, the Slant transform, and the Hartley transform. All these algorithms use at most O(log^2 N) operations to transform a state vector of a quantum computer of length N.

arXiv:quant-ph/0201120Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEMay 23, 20026 citations

News

The fast Fourier transform (FFT) is the unsung digital workhorse of modern life.It's a clever mathematical shortcut that makes possible the many signals in our device-connected world.Every minute of every video stream, for instance, entails computing some hundreds of FFTs.The FFT's importance to practically every data-processing application in the digital age explains why some researchers have begun exploring how quantum computing can run the FFT algorithm more efficiently still."The fast Fourier transform is an important algorithm that's had lots of applications in the classical world," says Ian Walmsley, physicist at Imperial College London."It also has many applications in the quantum domain.[So] it's important to figure out effective ways to be able to implement it."The first proposed killer app for quantum computers-finding a number's prime factors-was discovered by mathematician Peter Shor at AT&T Bell Laboratories in 1994.Shor's algorithm scales up its factorization of numbers more efficiently and rapidly than any classical computer anyone could ever design.And at the heart of Shor's phenomenal quantum engine is a subroutine called-you guessed it-the quantum Fourier transform (QFT).Here is where the terminology gets a little out of hand.There is the QFT at the center of Shor's algorithm, and then there is the QFFT-the quantum fast Fourier transform.They represent different calculations that produce different results, although both are based on the same core mathematical concept, known as the discrete Fourier transform.

IEEE SpectrumDec 30, 20200 citations