Title :
Comparison of Influence of Two Data-Encoding Methods for Grover Algorithm on Quantum Costs
Author :
Dhawan, Sidharth ; Perkowski, Marek
Author_Institution :
Westview High Sch., Portland, OR, USA
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 oracle data encoding method with Hogg´s encoding method for Grover algorithm, 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.
Keywords :
computability; constraint theory; encoding; graph colouring; quantum gates; Grover algorithm; Hogg´s encoding method; Perkowski´s oracle data encoding method; constraint satisfaction problem; graph coloring; max clique; quantum algorithm; quantum costs; satisfiability; send-more-money; Algorithm design and analysis; Color; Encoding; Equations; Image color analysis; Logic gates; Mathematical model; Hogg´s encoding; Perkowski´s encoding; Quantum circuit cost;
Conference_Titel :
Multiple-Valued Logic (ISMVL), 2011 41st IEEE International Symposium on
Conference_Location :
Tuusula
Print_ISBN :
978-1-4577-0112-2
Electronic_ISBN :
0195-623X
DOI :
10.1109/ISMVL.2011.29
