A general algorithm for computing bound states in infinite tight-binding systems

13Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Istas, M., Groth, C., Akhmerov, A. R., Wimmer, M., & Waintal, X. (2018). A general algorithm for computing bound states in infinite tight-binding systems. SciPost Physics, 4(5). https://doi.org/10.21468/SciPostPhys.4.5.026

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free