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

Mathieu Istas, Christoph Groth, Anton Akhmerov, Michael Wimmer, Xavier Waintal

Research output: Contribution to journalArticleScientificpeer-review

22 Downloads (Pure)

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.
Original languageEnglish
Pages (from-to)1-22
JournalSciPost Physics
Volume4
Issue number5
DOIs
Publication statusPublished - 2018

Keywords

  • Bound states
  • Edge states
  • Fermi arcs
  • Majorana fermions
  • Quantum billiards
  • Quantum spin Hall effect
  • Superconducting nanowires
  • Tight-binding models
  • Topological materials
  • Weyl semimetals

Fingerprint

Dive into the research topics of 'A general algorithm for computing bound states in infinite tight-binding systems'. Together they form a unique fingerprint.

Cite this