A general algorithm for computing bound states in infinite tight-binding systems
We propose a robust and efficient algorithm for computing bound states of infinite tight-binding systems that are made up of a finite scattering region connected to semi-infinite leads. Our method uses wave matching in close analogy to the approaches used to obtain propagating states and scattering...
Gespeichert in:
Veröffentlicht in: | SciPost physics 2018-05, Vol.4 (5), p.026, Article 026 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We propose a robust and efficient algorithm for computing bound
states of infinite tight-binding systems that are made up of a finite
scattering region connected to semi-infinite leads. Our method uses wave
matching in close analogy to the approaches used to obtain propagating
states and scattering matrices. We show that our algorithm is robust in
presence of slowly decaying bound states where a diagonalization of a
finite system would fail. It also allows to calculate the bound states
that can be present in the middle of a continuous spectrum. We apply our
technique to quantum billiards and the following topological materials:
Majorana states in 1D superconducting nanowires, edge states in the 2D
quantum spin Hall phase, and Fermi arcs in 3D Weyl semimetals. |
---|---|
ISSN: | 2542-4653 2542-4653 |
DOI: | 10.21468/SciPostPhys.4.5.026 |