Grover算法中两种数据编码方法对量子代价影响的比较

2011 41st IEEE International Symposium on Multiple-Valued Logic Pub Date : 2011-05-23 DOI:10.1109/ISMVL.2011.29

S. Dhawan, M. Perkowski

{"title":"Grover算法中两种数据编码方法对量子代价影响的比较","authors":"S. Dhawan, M. Perkowski","doi":"10.1109/ISMVL.2011.29","DOIUrl":null,"url":null,"abstract":"It is important to be able to calculate realistic estimates of quantum costs for real oracles used in quantum algorithms. In this paper, we compare Perkowski's[1] oracle data encoding method with Hogg's[2] encoding method for Grover algorithm[3], to examine the decrease in Oracle gate cost, if any, for four common constraint satisfaction problems: Graph coloring, Satisfiability, Send-More-Money and Max Clique.","PeriodicalId":234611,"journal":{"name":"2011 41st IEEE International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Comparison of Influence of Two Data-Encoding Methods for Grover Algorithm on Quantum Costs\",\"authors\":\"S. Dhawan, M. Perkowski\",\"doi\":\"10.1109/ISMVL.2011.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is important to be able to calculate realistic estimates of quantum costs for real oracles used in quantum algorithms. In this paper, we compare Perkowski's[1] oracle data encoding method with Hogg's[2] encoding method for Grover algorithm[3], to examine the decrease in Oracle gate cost, if any, for four common constraint satisfaction problems: Graph coloring, Satisfiability, Send-More-Money and Max Clique.\",\"PeriodicalId\":234611,\"journal\":{\"name\":\"2011 41st IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 41st IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2011.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 41st IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2011.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

对于量子算法中使用的真实预言机，能够计算出量子成本的实际估计是很重要的。在本文中，我们比较了Perkowski的[1]oracle数据编码方法和Hogg的[2]编码方法对Grover算法[3]的编码方法，检验了对于图着色、可满足性、Send-More-Money和Max Clique这四个常见的约束满足问题，如果有的话，oracle门成本的降低。

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

查看原文本刊更多论文

Comparison of Influence of Two Data-Encoding Methods for Grover Algorithm on Quantum Costs

It is important to be able to calculate realistic estimates of quantum costs for real oracles used in quantum algorithms. In this paper, we compare Perkowski's[1] oracle data encoding method with Hogg's[2] encoding method for Grover algorithm[3], to examine the decrease in Oracle gate cost, if any, for four common constraint satisfaction problems: Graph coloring, Satisfiability, Send-More-Money and Max Clique.

求助全文

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

来源期刊

2011 41st IEEE International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量