不动点和不变子群的量子算法

Groups Complex. Cryptol. Pub Date : 1900-01-01 DOI:10.1515/gcc.2011.013

M. Bonanome, S. Majewicz

{"title":"不动点和不变子群的量子算法","authors":"M. Bonanome, S. Majewicz","doi":"10.1515/gcc.2011.013","DOIUrl":null,"url":null,"abstract":"Abstract In this paper, we apply quantum algorithms to solve problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted multisets whose elements originate from the same set. This intersection algorithm is an application of the Grover search procedure.","PeriodicalId":119576,"journal":{"name":"Groups Complex. Cryptol.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum algorithms for fixed points and invariant subgroups\",\"authors\":\"M. Bonanome, S. Majewicz\",\"doi\":\"10.1515/gcc.2011.013\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In this paper, we apply quantum algorithms to solve problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted multisets whose elements originate from the same set. This intersection algorithm is an application of the Grover search procedure.\",\"PeriodicalId\":119576,\"journal\":{\"name\":\"Groups Complex. Cryptol.\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Groups Complex. Cryptol.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/gcc.2011.013\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complex. Cryptol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/gcc.2011.013","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

摘要应用量子算法求解自同构的不动点和不变子群问题。这些有效的算法调用了量子算法，该算法计算元素来自同一集合的多个未排序多集的交集。该交点算法是格罗弗搜索程序的一个应用。

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

查看原文本刊更多论文

Quantum algorithms for fixed points and invariant subgroups

Abstract In this paper, we apply quantum algorithms to solve problems concerning fixed points and invariant subgroups of automorphisms. These efficient algorithms invoke a quantum algorithm which computes the intersection of multiple unsorted multisets whose elements originate from the same set. This intersection algorithm is an application of the Grover search procedure.

求助全文

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

来源期刊

Groups Complex. Cryptol.

自引率

0.00%

发文量