Order from chaos in quantum walks on cyclic graphs

Abhisek Panda and Colin Benjamin
Phys. Rev. A 104, 012204 – Published 7 July 2021

Abstract

It has been shown classically that combining two chaotic random walks can yield an ordered (periodic) walk. Our aim in this paper is to find a quantum analog for this rather counterintuitive result. We study the chaotic and periodic nature of cyclic quantum walks and focus on a unique situation wherein a periodic quantum walk on 3-cycle graph is generated via a deterministic combination of two chaotic quantum walks on the same graph. We extend our results to even numbered cyclic graphs, specifically a 4-cycle graph too. Our results will be relevant in quantum cryptography and quantum chaos control.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
4 More
  • Received 4 August 2020
  • Revised 27 May 2021
  • Accepted 22 June 2021

DOI:https://doi.org/10.1103/PhysRevA.104.012204

©2021 American Physical Society

Physics Subject Headings (PhySH)

Nonlinear DynamicsQuantum Information, Science & Technology

Authors & Affiliations

Abhisek Panda and Colin Benjamin*

  • School of Physical Sciences, National Institute of Science Education & Research, HBNI, Jatni 752050, India

  • *colin.nano@gmail.com

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 104, Iss. 1 — July 2021

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×