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

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

S. Dhawan, M. Perkowski

引用次数: 3

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.

查看原文本刊更多论文

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

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

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

求助全文

约1分钟内获得全文求助全文

来源期刊

2011 41st IEEE International Symposium on Multiple-Valued Logic

自引率

0.00%

发文量