4.7 Article

Perfect state transfer by means of discrete-time quantum walk on complete bipartite graphs

Journal

QUANTUM INFORMATION PROCESSING
Volume 16, Issue 3, Pages -

Publisher

SPRINGER
DOI: 10.1007/s11128-017-1516-z

Keywords

Quantum walk; Perfect state transfer; Bipartite graph

Funding

  1. Czech Technical University in Prague [RVO 14000, SGS16/241/OHK4/3T/14]
  2. GACR [14-02901P]

Ask authors/readers for more resources

We consider a quantum walk with two marked vertices, sender and receiver, and analyze its application to perfect state transfer on complete bipartite graphs. First, the situation with both the sender and the receiver vertex in the same part of the graph is considered. We show that in this case the dynamics of the quantum walk is independent of the size of the second part and reduces to the one for the star graph where perfect state transfer is achieved. Second, we consider the situation where the sender and the receiver vertex are in the opposite parts of the graph. In such a case, the state transfer with unit fidelity is achieved only when the parts have the same size.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available