Quantum fourier transform over symmetric groups

Authors:
Yasuhito Kawano;Hiroshi Sekigawa
Affiliations:
NTT Communication Science Laboratories, Kanagawa, Japan;Tokai University, Kanagawa, Japan
Venue:
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Year:
2013

Citing 9
Cited 0

Fast generalized Fourier transforms

Theoretical Computer Science
Quantum computation of Fourier transforms over symmetric groups

STOC '97 Proceedings of the twenty-ninth 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 computation and quantum information

Quantum computation and quantum information
An improved quantum Fourier transform algorithm and applications

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Fast parallel circuits for the quantum Fourier transform

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Generic quantum Fourier transforms

ACM Transactions on Algorithms (TALG)
On the impossibility of a quantum sieve algorithm for graph isomorphism

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Quantum algorithms for Simon's problem over nonabelian groups

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes an O(n4) quantum Fourier transform (QFT) algorithm over symmetric group Sn, the fastest QFT algorithm of its kind. We propose a fast Fourier transform algorithm over symmetric group Sn, which consists of O(n3) multiplications of unitary matrices, and then transform it into a quantum circuit form. The QFT algorithm can be applied to constructing the standard algorithm of the hidden subgroup problem.