Papers
Topics
Authors
Recent
Search
2000 character limit reached

Entanglement dynamics in minimal Kitaev chains

Published 23 Jul 2025 in quant-ph, cond-mat.mes-hall, and cond-mat.stat-mech | (2507.17586v1)

Abstract: Minimal Kitaev chains host Majorana quasiparticles, which, although not topologically protected, exhibit spatial nonlocality and hence expected to be useful for quantum information tasks. In this work, we consider two- and three-site Kitaev chains and investigate the dynamics of bipartite and multipartite entanglement by means of concurrence and geometric measure of entanglement. In two-site Kitaev chains, we find that maximally entangled states can robustly emerge, with their stability and periodicity highly controllable by the interplay between the superconducting pair potential and the onsite energies. At the finely tuned sweet spot, where Majorana quasiparticles appear, the system exhibits oscillations between separable and entangled states, whereas detuning introduces tunable valleys in the entanglement dynamics. Extending to the three-site Kitaev chain, we uncover rich bipartite and multipartite entanglement by generalizing the concepts of concurrence and geometric measure of entanglement. At the sweet spot, the Majorana quasiparticles emerging at the edges suppress concurrence between the edges, while a finite detuning is able to restore it. Depending on the initial state, the three-site Kitaev chain can dynamically generate either a maximally entangled Greenberger-Horne-Zeilinger state or an imperfect W-type state exhibiting multipartite entanglement, although a (maximally entangled) pure W state cannot be realised due to parity constraints. Our results provide a resource for generating and characterising highly entangled states in minimal Kitaev chains, with potential relevance for quantum applications.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.