论文标题
通过修改硬币操作员，减少量子随机步行搜索算法中的门数
Reducing number of gates in quantum random walk search algorithm via modification of coin operators
论文作者
论文摘要
本文研究了一种简化量子随机步行搜索算法电路的方法，当时遍历硬币是由通用家庭反射和附加相位乘数构建的。如果实现相应参数之间的适当关系，我们的算法将在阶段偏差更加牢固。在此修改中，不需要标记硬币，并且保留了上述优化对稳定性的所有优势。它明确显示了如何构造此类行走硬币以获得更健壮的量子算法。
This paper examines a way to simplify the circuit of quantum random walk search algorithm, when the traversing coin is constructed by both generalized Householder reflection and an additional phase multiplier. If an appropriate relation between corresponding parameters is realized, our algorithm becomes more robust to deviations in the phases. In this modification marking coin is not needed, and all advantages from above mentioned optimization to the stability, are preserved. It is shown explicitly how to construct such walk coin in order to obtain more robust quantum algorithm.
