scholarly journals Perfect state transfer and efficient quantum routing: A discrete-time quantum-walk approach

2014 ◽  
Vol 90 (1) ◽  
Author(s):  
Xiang Zhan ◽  
Hao Qin ◽  
Zhi-hao Bian ◽  
Jian Li ◽  
Peng Xue
2014 ◽  
Vol 14 (5&6) ◽  
pp. 417-438
Author(s):  
Katharine E. Barr ◽  
Tim J. Proctor ◽  
Daniel Allen ◽  
Viv M. Kendon

We systematically investigated perfect state transfer between antipodal nodes of discrete time quantum walks on variants of the cycles $C_4$, $C_6$ and $C_8$ for three choices of coin operator. Perfect state transfer was found, in general, to be very rare, only being preserved for a very small number of ways of modifying the cycles. We observed that some of our useful modifications of $C_4$ could be generalised to an arbitrary number of nodes, and present three families of graphs which admit quantum walks with interesting dynamics either in the continuous time walk, or in the discrete time walk for appropriate selections of coin and initial conditions. These dynamics are either periodicity, perfect state transfer, or very high fidelity state transfer. These families are modifications of families known not to exhibit periodicity or perfect state transfer in general. The robustness of the dynamics is tested by varying the initial state, interpolating between structures and by adding decoherence.


2019 ◽  
Vol 34 (38) ◽  
pp. 1950317
Author(s):  
Wei-Feng Cao ◽  
Yu-Guang Yang ◽  
Dan Li ◽  
Jing-Ru Dong ◽  
Yi-Hua Zhou ◽  
...  

Perfect state transfer can be achieved between two marked vertices of graphs like a star graph, a complete graph with self-loops and a complete bipartite graph, and two-dimensional Lattice by means of discrete-time quantum walk. In this paper, we investigate the quality of quantum state transfer between two marked vertices of an unsymmetrical graph like the butterfly network. Our numerical results support the conjecture that the fidelity of state transfer depends on the quantum state to be transferred dynamically. The butterfly network is a typical example studied in networking coding. Therefore, these results can provide a clue to the construction of quantum network coding schemes.


2011 ◽  
Vol 09 (03) ◽  
pp. 823-842 ◽  
Author(s):  
YANG GE ◽  
BENJAMIN GREENBERG ◽  
OSCAR PEREZ ◽  
CHRISTINO TAMON

We describe new constructions of graphs which exhibit perfect state transfer on continuous-time quantum walks. Our constructions are based on generalizations of the double cones and variants of the Cartesian graph products (which include the hypercube). We also describe a generalization of the path collapsing argument (which reduces questions about perfect state transfer to simpler weighted multigraphs) for graphs with equitable distance partitions.


2011 ◽  
Vol 83 (6) ◽  
Author(s):  
Paweł Kurzyński ◽  
Antoni Wójcik

2015 ◽  
Vol 43 (4) ◽  
pp. 801-826 ◽  
Author(s):  
Rachael Alvir ◽  
Sophia Dever ◽  
Benjamin Lovitz ◽  
James Myer ◽  
Christino Tamon ◽  
...  

2012 ◽  
Vol 12 (3&4) ◽  
pp. 293-313
Author(s):  
Rachel Bachman ◽  
Eric Fredette ◽  
Jessica Fuller ◽  
Michael Landry ◽  
Michael Opperman ◽  
...  

We prove new results on perfect state transfer of quantum walks on quotient graphs. Since a graph G has perfect state transfer if and only if its quotient G/\pi, under any equitable partition \pi, has perfect state transfer, we exhibit graphs with perfect state transfer between two vertices but which lack automorphism swapping them. This answers a question of Godsil (Discrete Mathematics 312(1):129-147, 2011). We also show that the Cartesian product of quotient graphs \Box_{k} G_{k}/\pi_{k} is isomorphic to the quotient graph \Box_{k} G_{k}/\pi, for some equitable partition \pi. This provides an algebraic description of a construction due to Feder (Physical Review Letters 97, 180502, 2006) which is based on many-boson quantum walk.


2013 ◽  
Vol 13 (5&6) ◽  
pp. 511-530
Author(s):  
John Brown ◽  
Chris Godsil ◽  
Devlin Mallory ◽  
Abigail Raz ◽  
Christino Tamon

We study perfect state transfer of quantum walks on signed graphs. Our aim is to show that negative edges are useful for perfect state transfer. First, we show that the signed join of a negative $2$-clique with any positive $(n,3)$-regular graph has perfect state transfer even if the unsigned join does not. Curiously, the perfect state transfer time improves as $n$ increases. Next, we prove that a signed complete graph has perfect state transfer if its positive subgraph is a regular graph with perfect state transfer and its negative subgraph is periodic. This shows that signing is useful for creating perfect state transfer since no complete graph (except for the $2$-clique) has perfect state transfer. Also, we show that the double-cover of a signed graph has perfect state transfer if the positive subgraph has perfect state transfer and the negative subgraph is periodic.Here, signing is useful for constructing unsigned graphs with perfect state transfer. Finally, we study perfect state transfer on a family of signed graphs called the exterior powers which is derived from a many-fermion quantum walk on graphs.


Sign in / Sign up

Export Citation Format

Share Document