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

arXiv:1310.0420 · Scientific Reports

Quantum walks of interacting fermions on a cycle graph

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

Published Sep 29, 2016• 41 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/srep34226

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

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

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

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.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Dec 30, 2016•7 citations

Fermionic entanglement via quantum walks in quantum dots

Alexey A. Melnikov, Leonid Evgenevich Fedichkin

Quantum walks are fundamentally different from random walks due to the quantum superposition property of quantum objects. Quantum walk process was found to be very useful for quantum information and quantum computation applications. In this paper we demonstrate how to use quantum walks as a tool to generate high-dimensional two-particle fermionic entanglement. The generated entanglement can survive longer in the presence of depolorazing noise due to the periodicity of quantum walk dynamics. The possibility to create two distinguishable qudits in a system of tunnel-coupled semiconductor quantum dots is discussed.

AIP conference proceedings•Jan 1, 2018•5 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•4 citations

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•6 citations

Dynamics of electron entanglement in semiconductor nanostructures

Paolo Bordone

Quantum entanglement, the most remarkable feature of quantum physics, is recognized as a resource for quantum information processing. The quest for quantum-computing devices has also produced great interest in entanglement formation in solid-state systems involving quantum effects. Indeed, the functionality of an increasing number of nanodevices is influenced by quantum correlations. In this work a theoretical approach developed in recent years to study the entanglement of fermions interacting via a Coulomb potential is presented, together with a number of applications to specific situations of physical interest in the field of charge transport in semiconductor nanostructures.

Journal of Physics Conference Series•Nov 1, 2009•0 citations
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.
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 are fundamentally different from random walks due to the quantum superposition property of quantum objects. Quantum walk process was found to be very useful for quantum information and quantum computation applications. In this paper we demonstrate how to use quantum walks as a tool to generate high-dimensional two-particle fermionic entanglement. The generated entanglement can survive longer in the presence of depolorazing noise due to the periodicity of quantum walk dynamics. The possibility to create two distinguishable qudits in a system of tunnel-coupled semiconductor quantum dots is discussed.
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.
Quantum entanglement, the most remarkable feature of quantum physics, is recognized as a resource for quantum information processing. The quest for quantum-computing devices has also produced great interest in entanglement formation in solid-state systems involving quantum effects. Indeed, the functionality of an increasing number of nanodevices is influenced by quantum correlations. In this work a theoretical approach developed in recent years to study the entanglement of fermions interacting via a Coulomb potential is presented, together with a number of applications to specific situations of physical interest in the field of charge transport in semiconductor nanostructures.