Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring
Improved Complexity of Quantum Oracles for Ternary Grover Algorithm for Graph Coloring
复制标题
提高图着色三元 Grover 算法的量子预言的复杂性
DOI：
10.1109/ismvl.2011.42
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
M. Perkowski
中科院分区：
文献类型：
--
作者：
Yushi Wang;M. Perkowski
本文将著名的Grover算法推广到三值量子电路上。我们比较复杂的神谕和他们的一些常用组件的二元和三元的情况下，各种大小和密度的彩色图。我们表明，三进制编码导致量子电路，有显着更少的qud和更低的量子成本。在量子计算机串行实现的情况下，我们的三进制算法和电路也更快。
The paper presents a generalization of the well-known Grover Algorithm to operate on ternary quantum circuits. We compare complexity of oracles and some of their commonly used components for binary and ternary cases and various sizes and densities of colored graphs. We show that ternary encoding leads to quantum circuits that have significantly less qud its and lower quantum costs. In case of serial realization of quantum computers, our ternary algorithms and circuits are also faster.