The amplified quantum Fourier transform: solving the local period problem

Authors:
David J. Cornwell
Affiliations:
Department of Mathematics, University of Maryland, Baltimore County, Baltimore, USA
Venue:
Quantum Information Processing
Year:
2013

Citing 4
Cited 0

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

SIAM Journal on Computing
Quantum Computing

Quantum Computing
An Introduction to Quantum Computing

An Introduction to Quantum Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The first part of this paper defines the Amplified QFT algorithm. The second part of the paper summarizes the main results and compares the new algorithm against the QFT and QHS algorithms when solving the local period problem. It is shown that the new algorithm is, on average, quadratically faster than both the QFT and QHS algorithms.