Symmetry in quantum walks

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various coins and decoherence models. The hitting time for a classical random walk on a connected graph will always be finite. We show that, by contrast, quantum walks can have infinite hitting times for some initial states. We seek criteria to determine if a given walk on a graph will have infinite hitting times, and find a sufficient condition, which for discrete time quantum walks is that the degeneracy of the evolution operator be greater than the degree of the graph. The phenomenon of infinite hitting times is in general a consequence of the symmetry of the graph and its automorphism group. Symmetries of a graph, given by its automorphism group, can be inherited by the evolution operator. Using the irreducible representations of the automorphism group, we derive conditions such that quantum walks defined on this graph must have infinite hitting times for some initial states. Symmetry can cause the walk to also be confined to a subspace of the original Hilbert space for cartain initial states. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. We conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speed-up. Finally, we use symmetry and the theory of decoherence-free subspaces to determine when the subspace of the quotient graph is a decoherence-free subspace of the dynamics.

[1]  Andris Ambainis,et al.  Quantum to classical transition for random walks. , 2003, Physical review letters.

[2]  R. Leighton,et al.  Feynman Lectures on Physics , 1971 .

[3]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[4]  Nayak Ashwin,et al.  Quantum Walk on the Line , 2000 .

[5]  Eric Bach,et al.  One-dimensional quantum walks with absorbing boundaries , 2004, J. Comput. Syst. Sci..

[6]  D. Bacon Decoherence, Control, and Symmetry in Quantum Computers , 2001 .

[7]  Colin Cooper,et al.  Randomization and Approximation Techniques in Computer Science , 1999, Lecture Notes in Computer Science.

[8]  K. Birgitta Whaley,et al.  Quantum random-walk search algorithm , 2002, quant-ph/0210064.

[9]  George W. Polites,et al.  An introduction to the theory of groups , 1968 .

[10]  Hiroshi Imai,et al.  An Analysis of Absorbing Times of Quantum Walks , 2002, UMC.

[11]  A. Russell,et al.  Decoherence in quantum walks on the hypercube , 2005, quant-ph/0501169.

[12]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[13]  Andris Ambainis,et al.  Quantum walks driven by many coins , 2002, quant-ph/0210161.

[14]  H. S. Allen The Quantum Theory , 1928, Nature.

[15]  G. James,et al.  The Representation Theory of the Symmetric Group , 2009 .

[16]  R. Feynman Simulating physics with computers , 1999 .

[17]  Todd A. Brun,et al.  Quantum walks on quotient graphs , 2007 .

[18]  Andris Ambainis,et al.  Coins make quantum walks faster , 2004, SODA '05.

[19]  Randall R. Holmes Linear Representations of Finite Groups , 2008 .

[20]  Meinhard E. Mayer,et al.  Group theory and physics , 1994 .

[21]  Ashley Montanaro,et al.  Quantum walks on directed graphs , 2005, Quantum Inf. Comput..

[22]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[23]  T. Beth,et al.  Polynomial-Time Solution to the Hidden Subgroup Problem for a Class of non-abelian Groups , 1998, quant-ph/9812070.

[24]  S. Lloyd Quantum-Mechanical Computers , 1995 .

[25]  P. Benioff The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .

[26]  Ashwin Nayak,et al.  Quantum Walk on the Line , 2000 .

[27]  Lov K. Grover A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[28]  D. Deutsch Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[29]  Viv Kendon,et al.  Quantum walks on general graphs , 2003, quant-ph/0306140.

[30]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[31]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and EPR channels , 1993 .

[32]  Andris Ambainis,et al.  Quantum random walks with decoherent coins , 2003 .

[33]  Will Flanagan,et al.  Controlling discrete quantum walks: coins and initial states , 2003 .

[34]  Todd A. Brun,et al.  Quantum walks with infinite hitting times , 2006 .

[35]  Andris Ambainis,et al.  Quantum search algorithms , 2004, SIGA.

[36]  C. Lomont THE HIDDEN SUBGROUP PROBLEM - REVIEW AND OPEN PROBLEMS , 2004, quant-ph/0411037.

[37]  D. Deutsch Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[38]  Frederick W. Strauch,et al.  Connecting the discrete- and continuous-time quantum walks , 2006 .

[39]  Andrew M. Childs,et al.  Spatial search by quantum walk , 2003, quant-ph/0306054.

[40]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[41]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[42]  E. J. F. Primrose,et al.  Introduction to the Theory of Groups , 1961, The Mathematical Gazette.

[43]  Julia Kempe,et al.  Quantum random walks: An introductory overview , 2003, quant-ph/0303081.

[44]  Julia Kempe,et al.  Quantum Random Walks Hit Exponentially Faster , 2002, ArXiv.

[45]  Andris Ambainis,et al.  QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS , 2003, quant-ph/0403120.

[46]  Jonathan L. Gross,et al.  Topological Graph Theory , 1987, Handbook of Graph Theory.

[47]  Seth Lloyd,et al.  Quantum Information Processing , 2009, Encyclopedia of Complexity and Systems Science.