对称群上的量子傅里叶变换

International Symposium on Symbolic and Algebraic Computation Pub Date : 2013-06-26 DOI:10.1145/2465506.2465940

Y. Kawano, Hiroshi Sekigawa

{"title":"对称群上的量子傅里叶变换","authors":"Y. Kawano, Hiroshi Sekigawa","doi":"10.1145/2465506.2465940","DOIUrl":null,"url":null,"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.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Quantum fourier transform over symmetric groups\",\"authors\":\"Y. Kawano, Hiroshi Sekigawa\",\"doi\":\"10.1145/2465506.2465940\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":243282,\"journal\":{\"name\":\"International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2465506.2465940\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2465506.2465940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

本文提出了一种在对称群Sn上的O(n4)量子傅里叶变换(QFT)算法，这是同类算法中最快的QFT算法。本文提出了一种基于对称群Sn的快速傅里叶变换算法，该群Sn由O(n3)个酉矩阵相乘组成，并将其转换为量子电路形式。QFT算法可用于构造隐子群问题的标准算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Quantum fourier transform over symmetric groups

This paper proposes an O(n⁴) quantum Fourier transform (QFT) algorithm over symmetric group S_n, the fastest QFT algorithm of its kind. We propose a fast Fourier transform algorithm over symmetric group S_n, which consists of O(n³) 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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Symposium on Symbolic and Algebraic Computation

自引率

0.00%

发文量

期刊最新文献

On Minimal and Minimum Cylindrical Algebraic Decompositions Automated Reasoning For The Existence Of Darboux Polynomials New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials Efficient detection of redundancies in systems of linear inequalities✱ Transcendental methods in numerical algebraic geometry