Mixing times in quantum walks on the hypercube

被引:36
|
作者
Marquezino, F. L. [1 ]
Portugal, R. [1 ]
Abal, G. [3 ]
Donangelo, R. [2 ,3 ]
机构
[1] Lab Nacl Computacao Cient LNCC, BR-25651075 Rio De Janeiro, Brazil
[2] Univ Fed Rio de Janeiro, Inst Fis, BR-21941972 Rio De Janeiro, Brazil
[3] Univ La Republ, Inst Fis, Montevideo 11300, Uruguay
来源
PHYSICAL REVIEW A | 2008年 / 77卷 / 04期
关键词
D O I
10.1103/PhysRevA.77.042312
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean probability distribution of a discrete-time quantum walk on a hypercube mixes to a (generally nonuniform) distribution pi(x) in time O(n), and the stationary distribution is determined by the initial state of the walk. An explicit expression for pi(x) is derived for the particular case of a symmetric walk. These results are consistent with those obtained previously for a continuous-time quantum walk. The effect of decoherence due to randomly breaking links between connected sites in the hypercube is also considered. We find that the probability distribution mixes to the uniform distribution as expected. However, the mixing time has a minimum at a critical decoherence rate p approximate to 0.1. A similar effect was previously reported for a quantum walk on an N-cycle with decoherence from repeated measurements of position. A controlled amount of decoherence helps in obtaining-and preserving-a uniform distribution over the 2(n) sites of the hypercube in the shortest possible time.
引用
收藏
页数:8
相关论文
共 50 条
  • [21] On the hitting times of quantum versus random walks
    Magniez, Frederic
    Nayak, Ashwin
    Richter, Peter C.
    Santha, Miklos
    PROCEEDINGS OF THE TWENTIETH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2009, : 86 - 95
  • [22] On the Hitting Times of Quantum Versus Random Walks
    Magniez, Frederic
    Nayak, Ashwin
    Richter, Peter C.
    Santha, Miklos
    ALGORITHMICA, 2012, 63 (1-2) : 91 - 116
  • [23] Unidirectional quantum walks: Evolution and exit times
    Montero, Miquel
    PHYSICAL REVIEW A, 2013, 88 (01)
  • [24] On training a classifier of hitting times for quantum walks
    Melnikov, Alexey A.
    Fedichkin, Leonid E.
    Alodjants, Alexander
    FIFTH INTERNATIONAL CONFERENCE ON QUANTUM TECHNOLOGIES (ICQT-2019), 2020, 2241
  • [25] Random Walks on the Folded Hypercube
    Chen, Hong
    Li, Xiaoyan
    Lin, Cheng-Kuan
    JOURNAL OF INTERNET TECHNOLOGY, 2019, 20 (06): : 1987 - 1994
  • [26] Convergence of mixing times for sequences of random walks on finite graphs
    Croydon, D. A.
    Hambly, B. M.
    Kumagai, T.
    ELECTRONIC JOURNAL OF PROBABILITY, 2012, 17 : 1 - 32
  • [27] Passage Times, Exit Times and Dirichlet Problems for Open Quantum Walks
    Bardet, Ivan
    Bernard, Denis
    Pautrat, Yan
    JOURNAL OF STATISTICAL PHYSICS, 2017, 167 (02) : 173 - 204
  • [28] Passage Times, Exit Times and Dirichlet Problems for Open Quantum Walks
    Ivan Bardet
    Denis Bernard
    Yan Pautrat
    Journal of Statistical Physics, 2017, 167 : 173 - 204
  • [29] Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
    Yuval Peres
    Alexandre Stauffer
    Jeffrey E. Steif
    Probability Theory and Related Fields, 2015, 162 : 487 - 530
  • [30] Random walks on dynamical percolation: mixing times, mean squared displacement and hitting times
    Peres, Yuval
    Stauffer, Alexandre
    Steif, Jeffrey E.
    PROBABILITY THEORY AND RELATED FIELDS, 2015, 162 (3-4) : 487 - 530