Related papers: The Quantum Fourier Transform and Extensions of th…
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for…
We present a quantum algorithm solving the greatest common divisor (GCD) problem. This quantum algorithm possesses similar computational complexity with classical algorithms, such as the well-known Euclidean algorithm for GCD. This…
Ongoing work in quantum information emphasises the need for a structural understanding of quantum speedups: in this work, we focus on the quantum Fourier transform and the structures in quantum theory that enable it. We elucidate a general…
Quantum algorithms offer significant speedups over their classical counterparts for a variety of problems. The strongest arguments for this advantage are borne by algorithms for quantum search, quantum phase estimation, and Hamiltonian…
In this thesis we investigate two new Amplified Quantum Transforms. In particular we create and analyze the Amplified Quantum Fourier Transform (Amplified-QFT) and the Amplified-Haar Wavelet Transform. First, we provide a brief history of…
The theory of finite simple groups is a (rather unexplored) area likely to provide interesting computational problems and modelling tools useful in a cryptographic context. In this note, we review some applications of finite non-abelian…
The Cosmic Microwave Background (CMB) data analysis and the map-making process rely heavily on the use of spherical harmonics. For suitable pixelizations of the sphere, the (forward and inverse) Fourier transform plays a crucial role in…
An overview of quantum computing and in particular the Hidden Subgroup Problem are presented from a mathematical viewpoint. Detailed proofs are supplied for many important results from the literature, and notation is unified, making it…
Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation…
Quantum comparators and modular arithmetic are fundamental in many quantum algorithms. Current research mainly focuses on operations between two quantum states. However, various applications, such as integer factorization, optimization,…
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d-dimensional quantum systems is a transform between a standard computational basis…
Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem…
The quantum period-finding (QPF) algorithm can compute the period of a function exponentially faster than the best-known classical algorithm. In standard QPF, the output state has a primary contribution from $r$ high-probability bit…
We approach the hidden subgroup problem by performing the so-called pretty good measurement on hidden subgroup states. For various groups that can be expressed as the semidirect product of an abelian group and a cyclic group, we show that…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
We introduce the Shifted Legendre Symbol Problem and some variants along with efficient quantum algorithms to solve them. The problems and their algorithms are different from previous work on quantum computation in that they do not appear…
The quaternion Fourier transform (QFT), a generalization of the classical 2D Fourier transform, plays an increasingly active role in particular signal and colour image processing. There tends to be an inordinate degree of interest placed on…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(\omega^{ij})_{N\times N},i,j=0,1,..., N-1,…
Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction. Inspired by the…
An overarching milestone of quantum machine learning (QML) is to demonstrate the advantage of QML over all possible classical learning methods in accelerating a common type of learning task as represented by supervised learning with…