Thumbnail
Access Restriction
Subscribed

Author Sekigawa, Hiroshi ♦ Kawano, Yasuhito
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Computer programming, programs & data
Abstract This paper improves the main result in our paper "Quantum Fourier Transform over Symmetric Groups, Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 227--234, Northeastern University, Boston, USA (June 26-29, 2013)." In that paper, we presented an O(n4) quantum Fourier transform (QFT) algorithm over symmetric group Sn, which was faster than the existing algorithm. This paper proposes an O(n3 log n) QFT algorithm over Sn by relieving bottlenecks of our previous algorithm.
Description Affiliation: NTT Communication Science Laboratories, Kanagawa, Japan (Kawano, Yasuhito) || Tokyo University of Science, Tokyo, Japan (Sekigawa, Hiroshi)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2015-02-05
Publisher Place New York
Journal ACM Communications in Computer Algebra (ACCA)
Volume Number 48
Issue Number 3/4
Page Count 3
Starting Page 127
Ending Page 129


Open content in new tab

   Open content in new tab
Source: ACM Digital Library