2018
DOI: 10.1016/j.cpc.2018.04.013
|View full text |Cite
|
Sign up to set email alerts
|

GPUQT: An efficient linear-scaling quantum transport code fully implemented on graphics processing units

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
14
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6

Relationship

2
4

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 32 publications
1
14
0
Order By: Relevance
“…Pybinding [47], on the other hand, has a Python interface, and a C++ core, which besides basic diagonalization methods, can also use the kernel polynomial method to model finite size systems with disorder, strains or magnetic fields. GPUQT is a transport code fully implemented for the use on graphical processor units (GPUs), where the size of simulated domains are limited by the device memory to 2 × 10 7 [48]. ESSEX-GHOST [49] and TBTK [50] are C++ codes based on the kernel polynomial method that provide Chebyshev expansions of Green's functions for tight-binding models.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Pybinding [47], on the other hand, has a Python interface, and a C++ core, which besides basic diagonalization methods, can also use the kernel polynomial method to model finite size systems with disorder, strains or magnetic fields. GPUQT is a transport code fully implemented for the use on graphical processor units (GPUs), where the size of simulated domains are limited by the device memory to 2 × 10 7 [48]. ESSEX-GHOST [49] and TBTK [50] are C++ codes based on the kernel polynomial method that provide Chebyshev expansions of Green's functions for tight-binding models.…”
Section: Introductionmentioning
confidence: 99%
“…Pybinding [40], on the other hand, has a Python interface, and a C++ core, which besides basic diagonalization methods, can also use the kernel polynomial method to setup and model finite size systems with disorder, strains or magnetic fields. GPUQT is a transport code fully implemented for the use 3 on graphical processor units (GPUs), where the size of simulated domains are limited by the device memory to 2 × 10 7 [41]. and TBTK [43], are C++ codes based on the kernel polynomial method that provide Chebyshev expansions of the Green's functions for tight-binding models.Previous numerical implementations real-space quantum transport, either based on linear response theory or the non-equilibrium Green's function method [44], have so far been limited to mesoscopic structures with up to ten millions of orbitals [27,30,31,[45][46][47][48], hampering the extraction of maximum mileage from the tight-binding scheme (except for a recent report, where Kubo calculations with billions of atoms N = 3.6 × 10 9 were demonstrated [36]).…”
mentioning
confidence: 99%
“…The most important result is that the conductivity scales linearly with respect to the carrier density, giving a constant mobility. This transport fingerprint has been confirmed by using the LSQT method with the MSD formalism (Fan et al, 2017), as shown in Fig. 11.…”
Section: Charged Impuritiesmentioning
confidence: 58%
“…In addition, an implementation based on graphics processing units was used to obtain the results presented in this section and has been distributed as an open-source code named GPUQT (Fan et al, 2018).…”
Section: Implementationsmentioning
confidence: 99%
“…By using (9), (6) and (12), (13) the density of states and electrical conductivity are estimated. To calculate the correlators [Û (t), X], the recursive algorithm is used (see [17,18]). Note that by limiting the delta function expansion with N m Chebyshev polynomials we achieve the finite energy resolution determined as dE ≈ π∆E/N m .…”
Section: Computational Formalismmentioning
confidence: 99%