Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Continuous-time quantum walk of two interacting fermions on a cycle graph

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

Published Dec 30, 2016• 8 citations
Publisher

Abstract

We study a continuous-time quantum walk of interacting fermions on a cycle graph. By finding analytical solutions and simulating the dynamics of two fermions we observe a diverse structure of entangled states of indistinguishable fermions. The relation between entanglement of distinguishable qutrits and indistinguishable electrons is observed. Restrictions imposed by the symmetry of a cycle graph are derived. Possible realization of a quantum walk in an array of semiconductor quantum dots is discussed.

DOI
10.1117/12.2267094

Related papers

Two-particle fermionic quantum walks on a cycle graph

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.

•Oct 1, 2013•0 citations

Quantum walks of interacting fermions on a cycle graph

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.

arXiv:1310.0420•Scientific Reports•Sep 29, 2016•40 citations

Continuous-time quantum walks on a cycle graph

Dmitry Solenov, Leonid Evgenevich Fedichkin

We present an analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with a nearby quantum point contact. We derive an analytical expression of the probability distribution along the cycle. An upper-bound estimate to the mixing time is shown.

arXiv:quant-ph/0506096•Physical Review A•Jan 11, 2006•80 citations

Entanglement dynamics of two electrons in noisy quantum walks

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

We study the entanglement dynamics of two electrons in a dissipative quantum walk on a cycle graph. The considered dissipation, which is inevitably induced by coupling to a measurement apparatus, can make the quantum system unreliable by breaking entanglement between two electrons. However for certain realistic parameters a distinct maximum of fermionic entanglement can be established and entanglement revival can be observed.

Photonics & Electromagnetics Research Symposium - Spring (PIERS-Spring)•May 1, 2017•5 citations

Continuous-time Quantum Walks on a Cycle

Dmitry Solenov, Leonid Evgenevich Fedichkin

We present analytical treatment of quantum walks on a cycle graph. The investigation is based on a realistic physical model of the graph in which decoherence is induced by continuous monitoring of each graph vertex with nearby quantum point contact. We derive the analytical expression of the probability distribution along the cycle. Upper bound to mixing time is obtained. It is found to be linear in the graph size.

•Jun 13, 2005•1 citation

Hitting time for quantum walks of identical particles

Alexey A. Melnikov, Aleksandr P. Alodjants, Leonid Evgenevich Fedichkin

Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks than for classical random walks. It is however not known how fast would interacting quantum particles propagate on different graphs. Here we present our results on hitting times for quantum walks of identical particles on cycle graphs, and relate the results to our previous findings on the usefulness of identical interacting particles in quantum information theory. We observe that interacting fermions traverse cycle graphs faster than non-interacting fermions. We show that the rate of propagation is related to fermionic entanglement: interacting fermions keep traversing the cycle graph as long as their entanglement grows. Our results demonstrate the role of entanglement in quantum particles propagation. These results are of importance for understanding quantum transport properties of identical particles.

arXiv:1811.04482•International Conference on Micro- and Nano-Electronics (ICMNE)•Mar 15, 2019•7 citations
We study a continuous-time quantum walk of interacting fermions on a cycle graph. By finding analytical solutions and simulating the dynamics of two fermions we observe a diverse structure of entangled states of indistinguishable fermions. The relation between entanglement of distinguishable qutrits and indistinguishable electrons is observed. Restrictions imposed by the symmetry of a cycle graph are derived. Possible realization of a quantum walk in an array of semiconductor quantum dots is discussed.
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.
Quantum walks have been employed widely to develop new tools for quantum information processing recently. A natural quantum walk dynamics of interacting particles can be used to implement efficiently the universal quantum computation. In this work quantum walks of electrons on a graph are studied. The graph is composed of semiconductor quantum dots arranged in a circle. Electrons can tunnel between adjacent dots and interact via Coulomb repulsion, which leads to entanglement. Fermionic entanglement dynamics is obtained and evaluated.
Quantum particles are known to be faster than classical when they propagate stochastically on certain graphs. A time needed for a particle to reach a target node on a distance, the hitting time, can be exponentially less for quantum walks than for classical random walks. It is however not known how fast would interacting quantum particles propagate on different graphs. Here we present our results on hitting times for quantum walks of identical particles on cycle graphs, and relate the results to our previous findings on the usefulness of identical interacting particles in quantum information theory. We observe that interacting fermions traverse cycle graphs faster than non-interacting fermions. We show that the rate of propagation is related to fermionic entanglement: interacting fermions keep traversing the cycle graph as long as their entanglement grows. Our results demonstrate the role of entanglement in quantum particles propagation. These results are of importance for understanding quantum transport properties of identical particles.