Abstract

A discrete time quantum walk on the star network is considered, on which the walker has a waiting probability at any time step and for any of the $N$ nodes. This contrasts with a previous continuous time analysis, in which the walker in any of the $N\ensuremath{-}1$ leaf nodes is forced to jump back to the central hub. The model amounts to considering two coin operators, one for the hub (with $N$ possible states) and another one for all leaf nodes (with two possible states). The solution depends on $N$ and $\ensuremath{\theta}$, an angle gauging the action of the coin operator on the leaf nodes. Periodic solutions are identified, which can be represented as superposition of large-period branches, sharing a relative small number of shapes and displaced by a regular interval. It is shown that the large period is very sensitive to the choice of $N$ and $\ensuremath{\theta}$. The possibility of experimental applications of this property is briefly mentioned.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.