量子隨機漫步於一般圖形的統一架構

Abstract

在文獻中，有幾個量子演算法已被證明具有優越性超過其相對應之傳統演算法。最近的一個是量子隨機漫步。我們提出一個量子隨機漫步於一般圖形的統一架構。引進單一標籤的概念進入量子隨機漫步演算法。如果單一約束都無法滿足，我們還提供另一種中間量測的方法。我們並以幾個例子說明了所設計的演算法能保持量子干涉性質。

In the literature, several quantum computation algorithms have been shown to have superiority over their classical counterparts. The most recent one is quantum random walks. We propose a unified framework for quantum walk algorithms on general graphs. We introduce the concept of unitary labeling into the quantum walk algorithm, and also provide another solution with intermediate measurement if the unitary constraint is not satisfied. We also demonstrate that the designed algorithms maintain the quantum interfering property with a few examples.