Non-uniform mixing of quantum walk on cycles

被引:20
作者
Adamczak, William [1 ]
Andrew, Kevin [2 ]
Bergen, Leon [3 ]
Ethier, Dillon [4 ]
Hernberg, Peter [5 ]
Lin, Jennifer [6 ]
Tamon, Christino
机构
[1] SUNY Albany, Dept Math & Stat, Albany, NY 12222 USA
[2] Harvey Mudd Coll, Dept Math, Claremont, CA 91711 USA
[3] Swarthmore Coll, Dept Math & Stat, Swarthmore, PA 19081 USA
[4] Clarkson Univ, Dept Math, Potsdam, NY 13699 USA
[5] SUNY Coll Potsdam, Dept Math, Potsdam, NY 13676 USA
[6] Princeton Univ, Dept Math, Princeton, NJ 08544 USA
基金
美国国家科学基金会;
关键词
quantum walk; continuous-time; mixing; circulant;
D O I
10.1142/S0219749907003195
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
A classical lazy random walk on cycles is known to mix with the uniform distribution. In contrast, we show that a continuous-time quantum walk on cycles exhibits strong non-uniform mixing properties. First, we prove that the instantaneous distribution of a quantum walk on most even-length cycles is never uniform. More specifically, we prove that a quantum walk on a cycle C-n is not instantaneous uniform mixing, whenever n satisfies either: (a) n = 2(u), for u >= 3; or (b) n = 2(u)q, for u >= 1 and q equivalent to 3 (mod4). Second, we prove that the average distribution of a quantum walk on any Abelian circulant graph is never uniform. As a corollary, the average distribution of a quantum walk on any standard circulant graph, such as the cycles, complete graphs, and even hypercubes, is never uniform. Nevertheless, we show that the average distribution of a quantum walk on the cycle C-n is O(1/ n)-uniform.
引用
收藏
页码:781 / 793
页数:13
相关论文
共 17 条
  • [1] Aharonov Dorit, 2001, arXiv: quant-ph/0012090, P50
  • [2] Ahmadi A, 2003, QUANTUM INFORM COMPU, V3, P611
  • [3] [Anonymous], FEYNMAN LECT PHYS
  • [4] [Anonymous], LNCS
  • [5] Bednarska M, 2003, PHYS LETT A, V317, P21, DOI [10.1016/j.physleta.2003.08.023, 10.1016/j.physieta.2003.08.023]
  • [6] One-Dimensional Continuous-Time Quantum Walks
    ben-Avraham, D.
    Bollt, E. M.
    Tamon, C.
    [J]. QUANTUM INFORMATION PROCESSING, 2004, 3 (1-5) : 295 - 308
  • [7] Biggs N., 1993, Algebraic Graph Theory
  • [8] Childs A.M., 2003, STOC'03: 35th Annual ACM Symposium on Theory of Computing, P59, DOI [DOI 10.1145/780542.780552, 10.1145/780542.780552]
  • [9] Davis P.J., 1994, CIRCULANT MATRICES, Vsecond
  • [10] DIACONIS P, 1990, MATRIX THEORY APPLIC, V40, P37