寻找集合交集的量子算法

2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS) Pub Date : 2019-12-01 DOI:10.1109/ICICAS48597.2019.00181

Shengping Tian, Ping Wang, Xiaomei Chen

{"title":"寻找集合交集的量子算法","authors":"Shengping Tian, Ping Wang, Xiaomei Chen","doi":"10.1109/ICICAS48597.2019.00181","DOIUrl":null,"url":null,"abstract":"We propose a quantum algorithm to solve the intersection problem of two sets by extending Bernstein-Vazirani algorithm. Given set and set . In the classic algorithm, we need to query times to find the solution of set . However, in our quantum algorithm, we need only one quantum query to find the set .","PeriodicalId":409693,"journal":{"name":"2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)","volume":"321 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Quantum Algorithm for Finding Sets Intersection\",\"authors\":\"Shengping Tian, Ping Wang, Xiaomei Chen\",\"doi\":\"10.1109/ICICAS48597.2019.00181\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a quantum algorithm to solve the intersection problem of two sets by extending Bernstein-Vazirani algorithm. Given set and set . In the classic algorithm, we need to query times to find the solution of set . However, in our quantum algorithm, we need only one quantum query to find the set .\",\"PeriodicalId\":409693,\"journal\":{\"name\":\"2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)\",\"volume\":\"321 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICICAS48597.2019.00181\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICAS48597.2019.00181","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

通过对Bernstein-Vazirani算法的扩展，提出了一种求解两集相交问题的量子算法。给定集合和集合。在经典算法中，我们需要查询次数才能找到集合的解。然而，在我们的量子算法中，我们只需要一个量子查询就可以找到集合。

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

查看原文本刊更多论文

Quantum Algorithm for Finding Sets Intersection

We propose a quantum algorithm to solve the intersection problem of two sets by extending Bernstein-Vazirani algorithm. Given set and set . In the classic algorithm, we need to query times to find the solution of set . However, in our quantum algorithm, we need only one quantum query to find the set .

求助全文

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

来源期刊

2019 International Conference on Intelligent Computing, Automation and Systems (ICICAS)

自引率

0.00%

发文量