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

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.

Document Details

Document Type
Pub Defense Publication
Publication Date
May 23, 2018
Source ID
10.21468/scipostphys.4.5.026

Entities

People

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

Organizations

  • Delft University of Technology
  • Dutch Research Council
  • European Research Council
  • Grenoble Alpes University
  • Office of Naval Research

Tags

Fields of Study

  • Physics

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Quantum Dot Semiconductor Device Photonics and Graphene Optoelectronic Materials and THz Physics.
  • Quantum spin resonance or Electron Paramagnetic Resonance spectroscopy.

Technology Areas

  • Quantum Computing