4.7 Article

Partition-based discrete-time quantum walks

期刊

QUANTUM INFORMATION PROCESSING
卷 17, 期 4, 页码 -

出版社

SPRINGER
DOI: 10.1007/s11128-017-1807-4

关键词

Quantum walk; Coined walk; Szegedy's walk; Staggered walk; Graph tessellation; Hypergraph walk; Unitary equivalence; Intersection graph; Bipartite graph

资金

  1. Japan Society for the Promotion of Science [15K13443, 15K04985, 16K17637, 16H03939]
  2. Faperj [E-26/102.350/2013]
  3. CNPq [303406/2015-1]
  4. Grants-in-Aid for Scientific Research [16K17637, 16H03939] Funding Source: KAKEN

向作者/读者索取更多资源

We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coinedwalk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据