Order from chaos in quantum walks on cyclic graphs

@article{Panda2021OrderFC,
  title={Order from chaos in quantum walks on cyclic graphs},
  author={Abhisek Panda and Colin Benjamin},
  journal={ArXiv},
  year={2021},
  volume={abs/2008.00316}
}
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 counter-intuitive result. We study chaotic and periodic nature of cyclic quantum walks and focus on an 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. 
View PDF on arXiv
2 Citations
Background Citations
1

Figures from this paper

2 Citations

Citation Type

Citation Type

Quantum Computers, Predictability, and Free Will
: This article focuses on the connection between the possibility of quantum computers, the predictability of complex quantum systems in nature, and the issue of free will. The author’s theory, that…
Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues
We determine connected bipartite regular graphs with four distinct adjacency eigenvalues that induce periodic Grover walks, and show that it is only C6. We also show that there are only three kinds…

References

SHOWING 1-10 OF 32 REFERENCES
Parrondo's games with chaotic switching
TLDR
The rate of winning of Parrondo's games with chaotic switching depends on coefficient(s) defining the chaotic generator, initial conditions of the chaotic sequence and the proportion of Game A played.
et
  • al., Phys. Rev. A 101, 062335
  • 2020
‘A’
  • P. Alam
  • Composites Engineering: An A–Z Guide
  • 2021
Parrondo’s paradox from classical to quantum: A review
Two losing games can be combined in a certain manner to give a winning outcome—this is known as Parrondo’s paradox. Parrondo’s paradox has found its applications across different disciplines such as…
Perfect secrecy cryptography via mixing of chaotic waves in irreversible time-varying silicon chips
TLDR
The authors demonstrate a cryptographic system via correlated mixing of chaotic waves in irreversible time-varying silicon chips with key distributions in classical optical channels that unconditionally protects this scheme against any possible attack.
et
  • al., Nat. Comms.
  • 2019
et
  • al., Phys. Rev. Lett. 122, 020503
  • 2019
et
  • al., Phys. Rev. Lett. 122, 020501
  • 2019
EPL (Euro Phys
  • Lett.) 122, 40004
  • 2018
Parrondo's paradox or chaos control in discrete two-dimensional dynamic systems
...
1
2
3
4
...