Improved performance in quantum transport calculations: A divide-and-conquer method based on S-matrices
arXiv:2204.12689 · doi:10.1088/2516-1075/ac96b8
Abstract
We propose a divide-and-conquer algorithm to find recursively the Scattering matrix of general tight-binding structures. The Scattering matrix allows a direct calculation of transport properties in mesoscopic systems by using the Landauer formula. The method is exact, and by analyzing the performance of the algorithm in square, triangular and honeycomb lattices, we show a significant improvement in comparison to other state-of-the-art recursive and non-recursive methods.
arXiv comment12 pages, 3 figures
References in corpus (16)
- Kwant: a software package for quantum transport
- Scattering approach to parametric pumping
- Energy Spectrum and Quantum Hall Effect in Twisted Bilayer Graphene
- Scattering theory of topological insulators and superconductors
- A knitting algorithm for calculating Green functions in quantum systems
- Scattering theory of current-induced forces in mesoscopic systems
- Adiabatic quantum motors
- Recursive Green's function method for multi-terminal nanostructures
- Decoherence in current induced forces: Application to adiabatic quantum motors
- An efficient method for computing the electronic transport properties of a multi-terminal system
- Dynamics and decoherence in nonideal Thouless quantum motors
- A numerical method to efficiently calculate the transport properties of large systems: an algorithm optimized for sparse linear solvers
- Scattering matrix of arbitrary tight-binding Hamiltonians
- Green's functions on a renormalized lattice: An improved method for the integer quantum Hall transition
- Bound states in and out of the continuum in nanoribbons with wider sections: A novel recursive S-matrix method
- Taylor series of Landauer conductance