Kitaev chain in an alternating quantum dot-Andreev bound state array

Authors: Sebastian Miles, David van Driel, Michael Wimmer, Chun-Xiao Liu

arXiv: 2309.15777v1 - DOI (cond-mat.mes-hall)
16 pages, 9 figures

Abstract: We propose to implement a Kitaev chain based on an array of alternating normal and superconductor hybrid quantum dots embedded in semiconductors. In particular, the orbitals in the dot and the Andreev bound states in the hybrid are now on equal footing and both emerge as low-energy degrees of freedom in the Kitaev chain, with the couplings being induced by direct tunneling. Due to the electron and hole components in the Andreev bound state, this coupling is simultaneously of the normal and Andreev types, with their ratio being tunable by varying one or several of the experimentally accessible physical parameters, e.g., strength and direction of the Zeeman field, as well as changing proximity effect on the normal quantum dots. As such, it becomes feasible to realize a two-site Kitaev chain in a simple setup with only one normal quantum dot and one hybrid segment. Interestingly, when scaling up the system to a three-site Kitaev chain, next-nearest-neighbor couplings emerge as a result of high-order tunneling, lifting the Majorana zero energy at the sweet spot. This energy splitting is mitigated in a longer chain, approaching topological protection. Our proposal has two immediate advantages: obtaining a larger energy gap from direct tunneling and creating a Kitaev chain using a reduced number of quantum dots and hybrid segments.

Submitted to arXiv on 27 Sep. 2023

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Beta

Look for similar papers (in beta version)

By clicking on the button above, our algorithm compares the title and abstract of this paper with all the papers of the same arXiv category that we have summarized, and finds the closest ones. You can rerun it from time to time: the results improve as our database grows.